java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/sorting_selectionsort_false-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:51:45,163 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:51:45,165 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:51:45,183 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:51:45,184 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:51:45,185 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:51:45,189 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:51:45,191 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:51:45,194 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:51:45,196 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:51:45,197 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:51:45,197 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:51:45,200 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:51:45,203 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:51:45,206 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:51:45,213 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:51:45,215 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:51:45,217 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:51:45,222 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:51:45,224 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:51:45,226 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:51:45,230 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:51:45,234 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:51:45,234 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:51:45,234 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:51:45,235 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:51:45,237 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:51:45,238 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:51:45,238 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:51:45,239 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:51:45,240 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:51:45,240 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:51:45,240 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:51:45,241 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:51:45,242 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:51:45,243 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:51:45,243 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 11:51:45,269 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:51:45,272 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:51:45,273 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:51:45,273 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:51:45,274 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:51:45,274 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:51:45,274 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:51:45,275 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:51:45,275 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:51:45,275 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 11:51:45,275 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:51:45,275 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:51:45,276 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:51:45,276 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:51:45,276 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:51:45,276 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:51:45,276 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:51:45,277 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:51:45,277 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:51:45,277 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:51:45,277 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:51:45,277 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:51:45,278 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:51:45,278 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:51:45,278 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:51:45,278 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:51:45,278 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:51:45,279 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 11:51:45,279 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:51:45,279 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 11:51:45,279 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:51:45,335 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:51:45,348 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:51:45,352 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:51:45,355 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:51:45,355 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:51:45,356 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-23 11:51:45,417 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a8bae113/04f64645bc954d11a6fd3799b3bbeef8/FLAGa67e13726 [2018-11-23 11:51:45,853 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:51:45,854 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/sorting_selectionsort_false-unreach-call_ground.i [2018-11-23 11:51:45,861 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a8bae113/04f64645bc954d11a6fd3799b3bbeef8/FLAGa67e13726 [2018-11-23 11:51:46,227 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a8bae113/04f64645bc954d11a6fd3799b3bbeef8 [2018-11-23 11:51:46,240 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:51:46,242 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:51:46,242 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:51:46,243 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:51:46,246 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:51:46,248 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,251 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3809a6b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46, skipping insertion in model container [2018-11-23 11:51:46,251 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,262 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:51:46,290 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:51:46,576 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:51:46,581 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:51:46,621 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:51:46,647 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:51:46,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46 WrapperNode [2018-11-23 11:51:46,648 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:51:46,649 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:51:46,649 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:51:46,649 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:51:46,660 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,674 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,684 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:51:46,685 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:51:46,685 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:51:46,685 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:51:46,697 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,697 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,700 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,701 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,739 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,761 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,765 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,772 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:51:46,774 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:51:46,775 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:51:46,775 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:51:46,776 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:51:46,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 11:51:46,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:51:46,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:51:46,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:51:46,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:51:46,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:51:46,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 11:51:46,972 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:51:46,972 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:51:46,972 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:51:46,972 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:51:46,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:51:47,938 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:51:47,938 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-23 11:51:47,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:51:47 BoogieIcfgContainer [2018-11-23 11:51:47,939 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:51:47,940 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:51:47,940 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:51:47,943 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:51:47,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:51:46" (1/3) ... [2018-11-23 11:51:47,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cadd95b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:51:47, skipping insertion in model container [2018-11-23 11:51:47,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (2/3) ... [2018-11-23 11:51:47,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cadd95b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:51:47, skipping insertion in model container [2018-11-23 11:51:47,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:51:47" (3/3) ... [2018-11-23 11:51:47,946 INFO L112 eAbstractionObserver]: Analyzing ICFG sorting_selectionsort_false-unreach-call_ground.i [2018-11-23 11:51:47,954 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:51:47,962 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:51:47,980 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:51:48,015 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:51:48,016 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:51:48,016 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:51:48,016 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:51:48,016 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:51:48,016 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:51:48,017 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:51:48,017 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:51:48,017 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:51:48,036 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-11-23 11:51:48,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:51:48,042 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:48,043 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:48,046 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:48,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:48,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1945224924, now seen corresponding path program 1 times [2018-11-23 11:51:48,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:48,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:48,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:48,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:48,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:48,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:48,233 INFO L256 TraceCheckUtils]: 0: Hoare triple {45#true} call ULTIMATE.init(); {45#true} is VALID [2018-11-23 11:51:48,237 INFO L273 TraceCheckUtils]: 1: Hoare triple {45#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {45#true} is VALID [2018-11-23 11:51:48,237 INFO L273 TraceCheckUtils]: 2: Hoare triple {45#true} assume true; {45#true} is VALID [2018-11-23 11:51:48,238 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {45#true} {45#true} #130#return; {45#true} is VALID [2018-11-23 11:51:48,238 INFO L256 TraceCheckUtils]: 4: Hoare triple {45#true} call #t~ret15 := main(); {45#true} is VALID [2018-11-23 11:51:48,239 INFO L273 TraceCheckUtils]: 5: Hoare triple {45#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {45#true} is VALID [2018-11-23 11:51:48,240 INFO L273 TraceCheckUtils]: 6: Hoare triple {45#true} assume !true; {46#false} is VALID [2018-11-23 11:51:48,240 INFO L273 TraceCheckUtils]: 7: Hoare triple {46#false} ~x~0 := 0; {46#false} is VALID [2018-11-23 11:51:48,240 INFO L273 TraceCheckUtils]: 8: Hoare triple {46#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {46#false} is VALID [2018-11-23 11:51:48,240 INFO L273 TraceCheckUtils]: 9: Hoare triple {46#false} assume !!(~y~0 < 100000);call #t~mem13 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~y~0, 4); {46#false} is VALID [2018-11-23 11:51:48,241 INFO L256 TraceCheckUtils]: 10: Hoare triple {46#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {46#false} is VALID [2018-11-23 11:51:48,241 INFO L273 TraceCheckUtils]: 11: Hoare triple {46#false} ~cond := #in~cond; {46#false} is VALID [2018-11-23 11:51:48,242 INFO L273 TraceCheckUtils]: 12: Hoare triple {46#false} assume 0 == ~cond; {46#false} is VALID [2018-11-23 11:51:48,242 INFO L273 TraceCheckUtils]: 13: Hoare triple {46#false} assume !false; {46#false} is VALID [2018-11-23 11:51:48,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:48,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:51:48,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:51:48,253 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 11:51:48,256 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:48,260 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:51:48,341 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:48,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:51:48,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:51:48,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:51:48,354 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 2 states. [2018-11-23 11:51:48,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:48,530 INFO L93 Difference]: Finished difference Result 78 states and 117 transitions. [2018-11-23 11:51:48,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:51:48,531 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 11:51:48,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:48,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:51:48,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 117 transitions. [2018-11-23 11:51:48,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:51:48,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 117 transitions. [2018-11-23 11:51:48,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 117 transitions. [2018-11-23 11:51:49,083 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:49,111 INFO L225 Difference]: With dead ends: 78 [2018-11-23 11:51:49,111 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 11:51:49,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:51:49,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 11:51:49,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-23 11:51:49,227 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:49,227 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2018-11-23 11:51:49,228 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-23 11:51:49,228 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-23 11:51:49,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:49,235 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2018-11-23 11:51:49,236 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2018-11-23 11:51:49,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:49,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:49,237 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-23 11:51:49,237 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-23 11:51:49,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:49,249 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2018-11-23 11:51:49,249 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2018-11-23 11:51:49,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:49,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:49,251 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:49,251 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:49,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 11:51:49,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2018-11-23 11:51:49,260 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 14 [2018-11-23 11:51:49,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:49,261 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2018-11-23 11:51:49,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:51:49,261 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2018-11-23 11:51:49,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:51:49,262 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:49,262 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:49,264 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:49,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:49,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1826279014, now seen corresponding path program 1 times [2018-11-23 11:51:49,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:49,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:49,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:49,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:49,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:49,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:49,361 INFO L256 TraceCheckUtils]: 0: Hoare triple {279#true} call ULTIMATE.init(); {279#true} is VALID [2018-11-23 11:51:49,362 INFO L273 TraceCheckUtils]: 1: Hoare triple {279#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {279#true} is VALID [2018-11-23 11:51:49,362 INFO L273 TraceCheckUtils]: 2: Hoare triple {279#true} assume true; {279#true} is VALID [2018-11-23 11:51:49,363 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {279#true} {279#true} #130#return; {279#true} is VALID [2018-11-23 11:51:49,363 INFO L256 TraceCheckUtils]: 4: Hoare triple {279#true} call #t~ret15 := main(); {279#true} is VALID [2018-11-23 11:51:49,363 INFO L273 TraceCheckUtils]: 5: Hoare triple {279#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {281#(= main_~i~0 0)} is VALID [2018-11-23 11:51:49,364 INFO L273 TraceCheckUtils]: 6: Hoare triple {281#(= main_~i~0 0)} assume !(~i~0 < 100000); {280#false} is VALID [2018-11-23 11:51:49,365 INFO L273 TraceCheckUtils]: 7: Hoare triple {280#false} ~x~0 := 0; {280#false} is VALID [2018-11-23 11:51:49,365 INFO L273 TraceCheckUtils]: 8: Hoare triple {280#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {280#false} is VALID [2018-11-23 11:51:49,365 INFO L273 TraceCheckUtils]: 9: Hoare triple {280#false} assume !!(~y~0 < 100000);call #t~mem13 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~y~0, 4); {280#false} is VALID [2018-11-23 11:51:49,365 INFO L256 TraceCheckUtils]: 10: Hoare triple {280#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {280#false} is VALID [2018-11-23 11:51:49,366 INFO L273 TraceCheckUtils]: 11: Hoare triple {280#false} ~cond := #in~cond; {280#false} is VALID [2018-11-23 11:51:49,366 INFO L273 TraceCheckUtils]: 12: Hoare triple {280#false} assume 0 == ~cond; {280#false} is VALID [2018-11-23 11:51:49,367 INFO L273 TraceCheckUtils]: 13: Hoare triple {280#false} assume !false; {280#false} is VALID [2018-11-23 11:51:49,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:49,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:51:49,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:51:49,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 11:51:49,370 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:49,371 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:51:49,408 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:49,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:51:49,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:51:49,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:51:49,410 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand 3 states. [2018-11-23 11:51:49,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:49,824 INFO L93 Difference]: Finished difference Result 68 states and 88 transitions. [2018-11-23 11:51:49,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:51:49,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 11:51:49,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:49,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:51:49,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2018-11-23 11:51:49,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:51:49,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2018-11-23 11:51:49,834 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 88 transitions. [2018-11-23 11:51:50,025 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:50,029 INFO L225 Difference]: With dead ends: 68 [2018-11-23 11:51:50,029 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 11:51:50,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:51:50,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 11:51:50,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 38. [2018-11-23 11:51:50,057 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:50,058 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 38 states. [2018-11-23 11:51:50,058 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 38 states. [2018-11-23 11:51:50,058 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 38 states. [2018-11-23 11:51:50,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:50,064 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2018-11-23 11:51:50,065 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 73 transitions. [2018-11-23 11:51:50,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:50,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:50,066 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 55 states. [2018-11-23 11:51:50,066 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 55 states. [2018-11-23 11:51:50,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:50,074 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2018-11-23 11:51:50,074 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 73 transitions. [2018-11-23 11:51:50,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:50,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:50,075 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:50,075 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:50,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 11:51:50,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2018-11-23 11:51:50,082 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 48 transitions. Word has length 14 [2018-11-23 11:51:50,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:50,082 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 48 transitions. [2018-11-23 11:51:50,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:51:50,083 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2018-11-23 11:51:50,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:51:50,083 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:50,084 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:50,085 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:50,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:50,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1905148503, now seen corresponding path program 1 times [2018-11-23 11:51:50,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:50,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:50,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:50,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:50,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:50,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:50,160 INFO L256 TraceCheckUtils]: 0: Hoare triple {542#true} call ULTIMATE.init(); {542#true} is VALID [2018-11-23 11:51:50,160 INFO L273 TraceCheckUtils]: 1: Hoare triple {542#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {542#true} is VALID [2018-11-23 11:51:50,161 INFO L273 TraceCheckUtils]: 2: Hoare triple {542#true} assume true; {542#true} is VALID [2018-11-23 11:51:50,161 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {542#true} {542#true} #130#return; {542#true} is VALID [2018-11-23 11:51:50,161 INFO L256 TraceCheckUtils]: 4: Hoare triple {542#true} call #t~ret15 := main(); {542#true} is VALID [2018-11-23 11:51:50,161 INFO L273 TraceCheckUtils]: 5: Hoare triple {542#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {542#true} is VALID [2018-11-23 11:51:50,163 INFO L273 TraceCheckUtils]: 6: Hoare triple {542#true} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {544#(= main_~s~0 main_~i~0)} is VALID [2018-11-23 11:51:50,163 INFO L273 TraceCheckUtils]: 7: Hoare triple {544#(= main_~s~0 main_~i~0)} assume !(~k~0 < 100000); {544#(= main_~s~0 main_~i~0)} is VALID [2018-11-23 11:51:50,170 INFO L273 TraceCheckUtils]: 8: Hoare triple {544#(= main_~s~0 main_~i~0)} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {543#false} is VALID [2018-11-23 11:51:50,170 INFO L273 TraceCheckUtils]: 9: Hoare triple {543#false} ~x~0 := 0; {543#false} is VALID [2018-11-23 11:51:50,170 INFO L273 TraceCheckUtils]: 10: Hoare triple {543#false} assume !!(~x~0 < ~i~0);~y~0 := 1 + ~x~0; {543#false} is VALID [2018-11-23 11:51:50,171 INFO L273 TraceCheckUtils]: 11: Hoare triple {543#false} assume !!(~y~0 < ~i~0);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~y~0, 4); {543#false} is VALID [2018-11-23 11:51:50,171 INFO L256 TraceCheckUtils]: 12: Hoare triple {543#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {543#false} is VALID [2018-11-23 11:51:50,171 INFO L273 TraceCheckUtils]: 13: Hoare triple {543#false} ~cond := #in~cond; {543#false} is VALID [2018-11-23 11:51:50,171 INFO L273 TraceCheckUtils]: 14: Hoare triple {543#false} assume 0 == ~cond; {543#false} is VALID [2018-11-23 11:51:50,172 INFO L273 TraceCheckUtils]: 15: Hoare triple {543#false} assume !false; {543#false} is VALID [2018-11-23 11:51:50,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:50,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:51:50,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:51:50,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 11:51:50,179 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:50,179 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:51:50,224 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:50,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:51:50,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:51:50,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:51:50,225 INFO L87 Difference]: Start difference. First operand 38 states and 48 transitions. Second operand 3 states. [2018-11-23 11:51:50,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:50,489 INFO L93 Difference]: Finished difference Result 86 states and 114 transitions. [2018-11-23 11:51:50,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:51:50,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 11:51:50,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:50,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:51:50,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2018-11-23 11:51:50,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:51:50,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2018-11-23 11:51:50,498 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 113 transitions. [2018-11-23 11:51:50,686 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:50,690 INFO L225 Difference]: With dead ends: 86 [2018-11-23 11:51:50,690 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 11:51:50,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:51:50,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 11:51:50,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2018-11-23 11:51:50,747 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:50,747 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 42 states. [2018-11-23 11:51:50,747 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 42 states. [2018-11-23 11:51:50,748 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 42 states. [2018-11-23 11:51:50,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:50,752 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2018-11-23 11:51:50,752 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 72 transitions. [2018-11-23 11:51:50,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:50,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:50,753 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 55 states. [2018-11-23 11:51:50,754 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 55 states. [2018-11-23 11:51:50,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:50,758 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2018-11-23 11:51:50,758 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 72 transitions. [2018-11-23 11:51:50,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:50,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:50,759 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:50,760 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:50,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 11:51:50,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 54 transitions. [2018-11-23 11:51:50,763 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 54 transitions. Word has length 16 [2018-11-23 11:51:50,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:50,763 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 54 transitions. [2018-11-23 11:51:50,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:51:50,763 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 54 transitions. [2018-11-23 11:51:50,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:51:50,764 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:50,764 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:50,765 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:50,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:50,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1580472167, now seen corresponding path program 1 times [2018-11-23 11:51:50,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:50,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:50,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:50,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:50,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:50,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:50,895 INFO L256 TraceCheckUtils]: 0: Hoare triple {835#true} call ULTIMATE.init(); {835#true} is VALID [2018-11-23 11:51:50,895 INFO L273 TraceCheckUtils]: 1: Hoare triple {835#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {835#true} is VALID [2018-11-23 11:51:50,896 INFO L273 TraceCheckUtils]: 2: Hoare triple {835#true} assume true; {835#true} is VALID [2018-11-23 11:51:50,896 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {835#true} {835#true} #130#return; {835#true} is VALID [2018-11-23 11:51:50,897 INFO L256 TraceCheckUtils]: 4: Hoare triple {835#true} call #t~ret15 := main(); {835#true} is VALID [2018-11-23 11:51:50,899 INFO L273 TraceCheckUtils]: 5: Hoare triple {835#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {837#(= main_~i~0 0)} is VALID [2018-11-23 11:51:50,899 INFO L273 TraceCheckUtils]: 6: Hoare triple {837#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {838#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:51:50,904 INFO L273 TraceCheckUtils]: 7: Hoare triple {838#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume !(~k~0 < 100000); {836#false} is VALID [2018-11-23 11:51:50,904 INFO L273 TraceCheckUtils]: 8: Hoare triple {836#false} assume !(~s~0 != ~i~0); {836#false} is VALID [2018-11-23 11:51:50,904 INFO L273 TraceCheckUtils]: 9: Hoare triple {836#false} ~x~0 := 0; {836#false} is VALID [2018-11-23 11:51:50,905 INFO L273 TraceCheckUtils]: 10: Hoare triple {836#false} assume !!(~x~0 < ~i~0);~y~0 := 1 + ~x~0; {836#false} is VALID [2018-11-23 11:51:50,905 INFO L273 TraceCheckUtils]: 11: Hoare triple {836#false} assume !!(~y~0 < ~i~0);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~y~0, 4); {836#false} is VALID [2018-11-23 11:51:50,905 INFO L256 TraceCheckUtils]: 12: Hoare triple {836#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {836#false} is VALID [2018-11-23 11:51:50,906 INFO L273 TraceCheckUtils]: 13: Hoare triple {836#false} ~cond := #in~cond; {836#false} is VALID [2018-11-23 11:51:50,906 INFO L273 TraceCheckUtils]: 14: Hoare triple {836#false} assume 0 == ~cond; {836#false} is VALID [2018-11-23 11:51:50,906 INFO L273 TraceCheckUtils]: 15: Hoare triple {836#false} assume !false; {836#false} is VALID [2018-11-23 11:51:50,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:50,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:51:50,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:51:50,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-11-23 11:51:50,908 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:50,908 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:51:50,932 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:50,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:51:50,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:51:50,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:51:50,933 INFO L87 Difference]: Start difference. First operand 42 states and 54 transitions. Second operand 4 states. [2018-11-23 11:51:51,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:51,270 INFO L93 Difference]: Finished difference Result 102 states and 138 transitions. [2018-11-23 11:51:51,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:51:51,270 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-11-23 11:51:51,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:51,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:51:51,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2018-11-23 11:51:51,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:51:51,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2018-11-23 11:51:51,278 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 119 transitions. [2018-11-23 11:51:51,449 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:51,452 INFO L225 Difference]: With dead ends: 102 [2018-11-23 11:51:51,452 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 11:51:51,453 INFO L631 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-23 11:51:51,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 11:51:51,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 43. [2018-11-23 11:51:51,584 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:51,585 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 43 states. [2018-11-23 11:51:51,585 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 43 states. [2018-11-23 11:51:51,585 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 43 states. [2018-11-23 11:51:51,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:51,589 INFO L93 Difference]: Finished difference Result 67 states and 90 transitions. [2018-11-23 11:51:51,589 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 90 transitions. [2018-11-23 11:51:51,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:51,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:51,590 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 67 states. [2018-11-23 11:51:51,590 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 67 states. [2018-11-23 11:51:51,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:51,594 INFO L93 Difference]: Finished difference Result 67 states and 90 transitions. [2018-11-23 11:51:51,595 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 90 transitions. [2018-11-23 11:51:51,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:51,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:51,596 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:51,596 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:51,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 11:51:51,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2018-11-23 11:51:51,599 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 16 [2018-11-23 11:51:51,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:51,600 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2018-11-23 11:51:51,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:51:51,600 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2018-11-23 11:51:51,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 11:51:51,601 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:51,601 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:51,601 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:51,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:51,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1505214684, now seen corresponding path program 1 times [2018-11-23 11:51:51,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:51,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:51,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:51,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:51,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:51,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:51,756 INFO L256 TraceCheckUtils]: 0: Hoare triple {1175#true} call ULTIMATE.init(); {1175#true} is VALID [2018-11-23 11:51:51,757 INFO L273 TraceCheckUtils]: 1: Hoare triple {1175#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1175#true} is VALID [2018-11-23 11:51:51,757 INFO L273 TraceCheckUtils]: 2: Hoare triple {1175#true} assume true; {1175#true} is VALID [2018-11-23 11:51:51,758 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1175#true} {1175#true} #130#return; {1175#true} is VALID [2018-11-23 11:51:51,758 INFO L256 TraceCheckUtils]: 4: Hoare triple {1175#true} call #t~ret15 := main(); {1175#true} is VALID [2018-11-23 11:51:51,760 INFO L273 TraceCheckUtils]: 5: Hoare triple {1175#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {1177#(= main_~i~0 0)} is VALID [2018-11-23 11:51:51,760 INFO L273 TraceCheckUtils]: 6: Hoare triple {1177#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {1178#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:51:51,762 INFO L273 TraceCheckUtils]: 7: Hoare triple {1178#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {1178#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:51:51,762 INFO L273 TraceCheckUtils]: 8: Hoare triple {1178#(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; {1178#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:51:51,764 INFO L273 TraceCheckUtils]: 9: Hoare triple {1178#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {1179#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:51:51,765 INFO L273 TraceCheckUtils]: 10: Hoare triple {1179#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume !(~k~0 < 100000); {1176#false} is VALID [2018-11-23 11:51:51,765 INFO L273 TraceCheckUtils]: 11: Hoare triple {1176#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1176#false} is VALID [2018-11-23 11:51:51,766 INFO L273 TraceCheckUtils]: 12: Hoare triple {1176#false} ~x~0 := 0; {1176#false} is VALID [2018-11-23 11:51:51,766 INFO L273 TraceCheckUtils]: 13: Hoare triple {1176#false} assume !!(~x~0 < ~i~0);~y~0 := 1 + ~x~0; {1176#false} is VALID [2018-11-23 11:51:51,767 INFO L273 TraceCheckUtils]: 14: Hoare triple {1176#false} assume !!(~y~0 < ~i~0);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~y~0, 4); {1176#false} is VALID [2018-11-23 11:51:51,767 INFO L256 TraceCheckUtils]: 15: Hoare triple {1176#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {1176#false} is VALID [2018-11-23 11:51:51,768 INFO L273 TraceCheckUtils]: 16: Hoare triple {1176#false} ~cond := #in~cond; {1176#false} is VALID [2018-11-23 11:51:51,768 INFO L273 TraceCheckUtils]: 17: Hoare triple {1176#false} assume 0 == ~cond; {1176#false} is VALID [2018-11-23 11:51:51,769 INFO L273 TraceCheckUtils]: 18: Hoare triple {1176#false} assume !false; {1176#false} is VALID [2018-11-23 11:51:51,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:51,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:51,771 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:51:51,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:51,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:51,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:51,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:52,090 INFO L256 TraceCheckUtils]: 0: Hoare triple {1175#true} call ULTIMATE.init(); {1175#true} is VALID [2018-11-23 11:51:52,091 INFO L273 TraceCheckUtils]: 1: Hoare triple {1175#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1175#true} is VALID [2018-11-23 11:51:52,092 INFO L273 TraceCheckUtils]: 2: Hoare triple {1175#true} assume true; {1175#true} is VALID [2018-11-23 11:51:52,092 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1175#true} {1175#true} #130#return; {1175#true} is VALID [2018-11-23 11:51:52,093 INFO L256 TraceCheckUtils]: 4: Hoare triple {1175#true} call #t~ret15 := main(); {1175#true} is VALID [2018-11-23 11:51:52,102 INFO L273 TraceCheckUtils]: 5: Hoare triple {1175#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {1198#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:52,104 INFO L273 TraceCheckUtils]: 6: Hoare triple {1198#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {1202#(<= main_~k~0 1)} is VALID [2018-11-23 11:51:52,109 INFO L273 TraceCheckUtils]: 7: Hoare triple {1202#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {1202#(<= main_~k~0 1)} is VALID [2018-11-23 11:51:52,109 INFO L273 TraceCheckUtils]: 8: Hoare triple {1202#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {1202#(<= main_~k~0 1)} is VALID [2018-11-23 11:51:52,110 INFO L273 TraceCheckUtils]: 9: Hoare triple {1202#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {1212#(<= main_~k~0 2)} is VALID [2018-11-23 11:51:52,111 INFO L273 TraceCheckUtils]: 10: Hoare triple {1212#(<= main_~k~0 2)} assume !(~k~0 < 100000); {1176#false} is VALID [2018-11-23 11:51:52,111 INFO L273 TraceCheckUtils]: 11: Hoare triple {1176#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1176#false} is VALID [2018-11-23 11:51:52,111 INFO L273 TraceCheckUtils]: 12: Hoare triple {1176#false} ~x~0 := 0; {1176#false} is VALID [2018-11-23 11:51:52,111 INFO L273 TraceCheckUtils]: 13: Hoare triple {1176#false} assume !!(~x~0 < ~i~0);~y~0 := 1 + ~x~0; {1176#false} is VALID [2018-11-23 11:51:52,112 INFO L273 TraceCheckUtils]: 14: Hoare triple {1176#false} assume !!(~y~0 < ~i~0);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~y~0, 4); {1176#false} is VALID [2018-11-23 11:51:52,112 INFO L256 TraceCheckUtils]: 15: Hoare triple {1176#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {1176#false} is VALID [2018-11-23 11:51:52,112 INFO L273 TraceCheckUtils]: 16: Hoare triple {1176#false} ~cond := #in~cond; {1176#false} is VALID [2018-11-23 11:51:52,112 INFO L273 TraceCheckUtils]: 17: Hoare triple {1176#false} assume 0 == ~cond; {1176#false} is VALID [2018-11-23 11:51:52,113 INFO L273 TraceCheckUtils]: 18: Hoare triple {1176#false} assume !false; {1176#false} is VALID [2018-11-23 11:51:52,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:52,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:52,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-23 11:51:52,134 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-11-23 11:51:52,134 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:52,134 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:51:52,234 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:52,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:51:52,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:51:52,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:51:52,235 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. Second operand 8 states. [2018-11-23 11:51:52,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:52,803 INFO L93 Difference]: Finished difference Result 108 states and 147 transitions. [2018-11-23 11:51:52,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:51:52,803 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-11-23 11:51:52,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:52,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:51:52,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2018-11-23 11:51:52,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:51:52,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2018-11-23 11:51:52,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 123 transitions. [2018-11-23 11:51:53,038 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:53,041 INFO L225 Difference]: With dead ends: 108 [2018-11-23 11:51:53,041 INFO L226 Difference]: Without dead ends: 73 [2018-11-23 11:51:53,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 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-23 11:51:53,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-23 11:51:53,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 48. [2018-11-23 11:51:53,090 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:53,090 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 48 states. [2018-11-23 11:51:53,091 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 48 states. [2018-11-23 11:51:53,091 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 48 states. [2018-11-23 11:51:53,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:53,095 INFO L93 Difference]: Finished difference Result 73 states and 98 transitions. [2018-11-23 11:51:53,095 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 98 transitions. [2018-11-23 11:51:53,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:53,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:53,096 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 73 states. [2018-11-23 11:51:53,096 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 73 states. [2018-11-23 11:51:53,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:53,100 INFO L93 Difference]: Finished difference Result 73 states and 98 transitions. [2018-11-23 11:51:53,100 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 98 transitions. [2018-11-23 11:51:53,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:53,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:53,101 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:53,101 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:53,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 11:51:53,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 61 transitions. [2018-11-23 11:51:53,104 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 61 transitions. Word has length 19 [2018-11-23 11:51:53,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:53,104 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 61 transitions. [2018-11-23 11:51:53,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:51:53,105 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2018-11-23 11:51:53,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 11:51:53,105 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:53,106 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:53,106 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:53,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:53,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1316091959, now seen corresponding path program 2 times [2018-11-23 11:51:53,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:53,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:53,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:53,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:53,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:53,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:53,303 INFO L256 TraceCheckUtils]: 0: Hoare triple {1600#true} call ULTIMATE.init(); {1600#true} is VALID [2018-11-23 11:51:53,304 INFO L273 TraceCheckUtils]: 1: Hoare triple {1600#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1600#true} is VALID [2018-11-23 11:51:53,304 INFO L273 TraceCheckUtils]: 2: Hoare triple {1600#true} assume true; {1600#true} is VALID [2018-11-23 11:51:53,304 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1600#true} {1600#true} #130#return; {1600#true} is VALID [2018-11-23 11:51:53,304 INFO L256 TraceCheckUtils]: 4: Hoare triple {1600#true} call #t~ret15 := main(); {1600#true} is VALID [2018-11-23 11:51:53,305 INFO L273 TraceCheckUtils]: 5: Hoare triple {1600#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {1602#(= main_~i~0 0)} is VALID [2018-11-23 11:51:53,306 INFO L273 TraceCheckUtils]: 6: Hoare triple {1602#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {1603#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:51:53,313 INFO L273 TraceCheckUtils]: 7: Hoare triple {1603#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {1603#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:51:53,314 INFO L273 TraceCheckUtils]: 8: Hoare triple {1603#(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; {1603#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:51:53,315 INFO L273 TraceCheckUtils]: 9: Hoare triple {1603#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {1604#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:51:53,316 INFO L273 TraceCheckUtils]: 10: Hoare triple {1604#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {1604#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:51:53,316 INFO L273 TraceCheckUtils]: 11: Hoare triple {1604#(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; {1604#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:51:53,317 INFO L273 TraceCheckUtils]: 12: Hoare triple {1604#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {1605#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:51:53,318 INFO L273 TraceCheckUtils]: 13: Hoare triple {1605#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume !(~k~0 < 100000); {1601#false} is VALID [2018-11-23 11:51:53,318 INFO L273 TraceCheckUtils]: 14: Hoare triple {1601#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1601#false} is VALID [2018-11-23 11:51:53,319 INFO L273 TraceCheckUtils]: 15: Hoare triple {1601#false} ~x~0 := 0; {1601#false} is VALID [2018-11-23 11:51:53,319 INFO L273 TraceCheckUtils]: 16: Hoare triple {1601#false} assume !!(~x~0 < ~i~0);~y~0 := 1 + ~x~0; {1601#false} is VALID [2018-11-23 11:51:53,320 INFO L273 TraceCheckUtils]: 17: Hoare triple {1601#false} assume !!(~y~0 < ~i~0);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~y~0, 4); {1601#false} is VALID [2018-11-23 11:51:53,320 INFO L256 TraceCheckUtils]: 18: Hoare triple {1601#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {1601#false} is VALID [2018-11-23 11:51:53,321 INFO L273 TraceCheckUtils]: 19: Hoare triple {1601#false} ~cond := #in~cond; {1601#false} is VALID [2018-11-23 11:51:53,321 INFO L273 TraceCheckUtils]: 20: Hoare triple {1601#false} assume 0 == ~cond; {1601#false} is VALID [2018-11-23 11:51:53,321 INFO L273 TraceCheckUtils]: 21: Hoare triple {1601#false} assume !false; {1601#false} is VALID [2018-11-23 11:51:53,323 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:53,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:53,324 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:51:53,333 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:51:53,351 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 11:51:53,351 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:51:53,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:53,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:53,445 INFO L256 TraceCheckUtils]: 0: Hoare triple {1600#true} call ULTIMATE.init(); {1600#true} is VALID [2018-11-23 11:51:53,446 INFO L273 TraceCheckUtils]: 1: Hoare triple {1600#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1600#true} is VALID [2018-11-23 11:51:53,446 INFO L273 TraceCheckUtils]: 2: Hoare triple {1600#true} assume true; {1600#true} is VALID [2018-11-23 11:51:53,447 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1600#true} {1600#true} #130#return; {1600#true} is VALID [2018-11-23 11:51:53,447 INFO L256 TraceCheckUtils]: 4: Hoare triple {1600#true} call #t~ret15 := main(); {1600#true} is VALID [2018-11-23 11:51:53,461 INFO L273 TraceCheckUtils]: 5: Hoare triple {1600#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {1624#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:53,462 INFO L273 TraceCheckUtils]: 6: Hoare triple {1624#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {1624#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:53,462 INFO L273 TraceCheckUtils]: 7: Hoare triple {1624#(<= main_~i~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {1624#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:53,465 INFO L273 TraceCheckUtils]: 8: Hoare triple {1624#(<= main_~i~0 0)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {1624#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:53,466 INFO L273 TraceCheckUtils]: 9: Hoare triple {1624#(<= main_~i~0 0)} ~k~0 := 1 + ~k~0; {1624#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:53,466 INFO L273 TraceCheckUtils]: 10: Hoare triple {1624#(<= main_~i~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {1624#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:53,467 INFO L273 TraceCheckUtils]: 11: Hoare triple {1624#(<= main_~i~0 0)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {1624#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:53,467 INFO L273 TraceCheckUtils]: 12: Hoare triple {1624#(<= main_~i~0 0)} ~k~0 := 1 + ~k~0; {1624#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:53,468 INFO L273 TraceCheckUtils]: 13: Hoare triple {1624#(<= main_~i~0 0)} assume !(~k~0 < 100000); {1624#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:53,468 INFO L273 TraceCheckUtils]: 14: Hoare triple {1624#(<= main_~i~0 0)} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1624#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:53,469 INFO L273 TraceCheckUtils]: 15: Hoare triple {1624#(<= main_~i~0 0)} ~x~0 := 0; {1655#(and (<= main_~i~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 11:51:53,469 INFO L273 TraceCheckUtils]: 16: Hoare triple {1655#(and (<= main_~i~0 0) (<= 0 main_~x~0))} assume !!(~x~0 < ~i~0);~y~0 := 1 + ~x~0; {1601#false} is VALID [2018-11-23 11:51:53,470 INFO L273 TraceCheckUtils]: 17: Hoare triple {1601#false} assume !!(~y~0 < ~i~0);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~y~0, 4); {1601#false} is VALID [2018-11-23 11:51:53,470 INFO L256 TraceCheckUtils]: 18: Hoare triple {1601#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {1601#false} is VALID [2018-11-23 11:51:53,470 INFO L273 TraceCheckUtils]: 19: Hoare triple {1601#false} ~cond := #in~cond; {1601#false} is VALID [2018-11-23 11:51:53,471 INFO L273 TraceCheckUtils]: 20: Hoare triple {1601#false} assume 0 == ~cond; {1601#false} is VALID [2018-11-23 11:51:53,471 INFO L273 TraceCheckUtils]: 21: Hoare triple {1601#false} assume !false; {1601#false} is VALID [2018-11-23 11:51:53,473 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 11:51:53,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 11:51:53,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-11-23 11:51:53,492 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-11-23 11:51:53,492 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:53,492 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:51:53,585 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:53,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:51:53,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:51:53,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:51:53,586 INFO L87 Difference]: Start difference. First operand 48 states and 61 transitions. Second operand 8 states. [2018-11-23 11:51:54,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:54,083 INFO L93 Difference]: Finished difference Result 109 states and 148 transitions. [2018-11-23 11:51:54,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:51:54,084 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-11-23 11:51:54,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:54,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:51:54,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2018-11-23 11:51:54,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:51:54,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2018-11-23 11:51:54,090 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 120 transitions. [2018-11-23 11:51:54,426 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:54,428 INFO L225 Difference]: With dead ends: 109 [2018-11-23 11:51:54,428 INFO L226 Difference]: Without dead ends: 74 [2018-11-23 11:51:54,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 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-23 11:51:54,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-23 11:51:54,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 64. [2018-11-23 11:51:54,490 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:54,490 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 64 states. [2018-11-23 11:51:54,490 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 64 states. [2018-11-23 11:51:54,490 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 64 states. [2018-11-23 11:51:54,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:54,495 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2018-11-23 11:51:54,495 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 98 transitions. [2018-11-23 11:51:54,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:54,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:54,496 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 74 states. [2018-11-23 11:51:54,496 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 74 states. [2018-11-23 11:51:54,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:54,500 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2018-11-23 11:51:54,500 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 98 transitions. [2018-11-23 11:51:54,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:54,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:54,501 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:54,501 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:54,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 11:51:54,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 84 transitions. [2018-11-23 11:51:54,505 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 84 transitions. Word has length 22 [2018-11-23 11:51:54,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:54,505 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 84 transitions. [2018-11-23 11:51:54,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:51:54,505 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 84 transitions. [2018-11-23 11:51:54,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 11:51:54,508 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:54,508 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:54,508 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:54,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:54,509 INFO L82 PathProgramCache]: Analyzing trace with hash 335283198, now seen corresponding path program 1 times [2018-11-23 11:51:54,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:54,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:54,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:54,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:54,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:54,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:54,799 INFO L256 TraceCheckUtils]: 0: Hoare triple {2060#true} call ULTIMATE.init(); {2060#true} is VALID [2018-11-23 11:51:54,800 INFO L273 TraceCheckUtils]: 1: Hoare triple {2060#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2060#true} is VALID [2018-11-23 11:51:54,800 INFO L273 TraceCheckUtils]: 2: Hoare triple {2060#true} assume true; {2060#true} is VALID [2018-11-23 11:51:54,800 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2060#true} {2060#true} #130#return; {2060#true} is VALID [2018-11-23 11:51:54,801 INFO L256 TraceCheckUtils]: 4: Hoare triple {2060#true} call #t~ret15 := main(); {2060#true} is VALID [2018-11-23 11:51:54,802 INFO L273 TraceCheckUtils]: 5: Hoare triple {2060#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {2062#(= main_~i~0 0)} is VALID [2018-11-23 11:51:54,802 INFO L273 TraceCheckUtils]: 6: Hoare triple {2062#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {2063#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:51:54,803 INFO L273 TraceCheckUtils]: 7: Hoare triple {2063#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {2063#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:51:54,803 INFO L273 TraceCheckUtils]: 8: Hoare triple {2063#(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; {2063#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:51:54,804 INFO L273 TraceCheckUtils]: 9: Hoare triple {2063#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {2064#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:51:54,805 INFO L273 TraceCheckUtils]: 10: Hoare triple {2064#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {2064#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:51:54,806 INFO L273 TraceCheckUtils]: 11: Hoare triple {2064#(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; {2064#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:51:54,807 INFO L273 TraceCheckUtils]: 12: Hoare triple {2064#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {2065#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:51:54,824 INFO L273 TraceCheckUtils]: 13: Hoare triple {2065#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {2065#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:51:54,833 INFO L273 TraceCheckUtils]: 14: Hoare triple {2065#(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; {2065#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:51:54,848 INFO L273 TraceCheckUtils]: 15: Hoare triple {2065#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {2066#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:51:54,849 INFO L273 TraceCheckUtils]: 16: Hoare triple {2066#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume !(~k~0 < 100000); {2061#false} is VALID [2018-11-23 11:51:54,850 INFO L273 TraceCheckUtils]: 17: Hoare triple {2061#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2061#false} is VALID [2018-11-23 11:51:54,850 INFO L273 TraceCheckUtils]: 18: Hoare triple {2061#false} ~x~0 := 0; {2061#false} is VALID [2018-11-23 11:51:54,850 INFO L273 TraceCheckUtils]: 19: Hoare triple {2061#false} assume !(~x~0 < ~i~0); {2061#false} is VALID [2018-11-23 11:51:54,850 INFO L273 TraceCheckUtils]: 20: Hoare triple {2061#false} ~x~0 := 0; {2061#false} is VALID [2018-11-23 11:51:54,851 INFO L273 TraceCheckUtils]: 21: Hoare triple {2061#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2061#false} is VALID [2018-11-23 11:51:54,851 INFO L256 TraceCheckUtils]: 22: Hoare triple {2061#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {2061#false} is VALID [2018-11-23 11:51:54,851 INFO L273 TraceCheckUtils]: 23: Hoare triple {2061#false} ~cond := #in~cond; {2061#false} is VALID [2018-11-23 11:51:54,851 INFO L273 TraceCheckUtils]: 24: Hoare triple {2061#false} assume 0 == ~cond; {2061#false} is VALID [2018-11-23 11:51:54,851 INFO L273 TraceCheckUtils]: 25: Hoare triple {2061#false} assume !false; {2061#false} is VALID [2018-11-23 11:51:54,854 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:54,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:54,854 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:51:54,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:54,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:54,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:54,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:55,061 INFO L256 TraceCheckUtils]: 0: Hoare triple {2060#true} call ULTIMATE.init(); {2060#true} is VALID [2018-11-23 11:51:55,062 INFO L273 TraceCheckUtils]: 1: Hoare triple {2060#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2060#true} is VALID [2018-11-23 11:51:55,062 INFO L273 TraceCheckUtils]: 2: Hoare triple {2060#true} assume true; {2060#true} is VALID [2018-11-23 11:51:55,063 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2060#true} {2060#true} #130#return; {2060#true} is VALID [2018-11-23 11:51:55,063 INFO L256 TraceCheckUtils]: 4: Hoare triple {2060#true} call #t~ret15 := main(); {2060#true} is VALID [2018-11-23 11:51:55,064 INFO L273 TraceCheckUtils]: 5: Hoare triple {2060#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {2085#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:55,064 INFO L273 TraceCheckUtils]: 6: Hoare triple {2085#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {2089#(<= main_~k~0 1)} is VALID [2018-11-23 11:51:55,065 INFO L273 TraceCheckUtils]: 7: Hoare triple {2089#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {2089#(<= main_~k~0 1)} is VALID [2018-11-23 11:51:55,065 INFO L273 TraceCheckUtils]: 8: Hoare triple {2089#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2089#(<= main_~k~0 1)} is VALID [2018-11-23 11:51:55,066 INFO L273 TraceCheckUtils]: 9: Hoare triple {2089#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {2099#(<= main_~k~0 2)} is VALID [2018-11-23 11:51:55,067 INFO L273 TraceCheckUtils]: 10: Hoare triple {2099#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {2099#(<= main_~k~0 2)} is VALID [2018-11-23 11:51:55,067 INFO L273 TraceCheckUtils]: 11: Hoare triple {2099#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2099#(<= main_~k~0 2)} is VALID [2018-11-23 11:51:55,068 INFO L273 TraceCheckUtils]: 12: Hoare triple {2099#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {2109#(<= main_~k~0 3)} is VALID [2018-11-23 11:51:55,069 INFO L273 TraceCheckUtils]: 13: Hoare triple {2109#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {2109#(<= main_~k~0 3)} is VALID [2018-11-23 11:51:55,073 INFO L273 TraceCheckUtils]: 14: Hoare triple {2109#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2109#(<= main_~k~0 3)} is VALID [2018-11-23 11:51:55,073 INFO L273 TraceCheckUtils]: 15: Hoare triple {2109#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {2119#(<= main_~k~0 4)} is VALID [2018-11-23 11:51:55,074 INFO L273 TraceCheckUtils]: 16: Hoare triple {2119#(<= main_~k~0 4)} assume !(~k~0 < 100000); {2061#false} is VALID [2018-11-23 11:51:55,074 INFO L273 TraceCheckUtils]: 17: Hoare triple {2061#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2061#false} is VALID [2018-11-23 11:51:55,074 INFO L273 TraceCheckUtils]: 18: Hoare triple {2061#false} ~x~0 := 0; {2061#false} is VALID [2018-11-23 11:51:55,075 INFO L273 TraceCheckUtils]: 19: Hoare triple {2061#false} assume !(~x~0 < ~i~0); {2061#false} is VALID [2018-11-23 11:51:55,075 INFO L273 TraceCheckUtils]: 20: Hoare triple {2061#false} ~x~0 := 0; {2061#false} is VALID [2018-11-23 11:51:55,075 INFO L273 TraceCheckUtils]: 21: Hoare triple {2061#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2061#false} is VALID [2018-11-23 11:51:55,075 INFO L256 TraceCheckUtils]: 22: Hoare triple {2061#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {2061#false} is VALID [2018-11-23 11:51:55,076 INFO L273 TraceCheckUtils]: 23: Hoare triple {2061#false} ~cond := #in~cond; {2061#false} is VALID [2018-11-23 11:51:55,076 INFO L273 TraceCheckUtils]: 24: Hoare triple {2061#false} assume 0 == ~cond; {2061#false} is VALID [2018-11-23 11:51:55,076 INFO L273 TraceCheckUtils]: 25: Hoare triple {2061#false} assume !false; {2061#false} is VALID [2018-11-23 11:51:55,078 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:55,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:55,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 11:51:55,097 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-11-23 11:51:55,098 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:55,098 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:51:55,149 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:55,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:51:55,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:51:55,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:51:55,150 INFO L87 Difference]: Start difference. First operand 64 states and 84 transitions. Second operand 12 states. [2018-11-23 11:51:56,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:56,150 INFO L93 Difference]: Finished difference Result 119 states and 160 transitions. [2018-11-23 11:51:56,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:51:56,150 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-11-23 11:51:56,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:56,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:51:56,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2018-11-23 11:51:56,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:51:56,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2018-11-23 11:51:56,156 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 123 transitions. [2018-11-23 11:51:56,274 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:56,276 INFO L225 Difference]: With dead ends: 119 [2018-11-23 11:51:56,277 INFO L226 Difference]: Without dead ends: 80 [2018-11-23 11:51:56,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:51:56,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-23 11:51:56,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 70. [2018-11-23 11:51:56,318 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:56,319 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 70 states. [2018-11-23 11:51:56,319 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 70 states. [2018-11-23 11:51:56,319 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 70 states. [2018-11-23 11:51:56,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:56,322 INFO L93 Difference]: Finished difference Result 80 states and 106 transitions. [2018-11-23 11:51:56,322 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 106 transitions. [2018-11-23 11:51:56,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:56,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:56,323 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 80 states. [2018-11-23 11:51:56,323 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 80 states. [2018-11-23 11:51:56,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:56,327 INFO L93 Difference]: Finished difference Result 80 states and 106 transitions. [2018-11-23 11:51:56,327 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 106 transitions. [2018-11-23 11:51:56,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:56,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:56,327 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:56,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:56,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 11:51:56,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 92 transitions. [2018-11-23 11:51:56,330 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 92 transitions. Word has length 26 [2018-11-23 11:51:56,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:56,331 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 92 transitions. [2018-11-23 11:51:56,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:51:56,331 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 92 transitions. [2018-11-23 11:51:56,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 11:51:56,331 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:56,332 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:56,332 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:56,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:56,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1605949511, now seen corresponding path program 2 times [2018-11-23 11:51:56,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:56,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:56,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:56,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:56,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:56,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:56,492 INFO L256 TraceCheckUtils]: 0: Hoare triple {2567#true} call ULTIMATE.init(); {2567#true} is VALID [2018-11-23 11:51:56,492 INFO L273 TraceCheckUtils]: 1: Hoare triple {2567#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2567#true} is VALID [2018-11-23 11:51:56,493 INFO L273 TraceCheckUtils]: 2: Hoare triple {2567#true} assume true; {2567#true} is VALID [2018-11-23 11:51:56,493 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2567#true} {2567#true} #130#return; {2567#true} is VALID [2018-11-23 11:51:56,493 INFO L256 TraceCheckUtils]: 4: Hoare triple {2567#true} call #t~ret15 := main(); {2567#true} is VALID [2018-11-23 11:51:56,494 INFO L273 TraceCheckUtils]: 5: Hoare triple {2567#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {2569#(= main_~i~0 0)} is VALID [2018-11-23 11:51:56,495 INFO L273 TraceCheckUtils]: 6: Hoare triple {2569#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {2570#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:51:56,496 INFO L273 TraceCheckUtils]: 7: Hoare triple {2570#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {2570#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:51:56,496 INFO L273 TraceCheckUtils]: 8: Hoare triple {2570#(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; {2570#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:51:56,520 INFO L273 TraceCheckUtils]: 9: Hoare triple {2570#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {2571#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:51:56,535 INFO L273 TraceCheckUtils]: 10: Hoare triple {2571#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {2571#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:51:56,544 INFO L273 TraceCheckUtils]: 11: Hoare triple {2571#(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; {2571#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:51:56,560 INFO L273 TraceCheckUtils]: 12: Hoare triple {2571#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {2572#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:51:56,574 INFO L273 TraceCheckUtils]: 13: Hoare triple {2572#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {2572#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:51:56,588 INFO L273 TraceCheckUtils]: 14: Hoare triple {2572#(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; {2572#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:51:56,603 INFO L273 TraceCheckUtils]: 15: Hoare triple {2572#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {2573#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:51:56,612 INFO L273 TraceCheckUtils]: 16: Hoare triple {2573#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {2573#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:51:56,622 INFO L273 TraceCheckUtils]: 17: Hoare triple {2573#(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; {2573#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:51:56,629 INFO L273 TraceCheckUtils]: 18: Hoare triple {2573#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {2574#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:51:56,634 INFO L273 TraceCheckUtils]: 19: Hoare triple {2574#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume !(~k~0 < 100000); {2568#false} is VALID [2018-11-23 11:51:56,634 INFO L273 TraceCheckUtils]: 20: Hoare triple {2568#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2568#false} is VALID [2018-11-23 11:51:56,634 INFO L273 TraceCheckUtils]: 21: Hoare triple {2568#false} ~x~0 := 0; {2568#false} is VALID [2018-11-23 11:51:56,634 INFO L273 TraceCheckUtils]: 22: Hoare triple {2568#false} assume !(~x~0 < ~i~0); {2568#false} is VALID [2018-11-23 11:51:56,635 INFO L273 TraceCheckUtils]: 23: Hoare triple {2568#false} ~x~0 := 0; {2568#false} is VALID [2018-11-23 11:51:56,635 INFO L273 TraceCheckUtils]: 24: Hoare triple {2568#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2568#false} is VALID [2018-11-23 11:51:56,635 INFO L256 TraceCheckUtils]: 25: Hoare triple {2568#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {2568#false} is VALID [2018-11-23 11:51:56,635 INFO L273 TraceCheckUtils]: 26: Hoare triple {2568#false} ~cond := #in~cond; {2568#false} is VALID [2018-11-23 11:51:56,635 INFO L273 TraceCheckUtils]: 27: Hoare triple {2568#false} assume 0 == ~cond; {2568#false} is VALID [2018-11-23 11:51:56,636 INFO L273 TraceCheckUtils]: 28: Hoare triple {2568#false} assume !false; {2568#false} is VALID [2018-11-23 11:51:56,637 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:56,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:56,637 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:51:56,649 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:51:56,661 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 11:51:56,662 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:51:56,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:56,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:56,853 INFO L478 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-23 11:51:56,863 INFO L478 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-23 11:51:56,972 INFO L478 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-23 11:51:56,978 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-23 11:51:56,984 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:56,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:56,994 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-23 11:51:56,995 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:37, output treesize:7 [2018-11-23 11:51:56,999 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:51:56,999 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_10|, main_~s~0, main_~tmp~0]. (and (= |#memory_int| (store |v_#memory_int_10| |main_~#a~0.base| (let ((.cse1 (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (store (let ((.cse0 (select |v_#memory_int_10| |main_~#a~0.base|))) (store .cse0 (+ (* 4 main_~s~0) |main_~#a~0.offset|) (select .cse0 .cse1))) .cse1 main_~tmp~0)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0)) [2018-11-23 11:51:57,000 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~i~0 0) (= |main_~#a~0.offset| 0)) [2018-11-23 11:51:57,045 INFO L478 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-23 11:51:57,065 INFO L478 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-23 11:51:57,068 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:57,070 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:57,072 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-23 11:51:57,072 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-23 11:51:57,075 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:51:57,075 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|]. (let ((.cse0 (select (select |#memory_int| |main_~#a~0.base|) 0))) (and (<= |main_#t~mem10| .cse0) (<= .cse0 |main_#t~mem9|))) [2018-11-23 11:51:57,075 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (<= |main_#t~mem10| |main_#t~mem9|) [2018-11-23 11:51:57,131 INFO L256 TraceCheckUtils]: 0: Hoare triple {2567#true} call ULTIMATE.init(); {2567#true} is VALID [2018-11-23 11:51:57,132 INFO L273 TraceCheckUtils]: 1: Hoare triple {2567#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2567#true} is VALID [2018-11-23 11:51:57,132 INFO L273 TraceCheckUtils]: 2: Hoare triple {2567#true} assume true; {2567#true} is VALID [2018-11-23 11:51:57,132 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2567#true} {2567#true} #130#return; {2567#true} is VALID [2018-11-23 11:51:57,132 INFO L256 TraceCheckUtils]: 4: Hoare triple {2567#true} call #t~ret15 := main(); {2567#true} is VALID [2018-11-23 11:51:57,133 INFO L273 TraceCheckUtils]: 5: Hoare triple {2567#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {2593#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:51:57,133 INFO L273 TraceCheckUtils]: 6: Hoare triple {2593#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {2593#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:51:57,134 INFO L273 TraceCheckUtils]: 7: Hoare triple {2593#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {2593#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:51:57,135 INFO L273 TraceCheckUtils]: 8: Hoare triple {2593#(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; {2593#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:51:57,135 INFO L273 TraceCheckUtils]: 9: Hoare triple {2593#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} ~k~0 := 1 + ~k~0; {2593#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:51:57,136 INFO L273 TraceCheckUtils]: 10: Hoare triple {2593#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {2593#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:51:57,136 INFO L273 TraceCheckUtils]: 11: Hoare triple {2593#(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; {2593#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:51:57,137 INFO L273 TraceCheckUtils]: 12: Hoare triple {2593#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} ~k~0 := 1 + ~k~0; {2593#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:51:57,138 INFO L273 TraceCheckUtils]: 13: Hoare triple {2593#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {2593#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:51:57,139 INFO L273 TraceCheckUtils]: 14: Hoare triple {2593#(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; {2593#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:51:57,139 INFO L273 TraceCheckUtils]: 15: Hoare triple {2593#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} ~k~0 := 1 + ~k~0; {2593#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:51:57,140 INFO L273 TraceCheckUtils]: 16: Hoare triple {2593#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {2593#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:51:57,141 INFO L273 TraceCheckUtils]: 17: Hoare triple {2593#(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; {2593#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:51:57,142 INFO L273 TraceCheckUtils]: 18: Hoare triple {2593#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} ~k~0 := 1 + ~k~0; {2593#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:51:57,150 INFO L273 TraceCheckUtils]: 19: Hoare triple {2593#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !(~k~0 < 100000); {2593#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:51:57,150 INFO L273 TraceCheckUtils]: 20: Hoare triple {2593#(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 + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2593#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:51:57,151 INFO L273 TraceCheckUtils]: 21: Hoare triple {2593#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} ~x~0 := 0; {2593#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:51:57,151 INFO L273 TraceCheckUtils]: 22: Hoare triple {2593#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !(~x~0 < ~i~0); {2593#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:51:57,152 INFO L273 TraceCheckUtils]: 23: Hoare triple {2593#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} ~x~0 := 0; {2648#(and (= main_~x~0 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:51:57,152 INFO L273 TraceCheckUtils]: 24: Hoare triple {2648#(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 + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2652#(<= |main_#t~mem10| |main_#t~mem9|)} is VALID [2018-11-23 11:51:57,153 INFO L256 TraceCheckUtils]: 25: Hoare triple {2652#(<= |main_#t~mem10| |main_#t~mem9|)} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {2656#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 11:51:57,154 INFO L273 TraceCheckUtils]: 26: Hoare triple {2656#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {2660#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 11:51:57,154 INFO L273 TraceCheckUtils]: 27: Hoare triple {2660#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2568#false} is VALID [2018-11-23 11:51:57,154 INFO L273 TraceCheckUtils]: 28: Hoare triple {2568#false} assume !false; {2568#false} is VALID [2018-11-23 11:51:57,156 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-23 11:51:57,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 11:51:57,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2018-11-23 11:51:57,176 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2018-11-23 11:51:57,176 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:57,176 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 11:51:57,225 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:57,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 11:51:57,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 11:51:57,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:51:57,226 INFO L87 Difference]: Start difference. First operand 70 states and 92 transitions. Second operand 13 states. [2018-11-23 11:51:58,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:58,247 INFO L93 Difference]: Finished difference Result 133 states and 178 transitions. [2018-11-23 11:51:58,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:51:58,247 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2018-11-23 11:51:58,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:58,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:51:58,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 137 transitions. [2018-11-23 11:51:58,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:51:58,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 137 transitions. [2018-11-23 11:51:58,253 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 137 transitions. [2018-11-23 11:51:58,442 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:58,445 INFO L225 Difference]: With dead ends: 133 [2018-11-23 11:51:58,445 INFO L226 Difference]: Without dead ends: 94 [2018-11-23 11:51:58,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 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-23 11:51:58,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-23 11:51:58,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 83. [2018-11-23 11:51:58,555 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:58,555 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand 83 states. [2018-11-23 11:51:58,555 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 83 states. [2018-11-23 11:51:58,555 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 83 states. [2018-11-23 11:51:58,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:58,560 INFO L93 Difference]: Finished difference Result 94 states and 122 transitions. [2018-11-23 11:51:58,561 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 122 transitions. [2018-11-23 11:51:58,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:58,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:58,561 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 94 states. [2018-11-23 11:51:58,562 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 94 states. [2018-11-23 11:51:58,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:58,565 INFO L93 Difference]: Finished difference Result 94 states and 122 transitions. [2018-11-23 11:51:58,565 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 122 transitions. [2018-11-23 11:51:58,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:58,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:58,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:58,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:58,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-23 11:51:58,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 107 transitions. [2018-11-23 11:51:58,570 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 107 transitions. Word has length 29 [2018-11-23 11:51:58,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:58,570 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 107 transitions. [2018-11-23 11:51:58,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 11:51:58,570 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 107 transitions. [2018-11-23 11:51:58,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 11:51:58,571 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:58,571 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:58,571 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:58,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:58,573 INFO L82 PathProgramCache]: Analyzing trace with hash -799653583, now seen corresponding path program 1 times [2018-11-23 11:51:58,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:58,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:58,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:58,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:58,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:58,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:58,855 INFO L256 TraceCheckUtils]: 0: Hoare triple {3163#true} call ULTIMATE.init(); {3163#true} is VALID [2018-11-23 11:51:58,855 INFO L273 TraceCheckUtils]: 1: Hoare triple {3163#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3163#true} is VALID [2018-11-23 11:51:58,855 INFO L273 TraceCheckUtils]: 2: Hoare triple {3163#true} assume true; {3163#true} is VALID [2018-11-23 11:51:58,855 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3163#true} {3163#true} #130#return; {3163#true} is VALID [2018-11-23 11:51:58,856 INFO L256 TraceCheckUtils]: 4: Hoare triple {3163#true} call #t~ret15 := main(); {3163#true} is VALID [2018-11-23 11:51:58,857 INFO L273 TraceCheckUtils]: 5: Hoare triple {3163#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {3165#(= main_~i~0 0)} is VALID [2018-11-23 11:51:58,858 INFO L273 TraceCheckUtils]: 6: Hoare triple {3165#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {3166#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:51:58,859 INFO L273 TraceCheckUtils]: 7: Hoare triple {3166#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {3166#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:51:58,859 INFO L273 TraceCheckUtils]: 8: Hoare triple {3166#(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; {3166#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:51:58,860 INFO L273 TraceCheckUtils]: 9: Hoare triple {3166#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {3167#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:51:58,860 INFO L273 TraceCheckUtils]: 10: Hoare triple {3167#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {3167#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:51:58,861 INFO L273 TraceCheckUtils]: 11: Hoare triple {3167#(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; {3167#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:51:58,861 INFO L273 TraceCheckUtils]: 12: Hoare triple {3167#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {3168#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:51:58,862 INFO L273 TraceCheckUtils]: 13: Hoare triple {3168#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {3168#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:51:58,863 INFO L273 TraceCheckUtils]: 14: Hoare triple {3168#(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; {3168#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:51:58,864 INFO L273 TraceCheckUtils]: 15: Hoare triple {3168#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {3169#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:51:58,865 INFO L273 TraceCheckUtils]: 16: Hoare triple {3169#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {3169#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:51:58,866 INFO L273 TraceCheckUtils]: 17: Hoare triple {3169#(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; {3169#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:51:58,867 INFO L273 TraceCheckUtils]: 18: Hoare triple {3169#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {3170#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:51:58,868 INFO L273 TraceCheckUtils]: 19: Hoare triple {3170#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {3170#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:51:58,869 INFO L273 TraceCheckUtils]: 20: Hoare triple {3170#(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; {3170#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:51:58,870 INFO L273 TraceCheckUtils]: 21: Hoare triple {3170#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {3171#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:51:58,871 INFO L273 TraceCheckUtils]: 22: Hoare triple {3171#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume !(~k~0 < 100000); {3164#false} is VALID [2018-11-23 11:51:58,871 INFO L273 TraceCheckUtils]: 23: Hoare triple {3164#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3164#false} is VALID [2018-11-23 11:51:58,871 INFO L273 TraceCheckUtils]: 24: Hoare triple {3164#false} ~x~0 := 0; {3164#false} is VALID [2018-11-23 11:51:58,872 INFO L273 TraceCheckUtils]: 25: Hoare triple {3164#false} assume !(~x~0 < ~i~0); {3164#false} is VALID [2018-11-23 11:51:58,872 INFO L273 TraceCheckUtils]: 26: Hoare triple {3164#false} ~x~0 := 0; {3164#false} is VALID [2018-11-23 11:51:58,872 INFO L273 TraceCheckUtils]: 27: Hoare triple {3164#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3164#false} is VALID [2018-11-23 11:51:58,873 INFO L256 TraceCheckUtils]: 28: Hoare triple {3164#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {3163#true} is VALID [2018-11-23 11:51:58,873 INFO L273 TraceCheckUtils]: 29: Hoare triple {3163#true} ~cond := #in~cond; {3163#true} is VALID [2018-11-23 11:51:58,873 INFO L273 TraceCheckUtils]: 30: Hoare triple {3163#true} assume !(0 == ~cond); {3163#true} is VALID [2018-11-23 11:51:58,874 INFO L273 TraceCheckUtils]: 31: Hoare triple {3163#true} assume true; {3163#true} is VALID [2018-11-23 11:51:58,874 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {3163#true} {3164#false} #136#return; {3164#false} is VALID [2018-11-23 11:51:58,874 INFO L273 TraceCheckUtils]: 33: Hoare triple {3164#false} havoc #t~mem9;havoc #t~mem10; {3164#false} is VALID [2018-11-23 11:51:58,874 INFO L273 TraceCheckUtils]: 34: Hoare triple {3164#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {3164#false} is VALID [2018-11-23 11:51:58,875 INFO L273 TraceCheckUtils]: 35: Hoare triple {3164#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3164#false} is VALID [2018-11-23 11:51:58,875 INFO L256 TraceCheckUtils]: 36: Hoare triple {3164#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {3164#false} is VALID [2018-11-23 11:51:58,875 INFO L273 TraceCheckUtils]: 37: Hoare triple {3164#false} ~cond := #in~cond; {3164#false} is VALID [2018-11-23 11:51:58,875 INFO L273 TraceCheckUtils]: 38: Hoare triple {3164#false} assume 0 == ~cond; {3164#false} is VALID [2018-11-23 11:51:58,875 INFO L273 TraceCheckUtils]: 39: Hoare triple {3164#false} assume !false; {3164#false} is VALID [2018-11-23 11:51:58,878 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 2 proven. 35 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:51:58,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:58,878 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:51:58,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:58,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:58,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:58,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:59,068 INFO L256 TraceCheckUtils]: 0: Hoare triple {3163#true} call ULTIMATE.init(); {3163#true} is VALID [2018-11-23 11:51:59,069 INFO L273 TraceCheckUtils]: 1: Hoare triple {3163#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3163#true} is VALID [2018-11-23 11:51:59,069 INFO L273 TraceCheckUtils]: 2: Hoare triple {3163#true} assume true; {3163#true} is VALID [2018-11-23 11:51:59,069 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3163#true} {3163#true} #130#return; {3163#true} is VALID [2018-11-23 11:51:59,069 INFO L256 TraceCheckUtils]: 4: Hoare triple {3163#true} call #t~ret15 := main(); {3163#true} is VALID [2018-11-23 11:51:59,070 INFO L273 TraceCheckUtils]: 5: Hoare triple {3163#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {3190#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:59,071 INFO L273 TraceCheckUtils]: 6: Hoare triple {3190#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {3194#(<= main_~k~0 1)} is VALID [2018-11-23 11:51:59,071 INFO L273 TraceCheckUtils]: 7: Hoare triple {3194#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {3194#(<= main_~k~0 1)} is VALID [2018-11-23 11:51:59,071 INFO L273 TraceCheckUtils]: 8: Hoare triple {3194#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3194#(<= main_~k~0 1)} is VALID [2018-11-23 11:51:59,072 INFO L273 TraceCheckUtils]: 9: Hoare triple {3194#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {3204#(<= main_~k~0 2)} is VALID [2018-11-23 11:51:59,072 INFO L273 TraceCheckUtils]: 10: Hoare triple {3204#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {3204#(<= main_~k~0 2)} is VALID [2018-11-23 11:51:59,072 INFO L273 TraceCheckUtils]: 11: Hoare triple {3204#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3204#(<= main_~k~0 2)} is VALID [2018-11-23 11:51:59,073 INFO L273 TraceCheckUtils]: 12: Hoare triple {3204#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {3214#(<= main_~k~0 3)} is VALID [2018-11-23 11:51:59,073 INFO L273 TraceCheckUtils]: 13: Hoare triple {3214#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {3214#(<= main_~k~0 3)} is VALID [2018-11-23 11:51:59,074 INFO L273 TraceCheckUtils]: 14: Hoare triple {3214#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3214#(<= main_~k~0 3)} is VALID [2018-11-23 11:51:59,076 INFO L273 TraceCheckUtils]: 15: Hoare triple {3214#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {3224#(<= main_~k~0 4)} is VALID [2018-11-23 11:51:59,076 INFO L273 TraceCheckUtils]: 16: Hoare triple {3224#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {3224#(<= main_~k~0 4)} is VALID [2018-11-23 11:51:59,076 INFO L273 TraceCheckUtils]: 17: Hoare triple {3224#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3224#(<= main_~k~0 4)} is VALID [2018-11-23 11:51:59,077 INFO L273 TraceCheckUtils]: 18: Hoare triple {3224#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {3234#(<= main_~k~0 5)} is VALID [2018-11-23 11:51:59,077 INFO L273 TraceCheckUtils]: 19: Hoare triple {3234#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {3234#(<= main_~k~0 5)} is VALID [2018-11-23 11:51:59,078 INFO L273 TraceCheckUtils]: 20: Hoare triple {3234#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3234#(<= main_~k~0 5)} is VALID [2018-11-23 11:51:59,080 INFO L273 TraceCheckUtils]: 21: Hoare triple {3234#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {3244#(<= main_~k~0 6)} is VALID [2018-11-23 11:51:59,081 INFO L273 TraceCheckUtils]: 22: Hoare triple {3244#(<= main_~k~0 6)} assume !(~k~0 < 100000); {3164#false} is VALID [2018-11-23 11:51:59,081 INFO L273 TraceCheckUtils]: 23: Hoare triple {3164#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3164#false} is VALID [2018-11-23 11:51:59,081 INFO L273 TraceCheckUtils]: 24: Hoare triple {3164#false} ~x~0 := 0; {3164#false} is VALID [2018-11-23 11:51:59,082 INFO L273 TraceCheckUtils]: 25: Hoare triple {3164#false} assume !(~x~0 < ~i~0); {3164#false} is VALID [2018-11-23 11:51:59,082 INFO L273 TraceCheckUtils]: 26: Hoare triple {3164#false} ~x~0 := 0; {3164#false} is VALID [2018-11-23 11:51:59,082 INFO L273 TraceCheckUtils]: 27: Hoare triple {3164#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3164#false} is VALID [2018-11-23 11:51:59,082 INFO L256 TraceCheckUtils]: 28: Hoare triple {3164#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {3164#false} is VALID [2018-11-23 11:51:59,082 INFO L273 TraceCheckUtils]: 29: Hoare triple {3164#false} ~cond := #in~cond; {3164#false} is VALID [2018-11-23 11:51:59,083 INFO L273 TraceCheckUtils]: 30: Hoare triple {3164#false} assume !(0 == ~cond); {3164#false} is VALID [2018-11-23 11:51:59,083 INFO L273 TraceCheckUtils]: 31: Hoare triple {3164#false} assume true; {3164#false} is VALID [2018-11-23 11:51:59,083 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {3164#false} {3164#false} #136#return; {3164#false} is VALID [2018-11-23 11:51:59,083 INFO L273 TraceCheckUtils]: 33: Hoare triple {3164#false} havoc #t~mem9;havoc #t~mem10; {3164#false} is VALID [2018-11-23 11:51:59,083 INFO L273 TraceCheckUtils]: 34: Hoare triple {3164#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {3164#false} is VALID [2018-11-23 11:51:59,083 INFO L273 TraceCheckUtils]: 35: Hoare triple {3164#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3164#false} is VALID [2018-11-23 11:51:59,084 INFO L256 TraceCheckUtils]: 36: Hoare triple {3164#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {3164#false} is VALID [2018-11-23 11:51:59,084 INFO L273 TraceCheckUtils]: 37: Hoare triple {3164#false} ~cond := #in~cond; {3164#false} is VALID [2018-11-23 11:51:59,084 INFO L273 TraceCheckUtils]: 38: Hoare triple {3164#false} assume 0 == ~cond; {3164#false} is VALID [2018-11-23 11:51:59,084 INFO L273 TraceCheckUtils]: 39: Hoare triple {3164#false} assume !false; {3164#false} is VALID [2018-11-23 11:51:59,086 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:51:59,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:59,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-23 11:51:59,106 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 [2018-11-23 11:51:59,106 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:59,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 11:51:59,165 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:59,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 11:51:59,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 11:51:59,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:51:59,166 INFO L87 Difference]: Start difference. First operand 83 states and 107 transitions. Second operand 16 states. [2018-11-23 11:51:59,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:59,987 INFO L93 Difference]: Finished difference Result 144 states and 189 transitions. [2018-11-23 11:51:59,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:51:59,988 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 [2018-11-23 11:51:59,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:59,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:51:59,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 131 transitions. [2018-11-23 11:51:59,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:51:59,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 131 transitions. [2018-11-23 11:51:59,993 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 131 transitions. [2018-11-23 11:52:00,189 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:00,192 INFO L225 Difference]: With dead ends: 144 [2018-11-23 11:52:00,192 INFO L226 Difference]: Without dead ends: 98 [2018-11-23 11:52:00,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:52:00,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-23 11:52:00,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 89. [2018-11-23 11:52:00,291 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:00,291 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 89 states. [2018-11-23 11:52:00,291 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 89 states. [2018-11-23 11:52:00,291 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 89 states. [2018-11-23 11:52:00,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:00,295 INFO L93 Difference]: Finished difference Result 98 states and 128 transitions. [2018-11-23 11:52:00,296 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 128 transitions. [2018-11-23 11:52:00,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:00,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:00,296 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 98 states. [2018-11-23 11:52:00,296 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 98 states. [2018-11-23 11:52:00,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:00,299 INFO L93 Difference]: Finished difference Result 98 states and 128 transitions. [2018-11-23 11:52:00,300 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 128 transitions. [2018-11-23 11:52:00,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:00,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:00,300 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:00,300 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:00,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-23 11:52:00,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 115 transitions. [2018-11-23 11:52:00,303 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 115 transitions. Word has length 40 [2018-11-23 11:52:00,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:00,303 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 115 transitions. [2018-11-23 11:52:00,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 11:52:00,304 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 115 transitions. [2018-11-23 11:52:00,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 11:52:00,305 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:00,305 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:00,305 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:00,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:00,305 INFO L82 PathProgramCache]: Analyzing trace with hash 539935148, now seen corresponding path program 2 times [2018-11-23 11:52:00,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:00,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:00,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:00,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:52:00,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:00,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:00,595 INFO L256 TraceCheckUtils]: 0: Hoare triple {3813#true} call ULTIMATE.init(); {3813#true} is VALID [2018-11-23 11:52:00,595 INFO L273 TraceCheckUtils]: 1: Hoare triple {3813#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3813#true} is VALID [2018-11-23 11:52:00,595 INFO L273 TraceCheckUtils]: 2: Hoare triple {3813#true} assume true; {3813#true} is VALID [2018-11-23 11:52:00,595 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3813#true} {3813#true} #130#return; {3813#true} is VALID [2018-11-23 11:52:00,596 INFO L256 TraceCheckUtils]: 4: Hoare triple {3813#true} call #t~ret15 := main(); {3813#true} is VALID [2018-11-23 11:52:00,596 INFO L273 TraceCheckUtils]: 5: Hoare triple {3813#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {3815#(= main_~i~0 0)} is VALID [2018-11-23 11:52:00,596 INFO L273 TraceCheckUtils]: 6: Hoare triple {3815#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {3816#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:00,597 INFO L273 TraceCheckUtils]: 7: Hoare triple {3816#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {3816#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:00,597 INFO L273 TraceCheckUtils]: 8: Hoare triple {3816#(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; {3816#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:00,598 INFO L273 TraceCheckUtils]: 9: Hoare triple {3816#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {3817#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:00,599 INFO L273 TraceCheckUtils]: 10: Hoare triple {3817#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {3817#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:00,600 INFO L273 TraceCheckUtils]: 11: Hoare triple {3817#(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; {3817#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:00,601 INFO L273 TraceCheckUtils]: 12: Hoare triple {3817#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {3818#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:00,612 INFO L273 TraceCheckUtils]: 13: Hoare triple {3818#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {3818#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:00,612 INFO L273 TraceCheckUtils]: 14: Hoare triple {3818#(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; {3818#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:00,613 INFO L273 TraceCheckUtils]: 15: Hoare triple {3818#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {3819#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:00,613 INFO L273 TraceCheckUtils]: 16: Hoare triple {3819#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {3819#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:00,614 INFO L273 TraceCheckUtils]: 17: Hoare triple {3819#(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; {3819#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:00,614 INFO L273 TraceCheckUtils]: 18: Hoare triple {3819#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {3820#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:00,615 INFO L273 TraceCheckUtils]: 19: Hoare triple {3820#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {3820#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:00,616 INFO L273 TraceCheckUtils]: 20: Hoare triple {3820#(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; {3820#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:00,616 INFO L273 TraceCheckUtils]: 21: Hoare triple {3820#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {3821#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:00,617 INFO L273 TraceCheckUtils]: 22: Hoare triple {3821#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {3821#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:00,618 INFO L273 TraceCheckUtils]: 23: Hoare triple {3821#(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; {3821#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:00,619 INFO L273 TraceCheckUtils]: 24: Hoare triple {3821#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {3822#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:00,620 INFO L273 TraceCheckUtils]: 25: Hoare triple {3822#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume !(~k~0 < 100000); {3814#false} is VALID [2018-11-23 11:52:00,620 INFO L273 TraceCheckUtils]: 26: Hoare triple {3814#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3814#false} is VALID [2018-11-23 11:52:00,620 INFO L273 TraceCheckUtils]: 27: Hoare triple {3814#false} ~x~0 := 0; {3814#false} is VALID [2018-11-23 11:52:00,621 INFO L273 TraceCheckUtils]: 28: Hoare triple {3814#false} assume !(~x~0 < ~i~0); {3814#false} is VALID [2018-11-23 11:52:00,621 INFO L273 TraceCheckUtils]: 29: Hoare triple {3814#false} ~x~0 := 0; {3814#false} is VALID [2018-11-23 11:52:00,621 INFO L273 TraceCheckUtils]: 30: Hoare triple {3814#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3814#false} is VALID [2018-11-23 11:52:00,621 INFO L256 TraceCheckUtils]: 31: Hoare triple {3814#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {3813#true} is VALID [2018-11-23 11:52:00,622 INFO L273 TraceCheckUtils]: 32: Hoare triple {3813#true} ~cond := #in~cond; {3813#true} is VALID [2018-11-23 11:52:00,622 INFO L273 TraceCheckUtils]: 33: Hoare triple {3813#true} assume !(0 == ~cond); {3813#true} is VALID [2018-11-23 11:52:00,622 INFO L273 TraceCheckUtils]: 34: Hoare triple {3813#true} assume true; {3813#true} is VALID [2018-11-23 11:52:00,623 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {3813#true} {3814#false} #136#return; {3814#false} is VALID [2018-11-23 11:52:00,623 INFO L273 TraceCheckUtils]: 36: Hoare triple {3814#false} havoc #t~mem9;havoc #t~mem10; {3814#false} is VALID [2018-11-23 11:52:00,623 INFO L273 TraceCheckUtils]: 37: Hoare triple {3814#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {3814#false} is VALID [2018-11-23 11:52:00,623 INFO L273 TraceCheckUtils]: 38: Hoare triple {3814#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3814#false} is VALID [2018-11-23 11:52:00,624 INFO L256 TraceCheckUtils]: 39: Hoare triple {3814#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {3814#false} is VALID [2018-11-23 11:52:00,624 INFO L273 TraceCheckUtils]: 40: Hoare triple {3814#false} ~cond := #in~cond; {3814#false} is VALID [2018-11-23 11:52:00,624 INFO L273 TraceCheckUtils]: 41: Hoare triple {3814#false} assume 0 == ~cond; {3814#false} is VALID [2018-11-23 11:52:00,624 INFO L273 TraceCheckUtils]: 42: Hoare triple {3814#false} assume !false; {3814#false} is VALID [2018-11-23 11:52:00,627 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 2 proven. 51 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:52:00,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:00,627 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:52:00,638 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:52:00,686 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:52:00,686 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:00,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:00,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:01,075 INFO L256 TraceCheckUtils]: 0: Hoare triple {3813#true} call ULTIMATE.init(); {3813#true} is VALID [2018-11-23 11:52:01,075 INFO L273 TraceCheckUtils]: 1: Hoare triple {3813#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3813#true} is VALID [2018-11-23 11:52:01,076 INFO L273 TraceCheckUtils]: 2: Hoare triple {3813#true} assume true; {3813#true} is VALID [2018-11-23 11:52:01,076 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3813#true} {3813#true} #130#return; {3813#true} is VALID [2018-11-23 11:52:01,076 INFO L256 TraceCheckUtils]: 4: Hoare triple {3813#true} call #t~ret15 := main(); {3813#true} is VALID [2018-11-23 11:52:01,076 INFO L273 TraceCheckUtils]: 5: Hoare triple {3813#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {3841#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:01,078 INFO L273 TraceCheckUtils]: 6: Hoare triple {3841#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {3845#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:01,081 INFO L273 TraceCheckUtils]: 7: Hoare triple {3845#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {3845#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:01,083 INFO L273 TraceCheckUtils]: 8: Hoare triple {3845#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3845#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:01,086 INFO L273 TraceCheckUtils]: 9: Hoare triple {3845#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {3855#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:01,087 INFO L273 TraceCheckUtils]: 10: Hoare triple {3855#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {3855#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:01,087 INFO L273 TraceCheckUtils]: 11: Hoare triple {3855#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3855#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:01,088 INFO L273 TraceCheckUtils]: 12: Hoare triple {3855#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {3865#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:01,088 INFO L273 TraceCheckUtils]: 13: Hoare triple {3865#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {3865#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:01,089 INFO L273 TraceCheckUtils]: 14: Hoare triple {3865#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3865#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:01,089 INFO L273 TraceCheckUtils]: 15: Hoare triple {3865#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {3875#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:01,089 INFO L273 TraceCheckUtils]: 16: Hoare triple {3875#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {3875#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:01,090 INFO L273 TraceCheckUtils]: 17: Hoare triple {3875#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3875#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:01,090 INFO L273 TraceCheckUtils]: 18: Hoare triple {3875#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {3885#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:01,094 INFO L273 TraceCheckUtils]: 19: Hoare triple {3885#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {3885#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:01,097 INFO L273 TraceCheckUtils]: 20: Hoare triple {3885#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3885#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:01,097 INFO L273 TraceCheckUtils]: 21: Hoare triple {3885#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {3895#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:01,098 INFO L273 TraceCheckUtils]: 22: Hoare triple {3895#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {3895#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:01,098 INFO L273 TraceCheckUtils]: 23: Hoare triple {3895#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3895#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:01,099 INFO L273 TraceCheckUtils]: 24: Hoare triple {3895#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {3905#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:01,100 INFO L273 TraceCheckUtils]: 25: Hoare triple {3905#(<= main_~k~0 7)} assume !(~k~0 < 100000); {3814#false} is VALID [2018-11-23 11:52:01,100 INFO L273 TraceCheckUtils]: 26: Hoare triple {3814#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3814#false} is VALID [2018-11-23 11:52:01,100 INFO L273 TraceCheckUtils]: 27: Hoare triple {3814#false} ~x~0 := 0; {3814#false} is VALID [2018-11-23 11:52:01,100 INFO L273 TraceCheckUtils]: 28: Hoare triple {3814#false} assume !(~x~0 < ~i~0); {3814#false} is VALID [2018-11-23 11:52:01,100 INFO L273 TraceCheckUtils]: 29: Hoare triple {3814#false} ~x~0 := 0; {3814#false} is VALID [2018-11-23 11:52:01,100 INFO L273 TraceCheckUtils]: 30: Hoare triple {3814#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3814#false} is VALID [2018-11-23 11:52:01,101 INFO L256 TraceCheckUtils]: 31: Hoare triple {3814#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {3814#false} is VALID [2018-11-23 11:52:01,101 INFO L273 TraceCheckUtils]: 32: Hoare triple {3814#false} ~cond := #in~cond; {3814#false} is VALID [2018-11-23 11:52:01,101 INFO L273 TraceCheckUtils]: 33: Hoare triple {3814#false} assume !(0 == ~cond); {3814#false} is VALID [2018-11-23 11:52:01,101 INFO L273 TraceCheckUtils]: 34: Hoare triple {3814#false} assume true; {3814#false} is VALID [2018-11-23 11:52:01,101 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {3814#false} {3814#false} #136#return; {3814#false} is VALID [2018-11-23 11:52:01,101 INFO L273 TraceCheckUtils]: 36: Hoare triple {3814#false} havoc #t~mem9;havoc #t~mem10; {3814#false} is VALID [2018-11-23 11:52:01,101 INFO L273 TraceCheckUtils]: 37: Hoare triple {3814#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {3814#false} is VALID [2018-11-23 11:52:01,102 INFO L273 TraceCheckUtils]: 38: Hoare triple {3814#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3814#false} is VALID [2018-11-23 11:52:01,102 INFO L256 TraceCheckUtils]: 39: Hoare triple {3814#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {3814#false} is VALID [2018-11-23 11:52:01,102 INFO L273 TraceCheckUtils]: 40: Hoare triple {3814#false} ~cond := #in~cond; {3814#false} is VALID [2018-11-23 11:52:01,102 INFO L273 TraceCheckUtils]: 41: Hoare triple {3814#false} assume 0 == ~cond; {3814#false} is VALID [2018-11-23 11:52:01,102 INFO L273 TraceCheckUtils]: 42: Hoare triple {3814#false} assume !false; {3814#false} is VALID [2018-11-23 11:52:01,103 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:52:01,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:01,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-11-23 11:52:01,122 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 43 [2018-11-23 11:52:01,123 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:01,123 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 11:52:01,188 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:01,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 11:52:01,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 11:52:01,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=188, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:52:01,189 INFO L87 Difference]: Start difference. First operand 89 states and 115 transitions. Second operand 18 states. [2018-11-23 11:52:01,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:01,616 INFO L93 Difference]: Finished difference Result 150 states and 197 transitions. [2018-11-23 11:52:01,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:52:01,617 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 43 [2018-11-23 11:52:01,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:01,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:52:01,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 135 transitions. [2018-11-23 11:52:01,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:52:01,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 135 transitions. [2018-11-23 11:52:01,622 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 135 transitions. [2018-11-23 11:52:02,214 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:02,218 INFO L225 Difference]: With dead ends: 150 [2018-11-23 11:52:02,218 INFO L226 Difference]: Without dead ends: 104 [2018-11-23 11:52:02,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=188, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:52:02,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-23 11:52:02,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 95. [2018-11-23 11:52:02,302 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:02,302 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand 95 states. [2018-11-23 11:52:02,303 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 95 states. [2018-11-23 11:52:02,303 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 95 states. [2018-11-23 11:52:02,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:02,307 INFO L93 Difference]: Finished difference Result 104 states and 136 transitions. [2018-11-23 11:52:02,307 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 136 transitions. [2018-11-23 11:52:02,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:02,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:02,308 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 104 states. [2018-11-23 11:52:02,308 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 104 states. [2018-11-23 11:52:02,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:02,311 INFO L93 Difference]: Finished difference Result 104 states and 136 transitions. [2018-11-23 11:52:02,312 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 136 transitions. [2018-11-23 11:52:02,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:02,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:02,312 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:02,313 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:02,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-23 11:52:02,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 123 transitions. [2018-11-23 11:52:02,315 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 123 transitions. Word has length 43 [2018-11-23 11:52:02,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:02,316 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 123 transitions. [2018-11-23 11:52:02,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 11:52:02,316 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 123 transitions. [2018-11-23 11:52:02,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 11:52:02,317 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:02,317 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:02,317 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:02,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:02,318 INFO L82 PathProgramCache]: Analyzing trace with hash -608294063, now seen corresponding path program 3 times [2018-11-23 11:52:02,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:02,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:02,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:02,319 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:02,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:02,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:02,574 INFO L256 TraceCheckUtils]: 0: Hoare triple {4502#true} call ULTIMATE.init(); {4502#true} is VALID [2018-11-23 11:52:02,574 INFO L273 TraceCheckUtils]: 1: Hoare triple {4502#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4502#true} is VALID [2018-11-23 11:52:02,575 INFO L273 TraceCheckUtils]: 2: Hoare triple {4502#true} assume true; {4502#true} is VALID [2018-11-23 11:52:02,575 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4502#true} {4502#true} #130#return; {4502#true} is VALID [2018-11-23 11:52:02,575 INFO L256 TraceCheckUtils]: 4: Hoare triple {4502#true} call #t~ret15 := main(); {4502#true} is VALID [2018-11-23 11:52:02,576 INFO L273 TraceCheckUtils]: 5: Hoare triple {4502#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {4504#(= main_~i~0 0)} is VALID [2018-11-23 11:52:02,577 INFO L273 TraceCheckUtils]: 6: Hoare triple {4504#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {4505#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:02,577 INFO L273 TraceCheckUtils]: 7: Hoare triple {4505#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {4505#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:02,578 INFO L273 TraceCheckUtils]: 8: Hoare triple {4505#(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; {4505#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:02,578 INFO L273 TraceCheckUtils]: 9: Hoare triple {4505#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {4506#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:02,579 INFO L273 TraceCheckUtils]: 10: Hoare triple {4506#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {4506#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:02,580 INFO L273 TraceCheckUtils]: 11: Hoare triple {4506#(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; {4506#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:02,580 INFO L273 TraceCheckUtils]: 12: Hoare triple {4506#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {4507#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:02,581 INFO L273 TraceCheckUtils]: 13: Hoare triple {4507#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {4507#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:02,600 INFO L273 TraceCheckUtils]: 14: Hoare triple {4507#(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; {4507#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:02,614 INFO L273 TraceCheckUtils]: 15: Hoare triple {4507#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {4508#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:02,630 INFO L273 TraceCheckUtils]: 16: Hoare triple {4508#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {4508#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:02,639 INFO L273 TraceCheckUtils]: 17: Hoare triple {4508#(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; {4508#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:02,645 INFO L273 TraceCheckUtils]: 18: Hoare triple {4508#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {4509#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:02,646 INFO L273 TraceCheckUtils]: 19: Hoare triple {4509#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {4509#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:02,647 INFO L273 TraceCheckUtils]: 20: Hoare triple {4509#(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; {4509#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:02,647 INFO L273 TraceCheckUtils]: 21: Hoare triple {4509#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {4510#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:02,649 INFO L273 TraceCheckUtils]: 22: Hoare triple {4510#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {4510#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:02,649 INFO L273 TraceCheckUtils]: 23: Hoare triple {4510#(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; {4510#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:02,651 INFO L273 TraceCheckUtils]: 24: Hoare triple {4510#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {4511#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:02,652 INFO L273 TraceCheckUtils]: 25: Hoare triple {4511#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {4511#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:02,653 INFO L273 TraceCheckUtils]: 26: Hoare triple {4511#(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; {4511#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:02,653 INFO L273 TraceCheckUtils]: 27: Hoare triple {4511#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {4512#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:02,654 INFO L273 TraceCheckUtils]: 28: Hoare triple {4512#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume !(~k~0 < 100000); {4503#false} is VALID [2018-11-23 11:52:02,654 INFO L273 TraceCheckUtils]: 29: Hoare triple {4503#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4503#false} is VALID [2018-11-23 11:52:02,654 INFO L273 TraceCheckUtils]: 30: Hoare triple {4503#false} ~x~0 := 0; {4503#false} is VALID [2018-11-23 11:52:02,654 INFO L273 TraceCheckUtils]: 31: Hoare triple {4503#false} assume !(~x~0 < ~i~0); {4503#false} is VALID [2018-11-23 11:52:02,655 INFO L273 TraceCheckUtils]: 32: Hoare triple {4503#false} ~x~0 := 0; {4503#false} is VALID [2018-11-23 11:52:02,655 INFO L273 TraceCheckUtils]: 33: Hoare triple {4503#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4503#false} is VALID [2018-11-23 11:52:02,655 INFO L256 TraceCheckUtils]: 34: Hoare triple {4503#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {4502#true} is VALID [2018-11-23 11:52:02,655 INFO L273 TraceCheckUtils]: 35: Hoare triple {4502#true} ~cond := #in~cond; {4502#true} is VALID [2018-11-23 11:52:02,656 INFO L273 TraceCheckUtils]: 36: Hoare triple {4502#true} assume !(0 == ~cond); {4502#true} is VALID [2018-11-23 11:52:02,656 INFO L273 TraceCheckUtils]: 37: Hoare triple {4502#true} assume true; {4502#true} is VALID [2018-11-23 11:52:02,656 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {4502#true} {4503#false} #136#return; {4503#false} is VALID [2018-11-23 11:52:02,656 INFO L273 TraceCheckUtils]: 39: Hoare triple {4503#false} havoc #t~mem9;havoc #t~mem10; {4503#false} is VALID [2018-11-23 11:52:02,657 INFO L273 TraceCheckUtils]: 40: Hoare triple {4503#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {4503#false} is VALID [2018-11-23 11:52:02,657 INFO L273 TraceCheckUtils]: 41: Hoare triple {4503#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4503#false} is VALID [2018-11-23 11:52:02,658 INFO L256 TraceCheckUtils]: 42: Hoare triple {4503#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {4503#false} is VALID [2018-11-23 11:52:02,658 INFO L273 TraceCheckUtils]: 43: Hoare triple {4503#false} ~cond := #in~cond; {4503#false} is VALID [2018-11-23 11:52:02,658 INFO L273 TraceCheckUtils]: 44: Hoare triple {4503#false} assume 0 == ~cond; {4503#false} is VALID [2018-11-23 11:52:02,658 INFO L273 TraceCheckUtils]: 45: Hoare triple {4503#false} assume !false; {4503#false} is VALID [2018-11-23 11:52:02,663 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 2 proven. 70 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:52:02,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:02,664 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:52:02,704 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:52:02,748 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-23 11:52:02,748 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:02,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:02,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:02,999 INFO L256 TraceCheckUtils]: 0: Hoare triple {4502#true} call ULTIMATE.init(); {4502#true} is VALID [2018-11-23 11:52:02,999 INFO L273 TraceCheckUtils]: 1: Hoare triple {4502#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4502#true} is VALID [2018-11-23 11:52:02,999 INFO L273 TraceCheckUtils]: 2: Hoare triple {4502#true} assume true; {4502#true} is VALID [2018-11-23 11:52:03,000 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4502#true} {4502#true} #130#return; {4502#true} is VALID [2018-11-23 11:52:03,000 INFO L256 TraceCheckUtils]: 4: Hoare triple {4502#true} call #t~ret15 := main(); {4502#true} is VALID [2018-11-23 11:52:03,001 INFO L273 TraceCheckUtils]: 5: Hoare triple {4502#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {4531#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:03,001 INFO L273 TraceCheckUtils]: 6: Hoare triple {4531#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {4535#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:03,003 INFO L273 TraceCheckUtils]: 7: Hoare triple {4535#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {4535#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:03,005 INFO L273 TraceCheckUtils]: 8: Hoare triple {4535#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4535#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:03,005 INFO L273 TraceCheckUtils]: 9: Hoare triple {4535#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {4545#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:03,007 INFO L273 TraceCheckUtils]: 10: Hoare triple {4545#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {4545#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:03,007 INFO L273 TraceCheckUtils]: 11: Hoare triple {4545#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4545#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:03,009 INFO L273 TraceCheckUtils]: 12: Hoare triple {4545#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {4555#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:03,009 INFO L273 TraceCheckUtils]: 13: Hoare triple {4555#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {4555#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:03,011 INFO L273 TraceCheckUtils]: 14: Hoare triple {4555#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4555#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:03,011 INFO L273 TraceCheckUtils]: 15: Hoare triple {4555#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {4565#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:03,013 INFO L273 TraceCheckUtils]: 16: Hoare triple {4565#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {4565#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:03,013 INFO L273 TraceCheckUtils]: 17: Hoare triple {4565#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4565#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:03,015 INFO L273 TraceCheckUtils]: 18: Hoare triple {4565#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {4575#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:03,015 INFO L273 TraceCheckUtils]: 19: Hoare triple {4575#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {4575#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:03,018 INFO L273 TraceCheckUtils]: 20: Hoare triple {4575#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4575#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:03,018 INFO L273 TraceCheckUtils]: 21: Hoare triple {4575#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {4585#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:03,020 INFO L273 TraceCheckUtils]: 22: Hoare triple {4585#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {4585#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:03,020 INFO L273 TraceCheckUtils]: 23: Hoare triple {4585#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4585#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:03,022 INFO L273 TraceCheckUtils]: 24: Hoare triple {4585#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {4595#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:03,022 INFO L273 TraceCheckUtils]: 25: Hoare triple {4595#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {4595#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:03,025 INFO L273 TraceCheckUtils]: 26: Hoare triple {4595#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4595#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:03,025 INFO L273 TraceCheckUtils]: 27: Hoare triple {4595#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {4605#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:03,027 INFO L273 TraceCheckUtils]: 28: Hoare triple {4605#(<= main_~k~0 8)} assume !(~k~0 < 100000); {4503#false} is VALID [2018-11-23 11:52:03,027 INFO L273 TraceCheckUtils]: 29: Hoare triple {4503#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4503#false} is VALID [2018-11-23 11:52:03,027 INFO L273 TraceCheckUtils]: 30: Hoare triple {4503#false} ~x~0 := 0; {4503#false} is VALID [2018-11-23 11:52:03,027 INFO L273 TraceCheckUtils]: 31: Hoare triple {4503#false} assume !(~x~0 < ~i~0); {4503#false} is VALID [2018-11-23 11:52:03,027 INFO L273 TraceCheckUtils]: 32: Hoare triple {4503#false} ~x~0 := 0; {4503#false} is VALID [2018-11-23 11:52:03,027 INFO L273 TraceCheckUtils]: 33: Hoare triple {4503#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4503#false} is VALID [2018-11-23 11:52:03,027 INFO L256 TraceCheckUtils]: 34: Hoare triple {4503#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {4503#false} is VALID [2018-11-23 11:52:03,028 INFO L273 TraceCheckUtils]: 35: Hoare triple {4503#false} ~cond := #in~cond; {4503#false} is VALID [2018-11-23 11:52:03,028 INFO L273 TraceCheckUtils]: 36: Hoare triple {4503#false} assume !(0 == ~cond); {4503#false} is VALID [2018-11-23 11:52:03,028 INFO L273 TraceCheckUtils]: 37: Hoare triple {4503#false} assume true; {4503#false} is VALID [2018-11-23 11:52:03,028 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {4503#false} {4503#false} #136#return; {4503#false} is VALID [2018-11-23 11:52:03,028 INFO L273 TraceCheckUtils]: 39: Hoare triple {4503#false} havoc #t~mem9;havoc #t~mem10; {4503#false} is VALID [2018-11-23 11:52:03,028 INFO L273 TraceCheckUtils]: 40: Hoare triple {4503#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {4503#false} is VALID [2018-11-23 11:52:03,028 INFO L273 TraceCheckUtils]: 41: Hoare triple {4503#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4503#false} is VALID [2018-11-23 11:52:03,029 INFO L256 TraceCheckUtils]: 42: Hoare triple {4503#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {4503#false} is VALID [2018-11-23 11:52:03,029 INFO L273 TraceCheckUtils]: 43: Hoare triple {4503#false} ~cond := #in~cond; {4503#false} is VALID [2018-11-23 11:52:03,029 INFO L273 TraceCheckUtils]: 44: Hoare triple {4503#false} assume 0 == ~cond; {4503#false} is VALID [2018-11-23 11:52:03,029 INFO L273 TraceCheckUtils]: 45: Hoare triple {4503#false} assume !false; {4503#false} is VALID [2018-11-23 11:52:03,030 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:52:03,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:03,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-11-23 11:52:03,049 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 46 [2018-11-23 11:52:03,050 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:03,050 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 11:52:03,181 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:03,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 11:52:03,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 11:52:03,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=234, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:52:03,182 INFO L87 Difference]: Start difference. First operand 95 states and 123 transitions. Second operand 20 states. [2018-11-23 11:52:03,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:03,906 INFO L93 Difference]: Finished difference Result 156 states and 205 transitions. [2018-11-23 11:52:03,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:52:03,906 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 46 [2018-11-23 11:52:03,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:03,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:52:03,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 139 transitions. [2018-11-23 11:52:03,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:52:03,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 139 transitions. [2018-11-23 11:52:03,910 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 139 transitions. [2018-11-23 11:52:04,174 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:04,177 INFO L225 Difference]: With dead ends: 156 [2018-11-23 11:52:04,177 INFO L226 Difference]: Without dead ends: 110 [2018-11-23 11:52:04,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=234, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:52:04,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-23 11:52:04,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 101. [2018-11-23 11:52:04,235 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:04,236 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand 101 states. [2018-11-23 11:52:04,236 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 101 states. [2018-11-23 11:52:04,236 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 101 states. [2018-11-23 11:52:04,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:04,239 INFO L93 Difference]: Finished difference Result 110 states and 144 transitions. [2018-11-23 11:52:04,239 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 144 transitions. [2018-11-23 11:52:04,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:04,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:04,240 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 110 states. [2018-11-23 11:52:04,240 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 110 states. [2018-11-23 11:52:04,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:04,243 INFO L93 Difference]: Finished difference Result 110 states and 144 transitions. [2018-11-23 11:52:04,243 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 144 transitions. [2018-11-23 11:52:04,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:04,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:04,244 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:04,244 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:04,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-23 11:52:04,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 131 transitions. [2018-11-23 11:52:04,247 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 131 transitions. Word has length 46 [2018-11-23 11:52:04,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:04,247 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 131 transitions. [2018-11-23 11:52:04,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 11:52:04,247 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 131 transitions. [2018-11-23 11:52:04,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 11:52:04,248 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:04,248 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:04,249 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:04,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:04,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1909793676, now seen corresponding path program 4 times [2018-11-23 11:52:04,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:04,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:04,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:04,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:04,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:04,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:05,172 INFO L256 TraceCheckUtils]: 0: Hoare triple {5230#true} call ULTIMATE.init(); {5230#true} is VALID [2018-11-23 11:52:05,173 INFO L273 TraceCheckUtils]: 1: Hoare triple {5230#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5230#true} is VALID [2018-11-23 11:52:05,173 INFO L273 TraceCheckUtils]: 2: Hoare triple {5230#true} assume true; {5230#true} is VALID [2018-11-23 11:52:05,174 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5230#true} {5230#true} #130#return; {5230#true} is VALID [2018-11-23 11:52:05,174 INFO L256 TraceCheckUtils]: 4: Hoare triple {5230#true} call #t~ret15 := main(); {5230#true} is VALID [2018-11-23 11:52:05,188 INFO L273 TraceCheckUtils]: 5: Hoare triple {5230#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {5232#(= main_~i~0 0)} is VALID [2018-11-23 11:52:05,189 INFO L273 TraceCheckUtils]: 6: Hoare triple {5232#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {5233#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:05,189 INFO L273 TraceCheckUtils]: 7: Hoare triple {5233#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {5233#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:05,190 INFO L273 TraceCheckUtils]: 8: Hoare triple {5233#(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; {5233#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:05,190 INFO L273 TraceCheckUtils]: 9: Hoare triple {5233#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {5234#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:05,191 INFO L273 TraceCheckUtils]: 10: Hoare triple {5234#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {5234#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:05,191 INFO L273 TraceCheckUtils]: 11: Hoare triple {5234#(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; {5234#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:05,192 INFO L273 TraceCheckUtils]: 12: Hoare triple {5234#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {5235#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:05,192 INFO L273 TraceCheckUtils]: 13: Hoare triple {5235#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {5235#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:05,193 INFO L273 TraceCheckUtils]: 14: Hoare triple {5235#(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; {5235#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:05,194 INFO L273 TraceCheckUtils]: 15: Hoare triple {5235#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {5236#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:05,195 INFO L273 TraceCheckUtils]: 16: Hoare triple {5236#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {5236#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:05,196 INFO L273 TraceCheckUtils]: 17: Hoare triple {5236#(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; {5236#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:05,197 INFO L273 TraceCheckUtils]: 18: Hoare triple {5236#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {5237#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:05,198 INFO L273 TraceCheckUtils]: 19: Hoare triple {5237#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {5237#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:05,199 INFO L273 TraceCheckUtils]: 20: Hoare triple {5237#(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; {5237#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:05,199 INFO L273 TraceCheckUtils]: 21: Hoare triple {5237#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {5238#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:05,200 INFO L273 TraceCheckUtils]: 22: Hoare triple {5238#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {5238#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:05,201 INFO L273 TraceCheckUtils]: 23: Hoare triple {5238#(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; {5238#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:05,202 INFO L273 TraceCheckUtils]: 24: Hoare triple {5238#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {5239#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:05,203 INFO L273 TraceCheckUtils]: 25: Hoare triple {5239#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {5239#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:05,204 INFO L273 TraceCheckUtils]: 26: Hoare triple {5239#(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; {5239#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:05,205 INFO L273 TraceCheckUtils]: 27: Hoare triple {5239#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {5240#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:05,205 INFO L273 TraceCheckUtils]: 28: Hoare triple {5240#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {5240#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:05,206 INFO L273 TraceCheckUtils]: 29: Hoare triple {5240#(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; {5240#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:05,207 INFO L273 TraceCheckUtils]: 30: Hoare triple {5240#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {5241#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:05,208 INFO L273 TraceCheckUtils]: 31: Hoare triple {5241#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume !(~k~0 < 100000); {5231#false} is VALID [2018-11-23 11:52:05,208 INFO L273 TraceCheckUtils]: 32: Hoare triple {5231#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5231#false} is VALID [2018-11-23 11:52:05,208 INFO L273 TraceCheckUtils]: 33: Hoare triple {5231#false} ~x~0 := 0; {5231#false} is VALID [2018-11-23 11:52:05,208 INFO L273 TraceCheckUtils]: 34: Hoare triple {5231#false} assume !(~x~0 < ~i~0); {5231#false} is VALID [2018-11-23 11:52:05,209 INFO L273 TraceCheckUtils]: 35: Hoare triple {5231#false} ~x~0 := 0; {5231#false} is VALID [2018-11-23 11:52:05,209 INFO L273 TraceCheckUtils]: 36: Hoare triple {5231#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5231#false} is VALID [2018-11-23 11:52:05,209 INFO L256 TraceCheckUtils]: 37: Hoare triple {5231#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {5230#true} is VALID [2018-11-23 11:52:05,209 INFO L273 TraceCheckUtils]: 38: Hoare triple {5230#true} ~cond := #in~cond; {5230#true} is VALID [2018-11-23 11:52:05,210 INFO L273 TraceCheckUtils]: 39: Hoare triple {5230#true} assume !(0 == ~cond); {5230#true} is VALID [2018-11-23 11:52:05,210 INFO L273 TraceCheckUtils]: 40: Hoare triple {5230#true} assume true; {5230#true} is VALID [2018-11-23 11:52:05,210 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {5230#true} {5231#false} #136#return; {5231#false} is VALID [2018-11-23 11:52:05,210 INFO L273 TraceCheckUtils]: 42: Hoare triple {5231#false} havoc #t~mem9;havoc #t~mem10; {5231#false} is VALID [2018-11-23 11:52:05,210 INFO L273 TraceCheckUtils]: 43: Hoare triple {5231#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {5231#false} is VALID [2018-11-23 11:52:05,211 INFO L273 TraceCheckUtils]: 44: Hoare triple {5231#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5231#false} is VALID [2018-11-23 11:52:05,211 INFO L256 TraceCheckUtils]: 45: Hoare triple {5231#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {5231#false} is VALID [2018-11-23 11:52:05,211 INFO L273 TraceCheckUtils]: 46: Hoare triple {5231#false} ~cond := #in~cond; {5231#false} is VALID [2018-11-23 11:52:05,211 INFO L273 TraceCheckUtils]: 47: Hoare triple {5231#false} assume 0 == ~cond; {5231#false} is VALID [2018-11-23 11:52:05,211 INFO L273 TraceCheckUtils]: 48: Hoare triple {5231#false} assume !false; {5231#false} is VALID [2018-11-23 11:52:05,214 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 2 proven. 92 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:52:05,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:05,214 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:52:05,223 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:52:05,247 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:52:05,247 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:05,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:05,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:05,504 INFO L256 TraceCheckUtils]: 0: Hoare triple {5230#true} call ULTIMATE.init(); {5230#true} is VALID [2018-11-23 11:52:05,504 INFO L273 TraceCheckUtils]: 1: Hoare triple {5230#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5230#true} is VALID [2018-11-23 11:52:05,504 INFO L273 TraceCheckUtils]: 2: Hoare triple {5230#true} assume true; {5230#true} is VALID [2018-11-23 11:52:05,505 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5230#true} {5230#true} #130#return; {5230#true} is VALID [2018-11-23 11:52:05,505 INFO L256 TraceCheckUtils]: 4: Hoare triple {5230#true} call #t~ret15 := main(); {5230#true} is VALID [2018-11-23 11:52:05,505 INFO L273 TraceCheckUtils]: 5: Hoare triple {5230#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {5230#true} is VALID [2018-11-23 11:52:05,506 INFO L273 TraceCheckUtils]: 6: Hoare triple {5230#true} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {5263#(<= main_~k~0 (+ main_~i~0 1))} is VALID [2018-11-23 11:52:05,506 INFO L273 TraceCheckUtils]: 7: Hoare triple {5263#(<= main_~k~0 (+ main_~i~0 1))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {5263#(<= main_~k~0 (+ main_~i~0 1))} is VALID [2018-11-23 11:52:05,506 INFO L273 TraceCheckUtils]: 8: Hoare triple {5263#(<= main_~k~0 (+ main_~i~0 1))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5263#(<= main_~k~0 (+ main_~i~0 1))} is VALID [2018-11-23 11:52:05,507 INFO L273 TraceCheckUtils]: 9: Hoare triple {5263#(<= main_~k~0 (+ main_~i~0 1))} ~k~0 := 1 + ~k~0; {5273#(<= main_~k~0 (+ main_~i~0 2))} is VALID [2018-11-23 11:52:05,507 INFO L273 TraceCheckUtils]: 10: Hoare triple {5273#(<= main_~k~0 (+ main_~i~0 2))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {5273#(<= main_~k~0 (+ main_~i~0 2))} is VALID [2018-11-23 11:52:05,508 INFO L273 TraceCheckUtils]: 11: Hoare triple {5273#(<= main_~k~0 (+ main_~i~0 2))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5273#(<= main_~k~0 (+ main_~i~0 2))} is VALID [2018-11-23 11:52:05,508 INFO L273 TraceCheckUtils]: 12: Hoare triple {5273#(<= main_~k~0 (+ main_~i~0 2))} ~k~0 := 1 + ~k~0; {5283#(<= main_~k~0 (+ main_~i~0 3))} is VALID [2018-11-23 11:52:05,509 INFO L273 TraceCheckUtils]: 13: Hoare triple {5283#(<= main_~k~0 (+ main_~i~0 3))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {5283#(<= main_~k~0 (+ main_~i~0 3))} is VALID [2018-11-23 11:52:05,509 INFO L273 TraceCheckUtils]: 14: Hoare triple {5283#(<= main_~k~0 (+ main_~i~0 3))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5283#(<= main_~k~0 (+ main_~i~0 3))} is VALID [2018-11-23 11:52:05,510 INFO L273 TraceCheckUtils]: 15: Hoare triple {5283#(<= main_~k~0 (+ main_~i~0 3))} ~k~0 := 1 + ~k~0; {5293#(<= main_~k~0 (+ main_~i~0 4))} is VALID [2018-11-23 11:52:05,511 INFO L273 TraceCheckUtils]: 16: Hoare triple {5293#(<= main_~k~0 (+ main_~i~0 4))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {5293#(<= main_~k~0 (+ main_~i~0 4))} is VALID [2018-11-23 11:52:05,511 INFO L273 TraceCheckUtils]: 17: Hoare triple {5293#(<= main_~k~0 (+ main_~i~0 4))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5293#(<= main_~k~0 (+ main_~i~0 4))} is VALID [2018-11-23 11:52:05,512 INFO L273 TraceCheckUtils]: 18: Hoare triple {5293#(<= main_~k~0 (+ main_~i~0 4))} ~k~0 := 1 + ~k~0; {5303#(<= main_~k~0 (+ main_~i~0 5))} is VALID [2018-11-23 11:52:05,512 INFO L273 TraceCheckUtils]: 19: Hoare triple {5303#(<= main_~k~0 (+ main_~i~0 5))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {5303#(<= main_~k~0 (+ main_~i~0 5))} is VALID [2018-11-23 11:52:05,513 INFO L273 TraceCheckUtils]: 20: Hoare triple {5303#(<= main_~k~0 (+ main_~i~0 5))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5303#(<= main_~k~0 (+ main_~i~0 5))} is VALID [2018-11-23 11:52:05,514 INFO L273 TraceCheckUtils]: 21: Hoare triple {5303#(<= main_~k~0 (+ main_~i~0 5))} ~k~0 := 1 + ~k~0; {5313#(<= main_~k~0 (+ main_~i~0 6))} is VALID [2018-11-23 11:52:05,514 INFO L273 TraceCheckUtils]: 22: Hoare triple {5313#(<= main_~k~0 (+ main_~i~0 6))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {5313#(<= main_~k~0 (+ main_~i~0 6))} is VALID [2018-11-23 11:52:05,515 INFO L273 TraceCheckUtils]: 23: Hoare triple {5313#(<= main_~k~0 (+ main_~i~0 6))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5313#(<= main_~k~0 (+ main_~i~0 6))} is VALID [2018-11-23 11:52:05,516 INFO L273 TraceCheckUtils]: 24: Hoare triple {5313#(<= main_~k~0 (+ main_~i~0 6))} ~k~0 := 1 + ~k~0; {5323#(<= main_~k~0 (+ main_~i~0 7))} is VALID [2018-11-23 11:52:05,516 INFO L273 TraceCheckUtils]: 25: Hoare triple {5323#(<= main_~k~0 (+ main_~i~0 7))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {5323#(<= main_~k~0 (+ main_~i~0 7))} is VALID [2018-11-23 11:52:05,517 INFO L273 TraceCheckUtils]: 26: Hoare triple {5323#(<= main_~k~0 (+ main_~i~0 7))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5323#(<= main_~k~0 (+ main_~i~0 7))} is VALID [2018-11-23 11:52:05,517 INFO L273 TraceCheckUtils]: 27: Hoare triple {5323#(<= main_~k~0 (+ main_~i~0 7))} ~k~0 := 1 + ~k~0; {5333#(<= main_~k~0 (+ main_~i~0 8))} is VALID [2018-11-23 11:52:05,518 INFO L273 TraceCheckUtils]: 28: Hoare triple {5333#(<= main_~k~0 (+ main_~i~0 8))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {5333#(<= main_~k~0 (+ main_~i~0 8))} is VALID [2018-11-23 11:52:05,518 INFO L273 TraceCheckUtils]: 29: Hoare triple {5333#(<= main_~k~0 (+ main_~i~0 8))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5333#(<= main_~k~0 (+ main_~i~0 8))} is VALID [2018-11-23 11:52:05,519 INFO L273 TraceCheckUtils]: 30: Hoare triple {5333#(<= main_~k~0 (+ main_~i~0 8))} ~k~0 := 1 + ~k~0; {5343#(<= main_~k~0 (+ main_~i~0 9))} is VALID [2018-11-23 11:52:05,520 INFO L273 TraceCheckUtils]: 31: Hoare triple {5343#(<= main_~k~0 (+ main_~i~0 9))} assume !(~k~0 < 100000); {5347#(<= 99991 main_~i~0)} is VALID [2018-11-23 11:52:05,520 INFO L273 TraceCheckUtils]: 32: Hoare triple {5347#(<= 99991 main_~i~0)} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5347#(<= 99991 main_~i~0)} is VALID [2018-11-23 11:52:05,521 INFO L273 TraceCheckUtils]: 33: Hoare triple {5347#(<= 99991 main_~i~0)} ~x~0 := 0; {5354#(and (<= 99991 main_~i~0) (<= main_~x~0 0))} is VALID [2018-11-23 11:52:05,522 INFO L273 TraceCheckUtils]: 34: Hoare triple {5354#(and (<= 99991 main_~i~0) (<= main_~x~0 0))} assume !(~x~0 < ~i~0); {5231#false} is VALID [2018-11-23 11:52:05,522 INFO L273 TraceCheckUtils]: 35: Hoare triple {5231#false} ~x~0 := 0; {5231#false} is VALID [2018-11-23 11:52:05,522 INFO L273 TraceCheckUtils]: 36: Hoare triple {5231#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5231#false} is VALID [2018-11-23 11:52:05,522 INFO L256 TraceCheckUtils]: 37: Hoare triple {5231#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {5231#false} is VALID [2018-11-23 11:52:05,523 INFO L273 TraceCheckUtils]: 38: Hoare triple {5231#false} ~cond := #in~cond; {5231#false} is VALID [2018-11-23 11:52:05,523 INFO L273 TraceCheckUtils]: 39: Hoare triple {5231#false} assume !(0 == ~cond); {5231#false} is VALID [2018-11-23 11:52:05,523 INFO L273 TraceCheckUtils]: 40: Hoare triple {5231#false} assume true; {5231#false} is VALID [2018-11-23 11:52:05,523 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {5231#false} {5231#false} #136#return; {5231#false} is VALID [2018-11-23 11:52:05,523 INFO L273 TraceCheckUtils]: 42: Hoare triple {5231#false} havoc #t~mem9;havoc #t~mem10; {5231#false} is VALID [2018-11-23 11:52:05,524 INFO L273 TraceCheckUtils]: 43: Hoare triple {5231#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {5231#false} is VALID [2018-11-23 11:52:05,524 INFO L273 TraceCheckUtils]: 44: Hoare triple {5231#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5231#false} is VALID [2018-11-23 11:52:05,524 INFO L256 TraceCheckUtils]: 45: Hoare triple {5231#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {5231#false} is VALID [2018-11-23 11:52:05,524 INFO L273 TraceCheckUtils]: 46: Hoare triple {5231#false} ~cond := #in~cond; {5231#false} is VALID [2018-11-23 11:52:05,524 INFO L273 TraceCheckUtils]: 47: Hoare triple {5231#false} assume 0 == ~cond; {5231#false} is VALID [2018-11-23 11:52:05,525 INFO L273 TraceCheckUtils]: 48: Hoare triple {5231#false} assume !false; {5231#false} is VALID [2018-11-23 11:52:05,527 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:52:05,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:05,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2018-11-23 11:52:05,546 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 49 [2018-11-23 11:52:05,547 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:05,547 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 11:52:05,624 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:05,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 11:52:05,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 11:52:05,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=336, Unknown=0, NotChecked=0, Total=506 [2018-11-23 11:52:05,625 INFO L87 Difference]: Start difference. First operand 101 states and 131 transitions. Second operand 23 states. [2018-11-23 11:52:11,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:11,017 INFO L93 Difference]: Finished difference Result 604 states and 861 transitions. [2018-11-23 11:52:11,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-23 11:52:11,017 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 49 [2018-11-23 11:52:11,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:11,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:52:11,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 704 transitions. [2018-11-23 11:52:11,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:52:11,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 704 transitions. [2018-11-23 11:52:11,042 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 704 transitions. [2018-11-23 11:52:12,193 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 704 edges. 704 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:12,216 INFO L225 Difference]: With dead ends: 604 [2018-11-23 11:52:12,216 INFO L226 Difference]: Without dead ends: 558 [2018-11-23 11:52:12,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 11:52:12,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2018-11-23 11:52:12,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 179. [2018-11-23 11:52:12,531 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:12,531 INFO L82 GeneralOperation]: Start isEquivalent. First operand 558 states. Second operand 179 states. [2018-11-23 11:52:12,531 INFO L74 IsIncluded]: Start isIncluded. First operand 558 states. Second operand 179 states. [2018-11-23 11:52:12,532 INFO L87 Difference]: Start difference. First operand 558 states. Second operand 179 states. [2018-11-23 11:52:12,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:12,562 INFO L93 Difference]: Finished difference Result 558 states and 782 transitions. [2018-11-23 11:52:12,562 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 782 transitions. [2018-11-23 11:52:12,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:12,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:12,567 INFO L74 IsIncluded]: Start isIncluded. First operand 179 states. Second operand 558 states. [2018-11-23 11:52:12,567 INFO L87 Difference]: Start difference. First operand 179 states. Second operand 558 states. [2018-11-23 11:52:12,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:12,593 INFO L93 Difference]: Finished difference Result 558 states and 782 transitions. [2018-11-23 11:52:12,593 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 782 transitions. [2018-11-23 11:52:12,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:12,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:12,596 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:12,596 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:12,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-11-23 11:52:12,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 254 transitions. [2018-11-23 11:52:12,601 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 254 transitions. Word has length 49 [2018-11-23 11:52:12,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:12,601 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 254 transitions. [2018-11-23 11:52:12,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 11:52:12,601 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 254 transitions. [2018-11-23 11:52:12,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 11:52:12,602 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:12,602 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:12,602 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:12,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:12,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1932133007, now seen corresponding path program 5 times [2018-11-23 11:52:12,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:12,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:12,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:12,604 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:12,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:12,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:14,281 INFO L256 TraceCheckUtils]: 0: Hoare triple {7642#true} call ULTIMATE.init(); {7642#true} is VALID [2018-11-23 11:52:14,282 INFO L273 TraceCheckUtils]: 1: Hoare triple {7642#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7642#true} is VALID [2018-11-23 11:52:14,282 INFO L273 TraceCheckUtils]: 2: Hoare triple {7642#true} assume true; {7642#true} is VALID [2018-11-23 11:52:14,282 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7642#true} {7642#true} #130#return; {7642#true} is VALID [2018-11-23 11:52:14,282 INFO L256 TraceCheckUtils]: 4: Hoare triple {7642#true} call #t~ret15 := main(); {7642#true} is VALID [2018-11-23 11:52:14,282 INFO L273 TraceCheckUtils]: 5: Hoare triple {7642#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {7644#(= main_~i~0 0)} is VALID [2018-11-23 11:52:14,283 INFO L273 TraceCheckUtils]: 6: Hoare triple {7644#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {7645#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:14,284 INFO L273 TraceCheckUtils]: 7: Hoare triple {7645#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {7645#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:14,284 INFO L273 TraceCheckUtils]: 8: Hoare triple {7645#(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; {7645#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:14,285 INFO L273 TraceCheckUtils]: 9: Hoare triple {7645#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {7646#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:14,286 INFO L273 TraceCheckUtils]: 10: Hoare triple {7646#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {7646#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:14,287 INFO L273 TraceCheckUtils]: 11: Hoare triple {7646#(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; {7646#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:14,288 INFO L273 TraceCheckUtils]: 12: Hoare triple {7646#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {7647#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:14,288 INFO L273 TraceCheckUtils]: 13: Hoare triple {7647#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {7647#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:14,289 INFO L273 TraceCheckUtils]: 14: Hoare triple {7647#(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; {7647#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:14,290 INFO L273 TraceCheckUtils]: 15: Hoare triple {7647#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {7648#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:14,291 INFO L273 TraceCheckUtils]: 16: Hoare triple {7648#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {7648#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:14,291 INFO L273 TraceCheckUtils]: 17: Hoare triple {7648#(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; {7648#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:14,292 INFO L273 TraceCheckUtils]: 18: Hoare triple {7648#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {7649#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:14,293 INFO L273 TraceCheckUtils]: 19: Hoare triple {7649#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {7649#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:14,294 INFO L273 TraceCheckUtils]: 20: Hoare triple {7649#(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; {7649#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:14,295 INFO L273 TraceCheckUtils]: 21: Hoare triple {7649#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {7650#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:14,295 INFO L273 TraceCheckUtils]: 22: Hoare triple {7650#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {7650#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:14,296 INFO L273 TraceCheckUtils]: 23: Hoare triple {7650#(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; {7650#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:14,297 INFO L273 TraceCheckUtils]: 24: Hoare triple {7650#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {7651#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:14,298 INFO L273 TraceCheckUtils]: 25: Hoare triple {7651#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {7651#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:14,298 INFO L273 TraceCheckUtils]: 26: Hoare triple {7651#(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; {7651#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:14,299 INFO L273 TraceCheckUtils]: 27: Hoare triple {7651#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {7652#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:14,300 INFO L273 TraceCheckUtils]: 28: Hoare triple {7652#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {7652#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:14,301 INFO L273 TraceCheckUtils]: 29: Hoare triple {7652#(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; {7652#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:14,302 INFO L273 TraceCheckUtils]: 30: Hoare triple {7652#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {7653#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:14,302 INFO L273 TraceCheckUtils]: 31: Hoare triple {7653#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {7653#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:14,303 INFO L273 TraceCheckUtils]: 32: Hoare triple {7653#(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; {7653#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:14,304 INFO L273 TraceCheckUtils]: 33: Hoare triple {7653#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {7654#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:14,305 INFO L273 TraceCheckUtils]: 34: Hoare triple {7654#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume !(~k~0 < 100000); {7643#false} is VALID [2018-11-23 11:52:14,305 INFO L273 TraceCheckUtils]: 35: Hoare triple {7643#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7643#false} is VALID [2018-11-23 11:52:14,305 INFO L273 TraceCheckUtils]: 36: Hoare triple {7643#false} ~x~0 := 0; {7643#false} is VALID [2018-11-23 11:52:14,305 INFO L273 TraceCheckUtils]: 37: Hoare triple {7643#false} assume !(~x~0 < ~i~0); {7643#false} is VALID [2018-11-23 11:52:14,306 INFO L273 TraceCheckUtils]: 38: Hoare triple {7643#false} ~x~0 := 0; {7643#false} is VALID [2018-11-23 11:52:14,306 INFO L273 TraceCheckUtils]: 39: Hoare triple {7643#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7643#false} is VALID [2018-11-23 11:52:14,306 INFO L256 TraceCheckUtils]: 40: Hoare triple {7643#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {7642#true} is VALID [2018-11-23 11:52:14,306 INFO L273 TraceCheckUtils]: 41: Hoare triple {7642#true} ~cond := #in~cond; {7642#true} is VALID [2018-11-23 11:52:14,307 INFO L273 TraceCheckUtils]: 42: Hoare triple {7642#true} assume !(0 == ~cond); {7642#true} is VALID [2018-11-23 11:52:14,307 INFO L273 TraceCheckUtils]: 43: Hoare triple {7642#true} assume true; {7642#true} is VALID [2018-11-23 11:52:14,307 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {7642#true} {7643#false} #136#return; {7643#false} is VALID [2018-11-23 11:52:14,307 INFO L273 TraceCheckUtils]: 45: Hoare triple {7643#false} havoc #t~mem9;havoc #t~mem10; {7643#false} is VALID [2018-11-23 11:52:14,307 INFO L273 TraceCheckUtils]: 46: Hoare triple {7643#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {7643#false} is VALID [2018-11-23 11:52:14,308 INFO L273 TraceCheckUtils]: 47: Hoare triple {7643#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7643#false} is VALID [2018-11-23 11:52:14,308 INFO L256 TraceCheckUtils]: 48: Hoare triple {7643#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {7643#false} is VALID [2018-11-23 11:52:14,308 INFO L273 TraceCheckUtils]: 49: Hoare triple {7643#false} ~cond := #in~cond; {7643#false} is VALID [2018-11-23 11:52:14,308 INFO L273 TraceCheckUtils]: 50: Hoare triple {7643#false} assume 0 == ~cond; {7643#false} is VALID [2018-11-23 11:52:14,308 INFO L273 TraceCheckUtils]: 51: Hoare triple {7643#false} assume !false; {7643#false} is VALID [2018-11-23 11:52:14,313 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 2 proven. 117 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:52:14,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:14,313 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:52:14,328 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:52:14,357 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-11-23 11:52:14,358 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:14,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:14,580 INFO L256 TraceCheckUtils]: 0: Hoare triple {7642#true} call ULTIMATE.init(); {7642#true} is VALID [2018-11-23 11:52:14,580 INFO L273 TraceCheckUtils]: 1: Hoare triple {7642#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7642#true} is VALID [2018-11-23 11:52:14,581 INFO L273 TraceCheckUtils]: 2: Hoare triple {7642#true} assume true; {7642#true} is VALID [2018-11-23 11:52:14,581 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7642#true} {7642#true} #130#return; {7642#true} is VALID [2018-11-23 11:52:14,581 INFO L256 TraceCheckUtils]: 4: Hoare triple {7642#true} call #t~ret15 := main(); {7642#true} is VALID [2018-11-23 11:52:14,600 INFO L273 TraceCheckUtils]: 5: Hoare triple {7642#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {7673#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:14,602 INFO L273 TraceCheckUtils]: 6: Hoare triple {7673#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {7677#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:14,603 INFO L273 TraceCheckUtils]: 7: Hoare triple {7677#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {7677#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:14,603 INFO L273 TraceCheckUtils]: 8: Hoare triple {7677#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7677#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:14,603 INFO L273 TraceCheckUtils]: 9: Hoare triple {7677#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {7687#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:14,604 INFO L273 TraceCheckUtils]: 10: Hoare triple {7687#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {7687#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:14,604 INFO L273 TraceCheckUtils]: 11: Hoare triple {7687#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7687#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:14,605 INFO L273 TraceCheckUtils]: 12: Hoare triple {7687#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {7697#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:14,605 INFO L273 TraceCheckUtils]: 13: Hoare triple {7697#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {7697#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:14,606 INFO L273 TraceCheckUtils]: 14: Hoare triple {7697#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7697#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:14,606 INFO L273 TraceCheckUtils]: 15: Hoare triple {7697#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {7707#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:14,607 INFO L273 TraceCheckUtils]: 16: Hoare triple {7707#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {7707#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:14,607 INFO L273 TraceCheckUtils]: 17: Hoare triple {7707#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7707#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:14,608 INFO L273 TraceCheckUtils]: 18: Hoare triple {7707#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {7717#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:14,609 INFO L273 TraceCheckUtils]: 19: Hoare triple {7717#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {7717#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:14,609 INFO L273 TraceCheckUtils]: 20: Hoare triple {7717#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7717#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:14,610 INFO L273 TraceCheckUtils]: 21: Hoare triple {7717#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {7727#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:14,610 INFO L273 TraceCheckUtils]: 22: Hoare triple {7727#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {7727#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:14,611 INFO L273 TraceCheckUtils]: 23: Hoare triple {7727#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7727#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:14,611 INFO L273 TraceCheckUtils]: 24: Hoare triple {7727#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {7737#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:14,612 INFO L273 TraceCheckUtils]: 25: Hoare triple {7737#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {7737#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:14,612 INFO L273 TraceCheckUtils]: 26: Hoare triple {7737#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7737#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:14,613 INFO L273 TraceCheckUtils]: 27: Hoare triple {7737#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {7747#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:14,614 INFO L273 TraceCheckUtils]: 28: Hoare triple {7747#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {7747#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:14,614 INFO L273 TraceCheckUtils]: 29: Hoare triple {7747#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7747#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:14,615 INFO L273 TraceCheckUtils]: 30: Hoare triple {7747#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {7757#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:14,615 INFO L273 TraceCheckUtils]: 31: Hoare triple {7757#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {7757#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:14,616 INFO L273 TraceCheckUtils]: 32: Hoare triple {7757#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7757#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:14,617 INFO L273 TraceCheckUtils]: 33: Hoare triple {7757#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {7767#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:14,617 INFO L273 TraceCheckUtils]: 34: Hoare triple {7767#(<= main_~k~0 10)} assume !(~k~0 < 100000); {7643#false} is VALID [2018-11-23 11:52:14,617 INFO L273 TraceCheckUtils]: 35: Hoare triple {7643#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7643#false} is VALID [2018-11-23 11:52:14,618 INFO L273 TraceCheckUtils]: 36: Hoare triple {7643#false} ~x~0 := 0; {7643#false} is VALID [2018-11-23 11:52:14,618 INFO L273 TraceCheckUtils]: 37: Hoare triple {7643#false} assume !(~x~0 < ~i~0); {7643#false} is VALID [2018-11-23 11:52:14,618 INFO L273 TraceCheckUtils]: 38: Hoare triple {7643#false} ~x~0 := 0; {7643#false} is VALID [2018-11-23 11:52:14,618 INFO L273 TraceCheckUtils]: 39: Hoare triple {7643#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7643#false} is VALID [2018-11-23 11:52:14,618 INFO L256 TraceCheckUtils]: 40: Hoare triple {7643#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {7643#false} is VALID [2018-11-23 11:52:14,619 INFO L273 TraceCheckUtils]: 41: Hoare triple {7643#false} ~cond := #in~cond; {7643#false} is VALID [2018-11-23 11:52:14,619 INFO L273 TraceCheckUtils]: 42: Hoare triple {7643#false} assume !(0 == ~cond); {7643#false} is VALID [2018-11-23 11:52:14,619 INFO L273 TraceCheckUtils]: 43: Hoare triple {7643#false} assume true; {7643#false} is VALID [2018-11-23 11:52:14,619 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {7643#false} {7643#false} #136#return; {7643#false} is VALID [2018-11-23 11:52:14,619 INFO L273 TraceCheckUtils]: 45: Hoare triple {7643#false} havoc #t~mem9;havoc #t~mem10; {7643#false} is VALID [2018-11-23 11:52:14,620 INFO L273 TraceCheckUtils]: 46: Hoare triple {7643#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {7643#false} is VALID [2018-11-23 11:52:14,620 INFO L273 TraceCheckUtils]: 47: Hoare triple {7643#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7643#false} is VALID [2018-11-23 11:52:14,620 INFO L256 TraceCheckUtils]: 48: Hoare triple {7643#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {7643#false} is VALID [2018-11-23 11:52:14,620 INFO L273 TraceCheckUtils]: 49: Hoare triple {7643#false} ~cond := #in~cond; {7643#false} is VALID [2018-11-23 11:52:14,620 INFO L273 TraceCheckUtils]: 50: Hoare triple {7643#false} assume 0 == ~cond; {7643#false} is VALID [2018-11-23 11:52:14,621 INFO L273 TraceCheckUtils]: 51: Hoare triple {7643#false} assume !false; {7643#false} is VALID [2018-11-23 11:52:14,623 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:52:14,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:14,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-23 11:52:14,642 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 52 [2018-11-23 11:52:14,642 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:14,642 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 11:52:14,726 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-23 11:52:14,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 11:52:14,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 11:52:14,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=341, Unknown=0, NotChecked=0, Total=552 [2018-11-23 11:52:14,728 INFO L87 Difference]: Start difference. First operand 179 states and 254 transitions. Second operand 24 states. [2018-11-23 11:52:15,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:15,677 INFO L93 Difference]: Finished difference Result 312 states and 451 transitions. [2018-11-23 11:52:15,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 11:52:15,678 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 52 [2018-11-23 11:52:15,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:15,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:52:15,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 147 transitions. [2018-11-23 11:52:15,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:52:15,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 147 transitions. [2018-11-23 11:52:15,682 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 147 transitions. [2018-11-23 11:52:16,283 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:16,287 INFO L225 Difference]: With dead ends: 312 [2018-11-23 11:52:16,287 INFO L226 Difference]: Without dead ends: 194 [2018-11-23 11:52:16,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=211, Invalid=341, Unknown=0, NotChecked=0, Total=552 [2018-11-23 11:52:16,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-11-23 11:52:16,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 185. [2018-11-23 11:52:16,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:16,743 INFO L82 GeneralOperation]: Start isEquivalent. First operand 194 states. Second operand 185 states. [2018-11-23 11:52:16,743 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand 185 states. [2018-11-23 11:52:16,743 INFO L87 Difference]: Start difference. First operand 194 states. Second operand 185 states. [2018-11-23 11:52:16,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:16,748 INFO L93 Difference]: Finished difference Result 194 states and 275 transitions. [2018-11-23 11:52:16,748 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 275 transitions. [2018-11-23 11:52:16,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:16,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:16,749 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand 194 states. [2018-11-23 11:52:16,749 INFO L87 Difference]: Start difference. First operand 185 states. Second operand 194 states. [2018-11-23 11:52:16,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:16,755 INFO L93 Difference]: Finished difference Result 194 states and 275 transitions. [2018-11-23 11:52:16,755 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 275 transitions. [2018-11-23 11:52:16,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:16,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:16,756 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:16,756 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:16,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-11-23 11:52:16,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 262 transitions. [2018-11-23 11:52:16,761 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 262 transitions. Word has length 52 [2018-11-23 11:52:16,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:16,761 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 262 transitions. [2018-11-23 11:52:16,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 11:52:16,761 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 262 transitions. [2018-11-23 11:52:16,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 11:52:16,762 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:16,762 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:16,762 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:16,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:16,763 INFO L82 PathProgramCache]: Analyzing trace with hash -186475156, now seen corresponding path program 6 times [2018-11-23 11:52:16,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:16,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:16,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:16,764 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:16,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:16,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:17,490 INFO L256 TraceCheckUtils]: 0: Hoare triple {8889#true} call ULTIMATE.init(); {8889#true} is VALID [2018-11-23 11:52:17,490 INFO L273 TraceCheckUtils]: 1: Hoare triple {8889#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8889#true} is VALID [2018-11-23 11:52:17,490 INFO L273 TraceCheckUtils]: 2: Hoare triple {8889#true} assume true; {8889#true} is VALID [2018-11-23 11:52:17,490 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8889#true} {8889#true} #130#return; {8889#true} is VALID [2018-11-23 11:52:17,490 INFO L256 TraceCheckUtils]: 4: Hoare triple {8889#true} call #t~ret15 := main(); {8889#true} is VALID [2018-11-23 11:52:17,491 INFO L273 TraceCheckUtils]: 5: Hoare triple {8889#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {8891#(= main_~i~0 0)} is VALID [2018-11-23 11:52:17,491 INFO L273 TraceCheckUtils]: 6: Hoare triple {8891#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {8892#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:17,492 INFO L273 TraceCheckUtils]: 7: Hoare triple {8892#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {8892#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:17,492 INFO L273 TraceCheckUtils]: 8: Hoare triple {8892#(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; {8892#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:17,493 INFO L273 TraceCheckUtils]: 9: Hoare triple {8892#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {8893#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:17,493 INFO L273 TraceCheckUtils]: 10: Hoare triple {8893#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {8893#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:17,494 INFO L273 TraceCheckUtils]: 11: Hoare triple {8893#(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; {8893#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:17,494 INFO L273 TraceCheckUtils]: 12: Hoare triple {8893#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {8894#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:17,495 INFO L273 TraceCheckUtils]: 13: Hoare triple {8894#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {8894#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:17,496 INFO L273 TraceCheckUtils]: 14: Hoare triple {8894#(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; {8894#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:17,497 INFO L273 TraceCheckUtils]: 15: Hoare triple {8894#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {8895#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:17,497 INFO L273 TraceCheckUtils]: 16: Hoare triple {8895#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {8895#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:17,498 INFO L273 TraceCheckUtils]: 17: Hoare triple {8895#(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; {8895#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:17,499 INFO L273 TraceCheckUtils]: 18: Hoare triple {8895#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {8896#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:17,500 INFO L273 TraceCheckUtils]: 19: Hoare triple {8896#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {8896#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:17,500 INFO L273 TraceCheckUtils]: 20: Hoare triple {8896#(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; {8896#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:17,501 INFO L273 TraceCheckUtils]: 21: Hoare triple {8896#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {8897#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:17,502 INFO L273 TraceCheckUtils]: 22: Hoare triple {8897#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {8897#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:17,503 INFO L273 TraceCheckUtils]: 23: Hoare triple {8897#(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; {8897#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:17,504 INFO L273 TraceCheckUtils]: 24: Hoare triple {8897#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {8898#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:17,504 INFO L273 TraceCheckUtils]: 25: Hoare triple {8898#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {8898#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:17,505 INFO L273 TraceCheckUtils]: 26: Hoare triple {8898#(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; {8898#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:17,506 INFO L273 TraceCheckUtils]: 27: Hoare triple {8898#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {8899#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:17,507 INFO L273 TraceCheckUtils]: 28: Hoare triple {8899#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {8899#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:17,507 INFO L273 TraceCheckUtils]: 29: Hoare triple {8899#(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; {8899#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:17,508 INFO L273 TraceCheckUtils]: 30: Hoare triple {8899#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {8900#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:17,509 INFO L273 TraceCheckUtils]: 31: Hoare triple {8900#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {8900#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:17,510 INFO L273 TraceCheckUtils]: 32: Hoare triple {8900#(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; {8900#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:17,511 INFO L273 TraceCheckUtils]: 33: Hoare triple {8900#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {8901#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:17,511 INFO L273 TraceCheckUtils]: 34: Hoare triple {8901#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {8901#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:17,512 INFO L273 TraceCheckUtils]: 35: Hoare triple {8901#(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; {8901#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:17,513 INFO L273 TraceCheckUtils]: 36: Hoare triple {8901#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {8902#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:17,514 INFO L273 TraceCheckUtils]: 37: Hoare triple {8902#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume !(~k~0 < 100000); {8890#false} is VALID [2018-11-23 11:52:17,514 INFO L273 TraceCheckUtils]: 38: Hoare triple {8890#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8890#false} is VALID [2018-11-23 11:52:17,514 INFO L273 TraceCheckUtils]: 39: Hoare triple {8890#false} ~x~0 := 0; {8890#false} is VALID [2018-11-23 11:52:17,514 INFO L273 TraceCheckUtils]: 40: Hoare triple {8890#false} assume !(~x~0 < ~i~0); {8890#false} is VALID [2018-11-23 11:52:17,514 INFO L273 TraceCheckUtils]: 41: Hoare triple {8890#false} ~x~0 := 0; {8890#false} is VALID [2018-11-23 11:52:17,515 INFO L273 TraceCheckUtils]: 42: Hoare triple {8890#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8890#false} is VALID [2018-11-23 11:52:17,515 INFO L256 TraceCheckUtils]: 43: Hoare triple {8890#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {8889#true} is VALID [2018-11-23 11:52:17,515 INFO L273 TraceCheckUtils]: 44: Hoare triple {8889#true} ~cond := #in~cond; {8889#true} is VALID [2018-11-23 11:52:17,515 INFO L273 TraceCheckUtils]: 45: Hoare triple {8889#true} assume !(0 == ~cond); {8889#true} is VALID [2018-11-23 11:52:17,515 INFO L273 TraceCheckUtils]: 46: Hoare triple {8889#true} assume true; {8889#true} is VALID [2018-11-23 11:52:17,516 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {8889#true} {8890#false} #136#return; {8890#false} is VALID [2018-11-23 11:52:17,516 INFO L273 TraceCheckUtils]: 48: Hoare triple {8890#false} havoc #t~mem9;havoc #t~mem10; {8890#false} is VALID [2018-11-23 11:52:17,516 INFO L273 TraceCheckUtils]: 49: Hoare triple {8890#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {8890#false} is VALID [2018-11-23 11:52:17,516 INFO L273 TraceCheckUtils]: 50: Hoare triple {8890#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8890#false} is VALID [2018-11-23 11:52:17,516 INFO L256 TraceCheckUtils]: 51: Hoare triple {8890#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {8890#false} is VALID [2018-11-23 11:52:17,517 INFO L273 TraceCheckUtils]: 52: Hoare triple {8890#false} ~cond := #in~cond; {8890#false} is VALID [2018-11-23 11:52:17,517 INFO L273 TraceCheckUtils]: 53: Hoare triple {8890#false} assume 0 == ~cond; {8890#false} is VALID [2018-11-23 11:52:17,517 INFO L273 TraceCheckUtils]: 54: Hoare triple {8890#false} assume !false; {8890#false} is VALID [2018-11-23 11:52:17,521 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 2 proven. 145 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:52:17,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:17,521 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:52:17,530 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:52:17,572 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-11-23 11:52:17,572 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:17,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:17,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:17,844 INFO L256 TraceCheckUtils]: 0: Hoare triple {8889#true} call ULTIMATE.init(); {8889#true} is VALID [2018-11-23 11:52:17,844 INFO L273 TraceCheckUtils]: 1: Hoare triple {8889#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8889#true} is VALID [2018-11-23 11:52:17,845 INFO L273 TraceCheckUtils]: 2: Hoare triple {8889#true} assume true; {8889#true} is VALID [2018-11-23 11:52:17,845 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8889#true} {8889#true} #130#return; {8889#true} is VALID [2018-11-23 11:52:17,845 INFO L256 TraceCheckUtils]: 4: Hoare triple {8889#true} call #t~ret15 := main(); {8889#true} is VALID [2018-11-23 11:52:17,846 INFO L273 TraceCheckUtils]: 5: Hoare triple {8889#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {8921#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:17,847 INFO L273 TraceCheckUtils]: 6: Hoare triple {8921#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {8925#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:17,847 INFO L273 TraceCheckUtils]: 7: Hoare triple {8925#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {8925#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:17,847 INFO L273 TraceCheckUtils]: 8: Hoare triple {8925#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8925#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:17,848 INFO L273 TraceCheckUtils]: 9: Hoare triple {8925#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {8935#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:17,871 INFO L273 TraceCheckUtils]: 10: Hoare triple {8935#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {8935#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:17,886 INFO L273 TraceCheckUtils]: 11: Hoare triple {8935#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8935#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:17,895 INFO L273 TraceCheckUtils]: 12: Hoare triple {8935#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {8945#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:17,909 INFO L273 TraceCheckUtils]: 13: Hoare triple {8945#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {8945#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:17,918 INFO L273 TraceCheckUtils]: 14: Hoare triple {8945#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8945#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:17,930 INFO L273 TraceCheckUtils]: 15: Hoare triple {8945#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {8955#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:17,939 INFO L273 TraceCheckUtils]: 16: Hoare triple {8955#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {8955#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:17,952 INFO L273 TraceCheckUtils]: 17: Hoare triple {8955#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8955#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:17,957 INFO L273 TraceCheckUtils]: 18: Hoare triple {8955#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {8965#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:17,957 INFO L273 TraceCheckUtils]: 19: Hoare triple {8965#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {8965#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:17,958 INFO L273 TraceCheckUtils]: 20: Hoare triple {8965#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8965#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:17,959 INFO L273 TraceCheckUtils]: 21: Hoare triple {8965#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {8975#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:17,959 INFO L273 TraceCheckUtils]: 22: Hoare triple {8975#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {8975#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:17,962 INFO L273 TraceCheckUtils]: 23: Hoare triple {8975#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8975#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:17,962 INFO L273 TraceCheckUtils]: 24: Hoare triple {8975#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {8985#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:17,963 INFO L273 TraceCheckUtils]: 25: Hoare triple {8985#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {8985#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:17,963 INFO L273 TraceCheckUtils]: 26: Hoare triple {8985#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8985#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:17,963 INFO L273 TraceCheckUtils]: 27: Hoare triple {8985#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {8995#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:17,964 INFO L273 TraceCheckUtils]: 28: Hoare triple {8995#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {8995#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:17,965 INFO L273 TraceCheckUtils]: 29: Hoare triple {8995#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8995#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:17,965 INFO L273 TraceCheckUtils]: 30: Hoare triple {8995#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {9005#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:17,965 INFO L273 TraceCheckUtils]: 31: Hoare triple {9005#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {9005#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:17,966 INFO L273 TraceCheckUtils]: 32: Hoare triple {9005#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9005#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:17,967 INFO L273 TraceCheckUtils]: 33: Hoare triple {9005#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {9015#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:17,967 INFO L273 TraceCheckUtils]: 34: Hoare triple {9015#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {9015#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:17,968 INFO L273 TraceCheckUtils]: 35: Hoare triple {9015#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9015#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:17,968 INFO L273 TraceCheckUtils]: 36: Hoare triple {9015#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {9025#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:17,969 INFO L273 TraceCheckUtils]: 37: Hoare triple {9025#(<= main_~k~0 11)} assume !(~k~0 < 100000); {8890#false} is VALID [2018-11-23 11:52:17,969 INFO L273 TraceCheckUtils]: 38: Hoare triple {8890#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8890#false} is VALID [2018-11-23 11:52:17,970 INFO L273 TraceCheckUtils]: 39: Hoare triple {8890#false} ~x~0 := 0; {8890#false} is VALID [2018-11-23 11:52:17,970 INFO L273 TraceCheckUtils]: 40: Hoare triple {8890#false} assume !(~x~0 < ~i~0); {8890#false} is VALID [2018-11-23 11:52:17,970 INFO L273 TraceCheckUtils]: 41: Hoare triple {8890#false} ~x~0 := 0; {8890#false} is VALID [2018-11-23 11:52:17,970 INFO L273 TraceCheckUtils]: 42: Hoare triple {8890#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8890#false} is VALID [2018-11-23 11:52:17,970 INFO L256 TraceCheckUtils]: 43: Hoare triple {8890#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {8890#false} is VALID [2018-11-23 11:52:17,971 INFO L273 TraceCheckUtils]: 44: Hoare triple {8890#false} ~cond := #in~cond; {8890#false} is VALID [2018-11-23 11:52:17,971 INFO L273 TraceCheckUtils]: 45: Hoare triple {8890#false} assume !(0 == ~cond); {8890#false} is VALID [2018-11-23 11:52:17,971 INFO L273 TraceCheckUtils]: 46: Hoare triple {8890#false} assume true; {8890#false} is VALID [2018-11-23 11:52:17,971 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {8890#false} {8890#false} #136#return; {8890#false} is VALID [2018-11-23 11:52:17,972 INFO L273 TraceCheckUtils]: 48: Hoare triple {8890#false} havoc #t~mem9;havoc #t~mem10; {8890#false} is VALID [2018-11-23 11:52:17,972 INFO L273 TraceCheckUtils]: 49: Hoare triple {8890#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {8890#false} is VALID [2018-11-23 11:52:17,972 INFO L273 TraceCheckUtils]: 50: Hoare triple {8890#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8890#false} is VALID [2018-11-23 11:52:17,972 INFO L256 TraceCheckUtils]: 51: Hoare triple {8890#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {8890#false} is VALID [2018-11-23 11:52:17,972 INFO L273 TraceCheckUtils]: 52: Hoare triple {8890#false} ~cond := #in~cond; {8890#false} is VALID [2018-11-23 11:52:17,973 INFO L273 TraceCheckUtils]: 53: Hoare triple {8890#false} assume 0 == ~cond; {8890#false} is VALID [2018-11-23 11:52:17,973 INFO L273 TraceCheckUtils]: 54: Hoare triple {8890#false} assume !false; {8890#false} is VALID [2018-11-23 11:52:17,976 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:52:17,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:17,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-11-23 11:52:17,996 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2018-11-23 11:52:17,997 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:17,997 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 11:52:18,086 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:18,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 11:52:18,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 11:52:18,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=402, Unknown=0, NotChecked=0, Total=650 [2018-11-23 11:52:18,088 INFO L87 Difference]: Start difference. First operand 185 states and 262 transitions. Second operand 26 states. [2018-11-23 11:52:19,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:19,363 INFO L93 Difference]: Finished difference Result 318 states and 459 transitions. [2018-11-23 11:52:19,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 11:52:19,363 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2018-11-23 11:52:19,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:19,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 11:52:19,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 151 transitions. [2018-11-23 11:52:19,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 11:52:19,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 151 transitions. [2018-11-23 11:52:19,370 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 151 transitions. [2018-11-23 11:52:19,825 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:19,830 INFO L225 Difference]: With dead ends: 318 [2018-11-23 11:52:19,830 INFO L226 Difference]: Without dead ends: 200 [2018-11-23 11:52:19,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=248, Invalid=402, Unknown=0, NotChecked=0, Total=650 [2018-11-23 11:52:19,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-11-23 11:52:20,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 191. [2018-11-23 11:52:20,134 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:20,134 INFO L82 GeneralOperation]: Start isEquivalent. First operand 200 states. Second operand 191 states. [2018-11-23 11:52:20,134 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand 191 states. [2018-11-23 11:52:20,135 INFO L87 Difference]: Start difference. First operand 200 states. Second operand 191 states. [2018-11-23 11:52:20,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:20,141 INFO L93 Difference]: Finished difference Result 200 states and 283 transitions. [2018-11-23 11:52:20,141 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 283 transitions. [2018-11-23 11:52:20,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:20,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:20,142 INFO L74 IsIncluded]: Start isIncluded. First operand 191 states. Second operand 200 states. [2018-11-23 11:52:20,143 INFO L87 Difference]: Start difference. First operand 191 states. Second operand 200 states. [2018-11-23 11:52:20,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:20,150 INFO L93 Difference]: Finished difference Result 200 states and 283 transitions. [2018-11-23 11:52:20,150 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 283 transitions. [2018-11-23 11:52:20,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:20,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:20,151 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:20,151 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:20,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-11-23 11:52:20,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 270 transitions. [2018-11-23 11:52:20,158 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 270 transitions. Word has length 55 [2018-11-23 11:52:20,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:20,158 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 270 transitions. [2018-11-23 11:52:20,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 11:52:20,158 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 270 transitions. [2018-11-23 11:52:20,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-23 11:52:20,159 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:20,159 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:20,160 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:20,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:20,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1242544017, now seen corresponding path program 7 times [2018-11-23 11:52:20,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:20,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:20,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:20,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:20,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:20,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:20,805 INFO L256 TraceCheckUtils]: 0: Hoare triple {10175#true} call ULTIMATE.init(); {10175#true} is VALID [2018-11-23 11:52:20,805 INFO L273 TraceCheckUtils]: 1: Hoare triple {10175#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10175#true} is VALID [2018-11-23 11:52:20,805 INFO L273 TraceCheckUtils]: 2: Hoare triple {10175#true} assume true; {10175#true} is VALID [2018-11-23 11:52:20,806 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10175#true} {10175#true} #130#return; {10175#true} is VALID [2018-11-23 11:52:20,806 INFO L256 TraceCheckUtils]: 4: Hoare triple {10175#true} call #t~ret15 := main(); {10175#true} is VALID [2018-11-23 11:52:20,806 INFO L273 TraceCheckUtils]: 5: Hoare triple {10175#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {10177#(= main_~i~0 0)} is VALID [2018-11-23 11:52:20,807 INFO L273 TraceCheckUtils]: 6: Hoare triple {10177#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {10178#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:20,808 INFO L273 TraceCheckUtils]: 7: Hoare triple {10178#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {10178#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:20,809 INFO L273 TraceCheckUtils]: 8: Hoare triple {10178#(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; {10178#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:20,809 INFO L273 TraceCheckUtils]: 9: Hoare triple {10178#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {10179#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:20,810 INFO L273 TraceCheckUtils]: 10: Hoare triple {10179#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {10179#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:20,811 INFO L273 TraceCheckUtils]: 11: Hoare triple {10179#(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; {10179#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:20,812 INFO L273 TraceCheckUtils]: 12: Hoare triple {10179#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {10180#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:20,813 INFO L273 TraceCheckUtils]: 13: Hoare triple {10180#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {10180#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:20,813 INFO L273 TraceCheckUtils]: 14: Hoare triple {10180#(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; {10180#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:20,814 INFO L273 TraceCheckUtils]: 15: Hoare triple {10180#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {10181#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:20,815 INFO L273 TraceCheckUtils]: 16: Hoare triple {10181#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {10181#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:20,816 INFO L273 TraceCheckUtils]: 17: Hoare triple {10181#(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; {10181#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:20,816 INFO L273 TraceCheckUtils]: 18: Hoare triple {10181#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {10182#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:20,817 INFO L273 TraceCheckUtils]: 19: Hoare triple {10182#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {10182#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:20,818 INFO L273 TraceCheckUtils]: 20: Hoare triple {10182#(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; {10182#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:20,819 INFO L273 TraceCheckUtils]: 21: Hoare triple {10182#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {10183#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:20,820 INFO L273 TraceCheckUtils]: 22: Hoare triple {10183#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {10183#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:20,821 INFO L273 TraceCheckUtils]: 23: Hoare triple {10183#(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; {10183#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:20,822 INFO L273 TraceCheckUtils]: 24: Hoare triple {10183#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {10184#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:20,822 INFO L273 TraceCheckUtils]: 25: Hoare triple {10184#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {10184#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:20,823 INFO L273 TraceCheckUtils]: 26: Hoare triple {10184#(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; {10184#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:20,824 INFO L273 TraceCheckUtils]: 27: Hoare triple {10184#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {10185#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:20,825 INFO L273 TraceCheckUtils]: 28: Hoare triple {10185#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {10185#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:20,825 INFO L273 TraceCheckUtils]: 29: Hoare triple {10185#(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; {10185#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:20,826 INFO L273 TraceCheckUtils]: 30: Hoare triple {10185#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {10186#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:20,827 INFO L273 TraceCheckUtils]: 31: Hoare triple {10186#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {10186#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:20,828 INFO L273 TraceCheckUtils]: 32: Hoare triple {10186#(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; {10186#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:20,829 INFO L273 TraceCheckUtils]: 33: Hoare triple {10186#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {10187#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:20,830 INFO L273 TraceCheckUtils]: 34: Hoare triple {10187#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {10187#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:20,830 INFO L273 TraceCheckUtils]: 35: Hoare triple {10187#(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; {10187#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:20,831 INFO L273 TraceCheckUtils]: 36: Hoare triple {10187#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {10188#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:20,832 INFO L273 TraceCheckUtils]: 37: Hoare triple {10188#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {10188#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:20,833 INFO L273 TraceCheckUtils]: 38: Hoare triple {10188#(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; {10188#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:20,834 INFO L273 TraceCheckUtils]: 39: Hoare triple {10188#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {10189#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:20,835 INFO L273 TraceCheckUtils]: 40: Hoare triple {10189#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume !(~k~0 < 100000); {10176#false} is VALID [2018-11-23 11:52:20,835 INFO L273 TraceCheckUtils]: 41: Hoare triple {10176#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10176#false} is VALID [2018-11-23 11:52:20,835 INFO L273 TraceCheckUtils]: 42: Hoare triple {10176#false} ~x~0 := 0; {10176#false} is VALID [2018-11-23 11:52:20,835 INFO L273 TraceCheckUtils]: 43: Hoare triple {10176#false} assume !(~x~0 < ~i~0); {10176#false} is VALID [2018-11-23 11:52:20,836 INFO L273 TraceCheckUtils]: 44: Hoare triple {10176#false} ~x~0 := 0; {10176#false} is VALID [2018-11-23 11:52:20,836 INFO L273 TraceCheckUtils]: 45: Hoare triple {10176#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10176#false} is VALID [2018-11-23 11:52:20,836 INFO L256 TraceCheckUtils]: 46: Hoare triple {10176#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {10175#true} is VALID [2018-11-23 11:52:20,836 INFO L273 TraceCheckUtils]: 47: Hoare triple {10175#true} ~cond := #in~cond; {10175#true} is VALID [2018-11-23 11:52:20,836 INFO L273 TraceCheckUtils]: 48: Hoare triple {10175#true} assume !(0 == ~cond); {10175#true} is VALID [2018-11-23 11:52:20,837 INFO L273 TraceCheckUtils]: 49: Hoare triple {10175#true} assume true; {10175#true} is VALID [2018-11-23 11:52:20,837 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {10175#true} {10176#false} #136#return; {10176#false} is VALID [2018-11-23 11:52:20,837 INFO L273 TraceCheckUtils]: 51: Hoare triple {10176#false} havoc #t~mem9;havoc #t~mem10; {10176#false} is VALID [2018-11-23 11:52:20,837 INFO L273 TraceCheckUtils]: 52: Hoare triple {10176#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {10176#false} is VALID [2018-11-23 11:52:20,837 INFO L273 TraceCheckUtils]: 53: Hoare triple {10176#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10176#false} is VALID [2018-11-23 11:52:20,838 INFO L256 TraceCheckUtils]: 54: Hoare triple {10176#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {10176#false} is VALID [2018-11-23 11:52:20,838 INFO L273 TraceCheckUtils]: 55: Hoare triple {10176#false} ~cond := #in~cond; {10176#false} is VALID [2018-11-23 11:52:20,838 INFO L273 TraceCheckUtils]: 56: Hoare triple {10176#false} assume 0 == ~cond; {10176#false} is VALID [2018-11-23 11:52:20,838 INFO L273 TraceCheckUtils]: 57: Hoare triple {10176#false} assume !false; {10176#false} is VALID [2018-11-23 11:52:20,843 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 2 proven. 176 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:52:20,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:20,843 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:52:20,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:52:20,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:20,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:20,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:21,150 INFO L256 TraceCheckUtils]: 0: Hoare triple {10175#true} call ULTIMATE.init(); {10175#true} is VALID [2018-11-23 11:52:21,151 INFO L273 TraceCheckUtils]: 1: Hoare triple {10175#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10175#true} is VALID [2018-11-23 11:52:21,151 INFO L273 TraceCheckUtils]: 2: Hoare triple {10175#true} assume true; {10175#true} is VALID [2018-11-23 11:52:21,151 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10175#true} {10175#true} #130#return; {10175#true} is VALID [2018-11-23 11:52:21,151 INFO L256 TraceCheckUtils]: 4: Hoare triple {10175#true} call #t~ret15 := main(); {10175#true} is VALID [2018-11-23 11:52:21,152 INFO L273 TraceCheckUtils]: 5: Hoare triple {10175#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {10208#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:21,152 INFO L273 TraceCheckUtils]: 6: Hoare triple {10208#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {10212#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:21,153 INFO L273 TraceCheckUtils]: 7: Hoare triple {10212#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {10212#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:21,153 INFO L273 TraceCheckUtils]: 8: Hoare triple {10212#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10212#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:21,153 INFO L273 TraceCheckUtils]: 9: Hoare triple {10212#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {10222#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:21,154 INFO L273 TraceCheckUtils]: 10: Hoare triple {10222#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {10222#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:21,154 INFO L273 TraceCheckUtils]: 11: Hoare triple {10222#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10222#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:21,154 INFO L273 TraceCheckUtils]: 12: Hoare triple {10222#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {10232#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:21,155 INFO L273 TraceCheckUtils]: 13: Hoare triple {10232#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {10232#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:21,155 INFO L273 TraceCheckUtils]: 14: Hoare triple {10232#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10232#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:21,156 INFO L273 TraceCheckUtils]: 15: Hoare triple {10232#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {10242#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:21,156 INFO L273 TraceCheckUtils]: 16: Hoare triple {10242#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {10242#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:21,157 INFO L273 TraceCheckUtils]: 17: Hoare triple {10242#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10242#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:21,158 INFO L273 TraceCheckUtils]: 18: Hoare triple {10242#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {10252#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:21,158 INFO L273 TraceCheckUtils]: 19: Hoare triple {10252#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {10252#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:21,159 INFO L273 TraceCheckUtils]: 20: Hoare triple {10252#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10252#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:21,159 INFO L273 TraceCheckUtils]: 21: Hoare triple {10252#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {10262#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:21,160 INFO L273 TraceCheckUtils]: 22: Hoare triple {10262#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {10262#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:21,160 INFO L273 TraceCheckUtils]: 23: Hoare triple {10262#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10262#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:21,161 INFO L273 TraceCheckUtils]: 24: Hoare triple {10262#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {10272#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:21,162 INFO L273 TraceCheckUtils]: 25: Hoare triple {10272#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {10272#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:21,162 INFO L273 TraceCheckUtils]: 26: Hoare triple {10272#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10272#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:21,163 INFO L273 TraceCheckUtils]: 27: Hoare triple {10272#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {10282#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:21,163 INFO L273 TraceCheckUtils]: 28: Hoare triple {10282#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {10282#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:21,164 INFO L273 TraceCheckUtils]: 29: Hoare triple {10282#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10282#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:21,165 INFO L273 TraceCheckUtils]: 30: Hoare triple {10282#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {10292#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:21,165 INFO L273 TraceCheckUtils]: 31: Hoare triple {10292#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {10292#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:21,166 INFO L273 TraceCheckUtils]: 32: Hoare triple {10292#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10292#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:21,166 INFO L273 TraceCheckUtils]: 33: Hoare triple {10292#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {10302#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:21,167 INFO L273 TraceCheckUtils]: 34: Hoare triple {10302#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {10302#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:21,167 INFO L273 TraceCheckUtils]: 35: Hoare triple {10302#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10302#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:21,168 INFO L273 TraceCheckUtils]: 36: Hoare triple {10302#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {10312#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:21,168 INFO L273 TraceCheckUtils]: 37: Hoare triple {10312#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {10312#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:21,169 INFO L273 TraceCheckUtils]: 38: Hoare triple {10312#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10312#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:21,170 INFO L273 TraceCheckUtils]: 39: Hoare triple {10312#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {10322#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:21,170 INFO L273 TraceCheckUtils]: 40: Hoare triple {10322#(<= main_~k~0 12)} assume !(~k~0 < 100000); {10176#false} is VALID [2018-11-23 11:52:21,170 INFO L273 TraceCheckUtils]: 41: Hoare triple {10176#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10176#false} is VALID [2018-11-23 11:52:21,171 INFO L273 TraceCheckUtils]: 42: Hoare triple {10176#false} ~x~0 := 0; {10176#false} is VALID [2018-11-23 11:52:21,171 INFO L273 TraceCheckUtils]: 43: Hoare triple {10176#false} assume !(~x~0 < ~i~0); {10176#false} is VALID [2018-11-23 11:52:21,171 INFO L273 TraceCheckUtils]: 44: Hoare triple {10176#false} ~x~0 := 0; {10176#false} is VALID [2018-11-23 11:52:21,171 INFO L273 TraceCheckUtils]: 45: Hoare triple {10176#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10176#false} is VALID [2018-11-23 11:52:21,171 INFO L256 TraceCheckUtils]: 46: Hoare triple {10176#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {10176#false} is VALID [2018-11-23 11:52:21,172 INFO L273 TraceCheckUtils]: 47: Hoare triple {10176#false} ~cond := #in~cond; {10176#false} is VALID [2018-11-23 11:52:21,172 INFO L273 TraceCheckUtils]: 48: Hoare triple {10176#false} assume !(0 == ~cond); {10176#false} is VALID [2018-11-23 11:52:21,172 INFO L273 TraceCheckUtils]: 49: Hoare triple {10176#false} assume true; {10176#false} is VALID [2018-11-23 11:52:21,172 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {10176#false} {10176#false} #136#return; {10176#false} is VALID [2018-11-23 11:52:21,172 INFO L273 TraceCheckUtils]: 51: Hoare triple {10176#false} havoc #t~mem9;havoc #t~mem10; {10176#false} is VALID [2018-11-23 11:52:21,173 INFO L273 TraceCheckUtils]: 52: Hoare triple {10176#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {10176#false} is VALID [2018-11-23 11:52:21,173 INFO L273 TraceCheckUtils]: 53: Hoare triple {10176#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10176#false} is VALID [2018-11-23 11:52:21,173 INFO L256 TraceCheckUtils]: 54: Hoare triple {10176#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {10176#false} is VALID [2018-11-23 11:52:21,173 INFO L273 TraceCheckUtils]: 55: Hoare triple {10176#false} ~cond := #in~cond; {10176#false} is VALID [2018-11-23 11:52:21,173 INFO L273 TraceCheckUtils]: 56: Hoare triple {10176#false} assume 0 == ~cond; {10176#false} is VALID [2018-11-23 11:52:21,173 INFO L273 TraceCheckUtils]: 57: Hoare triple {10176#false} assume !false; {10176#false} is VALID [2018-11-23 11:52:21,176 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:52:21,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:21,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2018-11-23 11:52:21,197 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 58 [2018-11-23 11:52:21,197 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:21,197 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-23 11:52:21,309 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:21,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 11:52:21,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 11:52:21,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=468, Unknown=0, NotChecked=0, Total=756 [2018-11-23 11:52:21,311 INFO L87 Difference]: Start difference. First operand 191 states and 270 transitions. Second operand 28 states. [2018-11-23 11:52:22,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:22,115 INFO L93 Difference]: Finished difference Result 324 states and 467 transitions. [2018-11-23 11:52:22,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 11:52:22,116 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 58 [2018-11-23 11:52:22,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:22,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:52:22,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 155 transitions. [2018-11-23 11:52:22,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:52:22,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 155 transitions. [2018-11-23 11:52:22,120 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 155 transitions. [2018-11-23 11:52:22,648 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:22,655 INFO L225 Difference]: With dead ends: 324 [2018-11-23 11:52:22,655 INFO L226 Difference]: Without dead ends: 206 [2018-11-23 11:52:22,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=288, Invalid=468, Unknown=0, NotChecked=0, Total=756 [2018-11-23 11:52:22,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-11-23 11:52:25,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 197. [2018-11-23 11:52:25,952 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:25,953 INFO L82 GeneralOperation]: Start isEquivalent. First operand 206 states. Second operand 197 states. [2018-11-23 11:52:25,953 INFO L74 IsIncluded]: Start isIncluded. First operand 206 states. Second operand 197 states. [2018-11-23 11:52:25,953 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 197 states. [2018-11-23 11:52:25,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:25,958 INFO L93 Difference]: Finished difference Result 206 states and 291 transitions. [2018-11-23 11:52:25,958 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 291 transitions. [2018-11-23 11:52:25,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:25,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:25,959 INFO L74 IsIncluded]: Start isIncluded. First operand 197 states. Second operand 206 states. [2018-11-23 11:52:25,959 INFO L87 Difference]: Start difference. First operand 197 states. Second operand 206 states. [2018-11-23 11:52:25,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:25,964 INFO L93 Difference]: Finished difference Result 206 states and 291 transitions. [2018-11-23 11:52:25,964 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 291 transitions. [2018-11-23 11:52:25,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:25,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:25,965 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:25,965 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:25,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-11-23 11:52:25,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 278 transitions. [2018-11-23 11:52:25,970 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 278 transitions. Word has length 58 [2018-11-23 11:52:25,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:25,970 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 278 transitions. [2018-11-23 11:52:25,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-23 11:52:25,970 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 278 transitions. [2018-11-23 11:52:25,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 11:52:25,971 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:25,971 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:25,971 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:25,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:25,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1436888908, now seen corresponding path program 8 times [2018-11-23 11:52:25,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:25,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:25,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:25,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:52:25,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:25,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:26,381 INFO L256 TraceCheckUtils]: 0: Hoare triple {11500#true} call ULTIMATE.init(); {11500#true} is VALID [2018-11-23 11:52:26,381 INFO L273 TraceCheckUtils]: 1: Hoare triple {11500#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11500#true} is VALID [2018-11-23 11:52:26,381 INFO L273 TraceCheckUtils]: 2: Hoare triple {11500#true} assume true; {11500#true} is VALID [2018-11-23 11:52:26,382 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11500#true} {11500#true} #130#return; {11500#true} is VALID [2018-11-23 11:52:26,382 INFO L256 TraceCheckUtils]: 4: Hoare triple {11500#true} call #t~ret15 := main(); {11500#true} is VALID [2018-11-23 11:52:26,382 INFO L273 TraceCheckUtils]: 5: Hoare triple {11500#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {11502#(= main_~i~0 0)} is VALID [2018-11-23 11:52:26,383 INFO L273 TraceCheckUtils]: 6: Hoare triple {11502#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {11503#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:26,383 INFO L273 TraceCheckUtils]: 7: Hoare triple {11503#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {11503#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:26,383 INFO L273 TraceCheckUtils]: 8: Hoare triple {11503#(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; {11503#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:26,384 INFO L273 TraceCheckUtils]: 9: Hoare triple {11503#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {11504#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:26,384 INFO L273 TraceCheckUtils]: 10: Hoare triple {11504#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {11504#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:26,385 INFO L273 TraceCheckUtils]: 11: Hoare triple {11504#(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; {11504#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:26,386 INFO L273 TraceCheckUtils]: 12: Hoare triple {11504#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {11505#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:26,387 INFO L273 TraceCheckUtils]: 13: Hoare triple {11505#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {11505#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:26,387 INFO L273 TraceCheckUtils]: 14: Hoare triple {11505#(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; {11505#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:26,388 INFO L273 TraceCheckUtils]: 15: Hoare triple {11505#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {11506#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:26,389 INFO L273 TraceCheckUtils]: 16: Hoare triple {11506#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {11506#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:26,390 INFO L273 TraceCheckUtils]: 17: Hoare triple {11506#(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; {11506#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:26,390 INFO L273 TraceCheckUtils]: 18: Hoare triple {11506#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {11507#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:26,391 INFO L273 TraceCheckUtils]: 19: Hoare triple {11507#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {11507#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:26,392 INFO L273 TraceCheckUtils]: 20: Hoare triple {11507#(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; {11507#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:26,393 INFO L273 TraceCheckUtils]: 21: Hoare triple {11507#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {11508#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:26,394 INFO L273 TraceCheckUtils]: 22: Hoare triple {11508#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {11508#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:26,394 INFO L273 TraceCheckUtils]: 23: Hoare triple {11508#(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; {11508#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:26,395 INFO L273 TraceCheckUtils]: 24: Hoare triple {11508#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {11509#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:26,396 INFO L273 TraceCheckUtils]: 25: Hoare triple {11509#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {11509#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:26,397 INFO L273 TraceCheckUtils]: 26: Hoare triple {11509#(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; {11509#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:26,397 INFO L273 TraceCheckUtils]: 27: Hoare triple {11509#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {11510#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:26,398 INFO L273 TraceCheckUtils]: 28: Hoare triple {11510#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {11510#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:26,399 INFO L273 TraceCheckUtils]: 29: Hoare triple {11510#(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; {11510#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:26,400 INFO L273 TraceCheckUtils]: 30: Hoare triple {11510#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {11511#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:26,400 INFO L273 TraceCheckUtils]: 31: Hoare triple {11511#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {11511#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:26,401 INFO L273 TraceCheckUtils]: 32: Hoare triple {11511#(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; {11511#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:26,402 INFO L273 TraceCheckUtils]: 33: Hoare triple {11511#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {11512#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:26,403 INFO L273 TraceCheckUtils]: 34: Hoare triple {11512#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {11512#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:26,403 INFO L273 TraceCheckUtils]: 35: Hoare triple {11512#(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; {11512#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:26,404 INFO L273 TraceCheckUtils]: 36: Hoare triple {11512#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {11513#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:26,405 INFO L273 TraceCheckUtils]: 37: Hoare triple {11513#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {11513#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:26,406 INFO L273 TraceCheckUtils]: 38: Hoare triple {11513#(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; {11513#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:26,407 INFO L273 TraceCheckUtils]: 39: Hoare triple {11513#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {11514#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:26,407 INFO L273 TraceCheckUtils]: 40: Hoare triple {11514#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {11514#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:26,408 INFO L273 TraceCheckUtils]: 41: Hoare triple {11514#(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; {11514#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:26,409 INFO L273 TraceCheckUtils]: 42: Hoare triple {11514#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {11515#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:26,410 INFO L273 TraceCheckUtils]: 43: Hoare triple {11515#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume !(~k~0 < 100000); {11501#false} is VALID [2018-11-23 11:52:26,410 INFO L273 TraceCheckUtils]: 44: Hoare triple {11501#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11501#false} is VALID [2018-11-23 11:52:26,410 INFO L273 TraceCheckUtils]: 45: Hoare triple {11501#false} ~x~0 := 0; {11501#false} is VALID [2018-11-23 11:52:26,410 INFO L273 TraceCheckUtils]: 46: Hoare triple {11501#false} assume !(~x~0 < ~i~0); {11501#false} is VALID [2018-11-23 11:52:26,410 INFO L273 TraceCheckUtils]: 47: Hoare triple {11501#false} ~x~0 := 0; {11501#false} is VALID [2018-11-23 11:52:26,411 INFO L273 TraceCheckUtils]: 48: Hoare triple {11501#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11501#false} is VALID [2018-11-23 11:52:26,411 INFO L256 TraceCheckUtils]: 49: Hoare triple {11501#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {11500#true} is VALID [2018-11-23 11:52:26,411 INFO L273 TraceCheckUtils]: 50: Hoare triple {11500#true} ~cond := #in~cond; {11500#true} is VALID [2018-11-23 11:52:26,411 INFO L273 TraceCheckUtils]: 51: Hoare triple {11500#true} assume !(0 == ~cond); {11500#true} is VALID [2018-11-23 11:52:26,411 INFO L273 TraceCheckUtils]: 52: Hoare triple {11500#true} assume true; {11500#true} is VALID [2018-11-23 11:52:26,412 INFO L268 TraceCheckUtils]: 53: Hoare quadruple {11500#true} {11501#false} #136#return; {11501#false} is VALID [2018-11-23 11:52:26,412 INFO L273 TraceCheckUtils]: 54: Hoare triple {11501#false} havoc #t~mem9;havoc #t~mem10; {11501#false} is VALID [2018-11-23 11:52:26,412 INFO L273 TraceCheckUtils]: 55: Hoare triple {11501#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {11501#false} is VALID [2018-11-23 11:52:26,412 INFO L273 TraceCheckUtils]: 56: Hoare triple {11501#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11501#false} is VALID [2018-11-23 11:52:26,412 INFO L256 TraceCheckUtils]: 57: Hoare triple {11501#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {11501#false} is VALID [2018-11-23 11:52:26,413 INFO L273 TraceCheckUtils]: 58: Hoare triple {11501#false} ~cond := #in~cond; {11501#false} is VALID [2018-11-23 11:52:26,413 INFO L273 TraceCheckUtils]: 59: Hoare triple {11501#false} assume 0 == ~cond; {11501#false} is VALID [2018-11-23 11:52:26,413 INFO L273 TraceCheckUtils]: 60: Hoare triple {11501#false} assume !false; {11501#false} is VALID [2018-11-23 11:52:26,418 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 2 proven. 210 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:52:26,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:26,419 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:52:26,428 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:52:26,460 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:52:26,460 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:26,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:26,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:26,815 INFO L256 TraceCheckUtils]: 0: Hoare triple {11500#true} call ULTIMATE.init(); {11500#true} is VALID [2018-11-23 11:52:26,815 INFO L273 TraceCheckUtils]: 1: Hoare triple {11500#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11500#true} is VALID [2018-11-23 11:52:26,815 INFO L273 TraceCheckUtils]: 2: Hoare triple {11500#true} assume true; {11500#true} is VALID [2018-11-23 11:52:26,816 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11500#true} {11500#true} #130#return; {11500#true} is VALID [2018-11-23 11:52:26,816 INFO L256 TraceCheckUtils]: 4: Hoare triple {11500#true} call #t~ret15 := main(); {11500#true} is VALID [2018-11-23 11:52:26,816 INFO L273 TraceCheckUtils]: 5: Hoare triple {11500#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {11534#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:26,817 INFO L273 TraceCheckUtils]: 6: Hoare triple {11534#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {11538#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:26,817 INFO L273 TraceCheckUtils]: 7: Hoare triple {11538#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {11538#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:26,818 INFO L273 TraceCheckUtils]: 8: Hoare triple {11538#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11538#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:26,818 INFO L273 TraceCheckUtils]: 9: Hoare triple {11538#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {11548#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:26,818 INFO L273 TraceCheckUtils]: 10: Hoare triple {11548#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {11548#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:26,819 INFO L273 TraceCheckUtils]: 11: Hoare triple {11548#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11548#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:26,819 INFO L273 TraceCheckUtils]: 12: Hoare triple {11548#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {11558#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:26,820 INFO L273 TraceCheckUtils]: 13: Hoare triple {11558#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {11558#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:26,820 INFO L273 TraceCheckUtils]: 14: Hoare triple {11558#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11558#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:26,821 INFO L273 TraceCheckUtils]: 15: Hoare triple {11558#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {11568#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:26,821 INFO L273 TraceCheckUtils]: 16: Hoare triple {11568#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {11568#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:26,822 INFO L273 TraceCheckUtils]: 17: Hoare triple {11568#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11568#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:26,822 INFO L273 TraceCheckUtils]: 18: Hoare triple {11568#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {11578#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:26,823 INFO L273 TraceCheckUtils]: 19: Hoare triple {11578#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {11578#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:26,823 INFO L273 TraceCheckUtils]: 20: Hoare triple {11578#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11578#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:26,824 INFO L273 TraceCheckUtils]: 21: Hoare triple {11578#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {11588#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:26,825 INFO L273 TraceCheckUtils]: 22: Hoare triple {11588#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {11588#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:26,825 INFO L273 TraceCheckUtils]: 23: Hoare triple {11588#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11588#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:26,826 INFO L273 TraceCheckUtils]: 24: Hoare triple {11588#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {11598#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:26,826 INFO L273 TraceCheckUtils]: 25: Hoare triple {11598#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {11598#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:26,827 INFO L273 TraceCheckUtils]: 26: Hoare triple {11598#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11598#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:26,827 INFO L273 TraceCheckUtils]: 27: Hoare triple {11598#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {11608#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:26,828 INFO L273 TraceCheckUtils]: 28: Hoare triple {11608#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {11608#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:26,828 INFO L273 TraceCheckUtils]: 29: Hoare triple {11608#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11608#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:26,829 INFO L273 TraceCheckUtils]: 30: Hoare triple {11608#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {11618#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:26,830 INFO L273 TraceCheckUtils]: 31: Hoare triple {11618#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {11618#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:26,830 INFO L273 TraceCheckUtils]: 32: Hoare triple {11618#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11618#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:26,831 INFO L273 TraceCheckUtils]: 33: Hoare triple {11618#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {11628#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:26,831 INFO L273 TraceCheckUtils]: 34: Hoare triple {11628#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {11628#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:26,832 INFO L273 TraceCheckUtils]: 35: Hoare triple {11628#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11628#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:26,833 INFO L273 TraceCheckUtils]: 36: Hoare triple {11628#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {11638#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:26,833 INFO L273 TraceCheckUtils]: 37: Hoare triple {11638#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {11638#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:26,834 INFO L273 TraceCheckUtils]: 38: Hoare triple {11638#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11638#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:26,834 INFO L273 TraceCheckUtils]: 39: Hoare triple {11638#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {11648#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:26,835 INFO L273 TraceCheckUtils]: 40: Hoare triple {11648#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {11648#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:26,835 INFO L273 TraceCheckUtils]: 41: Hoare triple {11648#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11648#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:26,836 INFO L273 TraceCheckUtils]: 42: Hoare triple {11648#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {11658#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:26,837 INFO L273 TraceCheckUtils]: 43: Hoare triple {11658#(<= main_~k~0 13)} assume !(~k~0 < 100000); {11501#false} is VALID [2018-11-23 11:52:26,837 INFO L273 TraceCheckUtils]: 44: Hoare triple {11501#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11501#false} is VALID [2018-11-23 11:52:26,837 INFO L273 TraceCheckUtils]: 45: Hoare triple {11501#false} ~x~0 := 0; {11501#false} is VALID [2018-11-23 11:52:26,837 INFO L273 TraceCheckUtils]: 46: Hoare triple {11501#false} assume !(~x~0 < ~i~0); {11501#false} is VALID [2018-11-23 11:52:26,837 INFO L273 TraceCheckUtils]: 47: Hoare triple {11501#false} ~x~0 := 0; {11501#false} is VALID [2018-11-23 11:52:26,838 INFO L273 TraceCheckUtils]: 48: Hoare triple {11501#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11501#false} is VALID [2018-11-23 11:52:26,838 INFO L256 TraceCheckUtils]: 49: Hoare triple {11501#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {11501#false} is VALID [2018-11-23 11:52:26,838 INFO L273 TraceCheckUtils]: 50: Hoare triple {11501#false} ~cond := #in~cond; {11501#false} is VALID [2018-11-23 11:52:26,838 INFO L273 TraceCheckUtils]: 51: Hoare triple {11501#false} assume !(0 == ~cond); {11501#false} is VALID [2018-11-23 11:52:26,838 INFO L273 TraceCheckUtils]: 52: Hoare triple {11501#false} assume true; {11501#false} is VALID [2018-11-23 11:52:26,839 INFO L268 TraceCheckUtils]: 53: Hoare quadruple {11501#false} {11501#false} #136#return; {11501#false} is VALID [2018-11-23 11:52:26,839 INFO L273 TraceCheckUtils]: 54: Hoare triple {11501#false} havoc #t~mem9;havoc #t~mem10; {11501#false} is VALID [2018-11-23 11:52:26,839 INFO L273 TraceCheckUtils]: 55: Hoare triple {11501#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {11501#false} is VALID [2018-11-23 11:52:26,839 INFO L273 TraceCheckUtils]: 56: Hoare triple {11501#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11501#false} is VALID [2018-11-23 11:52:26,839 INFO L256 TraceCheckUtils]: 57: Hoare triple {11501#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {11501#false} is VALID [2018-11-23 11:52:26,839 INFO L273 TraceCheckUtils]: 58: Hoare triple {11501#false} ~cond := #in~cond; {11501#false} is VALID [2018-11-23 11:52:26,840 INFO L273 TraceCheckUtils]: 59: Hoare triple {11501#false} assume 0 == ~cond; {11501#false} is VALID [2018-11-23 11:52:26,840 INFO L273 TraceCheckUtils]: 60: Hoare triple {11501#false} assume !false; {11501#false} is VALID [2018-11-23 11:52:26,842 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:52:26,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:26,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2018-11-23 11:52:26,862 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 61 [2018-11-23 11:52:26,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:26,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 11:52:26,960 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:26,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 11:52:26,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 11:52:26,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=539, Unknown=0, NotChecked=0, Total=870 [2018-11-23 11:52:26,962 INFO L87 Difference]: Start difference. First operand 197 states and 278 transitions. Second operand 30 states. [2018-11-23 11:52:27,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:27,714 INFO L93 Difference]: Finished difference Result 330 states and 475 transitions. [2018-11-23 11:52:27,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 11:52:27,714 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 61 [2018-11-23 11:52:27,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:27,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:52:27,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 159 transitions. [2018-11-23 11:52:27,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:52:27,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 159 transitions. [2018-11-23 11:52:27,718 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 159 transitions. [2018-11-23 11:52:27,902 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:27,906 INFO L225 Difference]: With dead ends: 330 [2018-11-23 11:52:27,906 INFO L226 Difference]: Without dead ends: 212 [2018-11-23 11:52:27,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 48 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-23 11:52:27,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-11-23 11:52:28,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 203. [2018-11-23 11:52:28,277 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:28,277 INFO L82 GeneralOperation]: Start isEquivalent. First operand 212 states. Second operand 203 states. [2018-11-23 11:52:28,277 INFO L74 IsIncluded]: Start isIncluded. First operand 212 states. Second operand 203 states. [2018-11-23 11:52:28,277 INFO L87 Difference]: Start difference. First operand 212 states. Second operand 203 states. [2018-11-23 11:52:28,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:28,282 INFO L93 Difference]: Finished difference Result 212 states and 299 transitions. [2018-11-23 11:52:28,282 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 299 transitions. [2018-11-23 11:52:28,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:28,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:28,283 INFO L74 IsIncluded]: Start isIncluded. First operand 203 states. Second operand 212 states. [2018-11-23 11:52:28,283 INFO L87 Difference]: Start difference. First operand 203 states. Second operand 212 states. [2018-11-23 11:52:28,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:28,287 INFO L93 Difference]: Finished difference Result 212 states and 299 transitions. [2018-11-23 11:52:28,287 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 299 transitions. [2018-11-23 11:52:28,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:28,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:28,288 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:28,288 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:28,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-11-23 11:52:28,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 286 transitions. [2018-11-23 11:52:28,292 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 286 transitions. Word has length 61 [2018-11-23 11:52:28,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:28,293 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 286 transitions. [2018-11-23 11:52:28,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 11:52:28,293 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 286 transitions. [2018-11-23 11:52:28,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-23 11:52:28,294 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:28,294 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:28,294 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:28,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:28,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1549621681, now seen corresponding path program 9 times [2018-11-23 11:52:28,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:28,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:28,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:28,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:28,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:28,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:28,952 INFO L256 TraceCheckUtils]: 0: Hoare triple {12864#true} call ULTIMATE.init(); {12864#true} is VALID [2018-11-23 11:52:28,953 INFO L273 TraceCheckUtils]: 1: Hoare triple {12864#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12864#true} is VALID [2018-11-23 11:52:28,953 INFO L273 TraceCheckUtils]: 2: Hoare triple {12864#true} assume true; {12864#true} is VALID [2018-11-23 11:52:28,953 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12864#true} {12864#true} #130#return; {12864#true} is VALID [2018-11-23 11:52:28,953 INFO L256 TraceCheckUtils]: 4: Hoare triple {12864#true} call #t~ret15 := main(); {12864#true} is VALID [2018-11-23 11:52:28,953 INFO L273 TraceCheckUtils]: 5: Hoare triple {12864#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {12866#(= main_~i~0 0)} is VALID [2018-11-23 11:52:28,954 INFO L273 TraceCheckUtils]: 6: Hoare triple {12866#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {12867#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:28,955 INFO L273 TraceCheckUtils]: 7: Hoare triple {12867#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {12867#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:28,955 INFO L273 TraceCheckUtils]: 8: Hoare triple {12867#(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; {12867#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:28,956 INFO L273 TraceCheckUtils]: 9: Hoare triple {12867#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {12868#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:28,957 INFO L273 TraceCheckUtils]: 10: Hoare triple {12868#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {12868#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:28,958 INFO L273 TraceCheckUtils]: 11: Hoare triple {12868#(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; {12868#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:28,958 INFO L273 TraceCheckUtils]: 12: Hoare triple {12868#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {12869#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:28,959 INFO L273 TraceCheckUtils]: 13: Hoare triple {12869#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {12869#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:28,960 INFO L273 TraceCheckUtils]: 14: Hoare triple {12869#(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; {12869#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:28,961 INFO L273 TraceCheckUtils]: 15: Hoare triple {12869#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {12870#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:28,962 INFO L273 TraceCheckUtils]: 16: Hoare triple {12870#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {12870#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:28,962 INFO L273 TraceCheckUtils]: 17: Hoare triple {12870#(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; {12870#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:28,963 INFO L273 TraceCheckUtils]: 18: Hoare triple {12870#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {12871#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:28,964 INFO L273 TraceCheckUtils]: 19: Hoare triple {12871#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {12871#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:28,965 INFO L273 TraceCheckUtils]: 20: Hoare triple {12871#(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; {12871#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:28,966 INFO L273 TraceCheckUtils]: 21: Hoare triple {12871#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {12872#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:28,966 INFO L273 TraceCheckUtils]: 22: Hoare triple {12872#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {12872#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:28,967 INFO L273 TraceCheckUtils]: 23: Hoare triple {12872#(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; {12872#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:28,968 INFO L273 TraceCheckUtils]: 24: Hoare triple {12872#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {12873#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:28,969 INFO L273 TraceCheckUtils]: 25: Hoare triple {12873#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {12873#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:28,969 INFO L273 TraceCheckUtils]: 26: Hoare triple {12873#(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; {12873#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:28,970 INFO L273 TraceCheckUtils]: 27: Hoare triple {12873#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {12874#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:28,971 INFO L273 TraceCheckUtils]: 28: Hoare triple {12874#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {12874#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:28,972 INFO L273 TraceCheckUtils]: 29: Hoare triple {12874#(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; {12874#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:28,973 INFO L273 TraceCheckUtils]: 30: Hoare triple {12874#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {12875#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:28,973 INFO L273 TraceCheckUtils]: 31: Hoare triple {12875#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {12875#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:28,974 INFO L273 TraceCheckUtils]: 32: Hoare triple {12875#(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; {12875#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:28,975 INFO L273 TraceCheckUtils]: 33: Hoare triple {12875#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {12876#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:28,976 INFO L273 TraceCheckUtils]: 34: Hoare triple {12876#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {12876#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:28,977 INFO L273 TraceCheckUtils]: 35: Hoare triple {12876#(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; {12876#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:28,977 INFO L273 TraceCheckUtils]: 36: Hoare triple {12876#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {12877#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:28,978 INFO L273 TraceCheckUtils]: 37: Hoare triple {12877#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {12877#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:28,979 INFO L273 TraceCheckUtils]: 38: Hoare triple {12877#(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; {12877#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:28,980 INFO L273 TraceCheckUtils]: 39: Hoare triple {12877#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {12878#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:28,981 INFO L273 TraceCheckUtils]: 40: Hoare triple {12878#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {12878#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:28,981 INFO L273 TraceCheckUtils]: 41: Hoare triple {12878#(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; {12878#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:28,982 INFO L273 TraceCheckUtils]: 42: Hoare triple {12878#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {12879#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:28,983 INFO L273 TraceCheckUtils]: 43: Hoare triple {12879#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {12879#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:28,984 INFO L273 TraceCheckUtils]: 44: Hoare triple {12879#(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; {12879#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:28,984 INFO L273 TraceCheckUtils]: 45: Hoare triple {12879#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {12880#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:28,985 INFO L273 TraceCheckUtils]: 46: Hoare triple {12880#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} assume !(~k~0 < 100000); {12865#false} is VALID [2018-11-23 11:52:28,985 INFO L273 TraceCheckUtils]: 47: Hoare triple {12865#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12865#false} is VALID [2018-11-23 11:52:28,985 INFO L273 TraceCheckUtils]: 48: Hoare triple {12865#false} ~x~0 := 0; {12865#false} is VALID [2018-11-23 11:52:28,986 INFO L273 TraceCheckUtils]: 49: Hoare triple {12865#false} assume !(~x~0 < ~i~0); {12865#false} is VALID [2018-11-23 11:52:28,986 INFO L273 TraceCheckUtils]: 50: Hoare triple {12865#false} ~x~0 := 0; {12865#false} is VALID [2018-11-23 11:52:28,986 INFO L273 TraceCheckUtils]: 51: Hoare triple {12865#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12865#false} is VALID [2018-11-23 11:52:28,986 INFO L256 TraceCheckUtils]: 52: Hoare triple {12865#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {12864#true} is VALID [2018-11-23 11:52:28,986 INFO L273 TraceCheckUtils]: 53: Hoare triple {12864#true} ~cond := #in~cond; {12864#true} is VALID [2018-11-23 11:52:28,987 INFO L273 TraceCheckUtils]: 54: Hoare triple {12864#true} assume !(0 == ~cond); {12864#true} is VALID [2018-11-23 11:52:28,987 INFO L273 TraceCheckUtils]: 55: Hoare triple {12864#true} assume true; {12864#true} is VALID [2018-11-23 11:52:28,987 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {12864#true} {12865#false} #136#return; {12865#false} is VALID [2018-11-23 11:52:28,987 INFO L273 TraceCheckUtils]: 57: Hoare triple {12865#false} havoc #t~mem9;havoc #t~mem10; {12865#false} is VALID [2018-11-23 11:52:28,987 INFO L273 TraceCheckUtils]: 58: Hoare triple {12865#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {12865#false} is VALID [2018-11-23 11:52:28,988 INFO L273 TraceCheckUtils]: 59: Hoare triple {12865#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12865#false} is VALID [2018-11-23 11:52:28,988 INFO L256 TraceCheckUtils]: 60: Hoare triple {12865#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {12865#false} is VALID [2018-11-23 11:52:28,988 INFO L273 TraceCheckUtils]: 61: Hoare triple {12865#false} ~cond := #in~cond; {12865#false} is VALID [2018-11-23 11:52:28,988 INFO L273 TraceCheckUtils]: 62: Hoare triple {12865#false} assume 0 == ~cond; {12865#false} is VALID [2018-11-23 11:52:28,988 INFO L273 TraceCheckUtils]: 63: Hoare triple {12865#false} assume !false; {12865#false} is VALID [2018-11-23 11:52:28,994 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 2 proven. 247 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:52:28,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:28,994 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:52:29,003 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:52:29,053 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-11-23 11:52:29,053 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:29,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:29,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:29,488 INFO L256 TraceCheckUtils]: 0: Hoare triple {12864#true} call ULTIMATE.init(); {12864#true} is VALID [2018-11-23 11:52:29,488 INFO L273 TraceCheckUtils]: 1: Hoare triple {12864#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12864#true} is VALID [2018-11-23 11:52:29,489 INFO L273 TraceCheckUtils]: 2: Hoare triple {12864#true} assume true; {12864#true} is VALID [2018-11-23 11:52:29,489 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12864#true} {12864#true} #130#return; {12864#true} is VALID [2018-11-23 11:52:29,489 INFO L256 TraceCheckUtils]: 4: Hoare triple {12864#true} call #t~ret15 := main(); {12864#true} is VALID [2018-11-23 11:52:29,490 INFO L273 TraceCheckUtils]: 5: Hoare triple {12864#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {12899#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:29,491 INFO L273 TraceCheckUtils]: 6: Hoare triple {12899#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {12903#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:29,491 INFO L273 TraceCheckUtils]: 7: Hoare triple {12903#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {12903#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:29,491 INFO L273 TraceCheckUtils]: 8: Hoare triple {12903#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12903#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:29,492 INFO L273 TraceCheckUtils]: 9: Hoare triple {12903#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {12913#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:29,492 INFO L273 TraceCheckUtils]: 10: Hoare triple {12913#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {12913#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:29,492 INFO L273 TraceCheckUtils]: 11: Hoare triple {12913#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12913#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:29,493 INFO L273 TraceCheckUtils]: 12: Hoare triple {12913#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {12923#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:29,493 INFO L273 TraceCheckUtils]: 13: Hoare triple {12923#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {12923#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:29,494 INFO L273 TraceCheckUtils]: 14: Hoare triple {12923#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12923#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:29,495 INFO L273 TraceCheckUtils]: 15: Hoare triple {12923#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {12933#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:29,495 INFO L273 TraceCheckUtils]: 16: Hoare triple {12933#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {12933#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:29,496 INFO L273 TraceCheckUtils]: 17: Hoare triple {12933#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12933#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:29,496 INFO L273 TraceCheckUtils]: 18: Hoare triple {12933#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {12943#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:29,497 INFO L273 TraceCheckUtils]: 19: Hoare triple {12943#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {12943#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:29,497 INFO L273 TraceCheckUtils]: 20: Hoare triple {12943#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12943#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:29,503 INFO L273 TraceCheckUtils]: 21: Hoare triple {12943#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {12953#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:29,503 INFO L273 TraceCheckUtils]: 22: Hoare triple {12953#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {12953#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:29,503 INFO L273 TraceCheckUtils]: 23: Hoare triple {12953#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12953#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:29,504 INFO L273 TraceCheckUtils]: 24: Hoare triple {12953#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {12963#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:29,504 INFO L273 TraceCheckUtils]: 25: Hoare triple {12963#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {12963#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:29,504 INFO L273 TraceCheckUtils]: 26: Hoare triple {12963#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12963#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:29,505 INFO L273 TraceCheckUtils]: 27: Hoare triple {12963#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {12973#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:29,505 INFO L273 TraceCheckUtils]: 28: Hoare triple {12973#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {12973#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:29,506 INFO L273 TraceCheckUtils]: 29: Hoare triple {12973#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12973#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:29,506 INFO L273 TraceCheckUtils]: 30: Hoare triple {12973#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {12983#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:29,507 INFO L273 TraceCheckUtils]: 31: Hoare triple {12983#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {12983#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:29,508 INFO L273 TraceCheckUtils]: 32: Hoare triple {12983#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12983#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:29,508 INFO L273 TraceCheckUtils]: 33: Hoare triple {12983#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {12993#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:29,509 INFO L273 TraceCheckUtils]: 34: Hoare triple {12993#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {12993#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:29,510 INFO L273 TraceCheckUtils]: 35: Hoare triple {12993#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12993#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:29,510 INFO L273 TraceCheckUtils]: 36: Hoare triple {12993#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {13003#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:29,511 INFO L273 TraceCheckUtils]: 37: Hoare triple {13003#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {13003#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:29,511 INFO L273 TraceCheckUtils]: 38: Hoare triple {13003#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13003#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:29,512 INFO L273 TraceCheckUtils]: 39: Hoare triple {13003#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {13013#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:29,513 INFO L273 TraceCheckUtils]: 40: Hoare triple {13013#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {13013#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:29,513 INFO L273 TraceCheckUtils]: 41: Hoare triple {13013#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13013#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:29,514 INFO L273 TraceCheckUtils]: 42: Hoare triple {13013#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {13023#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:29,515 INFO L273 TraceCheckUtils]: 43: Hoare triple {13023#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {13023#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:29,515 INFO L273 TraceCheckUtils]: 44: Hoare triple {13023#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13023#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:29,516 INFO L273 TraceCheckUtils]: 45: Hoare triple {13023#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {13033#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:29,517 INFO L273 TraceCheckUtils]: 46: Hoare triple {13033#(<= main_~k~0 14)} assume !(~k~0 < 100000); {12865#false} is VALID [2018-11-23 11:52:29,517 INFO L273 TraceCheckUtils]: 47: Hoare triple {12865#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12865#false} is VALID [2018-11-23 11:52:29,517 INFO L273 TraceCheckUtils]: 48: Hoare triple {12865#false} ~x~0 := 0; {12865#false} is VALID [2018-11-23 11:52:29,518 INFO L273 TraceCheckUtils]: 49: Hoare triple {12865#false} assume !(~x~0 < ~i~0); {12865#false} is VALID [2018-11-23 11:52:29,518 INFO L273 TraceCheckUtils]: 50: Hoare triple {12865#false} ~x~0 := 0; {12865#false} is VALID [2018-11-23 11:52:29,518 INFO L273 TraceCheckUtils]: 51: Hoare triple {12865#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12865#false} is VALID [2018-11-23 11:52:29,518 INFO L256 TraceCheckUtils]: 52: Hoare triple {12865#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {12865#false} is VALID [2018-11-23 11:52:29,519 INFO L273 TraceCheckUtils]: 53: Hoare triple {12865#false} ~cond := #in~cond; {12865#false} is VALID [2018-11-23 11:52:29,519 INFO L273 TraceCheckUtils]: 54: Hoare triple {12865#false} assume !(0 == ~cond); {12865#false} is VALID [2018-11-23 11:52:29,519 INFO L273 TraceCheckUtils]: 55: Hoare triple {12865#false} assume true; {12865#false} is VALID [2018-11-23 11:52:29,519 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {12865#false} {12865#false} #136#return; {12865#false} is VALID [2018-11-23 11:52:29,520 INFO L273 TraceCheckUtils]: 57: Hoare triple {12865#false} havoc #t~mem9;havoc #t~mem10; {12865#false} is VALID [2018-11-23 11:52:29,520 INFO L273 TraceCheckUtils]: 58: Hoare triple {12865#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {12865#false} is VALID [2018-11-23 11:52:29,520 INFO L273 TraceCheckUtils]: 59: Hoare triple {12865#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12865#false} is VALID [2018-11-23 11:52:29,520 INFO L256 TraceCheckUtils]: 60: Hoare triple {12865#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {12865#false} is VALID [2018-11-23 11:52:29,520 INFO L273 TraceCheckUtils]: 61: Hoare triple {12865#false} ~cond := #in~cond; {12865#false} is VALID [2018-11-23 11:52:29,520 INFO L273 TraceCheckUtils]: 62: Hoare triple {12865#false} assume 0 == ~cond; {12865#false} is VALID [2018-11-23 11:52:29,520 INFO L273 TraceCheckUtils]: 63: Hoare triple {12865#false} assume !false; {12865#false} is VALID [2018-11-23 11:52:29,526 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:52:29,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:29,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2018-11-23 11:52:29,546 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 64 [2018-11-23 11:52:29,546 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:29,546 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-23 11:52:29,685 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-23 11:52:29,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-23 11:52:29,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-23 11:52:29,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=377, Invalid=615, Unknown=0, NotChecked=0, Total=992 [2018-11-23 11:52:29,686 INFO L87 Difference]: Start difference. First operand 203 states and 286 transitions. Second operand 32 states. [2018-11-23 11:52:30,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:30,750 INFO L93 Difference]: Finished difference Result 336 states and 483 transitions. [2018-11-23 11:52:30,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 11:52:30,751 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 64 [2018-11-23 11:52:30,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:30,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 11:52:30,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 163 transitions. [2018-11-23 11:52:30,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 11:52:30,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 163 transitions. [2018-11-23 11:52:30,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 163 transitions. [2018-11-23 11:52:30,898 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:30,903 INFO L225 Difference]: With dead ends: 336 [2018-11-23 11:52:30,903 INFO L226 Difference]: Without dead ends: 218 [2018-11-23 11:52:30,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=377, Invalid=615, Unknown=0, NotChecked=0, Total=992 [2018-11-23 11:52:30,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-11-23 11:52:31,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 209. [2018-11-23 11:52:31,480 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:31,480 INFO L82 GeneralOperation]: Start isEquivalent. First operand 218 states. Second operand 209 states. [2018-11-23 11:52:31,480 INFO L74 IsIncluded]: Start isIncluded. First operand 218 states. Second operand 209 states. [2018-11-23 11:52:31,480 INFO L87 Difference]: Start difference. First operand 218 states. Second operand 209 states. [2018-11-23 11:52:31,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:31,485 INFO L93 Difference]: Finished difference Result 218 states and 307 transitions. [2018-11-23 11:52:31,485 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 307 transitions. [2018-11-23 11:52:31,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:31,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:31,486 INFO L74 IsIncluded]: Start isIncluded. First operand 209 states. Second operand 218 states. [2018-11-23 11:52:31,486 INFO L87 Difference]: Start difference. First operand 209 states. Second operand 218 states. [2018-11-23 11:52:31,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:31,491 INFO L93 Difference]: Finished difference Result 218 states and 307 transitions. [2018-11-23 11:52:31,491 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 307 transitions. [2018-11-23 11:52:31,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:31,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:31,492 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:31,492 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:31,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-11-23 11:52:31,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 294 transitions. [2018-11-23 11:52:31,497 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 294 transitions. Word has length 64 [2018-11-23 11:52:31,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:31,497 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 294 transitions. [2018-11-23 11:52:31,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-23 11:52:31,498 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 294 transitions. [2018-11-23 11:52:31,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 11:52:31,498 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:31,499 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:31,499 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:31,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:31,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1307236652, now seen corresponding path program 10 times [2018-11-23 11:52:31,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:31,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:31,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:31,500 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:31,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:31,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:32,465 INFO L256 TraceCheckUtils]: 0: Hoare triple {14267#true} call ULTIMATE.init(); {14267#true} is VALID [2018-11-23 11:52:32,465 INFO L273 TraceCheckUtils]: 1: Hoare triple {14267#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14267#true} is VALID [2018-11-23 11:52:32,466 INFO L273 TraceCheckUtils]: 2: Hoare triple {14267#true} assume true; {14267#true} is VALID [2018-11-23 11:52:32,466 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14267#true} {14267#true} #130#return; {14267#true} is VALID [2018-11-23 11:52:32,466 INFO L256 TraceCheckUtils]: 4: Hoare triple {14267#true} call #t~ret15 := main(); {14267#true} is VALID [2018-11-23 11:52:32,467 INFO L273 TraceCheckUtils]: 5: Hoare triple {14267#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {14269#(= main_~i~0 0)} is VALID [2018-11-23 11:52:32,467 INFO L273 TraceCheckUtils]: 6: Hoare triple {14269#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {14270#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:32,468 INFO L273 TraceCheckUtils]: 7: Hoare triple {14270#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14270#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:32,468 INFO L273 TraceCheckUtils]: 8: Hoare triple {14270#(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; {14270#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:32,469 INFO L273 TraceCheckUtils]: 9: Hoare triple {14270#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {14271#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:32,469 INFO L273 TraceCheckUtils]: 10: Hoare triple {14271#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14271#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:32,470 INFO L273 TraceCheckUtils]: 11: Hoare triple {14271#(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; {14271#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:32,470 INFO L273 TraceCheckUtils]: 12: Hoare triple {14271#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {14272#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:32,471 INFO L273 TraceCheckUtils]: 13: Hoare triple {14272#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14272#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:32,472 INFO L273 TraceCheckUtils]: 14: Hoare triple {14272#(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; {14272#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:32,473 INFO L273 TraceCheckUtils]: 15: Hoare triple {14272#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {14273#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:32,474 INFO L273 TraceCheckUtils]: 16: Hoare triple {14273#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14273#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:32,474 INFO L273 TraceCheckUtils]: 17: Hoare triple {14273#(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; {14273#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:32,475 INFO L273 TraceCheckUtils]: 18: Hoare triple {14273#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {14274#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:32,476 INFO L273 TraceCheckUtils]: 19: Hoare triple {14274#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14274#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:32,477 INFO L273 TraceCheckUtils]: 20: Hoare triple {14274#(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; {14274#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:32,478 INFO L273 TraceCheckUtils]: 21: Hoare triple {14274#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {14275#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:32,479 INFO L273 TraceCheckUtils]: 22: Hoare triple {14275#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14275#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:32,479 INFO L273 TraceCheckUtils]: 23: Hoare triple {14275#(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; {14275#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:32,480 INFO L273 TraceCheckUtils]: 24: Hoare triple {14275#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {14276#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:32,481 INFO L273 TraceCheckUtils]: 25: Hoare triple {14276#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14276#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:32,482 INFO L273 TraceCheckUtils]: 26: Hoare triple {14276#(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; {14276#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:32,483 INFO L273 TraceCheckUtils]: 27: Hoare triple {14276#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {14277#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:32,483 INFO L273 TraceCheckUtils]: 28: Hoare triple {14277#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14277#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:32,484 INFO L273 TraceCheckUtils]: 29: Hoare triple {14277#(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; {14277#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:32,485 INFO L273 TraceCheckUtils]: 30: Hoare triple {14277#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {14278#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:32,486 INFO L273 TraceCheckUtils]: 31: Hoare triple {14278#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14278#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:32,487 INFO L273 TraceCheckUtils]: 32: Hoare triple {14278#(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; {14278#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:32,487 INFO L273 TraceCheckUtils]: 33: Hoare triple {14278#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {14279#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:32,488 INFO L273 TraceCheckUtils]: 34: Hoare triple {14279#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14279#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:32,489 INFO L273 TraceCheckUtils]: 35: Hoare triple {14279#(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; {14279#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:32,490 INFO L273 TraceCheckUtils]: 36: Hoare triple {14279#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {14280#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:32,491 INFO L273 TraceCheckUtils]: 37: Hoare triple {14280#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14280#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:32,492 INFO L273 TraceCheckUtils]: 38: Hoare triple {14280#(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; {14280#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:32,493 INFO L273 TraceCheckUtils]: 39: Hoare triple {14280#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {14281#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:32,494 INFO L273 TraceCheckUtils]: 40: Hoare triple {14281#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14281#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:32,494 INFO L273 TraceCheckUtils]: 41: Hoare triple {14281#(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; {14281#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:32,495 INFO L273 TraceCheckUtils]: 42: Hoare triple {14281#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {14282#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:32,496 INFO L273 TraceCheckUtils]: 43: Hoare triple {14282#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14282#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:32,497 INFO L273 TraceCheckUtils]: 44: Hoare triple {14282#(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; {14282#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:32,498 INFO L273 TraceCheckUtils]: 45: Hoare triple {14282#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {14283#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:32,498 INFO L273 TraceCheckUtils]: 46: Hoare triple {14283#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14283#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:32,499 INFO L273 TraceCheckUtils]: 47: Hoare triple {14283#(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; {14283#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:32,500 INFO L273 TraceCheckUtils]: 48: Hoare triple {14283#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {14284#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:32,501 INFO L273 TraceCheckUtils]: 49: Hoare triple {14284#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} assume !(~k~0 < 100000); {14268#false} is VALID [2018-11-23 11:52:32,501 INFO L273 TraceCheckUtils]: 50: Hoare triple {14268#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14268#false} is VALID [2018-11-23 11:52:32,501 INFO L273 TraceCheckUtils]: 51: Hoare triple {14268#false} ~x~0 := 0; {14268#false} is VALID [2018-11-23 11:52:32,501 INFO L273 TraceCheckUtils]: 52: Hoare triple {14268#false} assume !(~x~0 < ~i~0); {14268#false} is VALID [2018-11-23 11:52:32,502 INFO L273 TraceCheckUtils]: 53: Hoare triple {14268#false} ~x~0 := 0; {14268#false} is VALID [2018-11-23 11:52:32,502 INFO L273 TraceCheckUtils]: 54: Hoare triple {14268#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14268#false} is VALID [2018-11-23 11:52:32,502 INFO L256 TraceCheckUtils]: 55: Hoare triple {14268#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {14267#true} is VALID [2018-11-23 11:52:32,502 INFO L273 TraceCheckUtils]: 56: Hoare triple {14267#true} ~cond := #in~cond; {14267#true} is VALID [2018-11-23 11:52:32,502 INFO L273 TraceCheckUtils]: 57: Hoare triple {14267#true} assume !(0 == ~cond); {14267#true} is VALID [2018-11-23 11:52:32,503 INFO L273 TraceCheckUtils]: 58: Hoare triple {14267#true} assume true; {14267#true} is VALID [2018-11-23 11:52:32,503 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {14267#true} {14268#false} #136#return; {14268#false} is VALID [2018-11-23 11:52:32,503 INFO L273 TraceCheckUtils]: 60: Hoare triple {14268#false} havoc #t~mem9;havoc #t~mem10; {14268#false} is VALID [2018-11-23 11:52:32,503 INFO L273 TraceCheckUtils]: 61: Hoare triple {14268#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {14268#false} is VALID [2018-11-23 11:52:32,503 INFO L273 TraceCheckUtils]: 62: Hoare triple {14268#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14268#false} is VALID [2018-11-23 11:52:32,503 INFO L256 TraceCheckUtils]: 63: Hoare triple {14268#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {14268#false} is VALID [2018-11-23 11:52:32,503 INFO L273 TraceCheckUtils]: 64: Hoare triple {14268#false} ~cond := #in~cond; {14268#false} is VALID [2018-11-23 11:52:32,504 INFO L273 TraceCheckUtils]: 65: Hoare triple {14268#false} assume 0 == ~cond; {14268#false} is VALID [2018-11-23 11:52:32,504 INFO L273 TraceCheckUtils]: 66: Hoare triple {14268#false} assume !false; {14268#false} is VALID [2018-11-23 11:52:32,510 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 2 proven. 287 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:52:32,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:32,510 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:52:32,521 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:52:32,553 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:52:32,554 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:32,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:32,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:32,929 INFO L256 TraceCheckUtils]: 0: Hoare triple {14267#true} call ULTIMATE.init(); {14267#true} is VALID [2018-11-23 11:52:32,929 INFO L273 TraceCheckUtils]: 1: Hoare triple {14267#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14267#true} is VALID [2018-11-23 11:52:32,929 INFO L273 TraceCheckUtils]: 2: Hoare triple {14267#true} assume true; {14267#true} is VALID [2018-11-23 11:52:32,929 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14267#true} {14267#true} #130#return; {14267#true} is VALID [2018-11-23 11:52:32,930 INFO L256 TraceCheckUtils]: 4: Hoare triple {14267#true} call #t~ret15 := main(); {14267#true} is VALID [2018-11-23 11:52:32,930 INFO L273 TraceCheckUtils]: 5: Hoare triple {14267#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {14303#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:32,931 INFO L273 TraceCheckUtils]: 6: Hoare triple {14303#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {14307#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:32,931 INFO L273 TraceCheckUtils]: 7: Hoare triple {14307#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14307#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:32,932 INFO L273 TraceCheckUtils]: 8: Hoare triple {14307#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14307#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:32,932 INFO L273 TraceCheckUtils]: 9: Hoare triple {14307#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {14317#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:32,932 INFO L273 TraceCheckUtils]: 10: Hoare triple {14317#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14317#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:32,933 INFO L273 TraceCheckUtils]: 11: Hoare triple {14317#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14317#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:32,933 INFO L273 TraceCheckUtils]: 12: Hoare triple {14317#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {14327#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:32,934 INFO L273 TraceCheckUtils]: 13: Hoare triple {14327#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14327#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:32,934 INFO L273 TraceCheckUtils]: 14: Hoare triple {14327#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14327#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:32,935 INFO L273 TraceCheckUtils]: 15: Hoare triple {14327#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {14337#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:32,935 INFO L273 TraceCheckUtils]: 16: Hoare triple {14337#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14337#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:32,936 INFO L273 TraceCheckUtils]: 17: Hoare triple {14337#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14337#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:32,937 INFO L273 TraceCheckUtils]: 18: Hoare triple {14337#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {14347#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:32,937 INFO L273 TraceCheckUtils]: 19: Hoare triple {14347#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14347#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:32,938 INFO L273 TraceCheckUtils]: 20: Hoare triple {14347#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14347#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:32,938 INFO L273 TraceCheckUtils]: 21: Hoare triple {14347#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {14357#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:32,939 INFO L273 TraceCheckUtils]: 22: Hoare triple {14357#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14357#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:32,939 INFO L273 TraceCheckUtils]: 23: Hoare triple {14357#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14357#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:32,940 INFO L273 TraceCheckUtils]: 24: Hoare triple {14357#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {14367#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:32,941 INFO L273 TraceCheckUtils]: 25: Hoare triple {14367#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14367#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:32,941 INFO L273 TraceCheckUtils]: 26: Hoare triple {14367#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14367#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:32,942 INFO L273 TraceCheckUtils]: 27: Hoare triple {14367#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {14377#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:32,942 INFO L273 TraceCheckUtils]: 28: Hoare triple {14377#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14377#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:32,943 INFO L273 TraceCheckUtils]: 29: Hoare triple {14377#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14377#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:32,962 INFO L273 TraceCheckUtils]: 30: Hoare triple {14377#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {14387#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:32,976 INFO L273 TraceCheckUtils]: 31: Hoare triple {14387#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14387#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:32,984 INFO L273 TraceCheckUtils]: 32: Hoare triple {14387#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14387#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:32,995 INFO L273 TraceCheckUtils]: 33: Hoare triple {14387#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {14397#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:32,996 INFO L273 TraceCheckUtils]: 34: Hoare triple {14397#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14397#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:32,996 INFO L273 TraceCheckUtils]: 35: Hoare triple {14397#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14397#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:32,999 INFO L273 TraceCheckUtils]: 36: Hoare triple {14397#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {14407#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:32,999 INFO L273 TraceCheckUtils]: 37: Hoare triple {14407#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14407#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:32,999 INFO L273 TraceCheckUtils]: 38: Hoare triple {14407#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14407#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:33,000 INFO L273 TraceCheckUtils]: 39: Hoare triple {14407#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {14417#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:33,000 INFO L273 TraceCheckUtils]: 40: Hoare triple {14417#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14417#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:33,000 INFO L273 TraceCheckUtils]: 41: Hoare triple {14417#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14417#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:33,001 INFO L273 TraceCheckUtils]: 42: Hoare triple {14417#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {14427#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:33,001 INFO L273 TraceCheckUtils]: 43: Hoare triple {14427#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14427#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:33,001 INFO L273 TraceCheckUtils]: 44: Hoare triple {14427#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14427#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:33,002 INFO L273 TraceCheckUtils]: 45: Hoare triple {14427#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {14437#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:33,002 INFO L273 TraceCheckUtils]: 46: Hoare triple {14437#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14437#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:33,003 INFO L273 TraceCheckUtils]: 47: Hoare triple {14437#(<= main_~k~0 14)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14437#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:33,004 INFO L273 TraceCheckUtils]: 48: Hoare triple {14437#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {14447#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:33,004 INFO L273 TraceCheckUtils]: 49: Hoare triple {14447#(<= main_~k~0 15)} assume !(~k~0 < 100000); {14268#false} is VALID [2018-11-23 11:52:33,004 INFO L273 TraceCheckUtils]: 50: Hoare triple {14268#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14268#false} is VALID [2018-11-23 11:52:33,005 INFO L273 TraceCheckUtils]: 51: Hoare triple {14268#false} ~x~0 := 0; {14268#false} is VALID [2018-11-23 11:52:33,005 INFO L273 TraceCheckUtils]: 52: Hoare triple {14268#false} assume !(~x~0 < ~i~0); {14268#false} is VALID [2018-11-23 11:52:33,005 INFO L273 TraceCheckUtils]: 53: Hoare triple {14268#false} ~x~0 := 0; {14268#false} is VALID [2018-11-23 11:52:33,005 INFO L273 TraceCheckUtils]: 54: Hoare triple {14268#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14268#false} is VALID [2018-11-23 11:52:33,005 INFO L256 TraceCheckUtils]: 55: Hoare triple {14268#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {14268#false} is VALID [2018-11-23 11:52:33,005 INFO L273 TraceCheckUtils]: 56: Hoare triple {14268#false} ~cond := #in~cond; {14268#false} is VALID [2018-11-23 11:52:33,006 INFO L273 TraceCheckUtils]: 57: Hoare triple {14268#false} assume !(0 == ~cond); {14268#false} is VALID [2018-11-23 11:52:33,006 INFO L273 TraceCheckUtils]: 58: Hoare triple {14268#false} assume true; {14268#false} is VALID [2018-11-23 11:52:33,006 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {14268#false} {14268#false} #136#return; {14268#false} is VALID [2018-11-23 11:52:33,006 INFO L273 TraceCheckUtils]: 60: Hoare triple {14268#false} havoc #t~mem9;havoc #t~mem10; {14268#false} is VALID [2018-11-23 11:52:33,006 INFO L273 TraceCheckUtils]: 61: Hoare triple {14268#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {14268#false} is VALID [2018-11-23 11:52:33,007 INFO L273 TraceCheckUtils]: 62: Hoare triple {14268#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14268#false} is VALID [2018-11-23 11:52:33,007 INFO L256 TraceCheckUtils]: 63: Hoare triple {14268#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {14268#false} is VALID [2018-11-23 11:52:33,007 INFO L273 TraceCheckUtils]: 64: Hoare triple {14268#false} ~cond := #in~cond; {14268#false} is VALID [2018-11-23 11:52:33,007 INFO L273 TraceCheckUtils]: 65: Hoare triple {14268#false} assume 0 == ~cond; {14268#false} is VALID [2018-11-23 11:52:33,007 INFO L273 TraceCheckUtils]: 66: Hoare triple {14268#false} assume !false; {14268#false} is VALID [2018-11-23 11:52:33,010 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:52:33,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:33,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2018-11-23 11:52:33,029 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 67 [2018-11-23 11:52:33,029 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:33,030 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-23 11:52:33,201 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:33,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-23 11:52:33,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-23 11:52:33,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=426, Invalid=696, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 11:52:33,203 INFO L87 Difference]: Start difference. First operand 209 states and 294 transitions. Second operand 34 states. [2018-11-23 11:52:34,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:34,785 INFO L93 Difference]: Finished difference Result 342 states and 491 transitions. [2018-11-23 11:52:34,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 11:52:34,785 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 67 [2018-11-23 11:52:34,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:34,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 11:52:34,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 167 transitions. [2018-11-23 11:52:34,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 11:52:34,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 167 transitions. [2018-11-23 11:52:34,789 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 167 transitions. [2018-11-23 11:52:34,945 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:34,951 INFO L225 Difference]: With dead ends: 342 [2018-11-23 11:52:34,952 INFO L226 Difference]: Without dead ends: 224 [2018-11-23 11:52:34,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=426, Invalid=696, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 11:52:34,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-11-23 11:52:35,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 215. [2018-11-23 11:52:35,206 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:35,206 INFO L82 GeneralOperation]: Start isEquivalent. First operand 224 states. Second operand 215 states. [2018-11-23 11:52:35,207 INFO L74 IsIncluded]: Start isIncluded. First operand 224 states. Second operand 215 states. [2018-11-23 11:52:35,207 INFO L87 Difference]: Start difference. First operand 224 states. Second operand 215 states. [2018-11-23 11:52:35,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:35,211 INFO L93 Difference]: Finished difference Result 224 states and 315 transitions. [2018-11-23 11:52:35,211 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 315 transitions. [2018-11-23 11:52:35,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:35,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:35,212 INFO L74 IsIncluded]: Start isIncluded. First operand 215 states. Second operand 224 states. [2018-11-23 11:52:35,212 INFO L87 Difference]: Start difference. First operand 215 states. Second operand 224 states. [2018-11-23 11:52:35,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:35,217 INFO L93 Difference]: Finished difference Result 224 states and 315 transitions. [2018-11-23 11:52:35,217 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 315 transitions. [2018-11-23 11:52:35,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:35,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:35,218 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:35,218 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:35,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-11-23 11:52:35,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 302 transitions. [2018-11-23 11:52:35,223 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 302 transitions. Word has length 67 [2018-11-23 11:52:35,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:35,223 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 302 transitions. [2018-11-23 11:52:35,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-23 11:52:35,224 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 302 transitions. [2018-11-23 11:52:35,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 11:52:35,224 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:35,225 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:35,225 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:35,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:35,225 INFO L82 PathProgramCache]: Analyzing trace with hash 254862289, now seen corresponding path program 11 times [2018-11-23 11:52:35,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:35,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:35,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:35,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:35,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:35,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:35,717 INFO L256 TraceCheckUtils]: 0: Hoare triple {15709#true} call ULTIMATE.init(); {15709#true} is VALID [2018-11-23 11:52:35,717 INFO L273 TraceCheckUtils]: 1: Hoare triple {15709#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15709#true} is VALID [2018-11-23 11:52:35,717 INFO L273 TraceCheckUtils]: 2: Hoare triple {15709#true} assume true; {15709#true} is VALID [2018-11-23 11:52:35,717 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15709#true} {15709#true} #130#return; {15709#true} is VALID [2018-11-23 11:52:35,717 INFO L256 TraceCheckUtils]: 4: Hoare triple {15709#true} call #t~ret15 := main(); {15709#true} is VALID [2018-11-23 11:52:35,718 INFO L273 TraceCheckUtils]: 5: Hoare triple {15709#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {15711#(= main_~i~0 0)} is VALID [2018-11-23 11:52:35,718 INFO L273 TraceCheckUtils]: 6: Hoare triple {15711#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {15712#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:35,719 INFO L273 TraceCheckUtils]: 7: Hoare triple {15712#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15712#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:35,719 INFO L273 TraceCheckUtils]: 8: Hoare triple {15712#(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; {15712#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:35,720 INFO L273 TraceCheckUtils]: 9: Hoare triple {15712#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {15713#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:35,720 INFO L273 TraceCheckUtils]: 10: Hoare triple {15713#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15713#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:35,721 INFO L273 TraceCheckUtils]: 11: Hoare triple {15713#(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; {15713#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:35,721 INFO L273 TraceCheckUtils]: 12: Hoare triple {15713#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {15714#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:35,722 INFO L273 TraceCheckUtils]: 13: Hoare triple {15714#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15714#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:35,722 INFO L273 TraceCheckUtils]: 14: Hoare triple {15714#(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; {15714#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:35,723 INFO L273 TraceCheckUtils]: 15: Hoare triple {15714#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {15715#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:35,724 INFO L273 TraceCheckUtils]: 16: Hoare triple {15715#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15715#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:35,725 INFO L273 TraceCheckUtils]: 17: Hoare triple {15715#(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; {15715#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:35,725 INFO L273 TraceCheckUtils]: 18: Hoare triple {15715#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {15716#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:35,726 INFO L273 TraceCheckUtils]: 19: Hoare triple {15716#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15716#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:35,748 INFO L273 TraceCheckUtils]: 20: Hoare triple {15716#(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; {15716#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:35,749 INFO L273 TraceCheckUtils]: 21: Hoare triple {15716#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {15717#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:35,749 INFO L273 TraceCheckUtils]: 22: Hoare triple {15717#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15717#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:35,750 INFO L273 TraceCheckUtils]: 23: Hoare triple {15717#(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; {15717#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:35,750 INFO L273 TraceCheckUtils]: 24: Hoare triple {15717#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {15718#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:35,751 INFO L273 TraceCheckUtils]: 25: Hoare triple {15718#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15718#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:35,751 INFO L273 TraceCheckUtils]: 26: Hoare triple {15718#(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; {15718#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:35,752 INFO L273 TraceCheckUtils]: 27: Hoare triple {15718#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {15719#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:35,752 INFO L273 TraceCheckUtils]: 28: Hoare triple {15719#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15719#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:35,753 INFO L273 TraceCheckUtils]: 29: Hoare triple {15719#(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; {15719#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:35,753 INFO L273 TraceCheckUtils]: 30: Hoare triple {15719#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {15720#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:35,754 INFO L273 TraceCheckUtils]: 31: Hoare triple {15720#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15720#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:35,755 INFO L273 TraceCheckUtils]: 32: Hoare triple {15720#(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; {15720#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:35,755 INFO L273 TraceCheckUtils]: 33: Hoare triple {15720#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {15721#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:35,756 INFO L273 TraceCheckUtils]: 34: Hoare triple {15721#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15721#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:35,757 INFO L273 TraceCheckUtils]: 35: Hoare triple {15721#(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; {15721#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:35,758 INFO L273 TraceCheckUtils]: 36: Hoare triple {15721#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {15722#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:35,758 INFO L273 TraceCheckUtils]: 37: Hoare triple {15722#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15722#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:35,759 INFO L273 TraceCheckUtils]: 38: Hoare triple {15722#(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; {15722#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:35,760 INFO L273 TraceCheckUtils]: 39: Hoare triple {15722#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {15723#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:35,761 INFO L273 TraceCheckUtils]: 40: Hoare triple {15723#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15723#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:35,761 INFO L273 TraceCheckUtils]: 41: Hoare triple {15723#(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; {15723#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:35,762 INFO L273 TraceCheckUtils]: 42: Hoare triple {15723#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {15724#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:35,763 INFO L273 TraceCheckUtils]: 43: Hoare triple {15724#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15724#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:35,764 INFO L273 TraceCheckUtils]: 44: Hoare triple {15724#(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; {15724#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:35,765 INFO L273 TraceCheckUtils]: 45: Hoare triple {15724#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {15725#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:35,765 INFO L273 TraceCheckUtils]: 46: Hoare triple {15725#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15725#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:35,766 INFO L273 TraceCheckUtils]: 47: Hoare triple {15725#(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; {15725#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:35,767 INFO L273 TraceCheckUtils]: 48: Hoare triple {15725#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {15726#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:35,767 INFO L273 TraceCheckUtils]: 49: Hoare triple {15726#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15726#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:35,768 INFO L273 TraceCheckUtils]: 50: Hoare triple {15726#(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; {15726#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:35,769 INFO L273 TraceCheckUtils]: 51: Hoare triple {15726#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {15727#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:35,770 INFO L273 TraceCheckUtils]: 52: Hoare triple {15727#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} assume !(~k~0 < 100000); {15710#false} is VALID [2018-11-23 11:52:35,770 INFO L273 TraceCheckUtils]: 53: Hoare triple {15710#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15710#false} is VALID [2018-11-23 11:52:35,770 INFO L273 TraceCheckUtils]: 54: Hoare triple {15710#false} ~x~0 := 0; {15710#false} is VALID [2018-11-23 11:52:35,770 INFO L273 TraceCheckUtils]: 55: Hoare triple {15710#false} assume !(~x~0 < ~i~0); {15710#false} is VALID [2018-11-23 11:52:35,770 INFO L273 TraceCheckUtils]: 56: Hoare triple {15710#false} ~x~0 := 0; {15710#false} is VALID [2018-11-23 11:52:35,771 INFO L273 TraceCheckUtils]: 57: Hoare triple {15710#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15710#false} is VALID [2018-11-23 11:52:35,771 INFO L256 TraceCheckUtils]: 58: Hoare triple {15710#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {15709#true} is VALID [2018-11-23 11:52:35,771 INFO L273 TraceCheckUtils]: 59: Hoare triple {15709#true} ~cond := #in~cond; {15709#true} is VALID [2018-11-23 11:52:35,771 INFO L273 TraceCheckUtils]: 60: Hoare triple {15709#true} assume !(0 == ~cond); {15709#true} is VALID [2018-11-23 11:52:35,771 INFO L273 TraceCheckUtils]: 61: Hoare triple {15709#true} assume true; {15709#true} is VALID [2018-11-23 11:52:35,772 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {15709#true} {15710#false} #136#return; {15710#false} is VALID [2018-11-23 11:52:35,772 INFO L273 TraceCheckUtils]: 63: Hoare triple {15710#false} havoc #t~mem9;havoc #t~mem10; {15710#false} is VALID [2018-11-23 11:52:35,772 INFO L273 TraceCheckUtils]: 64: Hoare triple {15710#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {15710#false} is VALID [2018-11-23 11:52:35,772 INFO L273 TraceCheckUtils]: 65: Hoare triple {15710#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15710#false} is VALID [2018-11-23 11:52:35,772 INFO L256 TraceCheckUtils]: 66: Hoare triple {15710#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {15710#false} is VALID [2018-11-23 11:52:35,772 INFO L273 TraceCheckUtils]: 67: Hoare triple {15710#false} ~cond := #in~cond; {15710#false} is VALID [2018-11-23 11:52:35,773 INFO L273 TraceCheckUtils]: 68: Hoare triple {15710#false} assume 0 == ~cond; {15710#false} is VALID [2018-11-23 11:52:35,773 INFO L273 TraceCheckUtils]: 69: Hoare triple {15710#false} assume !false; {15710#false} is VALID [2018-11-23 11:52:35,779 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 2 proven. 330 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:52:35,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:35,779 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:52:35,788 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:52:35,834 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2018-11-23 11:52:35,834 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:35,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:35,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:36,216 INFO L256 TraceCheckUtils]: 0: Hoare triple {15709#true} call ULTIMATE.init(); {15709#true} is VALID [2018-11-23 11:52:36,216 INFO L273 TraceCheckUtils]: 1: Hoare triple {15709#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15709#true} is VALID [2018-11-23 11:52:36,216 INFO L273 TraceCheckUtils]: 2: Hoare triple {15709#true} assume true; {15709#true} is VALID [2018-11-23 11:52:36,217 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15709#true} {15709#true} #130#return; {15709#true} is VALID [2018-11-23 11:52:36,217 INFO L256 TraceCheckUtils]: 4: Hoare triple {15709#true} call #t~ret15 := main(); {15709#true} is VALID [2018-11-23 11:52:36,218 INFO L273 TraceCheckUtils]: 5: Hoare triple {15709#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {15746#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:36,218 INFO L273 TraceCheckUtils]: 6: Hoare triple {15746#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {15750#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:36,219 INFO L273 TraceCheckUtils]: 7: Hoare triple {15750#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15750#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:36,219 INFO L273 TraceCheckUtils]: 8: Hoare triple {15750#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15750#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:36,219 INFO L273 TraceCheckUtils]: 9: Hoare triple {15750#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {15760#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:36,220 INFO L273 TraceCheckUtils]: 10: Hoare triple {15760#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15760#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:36,220 INFO L273 TraceCheckUtils]: 11: Hoare triple {15760#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15760#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:36,221 INFO L273 TraceCheckUtils]: 12: Hoare triple {15760#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {15770#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:36,221 INFO L273 TraceCheckUtils]: 13: Hoare triple {15770#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15770#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:36,222 INFO L273 TraceCheckUtils]: 14: Hoare triple {15770#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15770#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:36,222 INFO L273 TraceCheckUtils]: 15: Hoare triple {15770#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {15780#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:36,223 INFO L273 TraceCheckUtils]: 16: Hoare triple {15780#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15780#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:36,224 INFO L273 TraceCheckUtils]: 17: Hoare triple {15780#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15780#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:36,224 INFO L273 TraceCheckUtils]: 18: Hoare triple {15780#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {15790#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:36,225 INFO L273 TraceCheckUtils]: 19: Hoare triple {15790#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15790#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:36,225 INFO L273 TraceCheckUtils]: 20: Hoare triple {15790#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15790#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:36,226 INFO L273 TraceCheckUtils]: 21: Hoare triple {15790#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {15800#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:36,227 INFO L273 TraceCheckUtils]: 22: Hoare triple {15800#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15800#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:36,227 INFO L273 TraceCheckUtils]: 23: Hoare triple {15800#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15800#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:36,228 INFO L273 TraceCheckUtils]: 24: Hoare triple {15800#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {15810#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:36,228 INFO L273 TraceCheckUtils]: 25: Hoare triple {15810#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15810#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:36,229 INFO L273 TraceCheckUtils]: 26: Hoare triple {15810#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15810#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:36,230 INFO L273 TraceCheckUtils]: 27: Hoare triple {15810#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {15820#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:36,230 INFO L273 TraceCheckUtils]: 28: Hoare triple {15820#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15820#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:36,230 INFO L273 TraceCheckUtils]: 29: Hoare triple {15820#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15820#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:36,231 INFO L273 TraceCheckUtils]: 30: Hoare triple {15820#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {15830#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:36,232 INFO L273 TraceCheckUtils]: 31: Hoare triple {15830#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15830#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:36,232 INFO L273 TraceCheckUtils]: 32: Hoare triple {15830#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15830#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:36,233 INFO L273 TraceCheckUtils]: 33: Hoare triple {15830#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {15840#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:36,233 INFO L273 TraceCheckUtils]: 34: Hoare triple {15840#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15840#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:36,234 INFO L273 TraceCheckUtils]: 35: Hoare triple {15840#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15840#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:36,235 INFO L273 TraceCheckUtils]: 36: Hoare triple {15840#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {15850#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:36,235 INFO L273 TraceCheckUtils]: 37: Hoare triple {15850#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15850#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:36,236 INFO L273 TraceCheckUtils]: 38: Hoare triple {15850#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15850#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:36,236 INFO L273 TraceCheckUtils]: 39: Hoare triple {15850#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {15860#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:36,237 INFO L273 TraceCheckUtils]: 40: Hoare triple {15860#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15860#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:36,237 INFO L273 TraceCheckUtils]: 41: Hoare triple {15860#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15860#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:36,238 INFO L273 TraceCheckUtils]: 42: Hoare triple {15860#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {15870#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:36,239 INFO L273 TraceCheckUtils]: 43: Hoare triple {15870#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15870#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:36,239 INFO L273 TraceCheckUtils]: 44: Hoare triple {15870#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15870#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:36,240 INFO L273 TraceCheckUtils]: 45: Hoare triple {15870#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {15880#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:36,240 INFO L273 TraceCheckUtils]: 46: Hoare triple {15880#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15880#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:36,241 INFO L273 TraceCheckUtils]: 47: Hoare triple {15880#(<= main_~k~0 14)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15880#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:36,241 INFO L273 TraceCheckUtils]: 48: Hoare triple {15880#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {15890#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:36,242 INFO L273 TraceCheckUtils]: 49: Hoare triple {15890#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15890#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:36,242 INFO L273 TraceCheckUtils]: 50: Hoare triple {15890#(<= main_~k~0 15)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15890#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:36,243 INFO L273 TraceCheckUtils]: 51: Hoare triple {15890#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {15900#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:36,244 INFO L273 TraceCheckUtils]: 52: Hoare triple {15900#(<= main_~k~0 16)} assume !(~k~0 < 100000); {15710#false} is VALID [2018-11-23 11:52:36,244 INFO L273 TraceCheckUtils]: 53: Hoare triple {15710#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15710#false} is VALID [2018-11-23 11:52:36,244 INFO L273 TraceCheckUtils]: 54: Hoare triple {15710#false} ~x~0 := 0; {15710#false} is VALID [2018-11-23 11:52:36,244 INFO L273 TraceCheckUtils]: 55: Hoare triple {15710#false} assume !(~x~0 < ~i~0); {15710#false} is VALID [2018-11-23 11:52:36,245 INFO L273 TraceCheckUtils]: 56: Hoare triple {15710#false} ~x~0 := 0; {15710#false} is VALID [2018-11-23 11:52:36,245 INFO L273 TraceCheckUtils]: 57: Hoare triple {15710#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15710#false} is VALID [2018-11-23 11:52:36,245 INFO L256 TraceCheckUtils]: 58: Hoare triple {15710#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {15710#false} is VALID [2018-11-23 11:52:36,245 INFO L273 TraceCheckUtils]: 59: Hoare triple {15710#false} ~cond := #in~cond; {15710#false} is VALID [2018-11-23 11:52:36,245 INFO L273 TraceCheckUtils]: 60: Hoare triple {15710#false} assume !(0 == ~cond); {15710#false} is VALID [2018-11-23 11:52:36,245 INFO L273 TraceCheckUtils]: 61: Hoare triple {15710#false} assume true; {15710#false} is VALID [2018-11-23 11:52:36,246 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {15710#false} {15710#false} #136#return; {15710#false} is VALID [2018-11-23 11:52:36,246 INFO L273 TraceCheckUtils]: 63: Hoare triple {15710#false} havoc #t~mem9;havoc #t~mem10; {15710#false} is VALID [2018-11-23 11:52:36,246 INFO L273 TraceCheckUtils]: 64: Hoare triple {15710#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {15710#false} is VALID [2018-11-23 11:52:36,246 INFO L273 TraceCheckUtils]: 65: Hoare triple {15710#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15710#false} is VALID [2018-11-23 11:52:36,246 INFO L256 TraceCheckUtils]: 66: Hoare triple {15710#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {15710#false} is VALID [2018-11-23 11:52:36,246 INFO L273 TraceCheckUtils]: 67: Hoare triple {15710#false} ~cond := #in~cond; {15710#false} is VALID [2018-11-23 11:52:36,247 INFO L273 TraceCheckUtils]: 68: Hoare triple {15710#false} assume 0 == ~cond; {15710#false} is VALID [2018-11-23 11:52:36,247 INFO L273 TraceCheckUtils]: 69: Hoare triple {15710#false} assume !false; {15710#false} is VALID [2018-11-23 11:52:36,250 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:52:36,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:36,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2018-11-23 11:52:36,269 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2018-11-23 11:52:36,269 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:36,270 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-23 11:52:36,412 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:36,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-23 11:52:36,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-23 11:52:36,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=478, Invalid=782, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 11:52:36,414 INFO L87 Difference]: Start difference. First operand 215 states and 302 transitions. Second operand 36 states. [2018-11-23 11:52:37,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:37,451 INFO L93 Difference]: Finished difference Result 348 states and 499 transitions. [2018-11-23 11:52:37,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 11:52:37,451 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2018-11-23 11:52:37,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:37,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 11:52:37,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 171 transitions. [2018-11-23 11:52:37,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 11:52:37,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 171 transitions. [2018-11-23 11:52:37,454 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 171 transitions. [2018-11-23 11:52:37,609 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:37,614 INFO L225 Difference]: With dead ends: 348 [2018-11-23 11:52:37,614 INFO L226 Difference]: Without dead ends: 230 [2018-11-23 11:52:37,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 54 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-23 11:52:37,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-11-23 11:52:37,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 221. [2018-11-23 11:52:37,848 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:37,849 INFO L82 GeneralOperation]: Start isEquivalent. First operand 230 states. Second operand 221 states. [2018-11-23 11:52:37,849 INFO L74 IsIncluded]: Start isIncluded. First operand 230 states. Second operand 221 states. [2018-11-23 11:52:37,849 INFO L87 Difference]: Start difference. First operand 230 states. Second operand 221 states. [2018-11-23 11:52:37,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:37,854 INFO L93 Difference]: Finished difference Result 230 states and 323 transitions. [2018-11-23 11:52:37,854 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 323 transitions. [2018-11-23 11:52:37,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:37,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:37,855 INFO L74 IsIncluded]: Start isIncluded. First operand 221 states. Second operand 230 states. [2018-11-23 11:52:37,855 INFO L87 Difference]: Start difference. First operand 221 states. Second operand 230 states. [2018-11-23 11:52:37,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:37,860 INFO L93 Difference]: Finished difference Result 230 states and 323 transitions. [2018-11-23 11:52:37,860 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 323 transitions. [2018-11-23 11:52:37,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:37,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:37,861 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:37,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:37,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-11-23 11:52:37,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 310 transitions. [2018-11-23 11:52:37,866 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 310 transitions. Word has length 70 [2018-11-23 11:52:37,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:37,867 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 310 transitions. [2018-11-23 11:52:37,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-23 11:52:37,867 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 310 transitions. [2018-11-23 11:52:37,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 11:52:37,868 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:37,868 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:37,868 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:37,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:37,868 INFO L82 PathProgramCache]: Analyzing trace with hash -2063492340, now seen corresponding path program 12 times [2018-11-23 11:52:37,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:37,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:37,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:37,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:37,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:37,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:38,604 INFO L256 TraceCheckUtils]: 0: Hoare triple {17190#true} call ULTIMATE.init(); {17190#true} is VALID [2018-11-23 11:52:38,604 INFO L273 TraceCheckUtils]: 1: Hoare triple {17190#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17190#true} is VALID [2018-11-23 11:52:38,604 INFO L273 TraceCheckUtils]: 2: Hoare triple {17190#true} assume true; {17190#true} is VALID [2018-11-23 11:52:38,605 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17190#true} {17190#true} #130#return; {17190#true} is VALID [2018-11-23 11:52:38,605 INFO L256 TraceCheckUtils]: 4: Hoare triple {17190#true} call #t~ret15 := main(); {17190#true} is VALID [2018-11-23 11:52:38,605 INFO L273 TraceCheckUtils]: 5: Hoare triple {17190#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {17192#(= main_~i~0 0)} is VALID [2018-11-23 11:52:38,605 INFO L273 TraceCheckUtils]: 6: Hoare triple {17192#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {17193#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:38,606 INFO L273 TraceCheckUtils]: 7: Hoare triple {17193#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17193#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:38,607 INFO L273 TraceCheckUtils]: 8: Hoare triple {17193#(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; {17193#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:38,608 INFO L273 TraceCheckUtils]: 9: Hoare triple {17193#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {17194#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:38,609 INFO L273 TraceCheckUtils]: 10: Hoare triple {17194#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17194#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:38,609 INFO L273 TraceCheckUtils]: 11: Hoare triple {17194#(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; {17194#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:38,610 INFO L273 TraceCheckUtils]: 12: Hoare triple {17194#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {17195#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:38,611 INFO L273 TraceCheckUtils]: 13: Hoare triple {17195#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17195#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:38,612 INFO L273 TraceCheckUtils]: 14: Hoare triple {17195#(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; {17195#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:38,612 INFO L273 TraceCheckUtils]: 15: Hoare triple {17195#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {17196#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:38,613 INFO L273 TraceCheckUtils]: 16: Hoare triple {17196#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17196#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:38,614 INFO L273 TraceCheckUtils]: 17: Hoare triple {17196#(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; {17196#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:38,615 INFO L273 TraceCheckUtils]: 18: Hoare triple {17196#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {17197#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:38,616 INFO L273 TraceCheckUtils]: 19: Hoare triple {17197#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17197#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:38,616 INFO L273 TraceCheckUtils]: 20: Hoare triple {17197#(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; {17197#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:38,617 INFO L273 TraceCheckUtils]: 21: Hoare triple {17197#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {17198#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:38,618 INFO L273 TraceCheckUtils]: 22: Hoare triple {17198#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17198#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:38,619 INFO L273 TraceCheckUtils]: 23: Hoare triple {17198#(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; {17198#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:38,620 INFO L273 TraceCheckUtils]: 24: Hoare triple {17198#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {17199#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:38,620 INFO L273 TraceCheckUtils]: 25: Hoare triple {17199#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17199#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:38,621 INFO L273 TraceCheckUtils]: 26: Hoare triple {17199#(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; {17199#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:38,622 INFO L273 TraceCheckUtils]: 27: Hoare triple {17199#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {17200#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:38,622 INFO L273 TraceCheckUtils]: 28: Hoare triple {17200#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17200#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:38,623 INFO L273 TraceCheckUtils]: 29: Hoare triple {17200#(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; {17200#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:38,624 INFO L273 TraceCheckUtils]: 30: Hoare triple {17200#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {17201#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:38,625 INFO L273 TraceCheckUtils]: 31: Hoare triple {17201#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17201#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:38,625 INFO L273 TraceCheckUtils]: 32: Hoare triple {17201#(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; {17201#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:38,626 INFO L273 TraceCheckUtils]: 33: Hoare triple {17201#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {17202#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:38,627 INFO L273 TraceCheckUtils]: 34: Hoare triple {17202#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17202#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:38,628 INFO L273 TraceCheckUtils]: 35: Hoare triple {17202#(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; {17202#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:38,628 INFO L273 TraceCheckUtils]: 36: Hoare triple {17202#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {17203#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:38,629 INFO L273 TraceCheckUtils]: 37: Hoare triple {17203#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17203#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:38,630 INFO L273 TraceCheckUtils]: 38: Hoare triple {17203#(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; {17203#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:38,631 INFO L273 TraceCheckUtils]: 39: Hoare triple {17203#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {17204#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:38,632 INFO L273 TraceCheckUtils]: 40: Hoare triple {17204#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17204#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:38,632 INFO L273 TraceCheckUtils]: 41: Hoare triple {17204#(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; {17204#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:38,633 INFO L273 TraceCheckUtils]: 42: Hoare triple {17204#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {17205#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:38,634 INFO L273 TraceCheckUtils]: 43: Hoare triple {17205#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17205#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:38,635 INFO L273 TraceCheckUtils]: 44: Hoare triple {17205#(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; {17205#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:38,636 INFO L273 TraceCheckUtils]: 45: Hoare triple {17205#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {17206#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:38,636 INFO L273 TraceCheckUtils]: 46: Hoare triple {17206#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17206#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:38,637 INFO L273 TraceCheckUtils]: 47: Hoare triple {17206#(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; {17206#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:38,638 INFO L273 TraceCheckUtils]: 48: Hoare triple {17206#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {17207#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:38,639 INFO L273 TraceCheckUtils]: 49: Hoare triple {17207#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17207#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:38,639 INFO L273 TraceCheckUtils]: 50: Hoare triple {17207#(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; {17207#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:38,640 INFO L273 TraceCheckUtils]: 51: Hoare triple {17207#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {17208#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:38,641 INFO L273 TraceCheckUtils]: 52: Hoare triple {17208#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17208#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:38,642 INFO L273 TraceCheckUtils]: 53: Hoare triple {17208#(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; {17208#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:38,643 INFO L273 TraceCheckUtils]: 54: Hoare triple {17208#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {17209#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:52:38,644 INFO L273 TraceCheckUtils]: 55: Hoare triple {17209#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} assume !(~k~0 < 100000); {17191#false} is VALID [2018-11-23 11:52:38,644 INFO L273 TraceCheckUtils]: 56: Hoare triple {17191#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17191#false} is VALID [2018-11-23 11:52:38,644 INFO L273 TraceCheckUtils]: 57: Hoare triple {17191#false} ~x~0 := 0; {17191#false} is VALID [2018-11-23 11:52:38,644 INFO L273 TraceCheckUtils]: 58: Hoare triple {17191#false} assume !(~x~0 < ~i~0); {17191#false} is VALID [2018-11-23 11:52:38,644 INFO L273 TraceCheckUtils]: 59: Hoare triple {17191#false} ~x~0 := 0; {17191#false} is VALID [2018-11-23 11:52:38,645 INFO L273 TraceCheckUtils]: 60: Hoare triple {17191#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17191#false} is VALID [2018-11-23 11:52:38,645 INFO L256 TraceCheckUtils]: 61: Hoare triple {17191#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {17190#true} is VALID [2018-11-23 11:52:38,645 INFO L273 TraceCheckUtils]: 62: Hoare triple {17190#true} ~cond := #in~cond; {17190#true} is VALID [2018-11-23 11:52:38,645 INFO L273 TraceCheckUtils]: 63: Hoare triple {17190#true} assume !(0 == ~cond); {17190#true} is VALID [2018-11-23 11:52:38,645 INFO L273 TraceCheckUtils]: 64: Hoare triple {17190#true} assume true; {17190#true} is VALID [2018-11-23 11:52:38,646 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {17190#true} {17191#false} #136#return; {17191#false} is VALID [2018-11-23 11:52:38,646 INFO L273 TraceCheckUtils]: 66: Hoare triple {17191#false} havoc #t~mem9;havoc #t~mem10; {17191#false} is VALID [2018-11-23 11:52:38,646 INFO L273 TraceCheckUtils]: 67: Hoare triple {17191#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {17191#false} is VALID [2018-11-23 11:52:38,646 INFO L273 TraceCheckUtils]: 68: Hoare triple {17191#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17191#false} is VALID [2018-11-23 11:52:38,646 INFO L256 TraceCheckUtils]: 69: Hoare triple {17191#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {17191#false} is VALID [2018-11-23 11:52:38,647 INFO L273 TraceCheckUtils]: 70: Hoare triple {17191#false} ~cond := #in~cond; {17191#false} is VALID [2018-11-23 11:52:38,647 INFO L273 TraceCheckUtils]: 71: Hoare triple {17191#false} assume 0 == ~cond; {17191#false} is VALID [2018-11-23 11:52:38,647 INFO L273 TraceCheckUtils]: 72: Hoare triple {17191#false} assume !false; {17191#false} is VALID [2018-11-23 11:52:38,654 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 2 proven. 376 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:52:38,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:38,655 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:52:38,664 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:52:38,739 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2018-11-23 11:52:38,739 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:38,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:38,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:39,389 INFO L256 TraceCheckUtils]: 0: Hoare triple {17190#true} call ULTIMATE.init(); {17190#true} is VALID [2018-11-23 11:52:39,390 INFO L273 TraceCheckUtils]: 1: Hoare triple {17190#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17190#true} is VALID [2018-11-23 11:52:39,390 INFO L273 TraceCheckUtils]: 2: Hoare triple {17190#true} assume true; {17190#true} is VALID [2018-11-23 11:52:39,390 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17190#true} {17190#true} #130#return; {17190#true} is VALID [2018-11-23 11:52:39,390 INFO L256 TraceCheckUtils]: 4: Hoare triple {17190#true} call #t~ret15 := main(); {17190#true} is VALID [2018-11-23 11:52:39,391 INFO L273 TraceCheckUtils]: 5: Hoare triple {17190#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {17228#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:39,392 INFO L273 TraceCheckUtils]: 6: Hoare triple {17228#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {17232#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:39,393 INFO L273 TraceCheckUtils]: 7: Hoare triple {17232#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17232#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:39,393 INFO L273 TraceCheckUtils]: 8: Hoare triple {17232#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17232#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:39,394 INFO L273 TraceCheckUtils]: 9: Hoare triple {17232#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {17242#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:39,394 INFO L273 TraceCheckUtils]: 10: Hoare triple {17242#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17242#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:39,395 INFO L273 TraceCheckUtils]: 11: Hoare triple {17242#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17242#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:39,396 INFO L273 TraceCheckUtils]: 12: Hoare triple {17242#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {17252#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:39,396 INFO L273 TraceCheckUtils]: 13: Hoare triple {17252#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17252#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:39,397 INFO L273 TraceCheckUtils]: 14: Hoare triple {17252#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17252#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:39,397 INFO L273 TraceCheckUtils]: 15: Hoare triple {17252#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {17262#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:39,398 INFO L273 TraceCheckUtils]: 16: Hoare triple {17262#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17262#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:39,398 INFO L273 TraceCheckUtils]: 17: Hoare triple {17262#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17262#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:39,399 INFO L273 TraceCheckUtils]: 18: Hoare triple {17262#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {17272#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:39,400 INFO L273 TraceCheckUtils]: 19: Hoare triple {17272#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17272#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:39,400 INFO L273 TraceCheckUtils]: 20: Hoare triple {17272#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17272#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:39,401 INFO L273 TraceCheckUtils]: 21: Hoare triple {17272#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {17282#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:39,402 INFO L273 TraceCheckUtils]: 22: Hoare triple {17282#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17282#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:39,402 INFO L273 TraceCheckUtils]: 23: Hoare triple {17282#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17282#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:39,403 INFO L273 TraceCheckUtils]: 24: Hoare triple {17282#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {17292#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:39,403 INFO L273 TraceCheckUtils]: 25: Hoare triple {17292#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17292#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:39,404 INFO L273 TraceCheckUtils]: 26: Hoare triple {17292#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17292#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:39,405 INFO L273 TraceCheckUtils]: 27: Hoare triple {17292#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {17302#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:39,405 INFO L273 TraceCheckUtils]: 28: Hoare triple {17302#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17302#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:39,406 INFO L273 TraceCheckUtils]: 29: Hoare triple {17302#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17302#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:39,406 INFO L273 TraceCheckUtils]: 30: Hoare triple {17302#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {17312#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:39,407 INFO L273 TraceCheckUtils]: 31: Hoare triple {17312#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17312#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:39,407 INFO L273 TraceCheckUtils]: 32: Hoare triple {17312#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17312#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:39,408 INFO L273 TraceCheckUtils]: 33: Hoare triple {17312#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {17322#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:39,409 INFO L273 TraceCheckUtils]: 34: Hoare triple {17322#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17322#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:39,409 INFO L273 TraceCheckUtils]: 35: Hoare triple {17322#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17322#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:39,410 INFO L273 TraceCheckUtils]: 36: Hoare triple {17322#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {17332#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:39,411 INFO L273 TraceCheckUtils]: 37: Hoare triple {17332#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17332#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:39,411 INFO L273 TraceCheckUtils]: 38: Hoare triple {17332#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17332#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:39,412 INFO L273 TraceCheckUtils]: 39: Hoare triple {17332#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {17342#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:39,412 INFO L273 TraceCheckUtils]: 40: Hoare triple {17342#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17342#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:39,413 INFO L273 TraceCheckUtils]: 41: Hoare triple {17342#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17342#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:39,414 INFO L273 TraceCheckUtils]: 42: Hoare triple {17342#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {17352#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:39,414 INFO L273 TraceCheckUtils]: 43: Hoare triple {17352#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17352#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:39,415 INFO L273 TraceCheckUtils]: 44: Hoare triple {17352#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17352#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:39,415 INFO L273 TraceCheckUtils]: 45: Hoare triple {17352#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {17362#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:39,416 INFO L273 TraceCheckUtils]: 46: Hoare triple {17362#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17362#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:39,416 INFO L273 TraceCheckUtils]: 47: Hoare triple {17362#(<= main_~k~0 14)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17362#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:39,417 INFO L273 TraceCheckUtils]: 48: Hoare triple {17362#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {17372#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:39,418 INFO L273 TraceCheckUtils]: 49: Hoare triple {17372#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17372#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:39,418 INFO L273 TraceCheckUtils]: 50: Hoare triple {17372#(<= main_~k~0 15)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17372#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:39,419 INFO L273 TraceCheckUtils]: 51: Hoare triple {17372#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {17382#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:39,420 INFO L273 TraceCheckUtils]: 52: Hoare triple {17382#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17382#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:39,420 INFO L273 TraceCheckUtils]: 53: Hoare triple {17382#(<= main_~k~0 16)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17382#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:39,421 INFO L273 TraceCheckUtils]: 54: Hoare triple {17382#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {17392#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:39,421 INFO L273 TraceCheckUtils]: 55: Hoare triple {17392#(<= main_~k~0 17)} assume !(~k~0 < 100000); {17191#false} is VALID [2018-11-23 11:52:39,422 INFO L273 TraceCheckUtils]: 56: Hoare triple {17191#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17191#false} is VALID [2018-11-23 11:52:39,422 INFO L273 TraceCheckUtils]: 57: Hoare triple {17191#false} ~x~0 := 0; {17191#false} is VALID [2018-11-23 11:52:39,422 INFO L273 TraceCheckUtils]: 58: Hoare triple {17191#false} assume !(~x~0 < ~i~0); {17191#false} is VALID [2018-11-23 11:52:39,422 INFO L273 TraceCheckUtils]: 59: Hoare triple {17191#false} ~x~0 := 0; {17191#false} is VALID [2018-11-23 11:52:39,422 INFO L273 TraceCheckUtils]: 60: Hoare triple {17191#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17191#false} is VALID [2018-11-23 11:52:39,423 INFO L256 TraceCheckUtils]: 61: Hoare triple {17191#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {17191#false} is VALID [2018-11-23 11:52:39,423 INFO L273 TraceCheckUtils]: 62: Hoare triple {17191#false} ~cond := #in~cond; {17191#false} is VALID [2018-11-23 11:52:39,423 INFO L273 TraceCheckUtils]: 63: Hoare triple {17191#false} assume !(0 == ~cond); {17191#false} is VALID [2018-11-23 11:52:39,423 INFO L273 TraceCheckUtils]: 64: Hoare triple {17191#false} assume true; {17191#false} is VALID [2018-11-23 11:52:39,423 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {17191#false} {17191#false} #136#return; {17191#false} is VALID [2018-11-23 11:52:39,424 INFO L273 TraceCheckUtils]: 66: Hoare triple {17191#false} havoc #t~mem9;havoc #t~mem10; {17191#false} is VALID [2018-11-23 11:52:39,424 INFO L273 TraceCheckUtils]: 67: Hoare triple {17191#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {17191#false} is VALID [2018-11-23 11:52:39,424 INFO L273 TraceCheckUtils]: 68: Hoare triple {17191#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17191#false} is VALID [2018-11-23 11:52:39,424 INFO L256 TraceCheckUtils]: 69: Hoare triple {17191#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {17191#false} is VALID [2018-11-23 11:52:39,424 INFO L273 TraceCheckUtils]: 70: Hoare triple {17191#false} ~cond := #in~cond; {17191#false} is VALID [2018-11-23 11:52:39,424 INFO L273 TraceCheckUtils]: 71: Hoare triple {17191#false} assume 0 == ~cond; {17191#false} is VALID [2018-11-23 11:52:39,425 INFO L273 TraceCheckUtils]: 72: Hoare triple {17191#false} assume !false; {17191#false} is VALID [2018-11-23 11:52:39,428 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:52:39,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:39,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2018-11-23 11:52:39,448 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 73 [2018-11-23 11:52:39,449 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:39,449 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2018-11-23 11:52:39,572 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:39,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-23 11:52:39,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-23 11:52:39,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=533, Invalid=873, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 11:52:39,574 INFO L87 Difference]: Start difference. First operand 221 states and 310 transitions. Second operand 38 states. [2018-11-23 11:52:40,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:40,520 INFO L93 Difference]: Finished difference Result 354 states and 507 transitions. [2018-11-23 11:52:40,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 11:52:40,520 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 73 [2018-11-23 11:52:40,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:40,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 11:52:40,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 175 transitions. [2018-11-23 11:52:40,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 11:52:40,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 175 transitions. [2018-11-23 11:52:40,523 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 175 transitions. [2018-11-23 11:52:40,721 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:40,726 INFO L225 Difference]: With dead ends: 354 [2018-11-23 11:52:40,726 INFO L226 Difference]: Without dead ends: 236 [2018-11-23 11:52:40,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=533, Invalid=873, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 11:52:40,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-11-23 11:52:41,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 227. [2018-11-23 11:52:41,018 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:41,018 INFO L82 GeneralOperation]: Start isEquivalent. First operand 236 states. Second operand 227 states. [2018-11-23 11:52:41,019 INFO L74 IsIncluded]: Start isIncluded. First operand 236 states. Second operand 227 states. [2018-11-23 11:52:41,019 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 227 states. [2018-11-23 11:52:41,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:41,023 INFO L93 Difference]: Finished difference Result 236 states and 331 transitions. [2018-11-23 11:52:41,023 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 331 transitions. [2018-11-23 11:52:41,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:41,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:41,024 INFO L74 IsIncluded]: Start isIncluded. First operand 227 states. Second operand 236 states. [2018-11-23 11:52:41,024 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 236 states. [2018-11-23 11:52:41,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:41,029 INFO L93 Difference]: Finished difference Result 236 states and 331 transitions. [2018-11-23 11:52:41,029 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 331 transitions. [2018-11-23 11:52:41,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:41,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:41,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:41,030 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:41,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-11-23 11:52:41,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 318 transitions. [2018-11-23 11:52:41,035 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 318 transitions. Word has length 73 [2018-11-23 11:52:41,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:41,035 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 318 transitions. [2018-11-23 11:52:41,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-23 11:52:41,035 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 318 transitions. [2018-11-23 11:52:41,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 11:52:41,036 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:41,036 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:41,037 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:41,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:41,037 INFO L82 PathProgramCache]: Analyzing trace with hash -797157903, now seen corresponding path program 13 times [2018-11-23 11:52:41,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:41,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:41,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:41,038 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:41,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:41,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:42,274 INFO L256 TraceCheckUtils]: 0: Hoare triple {18710#true} call ULTIMATE.init(); {18710#true} is VALID [2018-11-23 11:52:42,274 INFO L273 TraceCheckUtils]: 1: Hoare triple {18710#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {18710#true} is VALID [2018-11-23 11:52:42,275 INFO L273 TraceCheckUtils]: 2: Hoare triple {18710#true} assume true; {18710#true} is VALID [2018-11-23 11:52:42,275 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18710#true} {18710#true} #130#return; {18710#true} is VALID [2018-11-23 11:52:42,275 INFO L256 TraceCheckUtils]: 4: Hoare triple {18710#true} call #t~ret15 := main(); {18710#true} is VALID [2018-11-23 11:52:42,275 INFO L273 TraceCheckUtils]: 5: Hoare triple {18710#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {18712#(= main_~i~0 0)} is VALID [2018-11-23 11:52:42,276 INFO L273 TraceCheckUtils]: 6: Hoare triple {18712#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {18713#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:42,276 INFO L273 TraceCheckUtils]: 7: Hoare triple {18713#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18713#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:42,277 INFO L273 TraceCheckUtils]: 8: Hoare triple {18713#(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; {18713#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:42,277 INFO L273 TraceCheckUtils]: 9: Hoare triple {18713#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {18714#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:42,278 INFO L273 TraceCheckUtils]: 10: Hoare triple {18714#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18714#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:42,278 INFO L273 TraceCheckUtils]: 11: Hoare triple {18714#(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; {18714#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:42,279 INFO L273 TraceCheckUtils]: 12: Hoare triple {18714#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {18715#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:42,279 INFO L273 TraceCheckUtils]: 13: Hoare triple {18715#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18715#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:42,280 INFO L273 TraceCheckUtils]: 14: Hoare triple {18715#(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; {18715#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:42,281 INFO L273 TraceCheckUtils]: 15: Hoare triple {18715#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {18716#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:42,282 INFO L273 TraceCheckUtils]: 16: Hoare triple {18716#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18716#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:42,283 INFO L273 TraceCheckUtils]: 17: Hoare triple {18716#(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; {18716#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:42,283 INFO L273 TraceCheckUtils]: 18: Hoare triple {18716#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {18717#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:42,284 INFO L273 TraceCheckUtils]: 19: Hoare triple {18717#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18717#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:42,285 INFO L273 TraceCheckUtils]: 20: Hoare triple {18717#(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; {18717#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:42,286 INFO L273 TraceCheckUtils]: 21: Hoare triple {18717#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {18718#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:42,287 INFO L273 TraceCheckUtils]: 22: Hoare triple {18718#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18718#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:42,287 INFO L273 TraceCheckUtils]: 23: Hoare triple {18718#(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; {18718#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:42,288 INFO L273 TraceCheckUtils]: 24: Hoare triple {18718#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {18719#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:42,289 INFO L273 TraceCheckUtils]: 25: Hoare triple {18719#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18719#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:42,290 INFO L273 TraceCheckUtils]: 26: Hoare triple {18719#(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; {18719#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:42,290 INFO L273 TraceCheckUtils]: 27: Hoare triple {18719#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {18720#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:42,291 INFO L273 TraceCheckUtils]: 28: Hoare triple {18720#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18720#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:42,292 INFO L273 TraceCheckUtils]: 29: Hoare triple {18720#(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; {18720#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:42,292 INFO L273 TraceCheckUtils]: 30: Hoare triple {18720#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {18721#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:42,293 INFO L273 TraceCheckUtils]: 31: Hoare triple {18721#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18721#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:42,294 INFO L273 TraceCheckUtils]: 32: Hoare triple {18721#(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; {18721#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:42,295 INFO L273 TraceCheckUtils]: 33: Hoare triple {18721#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {18722#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:42,295 INFO L273 TraceCheckUtils]: 34: Hoare triple {18722#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18722#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:42,296 INFO L273 TraceCheckUtils]: 35: Hoare triple {18722#(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; {18722#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:42,297 INFO L273 TraceCheckUtils]: 36: Hoare triple {18722#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {18723#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:42,298 INFO L273 TraceCheckUtils]: 37: Hoare triple {18723#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18723#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:42,299 INFO L273 TraceCheckUtils]: 38: Hoare triple {18723#(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; {18723#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:42,299 INFO L273 TraceCheckUtils]: 39: Hoare triple {18723#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {18724#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:42,300 INFO L273 TraceCheckUtils]: 40: Hoare triple {18724#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18724#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:42,301 INFO L273 TraceCheckUtils]: 41: Hoare triple {18724#(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; {18724#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:42,302 INFO L273 TraceCheckUtils]: 42: Hoare triple {18724#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {18725#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:42,302 INFO L273 TraceCheckUtils]: 43: Hoare triple {18725#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18725#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:42,303 INFO L273 TraceCheckUtils]: 44: Hoare triple {18725#(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; {18725#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:42,304 INFO L273 TraceCheckUtils]: 45: Hoare triple {18725#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {18726#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:42,305 INFO L273 TraceCheckUtils]: 46: Hoare triple {18726#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18726#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:42,305 INFO L273 TraceCheckUtils]: 47: Hoare triple {18726#(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; {18726#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:42,306 INFO L273 TraceCheckUtils]: 48: Hoare triple {18726#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {18727#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:42,307 INFO L273 TraceCheckUtils]: 49: Hoare triple {18727#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18727#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:42,308 INFO L273 TraceCheckUtils]: 50: Hoare triple {18727#(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; {18727#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:42,308 INFO L273 TraceCheckUtils]: 51: Hoare triple {18727#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {18728#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:42,309 INFO L273 TraceCheckUtils]: 52: Hoare triple {18728#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18728#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:42,310 INFO L273 TraceCheckUtils]: 53: Hoare triple {18728#(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; {18728#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:42,322 INFO L273 TraceCheckUtils]: 54: Hoare triple {18728#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {18729#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:52:42,323 INFO L273 TraceCheckUtils]: 55: Hoare triple {18729#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18729#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:52:42,323 INFO L273 TraceCheckUtils]: 56: Hoare triple {18729#(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; {18729#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:52:42,324 INFO L273 TraceCheckUtils]: 57: Hoare triple {18729#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} ~k~0 := 1 + ~k~0; {18730#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:42,324 INFO L273 TraceCheckUtils]: 58: Hoare triple {18730#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} assume !(~k~0 < 100000); {18711#false} is VALID [2018-11-23 11:52:42,325 INFO L273 TraceCheckUtils]: 59: Hoare triple {18711#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18711#false} is VALID [2018-11-23 11:52:42,325 INFO L273 TraceCheckUtils]: 60: Hoare triple {18711#false} ~x~0 := 0; {18711#false} is VALID [2018-11-23 11:52:42,325 INFO L273 TraceCheckUtils]: 61: Hoare triple {18711#false} assume !(~x~0 < ~i~0); {18711#false} is VALID [2018-11-23 11:52:42,325 INFO L273 TraceCheckUtils]: 62: Hoare triple {18711#false} ~x~0 := 0; {18711#false} is VALID [2018-11-23 11:52:42,325 INFO L273 TraceCheckUtils]: 63: Hoare triple {18711#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18711#false} is VALID [2018-11-23 11:52:42,325 INFO L256 TraceCheckUtils]: 64: Hoare triple {18711#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {18710#true} is VALID [2018-11-23 11:52:42,325 INFO L273 TraceCheckUtils]: 65: Hoare triple {18710#true} ~cond := #in~cond; {18710#true} is VALID [2018-11-23 11:52:42,325 INFO L273 TraceCheckUtils]: 66: Hoare triple {18710#true} assume !(0 == ~cond); {18710#true} is VALID [2018-11-23 11:52:42,325 INFO L273 TraceCheckUtils]: 67: Hoare triple {18710#true} assume true; {18710#true} is VALID [2018-11-23 11:52:42,326 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {18710#true} {18711#false} #136#return; {18711#false} is VALID [2018-11-23 11:52:42,326 INFO L273 TraceCheckUtils]: 69: Hoare triple {18711#false} havoc #t~mem9;havoc #t~mem10; {18711#false} is VALID [2018-11-23 11:52:42,326 INFO L273 TraceCheckUtils]: 70: Hoare triple {18711#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {18711#false} is VALID [2018-11-23 11:52:42,326 INFO L273 TraceCheckUtils]: 71: Hoare triple {18711#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18711#false} is VALID [2018-11-23 11:52:42,326 INFO L256 TraceCheckUtils]: 72: Hoare triple {18711#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {18711#false} is VALID [2018-11-23 11:52:42,326 INFO L273 TraceCheckUtils]: 73: Hoare triple {18711#false} ~cond := #in~cond; {18711#false} is VALID [2018-11-23 11:52:42,326 INFO L273 TraceCheckUtils]: 74: Hoare triple {18711#false} assume 0 == ~cond; {18711#false} is VALID [2018-11-23 11:52:42,326 INFO L273 TraceCheckUtils]: 75: Hoare triple {18711#false} assume !false; {18711#false} is VALID [2018-11-23 11:52:42,334 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 2 proven. 425 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:52:42,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:42,335 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:52:42,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:52:42,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:42,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:42,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:42,899 INFO L256 TraceCheckUtils]: 0: Hoare triple {18710#true} call ULTIMATE.init(); {18710#true} is VALID [2018-11-23 11:52:42,899 INFO L273 TraceCheckUtils]: 1: Hoare triple {18710#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {18710#true} is VALID [2018-11-23 11:52:42,899 INFO L273 TraceCheckUtils]: 2: Hoare triple {18710#true} assume true; {18710#true} is VALID [2018-11-23 11:52:42,900 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18710#true} {18710#true} #130#return; {18710#true} is VALID [2018-11-23 11:52:42,900 INFO L256 TraceCheckUtils]: 4: Hoare triple {18710#true} call #t~ret15 := main(); {18710#true} is VALID [2018-11-23 11:52:42,901 INFO L273 TraceCheckUtils]: 5: Hoare triple {18710#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {18749#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:42,901 INFO L273 TraceCheckUtils]: 6: Hoare triple {18749#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {18753#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:42,901 INFO L273 TraceCheckUtils]: 7: Hoare triple {18753#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18753#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:42,902 INFO L273 TraceCheckUtils]: 8: Hoare triple {18753#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18753#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:42,902 INFO L273 TraceCheckUtils]: 9: Hoare triple {18753#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {18763#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:42,902 INFO L273 TraceCheckUtils]: 10: Hoare triple {18763#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18763#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:42,903 INFO L273 TraceCheckUtils]: 11: Hoare triple {18763#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18763#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:42,904 INFO L273 TraceCheckUtils]: 12: Hoare triple {18763#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {18773#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:42,904 INFO L273 TraceCheckUtils]: 13: Hoare triple {18773#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18773#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:42,905 INFO L273 TraceCheckUtils]: 14: Hoare triple {18773#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18773#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:42,905 INFO L273 TraceCheckUtils]: 15: Hoare triple {18773#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {18783#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:42,906 INFO L273 TraceCheckUtils]: 16: Hoare triple {18783#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18783#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:42,906 INFO L273 TraceCheckUtils]: 17: Hoare triple {18783#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18783#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:42,907 INFO L273 TraceCheckUtils]: 18: Hoare triple {18783#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {18793#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:42,907 INFO L273 TraceCheckUtils]: 19: Hoare triple {18793#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18793#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:42,908 INFO L273 TraceCheckUtils]: 20: Hoare triple {18793#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18793#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:42,909 INFO L273 TraceCheckUtils]: 21: Hoare triple {18793#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {18803#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:42,909 INFO L273 TraceCheckUtils]: 22: Hoare triple {18803#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18803#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:42,910 INFO L273 TraceCheckUtils]: 23: Hoare triple {18803#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18803#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:42,910 INFO L273 TraceCheckUtils]: 24: Hoare triple {18803#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {18813#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:42,911 INFO L273 TraceCheckUtils]: 25: Hoare triple {18813#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18813#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:42,911 INFO L273 TraceCheckUtils]: 26: Hoare triple {18813#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18813#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:42,912 INFO L273 TraceCheckUtils]: 27: Hoare triple {18813#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {18823#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:42,912 INFO L273 TraceCheckUtils]: 28: Hoare triple {18823#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18823#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:42,913 INFO L273 TraceCheckUtils]: 29: Hoare triple {18823#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18823#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:42,914 INFO L273 TraceCheckUtils]: 30: Hoare triple {18823#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {18833#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:42,914 INFO L273 TraceCheckUtils]: 31: Hoare triple {18833#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18833#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:42,914 INFO L273 TraceCheckUtils]: 32: Hoare triple {18833#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18833#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:42,915 INFO L273 TraceCheckUtils]: 33: Hoare triple {18833#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {18843#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:42,916 INFO L273 TraceCheckUtils]: 34: Hoare triple {18843#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18843#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:42,916 INFO L273 TraceCheckUtils]: 35: Hoare triple {18843#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18843#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:42,917 INFO L273 TraceCheckUtils]: 36: Hoare triple {18843#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {18853#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:42,917 INFO L273 TraceCheckUtils]: 37: Hoare triple {18853#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18853#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:42,918 INFO L273 TraceCheckUtils]: 38: Hoare triple {18853#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18853#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:42,919 INFO L273 TraceCheckUtils]: 39: Hoare triple {18853#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {18863#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:42,919 INFO L273 TraceCheckUtils]: 40: Hoare triple {18863#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18863#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:42,920 INFO L273 TraceCheckUtils]: 41: Hoare triple {18863#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18863#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:42,920 INFO L273 TraceCheckUtils]: 42: Hoare triple {18863#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {18873#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:42,921 INFO L273 TraceCheckUtils]: 43: Hoare triple {18873#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18873#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:42,921 INFO L273 TraceCheckUtils]: 44: Hoare triple {18873#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18873#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:42,922 INFO L273 TraceCheckUtils]: 45: Hoare triple {18873#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {18883#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:42,922 INFO L273 TraceCheckUtils]: 46: Hoare triple {18883#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18883#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:42,923 INFO L273 TraceCheckUtils]: 47: Hoare triple {18883#(<= main_~k~0 14)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18883#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:42,924 INFO L273 TraceCheckUtils]: 48: Hoare triple {18883#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {18893#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:42,924 INFO L273 TraceCheckUtils]: 49: Hoare triple {18893#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18893#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:42,925 INFO L273 TraceCheckUtils]: 50: Hoare triple {18893#(<= main_~k~0 15)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18893#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:42,925 INFO L273 TraceCheckUtils]: 51: Hoare triple {18893#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {18903#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:42,926 INFO L273 TraceCheckUtils]: 52: Hoare triple {18903#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18903#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:42,926 INFO L273 TraceCheckUtils]: 53: Hoare triple {18903#(<= main_~k~0 16)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18903#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:42,927 INFO L273 TraceCheckUtils]: 54: Hoare triple {18903#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {18913#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:42,927 INFO L273 TraceCheckUtils]: 55: Hoare triple {18913#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18913#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:42,928 INFO L273 TraceCheckUtils]: 56: Hoare triple {18913#(<= main_~k~0 17)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18913#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:42,929 INFO L273 TraceCheckUtils]: 57: Hoare triple {18913#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {18923#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:42,929 INFO L273 TraceCheckUtils]: 58: Hoare triple {18923#(<= main_~k~0 18)} assume !(~k~0 < 100000); {18711#false} is VALID [2018-11-23 11:52:42,929 INFO L273 TraceCheckUtils]: 59: Hoare triple {18711#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18711#false} is VALID [2018-11-23 11:52:42,930 INFO L273 TraceCheckUtils]: 60: Hoare triple {18711#false} ~x~0 := 0; {18711#false} is VALID [2018-11-23 11:52:42,930 INFO L273 TraceCheckUtils]: 61: Hoare triple {18711#false} assume !(~x~0 < ~i~0); {18711#false} is VALID [2018-11-23 11:52:42,930 INFO L273 TraceCheckUtils]: 62: Hoare triple {18711#false} ~x~0 := 0; {18711#false} is VALID [2018-11-23 11:52:42,930 INFO L273 TraceCheckUtils]: 63: Hoare triple {18711#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18711#false} is VALID [2018-11-23 11:52:42,930 INFO L256 TraceCheckUtils]: 64: Hoare triple {18711#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {18711#false} is VALID [2018-11-23 11:52:42,930 INFO L273 TraceCheckUtils]: 65: Hoare triple {18711#false} ~cond := #in~cond; {18711#false} is VALID [2018-11-23 11:52:42,931 INFO L273 TraceCheckUtils]: 66: Hoare triple {18711#false} assume !(0 == ~cond); {18711#false} is VALID [2018-11-23 11:52:42,931 INFO L273 TraceCheckUtils]: 67: Hoare triple {18711#false} assume true; {18711#false} is VALID [2018-11-23 11:52:42,931 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {18711#false} {18711#false} #136#return; {18711#false} is VALID [2018-11-23 11:52:42,931 INFO L273 TraceCheckUtils]: 69: Hoare triple {18711#false} havoc #t~mem9;havoc #t~mem10; {18711#false} is VALID [2018-11-23 11:52:42,931 INFO L273 TraceCheckUtils]: 70: Hoare triple {18711#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {18711#false} is VALID [2018-11-23 11:52:42,932 INFO L273 TraceCheckUtils]: 71: Hoare triple {18711#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18711#false} is VALID [2018-11-23 11:52:42,932 INFO L256 TraceCheckUtils]: 72: Hoare triple {18711#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {18711#false} is VALID [2018-11-23 11:52:42,932 INFO L273 TraceCheckUtils]: 73: Hoare triple {18711#false} ~cond := #in~cond; {18711#false} is VALID [2018-11-23 11:52:42,932 INFO L273 TraceCheckUtils]: 74: Hoare triple {18711#false} assume 0 == ~cond; {18711#false} is VALID [2018-11-23 11:52:42,932 INFO L273 TraceCheckUtils]: 75: Hoare triple {18711#false} assume !false; {18711#false} is VALID [2018-11-23 11:52:42,937 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 425 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:52:42,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:42,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2018-11-23 11:52:42,956 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 76 [2018-11-23 11:52:42,956 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:42,956 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states. [2018-11-23 11:52:43,081 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-23 11:52:43,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-23 11:52:43,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-23 11:52:43,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=591, Invalid=969, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 11:52:43,083 INFO L87 Difference]: Start difference. First operand 227 states and 318 transitions. Second operand 40 states. [2018-11-23 11:52:44,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:44,308 INFO L93 Difference]: Finished difference Result 360 states and 515 transitions. [2018-11-23 11:52:44,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 11:52:44,308 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 76 [2018-11-23 11:52:44,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:44,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 11:52:44,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 179 transitions. [2018-11-23 11:52:44,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 11:52:44,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 179 transitions. [2018-11-23 11:52:44,312 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 179 transitions. [2018-11-23 11:52:44,575 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:44,580 INFO L225 Difference]: With dead ends: 360 [2018-11-23 11:52:44,580 INFO L226 Difference]: Without dead ends: 242 [2018-11-23 11:52:44,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=591, Invalid=969, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 11:52:44,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-11-23 11:52:45,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 233. [2018-11-23 11:52:45,109 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:45,110 INFO L82 GeneralOperation]: Start isEquivalent. First operand 242 states. Second operand 233 states. [2018-11-23 11:52:45,110 INFO L74 IsIncluded]: Start isIncluded. First operand 242 states. Second operand 233 states. [2018-11-23 11:52:45,110 INFO L87 Difference]: Start difference. First operand 242 states. Second operand 233 states. [2018-11-23 11:52:45,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:45,116 INFO L93 Difference]: Finished difference Result 242 states and 339 transitions. [2018-11-23 11:52:45,116 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 339 transitions. [2018-11-23 11:52:45,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:45,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:45,117 INFO L74 IsIncluded]: Start isIncluded. First operand 233 states. Second operand 242 states. [2018-11-23 11:52:45,117 INFO L87 Difference]: Start difference. First operand 233 states. Second operand 242 states. [2018-11-23 11:52:45,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:45,122 INFO L93 Difference]: Finished difference Result 242 states and 339 transitions. [2018-11-23 11:52:45,122 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 339 transitions. [2018-11-23 11:52:45,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:45,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:45,123 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:45,123 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:45,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-11-23 11:52:45,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 326 transitions. [2018-11-23 11:52:45,129 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 326 transitions. Word has length 76 [2018-11-23 11:52:45,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:45,129 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 326 transitions. [2018-11-23 11:52:45,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-23 11:52:45,129 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 326 transitions. [2018-11-23 11:52:45,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 11:52:45,130 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:45,130 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:45,131 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:45,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:45,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1874293996, now seen corresponding path program 14 times [2018-11-23 11:52:45,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:45,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:45,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:45,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:52:45,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:45,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:45,779 INFO L256 TraceCheckUtils]: 0: Hoare triple {20269#true} call ULTIMATE.init(); {20269#true} is VALID [2018-11-23 11:52:45,779 INFO L273 TraceCheckUtils]: 1: Hoare triple {20269#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20269#true} is VALID [2018-11-23 11:52:45,779 INFO L273 TraceCheckUtils]: 2: Hoare triple {20269#true} assume true; {20269#true} is VALID [2018-11-23 11:52:45,779 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20269#true} {20269#true} #130#return; {20269#true} is VALID [2018-11-23 11:52:45,779 INFO L256 TraceCheckUtils]: 4: Hoare triple {20269#true} call #t~ret15 := main(); {20269#true} is VALID [2018-11-23 11:52:45,780 INFO L273 TraceCheckUtils]: 5: Hoare triple {20269#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {20271#(= main_~i~0 0)} is VALID [2018-11-23 11:52:45,780 INFO L273 TraceCheckUtils]: 6: Hoare triple {20271#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {20272#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:45,781 INFO L273 TraceCheckUtils]: 7: Hoare triple {20272#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {20272#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:45,781 INFO L273 TraceCheckUtils]: 8: Hoare triple {20272#(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; {20272#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:45,782 INFO L273 TraceCheckUtils]: 9: Hoare triple {20272#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {20273#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:45,782 INFO L273 TraceCheckUtils]: 10: Hoare triple {20273#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {20273#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:45,783 INFO L273 TraceCheckUtils]: 11: Hoare triple {20273#(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; {20273#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:45,784 INFO L273 TraceCheckUtils]: 12: Hoare triple {20273#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {20274#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:45,785 INFO L273 TraceCheckUtils]: 13: Hoare triple {20274#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {20274#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:45,785 INFO L273 TraceCheckUtils]: 14: Hoare triple {20274#(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; {20274#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:45,786 INFO L273 TraceCheckUtils]: 15: Hoare triple {20274#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {20275#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:45,787 INFO L273 TraceCheckUtils]: 16: Hoare triple {20275#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {20275#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:45,788 INFO L273 TraceCheckUtils]: 17: Hoare triple {20275#(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; {20275#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:45,788 INFO L273 TraceCheckUtils]: 18: Hoare triple {20275#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {20276#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:45,789 INFO L273 TraceCheckUtils]: 19: Hoare triple {20276#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {20276#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:45,790 INFO L273 TraceCheckUtils]: 20: Hoare triple {20276#(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; {20276#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:45,791 INFO L273 TraceCheckUtils]: 21: Hoare triple {20276#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {20277#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:45,792 INFO L273 TraceCheckUtils]: 22: Hoare triple {20277#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {20277#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:45,793 INFO L273 TraceCheckUtils]: 23: Hoare triple {20277#(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; {20277#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:45,794 INFO L273 TraceCheckUtils]: 24: Hoare triple {20277#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {20278#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:45,794 INFO L273 TraceCheckUtils]: 25: Hoare triple {20278#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {20278#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:45,795 INFO L273 TraceCheckUtils]: 26: Hoare triple {20278#(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; {20278#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:45,796 INFO L273 TraceCheckUtils]: 27: Hoare triple {20278#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {20279#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:45,797 INFO L273 TraceCheckUtils]: 28: Hoare triple {20279#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {20279#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:45,797 INFO L273 TraceCheckUtils]: 29: Hoare triple {20279#(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; {20279#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:45,798 INFO L273 TraceCheckUtils]: 30: Hoare triple {20279#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {20280#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:45,799 INFO L273 TraceCheckUtils]: 31: Hoare triple {20280#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {20280#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:45,800 INFO L273 TraceCheckUtils]: 32: Hoare triple {20280#(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; {20280#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:45,801 INFO L273 TraceCheckUtils]: 33: Hoare triple {20280#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {20281#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:45,801 INFO L273 TraceCheckUtils]: 34: Hoare triple {20281#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {20281#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:45,802 INFO L273 TraceCheckUtils]: 35: Hoare triple {20281#(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; {20281#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:45,803 INFO L273 TraceCheckUtils]: 36: Hoare triple {20281#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {20282#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:45,804 INFO L273 TraceCheckUtils]: 37: Hoare triple {20282#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {20282#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:45,805 INFO L273 TraceCheckUtils]: 38: Hoare triple {20282#(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; {20282#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:45,806 INFO L273 TraceCheckUtils]: 39: Hoare triple {20282#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {20283#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:45,806 INFO L273 TraceCheckUtils]: 40: Hoare triple {20283#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {20283#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:45,807 INFO L273 TraceCheckUtils]: 41: Hoare triple {20283#(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; {20283#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:45,808 INFO L273 TraceCheckUtils]: 42: Hoare triple {20283#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {20284#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:45,809 INFO L273 TraceCheckUtils]: 43: Hoare triple {20284#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {20284#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:45,810 INFO L273 TraceCheckUtils]: 44: Hoare triple {20284#(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; {20284#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:45,811 INFO L273 TraceCheckUtils]: 45: Hoare triple {20284#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {20285#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:45,811 INFO L273 TraceCheckUtils]: 46: Hoare triple {20285#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {20285#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:45,812 INFO L273 TraceCheckUtils]: 47: Hoare triple {20285#(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; {20285#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:45,813 INFO L273 TraceCheckUtils]: 48: Hoare triple {20285#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {20286#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:45,814 INFO L273 TraceCheckUtils]: 49: Hoare triple {20286#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {20286#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:45,814 INFO L273 TraceCheckUtils]: 50: Hoare triple {20286#(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; {20286#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:45,815 INFO L273 TraceCheckUtils]: 51: Hoare triple {20286#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {20287#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:45,816 INFO L273 TraceCheckUtils]: 52: Hoare triple {20287#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {20287#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:45,817 INFO L273 TraceCheckUtils]: 53: Hoare triple {20287#(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; {20287#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:45,818 INFO L273 TraceCheckUtils]: 54: Hoare triple {20287#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {20288#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:52:45,819 INFO L273 TraceCheckUtils]: 55: Hoare triple {20288#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {20288#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:52:45,819 INFO L273 TraceCheckUtils]: 56: Hoare triple {20288#(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; {20288#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:52:45,820 INFO L273 TraceCheckUtils]: 57: Hoare triple {20288#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} ~k~0 := 1 + ~k~0; {20289#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:45,821 INFO L273 TraceCheckUtils]: 58: Hoare triple {20289#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {20289#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:45,822 INFO L273 TraceCheckUtils]: 59: Hoare triple {20289#(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; {20289#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:45,823 INFO L273 TraceCheckUtils]: 60: Hoare triple {20289#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {20290#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:45,823 INFO L273 TraceCheckUtils]: 61: Hoare triple {20290#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} assume !(~k~0 < 100000); {20270#false} is VALID [2018-11-23 11:52:45,824 INFO L273 TraceCheckUtils]: 62: Hoare triple {20270#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20270#false} is VALID [2018-11-23 11:52:45,824 INFO L273 TraceCheckUtils]: 63: Hoare triple {20270#false} ~x~0 := 0; {20270#false} is VALID [2018-11-23 11:52:45,824 INFO L273 TraceCheckUtils]: 64: Hoare triple {20270#false} assume !(~x~0 < ~i~0); {20270#false} is VALID [2018-11-23 11:52:45,824 INFO L273 TraceCheckUtils]: 65: Hoare triple {20270#false} ~x~0 := 0; {20270#false} is VALID [2018-11-23 11:52:45,824 INFO L273 TraceCheckUtils]: 66: Hoare triple {20270#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20270#false} is VALID [2018-11-23 11:52:45,825 INFO L256 TraceCheckUtils]: 67: Hoare triple {20270#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {20269#true} is VALID [2018-11-23 11:52:45,825 INFO L273 TraceCheckUtils]: 68: Hoare triple {20269#true} ~cond := #in~cond; {20269#true} is VALID [2018-11-23 11:52:45,825 INFO L273 TraceCheckUtils]: 69: Hoare triple {20269#true} assume !(0 == ~cond); {20269#true} is VALID [2018-11-23 11:52:45,825 INFO L273 TraceCheckUtils]: 70: Hoare triple {20269#true} assume true; {20269#true} is VALID [2018-11-23 11:52:45,825 INFO L268 TraceCheckUtils]: 71: Hoare quadruple {20269#true} {20270#false} #136#return; {20270#false} is VALID [2018-11-23 11:52:45,826 INFO L273 TraceCheckUtils]: 72: Hoare triple {20270#false} havoc #t~mem9;havoc #t~mem10; {20270#false} is VALID [2018-11-23 11:52:45,826 INFO L273 TraceCheckUtils]: 73: Hoare triple {20270#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {20270#false} is VALID [2018-11-23 11:52:45,826 INFO L273 TraceCheckUtils]: 74: Hoare triple {20270#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20270#false} is VALID [2018-11-23 11:52:45,826 INFO L256 TraceCheckUtils]: 75: Hoare triple {20270#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {20270#false} is VALID [2018-11-23 11:52:45,826 INFO L273 TraceCheckUtils]: 76: Hoare triple {20270#false} ~cond := #in~cond; {20270#false} is VALID [2018-11-23 11:52:45,826 INFO L273 TraceCheckUtils]: 77: Hoare triple {20270#false} assume 0 == ~cond; {20270#false} is VALID [2018-11-23 11:52:45,827 INFO L273 TraceCheckUtils]: 78: Hoare triple {20270#false} assume !false; {20270#false} is VALID [2018-11-23 11:52:45,836 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 2 proven. 477 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:52:45,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:45,836 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:52:45,846 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:52:45,887 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:52:45,887 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:45,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:45,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:46,444 INFO L256 TraceCheckUtils]: 0: Hoare triple {20269#true} call ULTIMATE.init(); {20269#true} is VALID [2018-11-23 11:52:46,444 INFO L273 TraceCheckUtils]: 1: Hoare triple {20269#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20269#true} is VALID [2018-11-23 11:52:46,445 INFO L273 TraceCheckUtils]: 2: Hoare triple {20269#true} assume true; {20269#true} is VALID [2018-11-23 11:52:46,445 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20269#true} {20269#true} #130#return; {20269#true} is VALID [2018-11-23 11:52:46,445 INFO L256 TraceCheckUtils]: 4: Hoare triple {20269#true} call #t~ret15 := main(); {20269#true} is VALID [2018-11-23 11:52:46,446 INFO L273 TraceCheckUtils]: 5: Hoare triple {20269#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {20309#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:46,446 INFO L273 TraceCheckUtils]: 6: Hoare triple {20309#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {20313#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:46,447 INFO L273 TraceCheckUtils]: 7: Hoare triple {20313#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {20313#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:46,447 INFO L273 TraceCheckUtils]: 8: Hoare triple {20313#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20313#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:46,448 INFO L273 TraceCheckUtils]: 9: Hoare triple {20313#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {20323#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:46,448 INFO L273 TraceCheckUtils]: 10: Hoare triple {20323#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {20323#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:46,448 INFO L273 TraceCheckUtils]: 11: Hoare triple {20323#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20323#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:46,449 INFO L273 TraceCheckUtils]: 12: Hoare triple {20323#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {20333#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:46,449 INFO L273 TraceCheckUtils]: 13: Hoare triple {20333#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {20333#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:46,450 INFO L273 TraceCheckUtils]: 14: Hoare triple {20333#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20333#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:46,450 INFO L273 TraceCheckUtils]: 15: Hoare triple {20333#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {20343#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:46,451 INFO L273 TraceCheckUtils]: 16: Hoare triple {20343#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {20343#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:46,451 INFO L273 TraceCheckUtils]: 17: Hoare triple {20343#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20343#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:46,452 INFO L273 TraceCheckUtils]: 18: Hoare triple {20343#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {20353#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:46,453 INFO L273 TraceCheckUtils]: 19: Hoare triple {20353#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {20353#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:46,453 INFO L273 TraceCheckUtils]: 20: Hoare triple {20353#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20353#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:46,454 INFO L273 TraceCheckUtils]: 21: Hoare triple {20353#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {20363#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:46,454 INFO L273 TraceCheckUtils]: 22: Hoare triple {20363#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {20363#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:46,455 INFO L273 TraceCheckUtils]: 23: Hoare triple {20363#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20363#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:46,455 INFO L273 TraceCheckUtils]: 24: Hoare triple {20363#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {20373#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:46,456 INFO L273 TraceCheckUtils]: 25: Hoare triple {20373#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {20373#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:46,456 INFO L273 TraceCheckUtils]: 26: Hoare triple {20373#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20373#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:46,457 INFO L273 TraceCheckUtils]: 27: Hoare triple {20373#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {20383#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:46,458 INFO L273 TraceCheckUtils]: 28: Hoare triple {20383#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {20383#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:46,458 INFO L273 TraceCheckUtils]: 29: Hoare triple {20383#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20383#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:46,459 INFO L273 TraceCheckUtils]: 30: Hoare triple {20383#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {20393#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:46,459 INFO L273 TraceCheckUtils]: 31: Hoare triple {20393#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {20393#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:46,460 INFO L273 TraceCheckUtils]: 32: Hoare triple {20393#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20393#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:46,460 INFO L273 TraceCheckUtils]: 33: Hoare triple {20393#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {20403#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:46,461 INFO L273 TraceCheckUtils]: 34: Hoare triple {20403#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {20403#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:46,461 INFO L273 TraceCheckUtils]: 35: Hoare triple {20403#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20403#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:46,462 INFO L273 TraceCheckUtils]: 36: Hoare triple {20403#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {20413#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:46,463 INFO L273 TraceCheckUtils]: 37: Hoare triple {20413#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {20413#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:46,463 INFO L273 TraceCheckUtils]: 38: Hoare triple {20413#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20413#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:46,464 INFO L273 TraceCheckUtils]: 39: Hoare triple {20413#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {20423#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:46,464 INFO L273 TraceCheckUtils]: 40: Hoare triple {20423#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {20423#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:46,465 INFO L273 TraceCheckUtils]: 41: Hoare triple {20423#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20423#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:46,466 INFO L273 TraceCheckUtils]: 42: Hoare triple {20423#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {20433#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:46,466 INFO L273 TraceCheckUtils]: 43: Hoare triple {20433#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {20433#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:46,467 INFO L273 TraceCheckUtils]: 44: Hoare triple {20433#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20433#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:46,467 INFO L273 TraceCheckUtils]: 45: Hoare triple {20433#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {20443#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:46,468 INFO L273 TraceCheckUtils]: 46: Hoare triple {20443#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {20443#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:46,468 INFO L273 TraceCheckUtils]: 47: Hoare triple {20443#(<= main_~k~0 14)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20443#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:46,469 INFO L273 TraceCheckUtils]: 48: Hoare triple {20443#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {20453#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:46,469 INFO L273 TraceCheckUtils]: 49: Hoare triple {20453#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {20453#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:46,470 INFO L273 TraceCheckUtils]: 50: Hoare triple {20453#(<= main_~k~0 15)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20453#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:46,471 INFO L273 TraceCheckUtils]: 51: Hoare triple {20453#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {20463#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:46,471 INFO L273 TraceCheckUtils]: 52: Hoare triple {20463#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {20463#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:46,472 INFO L273 TraceCheckUtils]: 53: Hoare triple {20463#(<= main_~k~0 16)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20463#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:46,472 INFO L273 TraceCheckUtils]: 54: Hoare triple {20463#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {20473#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:46,473 INFO L273 TraceCheckUtils]: 55: Hoare triple {20473#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {20473#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:46,473 INFO L273 TraceCheckUtils]: 56: Hoare triple {20473#(<= main_~k~0 17)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20473#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:46,474 INFO L273 TraceCheckUtils]: 57: Hoare triple {20473#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {20483#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:46,474 INFO L273 TraceCheckUtils]: 58: Hoare triple {20483#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {20483#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:46,475 INFO L273 TraceCheckUtils]: 59: Hoare triple {20483#(<= main_~k~0 18)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20483#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:46,476 INFO L273 TraceCheckUtils]: 60: Hoare triple {20483#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {20493#(<= main_~k~0 19)} is VALID [2018-11-23 11:52:46,476 INFO L273 TraceCheckUtils]: 61: Hoare triple {20493#(<= main_~k~0 19)} assume !(~k~0 < 100000); {20270#false} is VALID [2018-11-23 11:52:46,476 INFO L273 TraceCheckUtils]: 62: Hoare triple {20270#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20270#false} is VALID [2018-11-23 11:52:46,477 INFO L273 TraceCheckUtils]: 63: Hoare triple {20270#false} ~x~0 := 0; {20270#false} is VALID [2018-11-23 11:52:46,477 INFO L273 TraceCheckUtils]: 64: Hoare triple {20270#false} assume !(~x~0 < ~i~0); {20270#false} is VALID [2018-11-23 11:52:46,477 INFO L273 TraceCheckUtils]: 65: Hoare triple {20270#false} ~x~0 := 0; {20270#false} is VALID [2018-11-23 11:52:46,477 INFO L273 TraceCheckUtils]: 66: Hoare triple {20270#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20270#false} is VALID [2018-11-23 11:52:46,477 INFO L256 TraceCheckUtils]: 67: Hoare triple {20270#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {20270#false} is VALID [2018-11-23 11:52:46,478 INFO L273 TraceCheckUtils]: 68: Hoare triple {20270#false} ~cond := #in~cond; {20270#false} is VALID [2018-11-23 11:52:46,478 INFO L273 TraceCheckUtils]: 69: Hoare triple {20270#false} assume !(0 == ~cond); {20270#false} is VALID [2018-11-23 11:52:46,478 INFO L273 TraceCheckUtils]: 70: Hoare triple {20270#false} assume true; {20270#false} is VALID [2018-11-23 11:52:46,478 INFO L268 TraceCheckUtils]: 71: Hoare quadruple {20270#false} {20270#false} #136#return; {20270#false} is VALID [2018-11-23 11:52:46,478 INFO L273 TraceCheckUtils]: 72: Hoare triple {20270#false} havoc #t~mem9;havoc #t~mem10; {20270#false} is VALID [2018-11-23 11:52:46,478 INFO L273 TraceCheckUtils]: 73: Hoare triple {20270#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {20270#false} is VALID [2018-11-23 11:52:46,479 INFO L273 TraceCheckUtils]: 74: Hoare triple {20270#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20270#false} is VALID [2018-11-23 11:52:46,479 INFO L256 TraceCheckUtils]: 75: Hoare triple {20270#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {20270#false} is VALID [2018-11-23 11:52:46,479 INFO L273 TraceCheckUtils]: 76: Hoare triple {20270#false} ~cond := #in~cond; {20270#false} is VALID [2018-11-23 11:52:46,479 INFO L273 TraceCheckUtils]: 77: Hoare triple {20270#false} assume 0 == ~cond; {20270#false} is VALID [2018-11-23 11:52:46,479 INFO L273 TraceCheckUtils]: 78: Hoare triple {20270#false} assume !false; {20270#false} is VALID [2018-11-23 11:52:46,483 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 0 proven. 477 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:52:46,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:46,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 42 [2018-11-23 11:52:46,502 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 79 [2018-11-23 11:52:46,503 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:46,503 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-23 11:52:46,634 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:46,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 11:52:46,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 11:52:46,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=652, Invalid=1070, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 11:52:46,636 INFO L87 Difference]: Start difference. First operand 233 states and 326 transitions. Second operand 42 states. [2018-11-23 11:52:47,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:47,536 INFO L93 Difference]: Finished difference Result 366 states and 523 transitions. [2018-11-23 11:52:47,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 11:52:47,536 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 79 [2018-11-23 11:52:47,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:47,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 11:52:47,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 183 transitions. [2018-11-23 11:52:47,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 11:52:47,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 183 transitions. [2018-11-23 11:52:47,539 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 183 transitions. [2018-11-23 11:52:47,701 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:47,707 INFO L225 Difference]: With dead ends: 366 [2018-11-23 11:52:47,707 INFO L226 Difference]: Without dead ends: 248 [2018-11-23 11:52:47,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=652, Invalid=1070, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 11:52:47,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-11-23 11:52:47,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 239. [2018-11-23 11:52:47,971 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:47,971 INFO L82 GeneralOperation]: Start isEquivalent. First operand 248 states. Second operand 239 states. [2018-11-23 11:52:47,971 INFO L74 IsIncluded]: Start isIncluded. First operand 248 states. Second operand 239 states. [2018-11-23 11:52:47,972 INFO L87 Difference]: Start difference. First operand 248 states. Second operand 239 states. [2018-11-23 11:52:47,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:47,977 INFO L93 Difference]: Finished difference Result 248 states and 347 transitions. [2018-11-23 11:52:47,977 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 347 transitions. [2018-11-23 11:52:47,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:47,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:47,978 INFO L74 IsIncluded]: Start isIncluded. First operand 239 states. Second operand 248 states. [2018-11-23 11:52:47,979 INFO L87 Difference]: Start difference. First operand 239 states. Second operand 248 states. [2018-11-23 11:52:47,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:47,984 INFO L93 Difference]: Finished difference Result 248 states and 347 transitions. [2018-11-23 11:52:47,984 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 347 transitions. [2018-11-23 11:52:47,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:47,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:47,985 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:47,985 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:47,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-11-23 11:52:47,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 334 transitions. [2018-11-23 11:52:47,990 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 334 transitions. Word has length 79 [2018-11-23 11:52:47,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:47,991 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 334 transitions. [2018-11-23 11:52:47,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 11:52:47,991 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 334 transitions. [2018-11-23 11:52:47,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-23 11:52:47,992 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:47,992 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:47,992 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:47,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:47,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1353822225, now seen corresponding path program 15 times [2018-11-23 11:52:47,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:47,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:47,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:47,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:47,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:48,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:48,619 INFO L256 TraceCheckUtils]: 0: Hoare triple {21867#true} call ULTIMATE.init(); {21867#true} is VALID [2018-11-23 11:52:48,619 INFO L273 TraceCheckUtils]: 1: Hoare triple {21867#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21867#true} is VALID [2018-11-23 11:52:48,619 INFO L273 TraceCheckUtils]: 2: Hoare triple {21867#true} assume true; {21867#true} is VALID [2018-11-23 11:52:48,619 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21867#true} {21867#true} #130#return; {21867#true} is VALID [2018-11-23 11:52:48,620 INFO L256 TraceCheckUtils]: 4: Hoare triple {21867#true} call #t~ret15 := main(); {21867#true} is VALID [2018-11-23 11:52:48,620 INFO L273 TraceCheckUtils]: 5: Hoare triple {21867#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {21869#(= main_~i~0 0)} is VALID [2018-11-23 11:52:48,620 INFO L273 TraceCheckUtils]: 6: Hoare triple {21869#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {21870#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:48,621 INFO L273 TraceCheckUtils]: 7: Hoare triple {21870#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21870#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:48,621 INFO L273 TraceCheckUtils]: 8: Hoare triple {21870#(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; {21870#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:48,622 INFO L273 TraceCheckUtils]: 9: Hoare triple {21870#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {21871#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:48,622 INFO L273 TraceCheckUtils]: 10: Hoare triple {21871#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21871#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:48,623 INFO L273 TraceCheckUtils]: 11: Hoare triple {21871#(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; {21871#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:48,624 INFO L273 TraceCheckUtils]: 12: Hoare triple {21871#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {21872#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:48,625 INFO L273 TraceCheckUtils]: 13: Hoare triple {21872#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21872#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:48,625 INFO L273 TraceCheckUtils]: 14: Hoare triple {21872#(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; {21872#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:48,626 INFO L273 TraceCheckUtils]: 15: Hoare triple {21872#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {21873#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:48,627 INFO L273 TraceCheckUtils]: 16: Hoare triple {21873#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21873#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:48,627 INFO L273 TraceCheckUtils]: 17: Hoare triple {21873#(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; {21873#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:48,628 INFO L273 TraceCheckUtils]: 18: Hoare triple {21873#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {21874#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:48,629 INFO L273 TraceCheckUtils]: 19: Hoare triple {21874#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21874#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:48,630 INFO L273 TraceCheckUtils]: 20: Hoare triple {21874#(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; {21874#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:48,631 INFO L273 TraceCheckUtils]: 21: Hoare triple {21874#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {21875#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:48,632 INFO L273 TraceCheckUtils]: 22: Hoare triple {21875#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21875#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:48,632 INFO L273 TraceCheckUtils]: 23: Hoare triple {21875#(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; {21875#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:48,633 INFO L273 TraceCheckUtils]: 24: Hoare triple {21875#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {21876#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:48,634 INFO L273 TraceCheckUtils]: 25: Hoare triple {21876#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21876#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:48,635 INFO L273 TraceCheckUtils]: 26: Hoare triple {21876#(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; {21876#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:48,635 INFO L273 TraceCheckUtils]: 27: Hoare triple {21876#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {21877#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:48,636 INFO L273 TraceCheckUtils]: 28: Hoare triple {21877#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21877#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:48,637 INFO L273 TraceCheckUtils]: 29: Hoare triple {21877#(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; {21877#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:48,638 INFO L273 TraceCheckUtils]: 30: Hoare triple {21877#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {21878#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:48,639 INFO L273 TraceCheckUtils]: 31: Hoare triple {21878#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21878#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:48,639 INFO L273 TraceCheckUtils]: 32: Hoare triple {21878#(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; {21878#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:48,640 INFO L273 TraceCheckUtils]: 33: Hoare triple {21878#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {21879#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:48,641 INFO L273 TraceCheckUtils]: 34: Hoare triple {21879#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21879#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:48,642 INFO L273 TraceCheckUtils]: 35: Hoare triple {21879#(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; {21879#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:48,642 INFO L273 TraceCheckUtils]: 36: Hoare triple {21879#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {21880#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:48,643 INFO L273 TraceCheckUtils]: 37: Hoare triple {21880#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21880#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:48,644 INFO L273 TraceCheckUtils]: 38: Hoare triple {21880#(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; {21880#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:48,645 INFO L273 TraceCheckUtils]: 39: Hoare triple {21880#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {21881#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:48,646 INFO L273 TraceCheckUtils]: 40: Hoare triple {21881#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21881#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:48,647 INFO L273 TraceCheckUtils]: 41: Hoare triple {21881#(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; {21881#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:48,647 INFO L273 TraceCheckUtils]: 42: Hoare triple {21881#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {21882#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:48,648 INFO L273 TraceCheckUtils]: 43: Hoare triple {21882#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21882#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:48,649 INFO L273 TraceCheckUtils]: 44: Hoare triple {21882#(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; {21882#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:48,650 INFO L273 TraceCheckUtils]: 45: Hoare triple {21882#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {21883#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:48,650 INFO L273 TraceCheckUtils]: 46: Hoare triple {21883#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21883#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:48,651 INFO L273 TraceCheckUtils]: 47: Hoare triple {21883#(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; {21883#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:48,652 INFO L273 TraceCheckUtils]: 48: Hoare triple {21883#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {21884#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:48,653 INFO L273 TraceCheckUtils]: 49: Hoare triple {21884#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21884#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:48,653 INFO L273 TraceCheckUtils]: 50: Hoare triple {21884#(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; {21884#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:48,654 INFO L273 TraceCheckUtils]: 51: Hoare triple {21884#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {21885#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:48,655 INFO L273 TraceCheckUtils]: 52: Hoare triple {21885#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21885#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:48,656 INFO L273 TraceCheckUtils]: 53: Hoare triple {21885#(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; {21885#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:48,657 INFO L273 TraceCheckUtils]: 54: Hoare triple {21885#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {21886#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:52:48,658 INFO L273 TraceCheckUtils]: 55: Hoare triple {21886#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21886#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:52:48,658 INFO L273 TraceCheckUtils]: 56: Hoare triple {21886#(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; {21886#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:52:48,659 INFO L273 TraceCheckUtils]: 57: Hoare triple {21886#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} ~k~0 := 1 + ~k~0; {21887#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:48,660 INFO L273 TraceCheckUtils]: 58: Hoare triple {21887#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21887#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:48,661 INFO L273 TraceCheckUtils]: 59: Hoare triple {21887#(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; {21887#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:48,661 INFO L273 TraceCheckUtils]: 60: Hoare triple {21887#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {21888#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:48,662 INFO L273 TraceCheckUtils]: 61: Hoare triple {21888#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21888#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:48,663 INFO L273 TraceCheckUtils]: 62: Hoare triple {21888#(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; {21888#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:48,664 INFO L273 TraceCheckUtils]: 63: Hoare triple {21888#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {21889#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:48,664 INFO L273 TraceCheckUtils]: 64: Hoare triple {21889#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} assume !(~k~0 < 100000); {21868#false} is VALID [2018-11-23 11:52:48,665 INFO L273 TraceCheckUtils]: 65: Hoare triple {21868#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21868#false} is VALID [2018-11-23 11:52:48,665 INFO L273 TraceCheckUtils]: 66: Hoare triple {21868#false} ~x~0 := 0; {21868#false} is VALID [2018-11-23 11:52:48,665 INFO L273 TraceCheckUtils]: 67: Hoare triple {21868#false} assume !(~x~0 < ~i~0); {21868#false} is VALID [2018-11-23 11:52:48,665 INFO L273 TraceCheckUtils]: 68: Hoare triple {21868#false} ~x~0 := 0; {21868#false} is VALID [2018-11-23 11:52:48,665 INFO L273 TraceCheckUtils]: 69: Hoare triple {21868#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21868#false} is VALID [2018-11-23 11:52:48,666 INFO L256 TraceCheckUtils]: 70: Hoare triple {21868#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {21867#true} is VALID [2018-11-23 11:52:48,666 INFO L273 TraceCheckUtils]: 71: Hoare triple {21867#true} ~cond := #in~cond; {21867#true} is VALID [2018-11-23 11:52:48,666 INFO L273 TraceCheckUtils]: 72: Hoare triple {21867#true} assume !(0 == ~cond); {21867#true} is VALID [2018-11-23 11:52:48,666 INFO L273 TraceCheckUtils]: 73: Hoare triple {21867#true} assume true; {21867#true} is VALID [2018-11-23 11:52:48,666 INFO L268 TraceCheckUtils]: 74: Hoare quadruple {21867#true} {21868#false} #136#return; {21868#false} is VALID [2018-11-23 11:52:48,667 INFO L273 TraceCheckUtils]: 75: Hoare triple {21868#false} havoc #t~mem9;havoc #t~mem10; {21868#false} is VALID [2018-11-23 11:52:48,667 INFO L273 TraceCheckUtils]: 76: Hoare triple {21868#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {21868#false} is VALID [2018-11-23 11:52:48,667 INFO L273 TraceCheckUtils]: 77: Hoare triple {21868#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21868#false} is VALID [2018-11-23 11:52:48,667 INFO L256 TraceCheckUtils]: 78: Hoare triple {21868#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {21868#false} is VALID [2018-11-23 11:52:48,667 INFO L273 TraceCheckUtils]: 79: Hoare triple {21868#false} ~cond := #in~cond; {21868#false} is VALID [2018-11-23 11:52:48,668 INFO L273 TraceCheckUtils]: 80: Hoare triple {21868#false} assume 0 == ~cond; {21868#false} is VALID [2018-11-23 11:52:48,668 INFO L273 TraceCheckUtils]: 81: Hoare triple {21868#false} assume !false; {21868#false} is VALID [2018-11-23 11:52:48,678 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 2 proven. 532 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:52:48,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:48,678 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:52:48,687 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:52:48,772 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-11-23 11:52:48,773 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:48,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:48,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:49,525 INFO L256 TraceCheckUtils]: 0: Hoare triple {21867#true} call ULTIMATE.init(); {21867#true} is VALID [2018-11-23 11:52:49,525 INFO L273 TraceCheckUtils]: 1: Hoare triple {21867#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21867#true} is VALID [2018-11-23 11:52:49,525 INFO L273 TraceCheckUtils]: 2: Hoare triple {21867#true} assume true; {21867#true} is VALID [2018-11-23 11:52:49,525 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21867#true} {21867#true} #130#return; {21867#true} is VALID [2018-11-23 11:52:49,526 INFO L256 TraceCheckUtils]: 4: Hoare triple {21867#true} call #t~ret15 := main(); {21867#true} is VALID [2018-11-23 11:52:49,526 INFO L273 TraceCheckUtils]: 5: Hoare triple {21867#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {21908#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:49,527 INFO L273 TraceCheckUtils]: 6: Hoare triple {21908#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {21912#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:49,527 INFO L273 TraceCheckUtils]: 7: Hoare triple {21912#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21912#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:49,528 INFO L273 TraceCheckUtils]: 8: Hoare triple {21912#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21912#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:49,528 INFO L273 TraceCheckUtils]: 9: Hoare triple {21912#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {21922#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:49,528 INFO L273 TraceCheckUtils]: 10: Hoare triple {21922#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21922#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:49,529 INFO L273 TraceCheckUtils]: 11: Hoare triple {21922#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21922#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:49,529 INFO L273 TraceCheckUtils]: 12: Hoare triple {21922#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {21932#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:49,529 INFO L273 TraceCheckUtils]: 13: Hoare triple {21932#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21932#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:49,530 INFO L273 TraceCheckUtils]: 14: Hoare triple {21932#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21932#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:49,531 INFO L273 TraceCheckUtils]: 15: Hoare triple {21932#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {21942#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:49,531 INFO L273 TraceCheckUtils]: 16: Hoare triple {21942#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21942#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:49,532 INFO L273 TraceCheckUtils]: 17: Hoare triple {21942#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21942#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:49,533 INFO L273 TraceCheckUtils]: 18: Hoare triple {21942#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {21952#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:49,533 INFO L273 TraceCheckUtils]: 19: Hoare triple {21952#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21952#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:49,534 INFO L273 TraceCheckUtils]: 20: Hoare triple {21952#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21952#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:49,534 INFO L273 TraceCheckUtils]: 21: Hoare triple {21952#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {21962#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:49,535 INFO L273 TraceCheckUtils]: 22: Hoare triple {21962#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21962#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:49,535 INFO L273 TraceCheckUtils]: 23: Hoare triple {21962#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21962#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:49,536 INFO L273 TraceCheckUtils]: 24: Hoare triple {21962#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {21972#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:49,537 INFO L273 TraceCheckUtils]: 25: Hoare triple {21972#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21972#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:49,537 INFO L273 TraceCheckUtils]: 26: Hoare triple {21972#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21972#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:49,538 INFO L273 TraceCheckUtils]: 27: Hoare triple {21972#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {21982#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:49,538 INFO L273 TraceCheckUtils]: 28: Hoare triple {21982#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21982#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:49,539 INFO L273 TraceCheckUtils]: 29: Hoare triple {21982#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21982#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:49,540 INFO L273 TraceCheckUtils]: 30: Hoare triple {21982#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {21992#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:49,540 INFO L273 TraceCheckUtils]: 31: Hoare triple {21992#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21992#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:49,541 INFO L273 TraceCheckUtils]: 32: Hoare triple {21992#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21992#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:49,541 INFO L273 TraceCheckUtils]: 33: Hoare triple {21992#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {22002#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:49,542 INFO L273 TraceCheckUtils]: 34: Hoare triple {22002#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22002#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:49,542 INFO L273 TraceCheckUtils]: 35: Hoare triple {22002#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22002#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:49,543 INFO L273 TraceCheckUtils]: 36: Hoare triple {22002#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {22012#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:49,544 INFO L273 TraceCheckUtils]: 37: Hoare triple {22012#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22012#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:49,544 INFO L273 TraceCheckUtils]: 38: Hoare triple {22012#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22012#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:49,545 INFO L273 TraceCheckUtils]: 39: Hoare triple {22012#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {22022#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:49,546 INFO L273 TraceCheckUtils]: 40: Hoare triple {22022#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22022#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:49,546 INFO L273 TraceCheckUtils]: 41: Hoare triple {22022#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22022#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:49,547 INFO L273 TraceCheckUtils]: 42: Hoare triple {22022#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {22032#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:49,547 INFO L273 TraceCheckUtils]: 43: Hoare triple {22032#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22032#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:49,548 INFO L273 TraceCheckUtils]: 44: Hoare triple {22032#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22032#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:49,549 INFO L273 TraceCheckUtils]: 45: Hoare triple {22032#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {22042#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:49,549 INFO L273 TraceCheckUtils]: 46: Hoare triple {22042#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22042#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:49,550 INFO L273 TraceCheckUtils]: 47: Hoare triple {22042#(<= main_~k~0 14)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22042#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:49,550 INFO L273 TraceCheckUtils]: 48: Hoare triple {22042#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {22052#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:49,551 INFO L273 TraceCheckUtils]: 49: Hoare triple {22052#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22052#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:49,551 INFO L273 TraceCheckUtils]: 50: Hoare triple {22052#(<= main_~k~0 15)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22052#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:49,552 INFO L273 TraceCheckUtils]: 51: Hoare triple {22052#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {22062#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:49,553 INFO L273 TraceCheckUtils]: 52: Hoare triple {22062#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22062#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:49,553 INFO L273 TraceCheckUtils]: 53: Hoare triple {22062#(<= main_~k~0 16)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22062#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:49,554 INFO L273 TraceCheckUtils]: 54: Hoare triple {22062#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {22072#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:49,554 INFO L273 TraceCheckUtils]: 55: Hoare triple {22072#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22072#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:49,555 INFO L273 TraceCheckUtils]: 56: Hoare triple {22072#(<= main_~k~0 17)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22072#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:49,556 INFO L273 TraceCheckUtils]: 57: Hoare triple {22072#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {22082#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:49,556 INFO L273 TraceCheckUtils]: 58: Hoare triple {22082#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22082#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:49,557 INFO L273 TraceCheckUtils]: 59: Hoare triple {22082#(<= main_~k~0 18)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22082#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:49,557 INFO L273 TraceCheckUtils]: 60: Hoare triple {22082#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {22092#(<= main_~k~0 19)} is VALID [2018-11-23 11:52:49,558 INFO L273 TraceCheckUtils]: 61: Hoare triple {22092#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22092#(<= main_~k~0 19)} is VALID [2018-11-23 11:52:49,558 INFO L273 TraceCheckUtils]: 62: Hoare triple {22092#(<= main_~k~0 19)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22092#(<= main_~k~0 19)} is VALID [2018-11-23 11:52:49,559 INFO L273 TraceCheckUtils]: 63: Hoare triple {22092#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {22102#(<= main_~k~0 20)} is VALID [2018-11-23 11:52:49,560 INFO L273 TraceCheckUtils]: 64: Hoare triple {22102#(<= main_~k~0 20)} assume !(~k~0 < 100000); {21868#false} is VALID [2018-11-23 11:52:49,560 INFO L273 TraceCheckUtils]: 65: Hoare triple {21868#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21868#false} is VALID [2018-11-23 11:52:49,560 INFO L273 TraceCheckUtils]: 66: Hoare triple {21868#false} ~x~0 := 0; {21868#false} is VALID [2018-11-23 11:52:49,560 INFO L273 TraceCheckUtils]: 67: Hoare triple {21868#false} assume !(~x~0 < ~i~0); {21868#false} is VALID [2018-11-23 11:52:49,561 INFO L273 TraceCheckUtils]: 68: Hoare triple {21868#false} ~x~0 := 0; {21868#false} is VALID [2018-11-23 11:52:49,561 INFO L273 TraceCheckUtils]: 69: Hoare triple {21868#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21868#false} is VALID [2018-11-23 11:52:49,561 INFO L256 TraceCheckUtils]: 70: Hoare triple {21868#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {21868#false} is VALID [2018-11-23 11:52:49,561 INFO L273 TraceCheckUtils]: 71: Hoare triple {21868#false} ~cond := #in~cond; {21868#false} is VALID [2018-11-23 11:52:49,561 INFO L273 TraceCheckUtils]: 72: Hoare triple {21868#false} assume !(0 == ~cond); {21868#false} is VALID [2018-11-23 11:52:49,562 INFO L273 TraceCheckUtils]: 73: Hoare triple {21868#false} assume true; {21868#false} is VALID [2018-11-23 11:52:49,562 INFO L268 TraceCheckUtils]: 74: Hoare quadruple {21868#false} {21868#false} #136#return; {21868#false} is VALID [2018-11-23 11:52:49,562 INFO L273 TraceCheckUtils]: 75: Hoare triple {21868#false} havoc #t~mem9;havoc #t~mem10; {21868#false} is VALID [2018-11-23 11:52:49,562 INFO L273 TraceCheckUtils]: 76: Hoare triple {21868#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {21868#false} is VALID [2018-11-23 11:52:49,562 INFO L273 TraceCheckUtils]: 77: Hoare triple {21868#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21868#false} is VALID [2018-11-23 11:52:49,562 INFO L256 TraceCheckUtils]: 78: Hoare triple {21868#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {21868#false} is VALID [2018-11-23 11:52:49,563 INFO L273 TraceCheckUtils]: 79: Hoare triple {21868#false} ~cond := #in~cond; {21868#false} is VALID [2018-11-23 11:52:49,563 INFO L273 TraceCheckUtils]: 80: Hoare triple {21868#false} assume 0 == ~cond; {21868#false} is VALID [2018-11-23 11:52:49,563 INFO L273 TraceCheckUtils]: 81: Hoare triple {21868#false} assume !false; {21868#false} is VALID [2018-11-23 11:52:49,567 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:52:49,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:49,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 44 [2018-11-23 11:52:49,588 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 82 [2018-11-23 11:52:49,588 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:49,588 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states. [2018-11-23 11:52:49,734 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-23 11:52:49,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-23 11:52:49,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-23 11:52:49,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=716, Invalid=1176, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 11:52:49,736 INFO L87 Difference]: Start difference. First operand 239 states and 334 transitions. Second operand 44 states. [2018-11-23 11:52:50,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:50,704 INFO L93 Difference]: Finished difference Result 372 states and 531 transitions. [2018-11-23 11:52:50,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 11:52:50,704 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 82 [2018-11-23 11:52:50,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:50,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 11:52:50,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 187 transitions. [2018-11-23 11:52:50,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 11:52:50,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 187 transitions. [2018-11-23 11:52:50,708 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 187 transitions. [2018-11-23 11:52:50,944 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:50,949 INFO L225 Difference]: With dead ends: 372 [2018-11-23 11:52:50,949 INFO L226 Difference]: Without dead ends: 254 [2018-11-23 11:52:50,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 62 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-23 11:52:50,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-11-23 11:52:51,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 245. [2018-11-23 11:52:51,169 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:51,169 INFO L82 GeneralOperation]: Start isEquivalent. First operand 254 states. Second operand 245 states. [2018-11-23 11:52:51,169 INFO L74 IsIncluded]: Start isIncluded. First operand 254 states. Second operand 245 states. [2018-11-23 11:52:51,169 INFO L87 Difference]: Start difference. First operand 254 states. Second operand 245 states. [2018-11-23 11:52:51,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:51,175 INFO L93 Difference]: Finished difference Result 254 states and 355 transitions. [2018-11-23 11:52:51,175 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 355 transitions. [2018-11-23 11:52:51,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:51,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:51,176 INFO L74 IsIncluded]: Start isIncluded. First operand 245 states. Second operand 254 states. [2018-11-23 11:52:51,176 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 254 states. [2018-11-23 11:52:51,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:51,181 INFO L93 Difference]: Finished difference Result 254 states and 355 transitions. [2018-11-23 11:52:51,181 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 355 transitions. [2018-11-23 11:52:51,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:51,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:51,182 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:51,182 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:51,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-11-23 11:52:51,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 342 transitions. [2018-11-23 11:52:51,187 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 342 transitions. Word has length 82 [2018-11-23 11:52:51,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:51,188 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 342 transitions. [2018-11-23 11:52:51,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-23 11:52:51,188 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 342 transitions. [2018-11-23 11:52:51,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-23 11:52:51,188 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:51,189 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:51,189 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:51,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:51,189 INFO L82 PathProgramCache]: Analyzing trace with hash 811230924, now seen corresponding path program 16 times [2018-11-23 11:52:51,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:51,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:51,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:51,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:51,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:51,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:52,148 INFO L256 TraceCheckUtils]: 0: Hoare triple {23504#true} call ULTIMATE.init(); {23504#true} is VALID [2018-11-23 11:52:52,148 INFO L273 TraceCheckUtils]: 1: Hoare triple {23504#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23504#true} is VALID [2018-11-23 11:52:52,148 INFO L273 TraceCheckUtils]: 2: Hoare triple {23504#true} assume true; {23504#true} is VALID [2018-11-23 11:52:52,149 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23504#true} {23504#true} #130#return; {23504#true} is VALID [2018-11-23 11:52:52,149 INFO L256 TraceCheckUtils]: 4: Hoare triple {23504#true} call #t~ret15 := main(); {23504#true} is VALID [2018-11-23 11:52:52,149 INFO L273 TraceCheckUtils]: 5: Hoare triple {23504#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {23506#(= main_~i~0 0)} is VALID [2018-11-23 11:52:52,150 INFO L273 TraceCheckUtils]: 6: Hoare triple {23506#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {23507#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:52,151 INFO L273 TraceCheckUtils]: 7: Hoare triple {23507#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23507#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:52,151 INFO L273 TraceCheckUtils]: 8: Hoare triple {23507#(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; {23507#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:52,152 INFO L273 TraceCheckUtils]: 9: Hoare triple {23507#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {23508#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:52,152 INFO L273 TraceCheckUtils]: 10: Hoare triple {23508#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23508#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:52,153 INFO L273 TraceCheckUtils]: 11: Hoare triple {23508#(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; {23508#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:52,153 INFO L273 TraceCheckUtils]: 12: Hoare triple {23508#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {23509#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:52,154 INFO L273 TraceCheckUtils]: 13: Hoare triple {23509#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23509#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:52,154 INFO L273 TraceCheckUtils]: 14: Hoare triple {23509#(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; {23509#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:52,155 INFO L273 TraceCheckUtils]: 15: Hoare triple {23509#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {23510#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:52,156 INFO L273 TraceCheckUtils]: 16: Hoare triple {23510#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23510#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:52,157 INFO L273 TraceCheckUtils]: 17: Hoare triple {23510#(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; {23510#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:52,157 INFO L273 TraceCheckUtils]: 18: Hoare triple {23510#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {23511#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:52,158 INFO L273 TraceCheckUtils]: 19: Hoare triple {23511#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23511#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:52,159 INFO L273 TraceCheckUtils]: 20: Hoare triple {23511#(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; {23511#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:52,160 INFO L273 TraceCheckUtils]: 21: Hoare triple {23511#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {23512#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:52,161 INFO L273 TraceCheckUtils]: 22: Hoare triple {23512#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23512#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:52,162 INFO L273 TraceCheckUtils]: 23: Hoare triple {23512#(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; {23512#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:52,162 INFO L273 TraceCheckUtils]: 24: Hoare triple {23512#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {23513#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:52,163 INFO L273 TraceCheckUtils]: 25: Hoare triple {23513#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23513#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:52,164 INFO L273 TraceCheckUtils]: 26: Hoare triple {23513#(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; {23513#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:52,165 INFO L273 TraceCheckUtils]: 27: Hoare triple {23513#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {23514#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:52,165 INFO L273 TraceCheckUtils]: 28: Hoare triple {23514#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23514#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:52,166 INFO L273 TraceCheckUtils]: 29: Hoare triple {23514#(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; {23514#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:52,167 INFO L273 TraceCheckUtils]: 30: Hoare triple {23514#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {23515#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:52,168 INFO L273 TraceCheckUtils]: 31: Hoare triple {23515#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23515#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:52,168 INFO L273 TraceCheckUtils]: 32: Hoare triple {23515#(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; {23515#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:52,169 INFO L273 TraceCheckUtils]: 33: Hoare triple {23515#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {23516#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:52,170 INFO L273 TraceCheckUtils]: 34: Hoare triple {23516#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23516#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:52,171 INFO L273 TraceCheckUtils]: 35: Hoare triple {23516#(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; {23516#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:52,171 INFO L273 TraceCheckUtils]: 36: Hoare triple {23516#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {23517#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:52,172 INFO L273 TraceCheckUtils]: 37: Hoare triple {23517#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23517#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:52,173 INFO L273 TraceCheckUtils]: 38: Hoare triple {23517#(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; {23517#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:52,174 INFO L273 TraceCheckUtils]: 39: Hoare triple {23517#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {23518#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:52,175 INFO L273 TraceCheckUtils]: 40: Hoare triple {23518#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23518#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:52,176 INFO L273 TraceCheckUtils]: 41: Hoare triple {23518#(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; {23518#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:52,176 INFO L273 TraceCheckUtils]: 42: Hoare triple {23518#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {23519#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:52,177 INFO L273 TraceCheckUtils]: 43: Hoare triple {23519#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23519#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:52,178 INFO L273 TraceCheckUtils]: 44: Hoare triple {23519#(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; {23519#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:52,179 INFO L273 TraceCheckUtils]: 45: Hoare triple {23519#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {23520#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:52,179 INFO L273 TraceCheckUtils]: 46: Hoare triple {23520#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23520#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:52,180 INFO L273 TraceCheckUtils]: 47: Hoare triple {23520#(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; {23520#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:52,181 INFO L273 TraceCheckUtils]: 48: Hoare triple {23520#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {23521#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:52,182 INFO L273 TraceCheckUtils]: 49: Hoare triple {23521#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23521#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:52,182 INFO L273 TraceCheckUtils]: 50: Hoare triple {23521#(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; {23521#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:52,183 INFO L273 TraceCheckUtils]: 51: Hoare triple {23521#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {23522#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:52,184 INFO L273 TraceCheckUtils]: 52: Hoare triple {23522#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23522#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:52,185 INFO L273 TraceCheckUtils]: 53: Hoare triple {23522#(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; {23522#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:52,186 INFO L273 TraceCheckUtils]: 54: Hoare triple {23522#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {23523#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:52:52,186 INFO L273 TraceCheckUtils]: 55: Hoare triple {23523#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23523#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:52:52,187 INFO L273 TraceCheckUtils]: 56: Hoare triple {23523#(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; {23523#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:52:52,188 INFO L273 TraceCheckUtils]: 57: Hoare triple {23523#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} ~k~0 := 1 + ~k~0; {23524#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:52,189 INFO L273 TraceCheckUtils]: 58: Hoare triple {23524#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23524#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:52,190 INFO L273 TraceCheckUtils]: 59: Hoare triple {23524#(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; {23524#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:52,190 INFO L273 TraceCheckUtils]: 60: Hoare triple {23524#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {23525#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:52,191 INFO L273 TraceCheckUtils]: 61: Hoare triple {23525#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23525#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:52,192 INFO L273 TraceCheckUtils]: 62: Hoare triple {23525#(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; {23525#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:52,193 INFO L273 TraceCheckUtils]: 63: Hoare triple {23525#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {23526#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:52,194 INFO L273 TraceCheckUtils]: 64: Hoare triple {23526#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23526#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:52,194 INFO L273 TraceCheckUtils]: 65: Hoare triple {23526#(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; {23526#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:52,195 INFO L273 TraceCheckUtils]: 66: Hoare triple {23526#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {23527#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:52,196 INFO L273 TraceCheckUtils]: 67: Hoare triple {23527#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} assume !(~k~0 < 100000); {23505#false} is VALID [2018-11-23 11:52:52,196 INFO L273 TraceCheckUtils]: 68: Hoare triple {23505#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23505#false} is VALID [2018-11-23 11:52:52,196 INFO L273 TraceCheckUtils]: 69: Hoare triple {23505#false} ~x~0 := 0; {23505#false} is VALID [2018-11-23 11:52:52,196 INFO L273 TraceCheckUtils]: 70: Hoare triple {23505#false} assume !(~x~0 < ~i~0); {23505#false} is VALID [2018-11-23 11:52:52,196 INFO L273 TraceCheckUtils]: 71: Hoare triple {23505#false} ~x~0 := 0; {23505#false} is VALID [2018-11-23 11:52:52,197 INFO L273 TraceCheckUtils]: 72: Hoare triple {23505#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23505#false} is VALID [2018-11-23 11:52:52,197 INFO L256 TraceCheckUtils]: 73: Hoare triple {23505#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {23504#true} is VALID [2018-11-23 11:52:52,197 INFO L273 TraceCheckUtils]: 74: Hoare triple {23504#true} ~cond := #in~cond; {23504#true} is VALID [2018-11-23 11:52:52,197 INFO L273 TraceCheckUtils]: 75: Hoare triple {23504#true} assume !(0 == ~cond); {23504#true} is VALID [2018-11-23 11:52:52,197 INFO L273 TraceCheckUtils]: 76: Hoare triple {23504#true} assume true; {23504#true} is VALID [2018-11-23 11:52:52,198 INFO L268 TraceCheckUtils]: 77: Hoare quadruple {23504#true} {23505#false} #136#return; {23505#false} is VALID [2018-11-23 11:52:52,198 INFO L273 TraceCheckUtils]: 78: Hoare triple {23505#false} havoc #t~mem9;havoc #t~mem10; {23505#false} is VALID [2018-11-23 11:52:52,198 INFO L273 TraceCheckUtils]: 79: Hoare triple {23505#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {23505#false} is VALID [2018-11-23 11:52:52,198 INFO L273 TraceCheckUtils]: 80: Hoare triple {23505#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23505#false} is VALID [2018-11-23 11:52:52,198 INFO L256 TraceCheckUtils]: 81: Hoare triple {23505#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {23505#false} is VALID [2018-11-23 11:52:52,198 INFO L273 TraceCheckUtils]: 82: Hoare triple {23505#false} ~cond := #in~cond; {23505#false} is VALID [2018-11-23 11:52:52,199 INFO L273 TraceCheckUtils]: 83: Hoare triple {23505#false} assume 0 == ~cond; {23505#false} is VALID [2018-11-23 11:52:52,199 INFO L273 TraceCheckUtils]: 84: Hoare triple {23505#false} assume !false; {23505#false} is VALID [2018-11-23 11:52:52,209 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 2 proven. 590 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:52:52,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:52,209 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:52:52,218 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:52:52,264 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:52:52,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:52,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:52,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:52,812 INFO L256 TraceCheckUtils]: 0: Hoare triple {23504#true} call ULTIMATE.init(); {23504#true} is VALID [2018-11-23 11:52:52,812 INFO L273 TraceCheckUtils]: 1: Hoare triple {23504#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23504#true} is VALID [2018-11-23 11:52:52,812 INFO L273 TraceCheckUtils]: 2: Hoare triple {23504#true} assume true; {23504#true} is VALID [2018-11-23 11:52:52,813 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23504#true} {23504#true} #130#return; {23504#true} is VALID [2018-11-23 11:52:52,813 INFO L256 TraceCheckUtils]: 4: Hoare triple {23504#true} call #t~ret15 := main(); {23504#true} is VALID [2018-11-23 11:52:52,814 INFO L273 TraceCheckUtils]: 5: Hoare triple {23504#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {23546#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:52,814 INFO L273 TraceCheckUtils]: 6: Hoare triple {23546#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {23550#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:52,814 INFO L273 TraceCheckUtils]: 7: Hoare triple {23550#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23550#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:52,815 INFO L273 TraceCheckUtils]: 8: Hoare triple {23550#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23550#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:52,815 INFO L273 TraceCheckUtils]: 9: Hoare triple {23550#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {23560#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:52,815 INFO L273 TraceCheckUtils]: 10: Hoare triple {23560#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23560#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:52,816 INFO L273 TraceCheckUtils]: 11: Hoare triple {23560#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23560#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:52,816 INFO L273 TraceCheckUtils]: 12: Hoare triple {23560#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {23570#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:52,816 INFO L273 TraceCheckUtils]: 13: Hoare triple {23570#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23570#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:52,817 INFO L273 TraceCheckUtils]: 14: Hoare triple {23570#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23570#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:52,818 INFO L273 TraceCheckUtils]: 15: Hoare triple {23570#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {23580#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:52,818 INFO L273 TraceCheckUtils]: 16: Hoare triple {23580#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23580#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:52,819 INFO L273 TraceCheckUtils]: 17: Hoare triple {23580#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23580#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:52,820 INFO L273 TraceCheckUtils]: 18: Hoare triple {23580#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {23590#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:52,820 INFO L273 TraceCheckUtils]: 19: Hoare triple {23590#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23590#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:52,821 INFO L273 TraceCheckUtils]: 20: Hoare triple {23590#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23590#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:52,821 INFO L273 TraceCheckUtils]: 21: Hoare triple {23590#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {23600#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:52,822 INFO L273 TraceCheckUtils]: 22: Hoare triple {23600#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23600#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:52,822 INFO L273 TraceCheckUtils]: 23: Hoare triple {23600#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23600#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:52,823 INFO L273 TraceCheckUtils]: 24: Hoare triple {23600#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {23610#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:52,824 INFO L273 TraceCheckUtils]: 25: Hoare triple {23610#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23610#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:52,824 INFO L273 TraceCheckUtils]: 26: Hoare triple {23610#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23610#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:52,825 INFO L273 TraceCheckUtils]: 27: Hoare triple {23610#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {23620#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:52,825 INFO L273 TraceCheckUtils]: 28: Hoare triple {23620#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23620#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:52,826 INFO L273 TraceCheckUtils]: 29: Hoare triple {23620#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23620#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:52,827 INFO L273 TraceCheckUtils]: 30: Hoare triple {23620#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {23630#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:52,827 INFO L273 TraceCheckUtils]: 31: Hoare triple {23630#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23630#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:52,828 INFO L273 TraceCheckUtils]: 32: Hoare triple {23630#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23630#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:52,829 INFO L273 TraceCheckUtils]: 33: Hoare triple {23630#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {23640#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:52,829 INFO L273 TraceCheckUtils]: 34: Hoare triple {23640#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23640#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:52,830 INFO L273 TraceCheckUtils]: 35: Hoare triple {23640#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23640#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:52,830 INFO L273 TraceCheckUtils]: 36: Hoare triple {23640#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {23650#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:52,831 INFO L273 TraceCheckUtils]: 37: Hoare triple {23650#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23650#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:52,831 INFO L273 TraceCheckUtils]: 38: Hoare triple {23650#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23650#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:52,832 INFO L273 TraceCheckUtils]: 39: Hoare triple {23650#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {23660#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:52,833 INFO L273 TraceCheckUtils]: 40: Hoare triple {23660#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23660#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:52,833 INFO L273 TraceCheckUtils]: 41: Hoare triple {23660#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23660#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:52,834 INFO L273 TraceCheckUtils]: 42: Hoare triple {23660#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {23670#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:52,835 INFO L273 TraceCheckUtils]: 43: Hoare triple {23670#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23670#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:52,835 INFO L273 TraceCheckUtils]: 44: Hoare triple {23670#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23670#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:52,836 INFO L273 TraceCheckUtils]: 45: Hoare triple {23670#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {23680#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:52,836 INFO L273 TraceCheckUtils]: 46: Hoare triple {23680#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23680#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:52,837 INFO L273 TraceCheckUtils]: 47: Hoare triple {23680#(<= main_~k~0 14)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23680#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:52,838 INFO L273 TraceCheckUtils]: 48: Hoare triple {23680#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {23690#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:52,838 INFO L273 TraceCheckUtils]: 49: Hoare triple {23690#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23690#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:52,839 INFO L273 TraceCheckUtils]: 50: Hoare triple {23690#(<= main_~k~0 15)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23690#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:52,839 INFO L273 TraceCheckUtils]: 51: Hoare triple {23690#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {23700#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:52,840 INFO L273 TraceCheckUtils]: 52: Hoare triple {23700#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23700#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:52,840 INFO L273 TraceCheckUtils]: 53: Hoare triple {23700#(<= main_~k~0 16)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23700#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:52,841 INFO L273 TraceCheckUtils]: 54: Hoare triple {23700#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {23710#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:52,842 INFO L273 TraceCheckUtils]: 55: Hoare triple {23710#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23710#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:52,842 INFO L273 TraceCheckUtils]: 56: Hoare triple {23710#(<= main_~k~0 17)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23710#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:52,843 INFO L273 TraceCheckUtils]: 57: Hoare triple {23710#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {23720#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:52,843 INFO L273 TraceCheckUtils]: 58: Hoare triple {23720#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23720#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:52,844 INFO L273 TraceCheckUtils]: 59: Hoare triple {23720#(<= main_~k~0 18)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23720#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:52,845 INFO L273 TraceCheckUtils]: 60: Hoare triple {23720#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {23730#(<= main_~k~0 19)} is VALID [2018-11-23 11:52:52,845 INFO L273 TraceCheckUtils]: 61: Hoare triple {23730#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23730#(<= main_~k~0 19)} is VALID [2018-11-23 11:52:52,846 INFO L273 TraceCheckUtils]: 62: Hoare triple {23730#(<= main_~k~0 19)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23730#(<= main_~k~0 19)} is VALID [2018-11-23 11:52:52,846 INFO L273 TraceCheckUtils]: 63: Hoare triple {23730#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {23740#(<= main_~k~0 20)} is VALID [2018-11-23 11:52:52,847 INFO L273 TraceCheckUtils]: 64: Hoare triple {23740#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23740#(<= main_~k~0 20)} is VALID [2018-11-23 11:52:52,847 INFO L273 TraceCheckUtils]: 65: Hoare triple {23740#(<= main_~k~0 20)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23740#(<= main_~k~0 20)} is VALID [2018-11-23 11:52:52,848 INFO L273 TraceCheckUtils]: 66: Hoare triple {23740#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {23750#(<= main_~k~0 21)} is VALID [2018-11-23 11:52:52,849 INFO L273 TraceCheckUtils]: 67: Hoare triple {23750#(<= main_~k~0 21)} assume !(~k~0 < 100000); {23505#false} is VALID [2018-11-23 11:52:52,849 INFO L273 TraceCheckUtils]: 68: Hoare triple {23505#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23505#false} is VALID [2018-11-23 11:52:52,849 INFO L273 TraceCheckUtils]: 69: Hoare triple {23505#false} ~x~0 := 0; {23505#false} is VALID [2018-11-23 11:52:52,849 INFO L273 TraceCheckUtils]: 70: Hoare triple {23505#false} assume !(~x~0 < ~i~0); {23505#false} is VALID [2018-11-23 11:52:52,849 INFO L273 TraceCheckUtils]: 71: Hoare triple {23505#false} ~x~0 := 0; {23505#false} is VALID [2018-11-23 11:52:52,850 INFO L273 TraceCheckUtils]: 72: Hoare triple {23505#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23505#false} is VALID [2018-11-23 11:52:52,850 INFO L256 TraceCheckUtils]: 73: Hoare triple {23505#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {23505#false} is VALID [2018-11-23 11:52:52,850 INFO L273 TraceCheckUtils]: 74: Hoare triple {23505#false} ~cond := #in~cond; {23505#false} is VALID [2018-11-23 11:52:52,850 INFO L273 TraceCheckUtils]: 75: Hoare triple {23505#false} assume !(0 == ~cond); {23505#false} is VALID [2018-11-23 11:52:52,850 INFO L273 TraceCheckUtils]: 76: Hoare triple {23505#false} assume true; {23505#false} is VALID [2018-11-23 11:52:52,851 INFO L268 TraceCheckUtils]: 77: Hoare quadruple {23505#false} {23505#false} #136#return; {23505#false} is VALID [2018-11-23 11:52:52,851 INFO L273 TraceCheckUtils]: 78: Hoare triple {23505#false} havoc #t~mem9;havoc #t~mem10; {23505#false} is VALID [2018-11-23 11:52:52,851 INFO L273 TraceCheckUtils]: 79: Hoare triple {23505#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {23505#false} is VALID [2018-11-23 11:52:52,851 INFO L273 TraceCheckUtils]: 80: Hoare triple {23505#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23505#false} is VALID [2018-11-23 11:52:52,851 INFO L256 TraceCheckUtils]: 81: Hoare triple {23505#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {23505#false} is VALID [2018-11-23 11:52:52,851 INFO L273 TraceCheckUtils]: 82: Hoare triple {23505#false} ~cond := #in~cond; {23505#false} is VALID [2018-11-23 11:52:52,852 INFO L273 TraceCheckUtils]: 83: Hoare triple {23505#false} assume 0 == ~cond; {23505#false} is VALID [2018-11-23 11:52:52,852 INFO L273 TraceCheckUtils]: 84: Hoare triple {23505#false} assume !false; {23505#false} is VALID [2018-11-23 11:52:52,857 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:52:52,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:52,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2018-11-23 11:52:52,876 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 85 [2018-11-23 11:52:52,877 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:52,877 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states. [2018-11-23 11:52:53,026 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:53,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-23 11:52:53,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-23 11:52:53,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=1287, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 11:52:53,028 INFO L87 Difference]: Start difference. First operand 245 states and 342 transitions. Second operand 46 states. [2018-11-23 11:52:53,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:53,898 INFO L93 Difference]: Finished difference Result 378 states and 539 transitions. [2018-11-23 11:52:53,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 11:52:53,898 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 85 [2018-11-23 11:52:53,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:53,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 11:52:53,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 191 transitions. [2018-11-23 11:52:53,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 11:52:53,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 191 transitions. [2018-11-23 11:52:53,901 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 191 transitions. [2018-11-23 11:52:54,083 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:54,089 INFO L225 Difference]: With dead ends: 378 [2018-11-23 11:52:54,090 INFO L226 Difference]: Without dead ends: 260 [2018-11-23 11:52:54,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 694 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=783, Invalid=1287, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 11:52:54,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-11-23 11:52:54,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 251. [2018-11-23 11:52:54,581 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:54,582 INFO L82 GeneralOperation]: Start isEquivalent. First operand 260 states. Second operand 251 states. [2018-11-23 11:52:54,582 INFO L74 IsIncluded]: Start isIncluded. First operand 260 states. Second operand 251 states. [2018-11-23 11:52:54,582 INFO L87 Difference]: Start difference. First operand 260 states. Second operand 251 states. [2018-11-23 11:52:54,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:54,587 INFO L93 Difference]: Finished difference Result 260 states and 363 transitions. [2018-11-23 11:52:54,587 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 363 transitions. [2018-11-23 11:52:54,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:54,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:54,588 INFO L74 IsIncluded]: Start isIncluded. First operand 251 states. Second operand 260 states. [2018-11-23 11:52:54,588 INFO L87 Difference]: Start difference. First operand 251 states. Second operand 260 states. [2018-11-23 11:52:54,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:54,593 INFO L93 Difference]: Finished difference Result 260 states and 363 transitions. [2018-11-23 11:52:54,594 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 363 transitions. [2018-11-23 11:52:54,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:54,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:54,594 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:54,594 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:54,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-11-23 11:52:54,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 350 transitions. [2018-11-23 11:52:54,599 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 350 transitions. Word has length 85 [2018-11-23 11:52:54,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:54,599 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 350 transitions. [2018-11-23 11:52:54,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-23 11:52:54,599 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 350 transitions. [2018-11-23 11:52:54,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-23 11:52:54,600 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:54,600 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:54,600 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:54,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:54,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1564282319, now seen corresponding path program 17 times [2018-11-23 11:52:54,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:54,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:54,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:54,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:54,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:54,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:55,196 INFO L256 TraceCheckUtils]: 0: Hoare triple {25180#true} call ULTIMATE.init(); {25180#true} is VALID [2018-11-23 11:52:55,196 INFO L273 TraceCheckUtils]: 1: Hoare triple {25180#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {25180#true} is VALID [2018-11-23 11:52:55,196 INFO L273 TraceCheckUtils]: 2: Hoare triple {25180#true} assume true; {25180#true} is VALID [2018-11-23 11:52:55,196 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25180#true} {25180#true} #130#return; {25180#true} is VALID [2018-11-23 11:52:55,197 INFO L256 TraceCheckUtils]: 4: Hoare triple {25180#true} call #t~ret15 := main(); {25180#true} is VALID [2018-11-23 11:52:55,197 INFO L273 TraceCheckUtils]: 5: Hoare triple {25180#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {25182#(= main_~i~0 0)} is VALID [2018-11-23 11:52:55,197 INFO L273 TraceCheckUtils]: 6: Hoare triple {25182#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {25183#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,198 INFO L273 TraceCheckUtils]: 7: Hoare triple {25183#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25183#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,198 INFO L273 TraceCheckUtils]: 8: Hoare triple {25183#(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; {25183#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,199 INFO L273 TraceCheckUtils]: 9: Hoare triple {25183#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {25184#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,199 INFO L273 TraceCheckUtils]: 10: Hoare triple {25184#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25184#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,200 INFO L273 TraceCheckUtils]: 11: Hoare triple {25184#(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; {25184#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,200 INFO L273 TraceCheckUtils]: 12: Hoare triple {25184#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {25185#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,201 INFO L273 TraceCheckUtils]: 13: Hoare triple {25185#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25185#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,201 INFO L273 TraceCheckUtils]: 14: Hoare triple {25185#(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; {25185#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,202 INFO L273 TraceCheckUtils]: 15: Hoare triple {25185#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {25186#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,203 INFO L273 TraceCheckUtils]: 16: Hoare triple {25186#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25186#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,203 INFO L273 TraceCheckUtils]: 17: Hoare triple {25186#(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; {25186#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,204 INFO L273 TraceCheckUtils]: 18: Hoare triple {25186#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {25187#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,205 INFO L273 TraceCheckUtils]: 19: Hoare triple {25187#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25187#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,206 INFO L273 TraceCheckUtils]: 20: Hoare triple {25187#(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; {25187#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,207 INFO L273 TraceCheckUtils]: 21: Hoare triple {25187#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {25188#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,207 INFO L273 TraceCheckUtils]: 22: Hoare triple {25188#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25188#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,208 INFO L273 TraceCheckUtils]: 23: Hoare triple {25188#(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; {25188#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,209 INFO L273 TraceCheckUtils]: 24: Hoare triple {25188#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {25189#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,210 INFO L273 TraceCheckUtils]: 25: Hoare triple {25189#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25189#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,210 INFO L273 TraceCheckUtils]: 26: Hoare triple {25189#(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; {25189#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,211 INFO L273 TraceCheckUtils]: 27: Hoare triple {25189#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {25190#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,212 INFO L273 TraceCheckUtils]: 28: Hoare triple {25190#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25190#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,212 INFO L273 TraceCheckUtils]: 29: Hoare triple {25190#(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; {25190#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,213 INFO L273 TraceCheckUtils]: 30: Hoare triple {25190#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {25191#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,214 INFO L273 TraceCheckUtils]: 31: Hoare triple {25191#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25191#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,215 INFO L273 TraceCheckUtils]: 32: Hoare triple {25191#(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; {25191#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,215 INFO L273 TraceCheckUtils]: 33: Hoare triple {25191#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {25192#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,216 INFO L273 TraceCheckUtils]: 34: Hoare triple {25192#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25192#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,217 INFO L273 TraceCheckUtils]: 35: Hoare triple {25192#(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; {25192#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,218 INFO L273 TraceCheckUtils]: 36: Hoare triple {25192#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {25193#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,219 INFO L273 TraceCheckUtils]: 37: Hoare triple {25193#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25193#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,219 INFO L273 TraceCheckUtils]: 38: Hoare triple {25193#(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; {25193#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,220 INFO L273 TraceCheckUtils]: 39: Hoare triple {25193#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {25194#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,221 INFO L273 TraceCheckUtils]: 40: Hoare triple {25194#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25194#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,222 INFO L273 TraceCheckUtils]: 41: Hoare triple {25194#(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; {25194#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,222 INFO L273 TraceCheckUtils]: 42: Hoare triple {25194#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {25195#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,223 INFO L273 TraceCheckUtils]: 43: Hoare triple {25195#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25195#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,224 INFO L273 TraceCheckUtils]: 44: Hoare triple {25195#(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; {25195#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,225 INFO L273 TraceCheckUtils]: 45: Hoare triple {25195#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {25196#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,225 INFO L273 TraceCheckUtils]: 46: Hoare triple {25196#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25196#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,226 INFO L273 TraceCheckUtils]: 47: Hoare triple {25196#(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; {25196#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,227 INFO L273 TraceCheckUtils]: 48: Hoare triple {25196#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {25197#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,228 INFO L273 TraceCheckUtils]: 49: Hoare triple {25197#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25197#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,228 INFO L273 TraceCheckUtils]: 50: Hoare triple {25197#(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; {25197#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,229 INFO L273 TraceCheckUtils]: 51: Hoare triple {25197#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {25198#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,230 INFO L273 TraceCheckUtils]: 52: Hoare triple {25198#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25198#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,231 INFO L273 TraceCheckUtils]: 53: Hoare triple {25198#(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; {25198#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,232 INFO L273 TraceCheckUtils]: 54: Hoare triple {25198#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {25199#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:52:55,232 INFO L273 TraceCheckUtils]: 55: Hoare triple {25199#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25199#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:52:55,233 INFO L273 TraceCheckUtils]: 56: Hoare triple {25199#(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; {25199#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:52:55,234 INFO L273 TraceCheckUtils]: 57: Hoare triple {25199#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} ~k~0 := 1 + ~k~0; {25200#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,235 INFO L273 TraceCheckUtils]: 58: Hoare triple {25200#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25200#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,235 INFO L273 TraceCheckUtils]: 59: Hoare triple {25200#(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; {25200#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,236 INFO L273 TraceCheckUtils]: 60: Hoare triple {25200#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {25201#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,237 INFO L273 TraceCheckUtils]: 61: Hoare triple {25201#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25201#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,237 INFO L273 TraceCheckUtils]: 62: Hoare triple {25201#(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; {25201#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,238 INFO L273 TraceCheckUtils]: 63: Hoare triple {25201#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {25202#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,239 INFO L273 TraceCheckUtils]: 64: Hoare triple {25202#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25202#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,240 INFO L273 TraceCheckUtils]: 65: Hoare triple {25202#(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; {25202#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,240 INFO L273 TraceCheckUtils]: 66: Hoare triple {25202#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {25203#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,241 INFO L273 TraceCheckUtils]: 67: Hoare triple {25203#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25203#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,242 INFO L273 TraceCheckUtils]: 68: Hoare triple {25203#(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; {25203#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,243 INFO L273 TraceCheckUtils]: 69: Hoare triple {25203#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {25204#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:55,243 INFO L273 TraceCheckUtils]: 70: Hoare triple {25204#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} assume !(~k~0 < 100000); {25181#false} is VALID [2018-11-23 11:52:55,244 INFO L273 TraceCheckUtils]: 71: Hoare triple {25181#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25181#false} is VALID [2018-11-23 11:52:55,244 INFO L273 TraceCheckUtils]: 72: Hoare triple {25181#false} ~x~0 := 0; {25181#false} is VALID [2018-11-23 11:52:55,244 INFO L273 TraceCheckUtils]: 73: Hoare triple {25181#false} assume !(~x~0 < ~i~0); {25181#false} is VALID [2018-11-23 11:52:55,244 INFO L273 TraceCheckUtils]: 74: Hoare triple {25181#false} ~x~0 := 0; {25181#false} is VALID [2018-11-23 11:52:55,244 INFO L273 TraceCheckUtils]: 75: Hoare triple {25181#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25181#false} is VALID [2018-11-23 11:52:55,244 INFO L256 TraceCheckUtils]: 76: Hoare triple {25181#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {25180#true} is VALID [2018-11-23 11:52:55,245 INFO L273 TraceCheckUtils]: 77: Hoare triple {25180#true} ~cond := #in~cond; {25180#true} is VALID [2018-11-23 11:52:55,245 INFO L273 TraceCheckUtils]: 78: Hoare triple {25180#true} assume !(0 == ~cond); {25180#true} is VALID [2018-11-23 11:52:55,245 INFO L273 TraceCheckUtils]: 79: Hoare triple {25180#true} assume true; {25180#true} is VALID [2018-11-23 11:52:55,245 INFO L268 TraceCheckUtils]: 80: Hoare quadruple {25180#true} {25181#false} #136#return; {25181#false} is VALID [2018-11-23 11:52:55,245 INFO L273 TraceCheckUtils]: 81: Hoare triple {25181#false} havoc #t~mem9;havoc #t~mem10; {25181#false} is VALID [2018-11-23 11:52:55,246 INFO L273 TraceCheckUtils]: 82: Hoare triple {25181#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {25181#false} is VALID [2018-11-23 11:52:55,246 INFO L273 TraceCheckUtils]: 83: Hoare triple {25181#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25181#false} is VALID [2018-11-23 11:52:55,246 INFO L256 TraceCheckUtils]: 84: Hoare triple {25181#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {25181#false} is VALID [2018-11-23 11:52:55,246 INFO L273 TraceCheckUtils]: 85: Hoare triple {25181#false} ~cond := #in~cond; {25181#false} is VALID [2018-11-23 11:52:55,246 INFO L273 TraceCheckUtils]: 86: Hoare triple {25181#false} assume 0 == ~cond; {25181#false} is VALID [2018-11-23 11:52:55,247 INFO L273 TraceCheckUtils]: 87: Hoare triple {25181#false} assume !false; {25181#false} is VALID [2018-11-23 11:52:55,258 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 2 proven. 651 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:52:55,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:55,258 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:52:55,267 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:52:55,342 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2018-11-23 11:52:55,342 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:55,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:55,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:55,916 INFO L256 TraceCheckUtils]: 0: Hoare triple {25180#true} call ULTIMATE.init(); {25180#true} is VALID [2018-11-23 11:52:55,917 INFO L273 TraceCheckUtils]: 1: Hoare triple {25180#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {25180#true} is VALID [2018-11-23 11:52:55,917 INFO L273 TraceCheckUtils]: 2: Hoare triple {25180#true} assume true; {25180#true} is VALID [2018-11-23 11:52:55,917 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25180#true} {25180#true} #130#return; {25180#true} is VALID [2018-11-23 11:52:55,917 INFO L256 TraceCheckUtils]: 4: Hoare triple {25180#true} call #t~ret15 := main(); {25180#true} is VALID [2018-11-23 11:52:55,918 INFO L273 TraceCheckUtils]: 5: Hoare triple {25180#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {25223#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:55,919 INFO L273 TraceCheckUtils]: 6: Hoare triple {25223#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {25227#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:55,919 INFO L273 TraceCheckUtils]: 7: Hoare triple {25227#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25227#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:55,919 INFO L273 TraceCheckUtils]: 8: Hoare triple {25227#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25227#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:55,920 INFO L273 TraceCheckUtils]: 9: Hoare triple {25227#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {25237#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:55,920 INFO L273 TraceCheckUtils]: 10: Hoare triple {25237#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25237#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:55,920 INFO L273 TraceCheckUtils]: 11: Hoare triple {25237#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25237#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:55,921 INFO L273 TraceCheckUtils]: 12: Hoare triple {25237#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {25247#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:55,921 INFO L273 TraceCheckUtils]: 13: Hoare triple {25247#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25247#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:55,922 INFO L273 TraceCheckUtils]: 14: Hoare triple {25247#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25247#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:55,923 INFO L273 TraceCheckUtils]: 15: Hoare triple {25247#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {25257#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:55,923 INFO L273 TraceCheckUtils]: 16: Hoare triple {25257#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25257#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:55,924 INFO L273 TraceCheckUtils]: 17: Hoare triple {25257#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25257#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:55,924 INFO L273 TraceCheckUtils]: 18: Hoare triple {25257#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {25267#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:55,925 INFO L273 TraceCheckUtils]: 19: Hoare triple {25267#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25267#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:55,925 INFO L273 TraceCheckUtils]: 20: Hoare triple {25267#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25267#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:55,926 INFO L273 TraceCheckUtils]: 21: Hoare triple {25267#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {25277#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:55,926 INFO L273 TraceCheckUtils]: 22: Hoare triple {25277#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25277#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:55,927 INFO L273 TraceCheckUtils]: 23: Hoare triple {25277#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25277#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:55,928 INFO L273 TraceCheckUtils]: 24: Hoare triple {25277#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {25287#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:55,928 INFO L273 TraceCheckUtils]: 25: Hoare triple {25287#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25287#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:55,929 INFO L273 TraceCheckUtils]: 26: Hoare triple {25287#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25287#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:55,929 INFO L273 TraceCheckUtils]: 27: Hoare triple {25287#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {25297#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:55,930 INFO L273 TraceCheckUtils]: 28: Hoare triple {25297#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25297#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:55,930 INFO L273 TraceCheckUtils]: 29: Hoare triple {25297#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25297#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:55,931 INFO L273 TraceCheckUtils]: 30: Hoare triple {25297#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {25307#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:55,931 INFO L273 TraceCheckUtils]: 31: Hoare triple {25307#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25307#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:55,932 INFO L273 TraceCheckUtils]: 32: Hoare triple {25307#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25307#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:55,933 INFO L273 TraceCheckUtils]: 33: Hoare triple {25307#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {25317#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:55,933 INFO L273 TraceCheckUtils]: 34: Hoare triple {25317#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25317#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:55,934 INFO L273 TraceCheckUtils]: 35: Hoare triple {25317#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25317#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:55,934 INFO L273 TraceCheckUtils]: 36: Hoare triple {25317#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {25327#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:55,935 INFO L273 TraceCheckUtils]: 37: Hoare triple {25327#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25327#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:55,935 INFO L273 TraceCheckUtils]: 38: Hoare triple {25327#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25327#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:55,936 INFO L273 TraceCheckUtils]: 39: Hoare triple {25327#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {25337#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:55,936 INFO L273 TraceCheckUtils]: 40: Hoare triple {25337#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25337#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:55,937 INFO L273 TraceCheckUtils]: 41: Hoare triple {25337#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25337#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:55,938 INFO L273 TraceCheckUtils]: 42: Hoare triple {25337#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {25347#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:55,938 INFO L273 TraceCheckUtils]: 43: Hoare triple {25347#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25347#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:55,939 INFO L273 TraceCheckUtils]: 44: Hoare triple {25347#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25347#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:55,939 INFO L273 TraceCheckUtils]: 45: Hoare triple {25347#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {25357#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:55,940 INFO L273 TraceCheckUtils]: 46: Hoare triple {25357#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25357#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:55,940 INFO L273 TraceCheckUtils]: 47: Hoare triple {25357#(<= main_~k~0 14)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25357#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:55,941 INFO L273 TraceCheckUtils]: 48: Hoare triple {25357#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {25367#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:55,941 INFO L273 TraceCheckUtils]: 49: Hoare triple {25367#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25367#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:55,942 INFO L273 TraceCheckUtils]: 50: Hoare triple {25367#(<= main_~k~0 15)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25367#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:55,943 INFO L273 TraceCheckUtils]: 51: Hoare triple {25367#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {25377#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:55,943 INFO L273 TraceCheckUtils]: 52: Hoare triple {25377#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25377#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:55,944 INFO L273 TraceCheckUtils]: 53: Hoare triple {25377#(<= main_~k~0 16)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25377#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:55,944 INFO L273 TraceCheckUtils]: 54: Hoare triple {25377#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {25387#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:55,945 INFO L273 TraceCheckUtils]: 55: Hoare triple {25387#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25387#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:55,945 INFO L273 TraceCheckUtils]: 56: Hoare triple {25387#(<= main_~k~0 17)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25387#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:55,946 INFO L273 TraceCheckUtils]: 57: Hoare triple {25387#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {25397#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:55,947 INFO L273 TraceCheckUtils]: 58: Hoare triple {25397#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25397#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:55,947 INFO L273 TraceCheckUtils]: 59: Hoare triple {25397#(<= main_~k~0 18)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25397#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:55,948 INFO L273 TraceCheckUtils]: 60: Hoare triple {25397#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {25407#(<= main_~k~0 19)} is VALID [2018-11-23 11:52:55,948 INFO L273 TraceCheckUtils]: 61: Hoare triple {25407#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25407#(<= main_~k~0 19)} is VALID [2018-11-23 11:52:55,949 INFO L273 TraceCheckUtils]: 62: Hoare triple {25407#(<= main_~k~0 19)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25407#(<= main_~k~0 19)} is VALID [2018-11-23 11:52:55,949 INFO L273 TraceCheckUtils]: 63: Hoare triple {25407#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {25417#(<= main_~k~0 20)} is VALID [2018-11-23 11:52:55,950 INFO L273 TraceCheckUtils]: 64: Hoare triple {25417#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25417#(<= main_~k~0 20)} is VALID [2018-11-23 11:52:55,950 INFO L273 TraceCheckUtils]: 65: Hoare triple {25417#(<= main_~k~0 20)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25417#(<= main_~k~0 20)} is VALID [2018-11-23 11:52:55,951 INFO L273 TraceCheckUtils]: 66: Hoare triple {25417#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {25427#(<= main_~k~0 21)} is VALID [2018-11-23 11:52:55,952 INFO L273 TraceCheckUtils]: 67: Hoare triple {25427#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25427#(<= main_~k~0 21)} is VALID [2018-11-23 11:52:55,952 INFO L273 TraceCheckUtils]: 68: Hoare triple {25427#(<= main_~k~0 21)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25427#(<= main_~k~0 21)} is VALID [2018-11-23 11:52:55,953 INFO L273 TraceCheckUtils]: 69: Hoare triple {25427#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {25437#(<= main_~k~0 22)} is VALID [2018-11-23 11:52:55,953 INFO L273 TraceCheckUtils]: 70: Hoare triple {25437#(<= main_~k~0 22)} assume !(~k~0 < 100000); {25181#false} is VALID [2018-11-23 11:52:55,954 INFO L273 TraceCheckUtils]: 71: Hoare triple {25181#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25181#false} is VALID [2018-11-23 11:52:55,954 INFO L273 TraceCheckUtils]: 72: Hoare triple {25181#false} ~x~0 := 0; {25181#false} is VALID [2018-11-23 11:52:55,954 INFO L273 TraceCheckUtils]: 73: Hoare triple {25181#false} assume !(~x~0 < ~i~0); {25181#false} is VALID [2018-11-23 11:52:55,954 INFO L273 TraceCheckUtils]: 74: Hoare triple {25181#false} ~x~0 := 0; {25181#false} is VALID [2018-11-23 11:52:55,954 INFO L273 TraceCheckUtils]: 75: Hoare triple {25181#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25181#false} is VALID [2018-11-23 11:52:55,954 INFO L256 TraceCheckUtils]: 76: Hoare triple {25181#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {25181#false} is VALID [2018-11-23 11:52:55,955 INFO L273 TraceCheckUtils]: 77: Hoare triple {25181#false} ~cond := #in~cond; {25181#false} is VALID [2018-11-23 11:52:55,955 INFO L273 TraceCheckUtils]: 78: Hoare triple {25181#false} assume !(0 == ~cond); {25181#false} is VALID [2018-11-23 11:52:55,955 INFO L273 TraceCheckUtils]: 79: Hoare triple {25181#false} assume true; {25181#false} is VALID [2018-11-23 11:52:55,955 INFO L268 TraceCheckUtils]: 80: Hoare quadruple {25181#false} {25181#false} #136#return; {25181#false} is VALID [2018-11-23 11:52:55,955 INFO L273 TraceCheckUtils]: 81: Hoare triple {25181#false} havoc #t~mem9;havoc #t~mem10; {25181#false} is VALID [2018-11-23 11:52:55,956 INFO L273 TraceCheckUtils]: 82: Hoare triple {25181#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {25181#false} is VALID [2018-11-23 11:52:55,956 INFO L273 TraceCheckUtils]: 83: Hoare triple {25181#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25181#false} is VALID [2018-11-23 11:52:55,956 INFO L256 TraceCheckUtils]: 84: Hoare triple {25181#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {25181#false} is VALID [2018-11-23 11:52:55,956 INFO L273 TraceCheckUtils]: 85: Hoare triple {25181#false} ~cond := #in~cond; {25181#false} is VALID [2018-11-23 11:52:55,956 INFO L273 TraceCheckUtils]: 86: Hoare triple {25181#false} assume 0 == ~cond; {25181#false} is VALID [2018-11-23 11:52:55,956 INFO L273 TraceCheckUtils]: 87: Hoare triple {25181#false} assume !false; {25181#false} is VALID [2018-11-23 11:52:55,962 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:52:55,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:55,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-23 11:52:55,982 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 88 [2018-11-23 11:52:55,982 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:55,982 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 11:52:56,137 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-23 11:52:56,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 11:52:56,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 11:52:56,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=853, Invalid=1403, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 11:52:56,139 INFO L87 Difference]: Start difference. First operand 251 states and 350 transitions. Second operand 48 states. [2018-11-23 11:52:57,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:57,142 INFO L93 Difference]: Finished difference Result 384 states and 547 transitions. [2018-11-23 11:52:57,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 11:52:57,143 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 88 [2018-11-23 11:52:57,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:57,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 11:52:57,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 195 transitions. [2018-11-23 11:52:57,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 11:52:57,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 195 transitions. [2018-11-23 11:52:57,146 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 195 transitions. [2018-11-23 11:52:57,332 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-23 11:52:57,338 INFO L225 Difference]: With dead ends: 384 [2018-11-23 11:52:57,338 INFO L226 Difference]: Without dead ends: 266 [2018-11-23 11:52:57,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=853, Invalid=1403, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 11:52:57,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-11-23 11:52:57,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 257. [2018-11-23 11:52:57,555 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:57,555 INFO L82 GeneralOperation]: Start isEquivalent. First operand 266 states. Second operand 257 states. [2018-11-23 11:52:57,555 INFO L74 IsIncluded]: Start isIncluded. First operand 266 states. Second operand 257 states. [2018-11-23 11:52:57,555 INFO L87 Difference]: Start difference. First operand 266 states. Second operand 257 states. [2018-11-23 11:52:57,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:57,562 INFO L93 Difference]: Finished difference Result 266 states and 371 transitions. [2018-11-23 11:52:57,562 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 371 transitions. [2018-11-23 11:52:57,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:57,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:57,563 INFO L74 IsIncluded]: Start isIncluded. First operand 257 states. Second operand 266 states. [2018-11-23 11:52:57,563 INFO L87 Difference]: Start difference. First operand 257 states. Second operand 266 states. [2018-11-23 11:52:57,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:57,569 INFO L93 Difference]: Finished difference Result 266 states and 371 transitions. [2018-11-23 11:52:57,569 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 371 transitions. [2018-11-23 11:52:57,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:57,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:57,570 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:57,570 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:57,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-11-23 11:52:57,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 358 transitions. [2018-11-23 11:52:57,576 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 358 transitions. Word has length 88 [2018-11-23 11:52:57,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:57,576 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 358 transitions. [2018-11-23 11:52:57,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 11:52:57,576 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 358 transitions. [2018-11-23 11:52:57,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 11:52:57,577 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:57,577 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:57,577 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:57,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:57,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1991798956, now seen corresponding path program 18 times [2018-11-23 11:52:57,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:57,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:57,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:57,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:57,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:57,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:58,260 INFO L256 TraceCheckUtils]: 0: Hoare triple {26895#true} call ULTIMATE.init(); {26895#true} is VALID [2018-11-23 11:52:58,261 INFO L273 TraceCheckUtils]: 1: Hoare triple {26895#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26895#true} is VALID [2018-11-23 11:52:58,261 INFO L273 TraceCheckUtils]: 2: Hoare triple {26895#true} assume true; {26895#true} is VALID [2018-11-23 11:52:58,261 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26895#true} {26895#true} #130#return; {26895#true} is VALID [2018-11-23 11:52:58,261 INFO L256 TraceCheckUtils]: 4: Hoare triple {26895#true} call #t~ret15 := main(); {26895#true} is VALID [2018-11-23 11:52:58,261 INFO L273 TraceCheckUtils]: 5: Hoare triple {26895#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {26897#(= main_~i~0 0)} is VALID [2018-11-23 11:52:58,262 INFO L273 TraceCheckUtils]: 6: Hoare triple {26897#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {26898#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,262 INFO L273 TraceCheckUtils]: 7: Hoare triple {26898#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26898#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,263 INFO L273 TraceCheckUtils]: 8: Hoare triple {26898#(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; {26898#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,263 INFO L273 TraceCheckUtils]: 9: Hoare triple {26898#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {26899#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,264 INFO L273 TraceCheckUtils]: 10: Hoare triple {26899#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26899#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,264 INFO L273 TraceCheckUtils]: 11: Hoare triple {26899#(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; {26899#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,265 INFO L273 TraceCheckUtils]: 12: Hoare triple {26899#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {26900#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,265 INFO L273 TraceCheckUtils]: 13: Hoare triple {26900#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26900#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,265 INFO L273 TraceCheckUtils]: 14: Hoare triple {26900#(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; {26900#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,266 INFO L273 TraceCheckUtils]: 15: Hoare triple {26900#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {26901#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,267 INFO L273 TraceCheckUtils]: 16: Hoare triple {26901#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26901#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,268 INFO L273 TraceCheckUtils]: 17: Hoare triple {26901#(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; {26901#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,268 INFO L273 TraceCheckUtils]: 18: Hoare triple {26901#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {26902#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,269 INFO L273 TraceCheckUtils]: 19: Hoare triple {26902#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26902#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,270 INFO L273 TraceCheckUtils]: 20: Hoare triple {26902#(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; {26902#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,271 INFO L273 TraceCheckUtils]: 21: Hoare triple {26902#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {26903#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,272 INFO L273 TraceCheckUtils]: 22: Hoare triple {26903#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26903#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,272 INFO L273 TraceCheckUtils]: 23: Hoare triple {26903#(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; {26903#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,273 INFO L273 TraceCheckUtils]: 24: Hoare triple {26903#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {26904#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,274 INFO L273 TraceCheckUtils]: 25: Hoare triple {26904#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26904#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,275 INFO L273 TraceCheckUtils]: 26: Hoare triple {26904#(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; {26904#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,275 INFO L273 TraceCheckUtils]: 27: Hoare triple {26904#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {26905#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,276 INFO L273 TraceCheckUtils]: 28: Hoare triple {26905#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26905#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,277 INFO L273 TraceCheckUtils]: 29: Hoare triple {26905#(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; {26905#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,278 INFO L273 TraceCheckUtils]: 30: Hoare triple {26905#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {26906#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,279 INFO L273 TraceCheckUtils]: 31: Hoare triple {26906#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26906#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,279 INFO L273 TraceCheckUtils]: 32: Hoare triple {26906#(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; {26906#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,280 INFO L273 TraceCheckUtils]: 33: Hoare triple {26906#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {26907#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,281 INFO L273 TraceCheckUtils]: 34: Hoare triple {26907#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26907#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,282 INFO L273 TraceCheckUtils]: 35: Hoare triple {26907#(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; {26907#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,282 INFO L273 TraceCheckUtils]: 36: Hoare triple {26907#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {26908#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,283 INFO L273 TraceCheckUtils]: 37: Hoare triple {26908#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26908#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,284 INFO L273 TraceCheckUtils]: 38: Hoare triple {26908#(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; {26908#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,285 INFO L273 TraceCheckUtils]: 39: Hoare triple {26908#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {26909#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,286 INFO L273 TraceCheckUtils]: 40: Hoare triple {26909#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26909#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,286 INFO L273 TraceCheckUtils]: 41: Hoare triple {26909#(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; {26909#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,287 INFO L273 TraceCheckUtils]: 42: Hoare triple {26909#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {26910#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,288 INFO L273 TraceCheckUtils]: 43: Hoare triple {26910#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26910#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,289 INFO L273 TraceCheckUtils]: 44: Hoare triple {26910#(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; {26910#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,289 INFO L273 TraceCheckUtils]: 45: Hoare triple {26910#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {26911#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,290 INFO L273 TraceCheckUtils]: 46: Hoare triple {26911#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26911#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,291 INFO L273 TraceCheckUtils]: 47: Hoare triple {26911#(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; {26911#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,292 INFO L273 TraceCheckUtils]: 48: Hoare triple {26911#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {26912#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,292 INFO L273 TraceCheckUtils]: 49: Hoare triple {26912#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26912#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,293 INFO L273 TraceCheckUtils]: 50: Hoare triple {26912#(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; {26912#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,294 INFO L273 TraceCheckUtils]: 51: Hoare triple {26912#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {26913#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,295 INFO L273 TraceCheckUtils]: 52: Hoare triple {26913#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26913#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,296 INFO L273 TraceCheckUtils]: 53: Hoare triple {26913#(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; {26913#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,296 INFO L273 TraceCheckUtils]: 54: Hoare triple {26913#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {26914#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:52:58,297 INFO L273 TraceCheckUtils]: 55: Hoare triple {26914#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26914#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:52:58,298 INFO L273 TraceCheckUtils]: 56: Hoare triple {26914#(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; {26914#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:52:58,299 INFO L273 TraceCheckUtils]: 57: Hoare triple {26914#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} ~k~0 := 1 + ~k~0; {26915#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,299 INFO L273 TraceCheckUtils]: 58: Hoare triple {26915#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26915#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,300 INFO L273 TraceCheckUtils]: 59: Hoare triple {26915#(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; {26915#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,301 INFO L273 TraceCheckUtils]: 60: Hoare triple {26915#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {26916#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,302 INFO L273 TraceCheckUtils]: 61: Hoare triple {26916#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26916#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,302 INFO L273 TraceCheckUtils]: 62: Hoare triple {26916#(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; {26916#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,303 INFO L273 TraceCheckUtils]: 63: Hoare triple {26916#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {26917#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,304 INFO L273 TraceCheckUtils]: 64: Hoare triple {26917#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26917#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,305 INFO L273 TraceCheckUtils]: 65: Hoare triple {26917#(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; {26917#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,305 INFO L273 TraceCheckUtils]: 66: Hoare triple {26917#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {26918#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,306 INFO L273 TraceCheckUtils]: 67: Hoare triple {26918#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26918#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,307 INFO L273 TraceCheckUtils]: 68: Hoare triple {26918#(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; {26918#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,308 INFO L273 TraceCheckUtils]: 69: Hoare triple {26918#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {26919#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,308 INFO L273 TraceCheckUtils]: 70: Hoare triple {26919#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26919#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,309 INFO L273 TraceCheckUtils]: 71: Hoare triple {26919#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26919#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,310 INFO L273 TraceCheckUtils]: 72: Hoare triple {26919#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {26920#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 11:52:58,311 INFO L273 TraceCheckUtils]: 73: Hoare triple {26920#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} assume !(~k~0 < 100000); {26896#false} is VALID [2018-11-23 11:52:58,311 INFO L273 TraceCheckUtils]: 74: Hoare triple {26896#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26896#false} is VALID [2018-11-23 11:52:58,311 INFO L273 TraceCheckUtils]: 75: Hoare triple {26896#false} ~x~0 := 0; {26896#false} is VALID [2018-11-23 11:52:58,311 INFO L273 TraceCheckUtils]: 76: Hoare triple {26896#false} assume !(~x~0 < ~i~0); {26896#false} is VALID [2018-11-23 11:52:58,311 INFO L273 TraceCheckUtils]: 77: Hoare triple {26896#false} ~x~0 := 0; {26896#false} is VALID [2018-11-23 11:52:58,312 INFO L273 TraceCheckUtils]: 78: Hoare triple {26896#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26896#false} is VALID [2018-11-23 11:52:58,312 INFO L256 TraceCheckUtils]: 79: Hoare triple {26896#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {26895#true} is VALID [2018-11-23 11:52:58,312 INFO L273 TraceCheckUtils]: 80: Hoare triple {26895#true} ~cond := #in~cond; {26895#true} is VALID [2018-11-23 11:52:58,312 INFO L273 TraceCheckUtils]: 81: Hoare triple {26895#true} assume !(0 == ~cond); {26895#true} is VALID [2018-11-23 11:52:58,312 INFO L273 TraceCheckUtils]: 82: Hoare triple {26895#true} assume true; {26895#true} is VALID [2018-11-23 11:52:58,312 INFO L268 TraceCheckUtils]: 83: Hoare quadruple {26895#true} {26896#false} #136#return; {26896#false} is VALID [2018-11-23 11:52:58,313 INFO L273 TraceCheckUtils]: 84: Hoare triple {26896#false} havoc #t~mem9;havoc #t~mem10; {26896#false} is VALID [2018-11-23 11:52:58,313 INFO L273 TraceCheckUtils]: 85: Hoare triple {26896#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {26896#false} is VALID [2018-11-23 11:52:58,313 INFO L273 TraceCheckUtils]: 86: Hoare triple {26896#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26896#false} is VALID [2018-11-23 11:52:58,313 INFO L256 TraceCheckUtils]: 87: Hoare triple {26896#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {26896#false} is VALID [2018-11-23 11:52:58,313 INFO L273 TraceCheckUtils]: 88: Hoare triple {26896#false} ~cond := #in~cond; {26896#false} is VALID [2018-11-23 11:52:58,314 INFO L273 TraceCheckUtils]: 89: Hoare triple {26896#false} assume 0 == ~cond; {26896#false} is VALID [2018-11-23 11:52:58,314 INFO L273 TraceCheckUtils]: 90: Hoare triple {26896#false} assume !false; {26896#false} is VALID [2018-11-23 11:52:58,326 INFO L134 CoverageAnalysis]: Checked inductivity of 719 backedges. 2 proven. 715 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:52:58,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:58,326 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:52:58,335 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:52:58,448 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) [2018-11-23 11:52:58,448 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:58,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:58,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:59,045 INFO L256 TraceCheckUtils]: 0: Hoare triple {26895#true} call ULTIMATE.init(); {26895#true} is VALID [2018-11-23 11:52:59,045 INFO L273 TraceCheckUtils]: 1: Hoare triple {26895#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26895#true} is VALID [2018-11-23 11:52:59,045 INFO L273 TraceCheckUtils]: 2: Hoare triple {26895#true} assume true; {26895#true} is VALID [2018-11-23 11:52:59,045 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26895#true} {26895#true} #130#return; {26895#true} is VALID [2018-11-23 11:52:59,046 INFO L256 TraceCheckUtils]: 4: Hoare triple {26895#true} call #t~ret15 := main(); {26895#true} is VALID [2018-11-23 11:52:59,046 INFO L273 TraceCheckUtils]: 5: Hoare triple {26895#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {26939#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:59,047 INFO L273 TraceCheckUtils]: 6: Hoare triple {26939#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {26943#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:59,047 INFO L273 TraceCheckUtils]: 7: Hoare triple {26943#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26943#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:59,047 INFO L273 TraceCheckUtils]: 8: Hoare triple {26943#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26943#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:59,048 INFO L273 TraceCheckUtils]: 9: Hoare triple {26943#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {26953#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:59,048 INFO L273 TraceCheckUtils]: 10: Hoare triple {26953#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26953#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:59,049 INFO L273 TraceCheckUtils]: 11: Hoare triple {26953#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26953#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:59,049 INFO L273 TraceCheckUtils]: 12: Hoare triple {26953#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {26963#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:59,049 INFO L273 TraceCheckUtils]: 13: Hoare triple {26963#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26963#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:59,050 INFO L273 TraceCheckUtils]: 14: Hoare triple {26963#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26963#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:59,051 INFO L273 TraceCheckUtils]: 15: Hoare triple {26963#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {26973#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:59,051 INFO L273 TraceCheckUtils]: 16: Hoare triple {26973#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26973#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:59,052 INFO L273 TraceCheckUtils]: 17: Hoare triple {26973#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26973#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:59,052 INFO L273 TraceCheckUtils]: 18: Hoare triple {26973#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {26983#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:59,053 INFO L273 TraceCheckUtils]: 19: Hoare triple {26983#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26983#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:59,053 INFO L273 TraceCheckUtils]: 20: Hoare triple {26983#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26983#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:59,054 INFO L273 TraceCheckUtils]: 21: Hoare triple {26983#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {26993#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:59,054 INFO L273 TraceCheckUtils]: 22: Hoare triple {26993#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26993#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:59,055 INFO L273 TraceCheckUtils]: 23: Hoare triple {26993#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26993#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:59,056 INFO L273 TraceCheckUtils]: 24: Hoare triple {26993#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {27003#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:59,056 INFO L273 TraceCheckUtils]: 25: Hoare triple {27003#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27003#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:59,057 INFO L273 TraceCheckUtils]: 26: Hoare triple {27003#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27003#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:59,057 INFO L273 TraceCheckUtils]: 27: Hoare triple {27003#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {27013#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:59,058 INFO L273 TraceCheckUtils]: 28: Hoare triple {27013#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27013#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:59,058 INFO L273 TraceCheckUtils]: 29: Hoare triple {27013#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27013#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:59,059 INFO L273 TraceCheckUtils]: 30: Hoare triple {27013#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {27023#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:59,059 INFO L273 TraceCheckUtils]: 31: Hoare triple {27023#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27023#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:59,060 INFO L273 TraceCheckUtils]: 32: Hoare triple {27023#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27023#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:59,061 INFO L273 TraceCheckUtils]: 33: Hoare triple {27023#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {27033#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:59,061 INFO L273 TraceCheckUtils]: 34: Hoare triple {27033#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27033#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:59,062 INFO L273 TraceCheckUtils]: 35: Hoare triple {27033#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27033#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:59,062 INFO L273 TraceCheckUtils]: 36: Hoare triple {27033#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {27043#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:59,063 INFO L273 TraceCheckUtils]: 37: Hoare triple {27043#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27043#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:59,063 INFO L273 TraceCheckUtils]: 38: Hoare triple {27043#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27043#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:59,064 INFO L273 TraceCheckUtils]: 39: Hoare triple {27043#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {27053#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:59,065 INFO L273 TraceCheckUtils]: 40: Hoare triple {27053#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27053#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:59,065 INFO L273 TraceCheckUtils]: 41: Hoare triple {27053#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27053#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:59,066 INFO L273 TraceCheckUtils]: 42: Hoare triple {27053#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {27063#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:59,066 INFO L273 TraceCheckUtils]: 43: Hoare triple {27063#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27063#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:59,067 INFO L273 TraceCheckUtils]: 44: Hoare triple {27063#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27063#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:59,067 INFO L273 TraceCheckUtils]: 45: Hoare triple {27063#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {27073#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:59,068 INFO L273 TraceCheckUtils]: 46: Hoare triple {27073#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27073#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:59,068 INFO L273 TraceCheckUtils]: 47: Hoare triple {27073#(<= main_~k~0 14)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27073#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:59,069 INFO L273 TraceCheckUtils]: 48: Hoare triple {27073#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {27083#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:59,070 INFO L273 TraceCheckUtils]: 49: Hoare triple {27083#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27083#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:59,070 INFO L273 TraceCheckUtils]: 50: Hoare triple {27083#(<= main_~k~0 15)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27083#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:59,071 INFO L273 TraceCheckUtils]: 51: Hoare triple {27083#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {27093#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:59,071 INFO L273 TraceCheckUtils]: 52: Hoare triple {27093#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27093#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:59,072 INFO L273 TraceCheckUtils]: 53: Hoare triple {27093#(<= main_~k~0 16)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27093#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:59,073 INFO L273 TraceCheckUtils]: 54: Hoare triple {27093#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {27103#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:59,073 INFO L273 TraceCheckUtils]: 55: Hoare triple {27103#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27103#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:59,074 INFO L273 TraceCheckUtils]: 56: Hoare triple {27103#(<= main_~k~0 17)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27103#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:59,074 INFO L273 TraceCheckUtils]: 57: Hoare triple {27103#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {27113#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:59,075 INFO L273 TraceCheckUtils]: 58: Hoare triple {27113#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27113#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:59,075 INFO L273 TraceCheckUtils]: 59: Hoare triple {27113#(<= main_~k~0 18)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27113#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:59,076 INFO L273 TraceCheckUtils]: 60: Hoare triple {27113#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {27123#(<= main_~k~0 19)} is VALID [2018-11-23 11:52:59,077 INFO L273 TraceCheckUtils]: 61: Hoare triple {27123#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27123#(<= main_~k~0 19)} is VALID [2018-11-23 11:52:59,077 INFO L273 TraceCheckUtils]: 62: Hoare triple {27123#(<= main_~k~0 19)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27123#(<= main_~k~0 19)} is VALID [2018-11-23 11:52:59,078 INFO L273 TraceCheckUtils]: 63: Hoare triple {27123#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {27133#(<= main_~k~0 20)} is VALID [2018-11-23 11:52:59,078 INFO L273 TraceCheckUtils]: 64: Hoare triple {27133#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27133#(<= main_~k~0 20)} is VALID [2018-11-23 11:52:59,079 INFO L273 TraceCheckUtils]: 65: Hoare triple {27133#(<= main_~k~0 20)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27133#(<= main_~k~0 20)} is VALID [2018-11-23 11:52:59,080 INFO L273 TraceCheckUtils]: 66: Hoare triple {27133#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {27143#(<= main_~k~0 21)} is VALID [2018-11-23 11:52:59,080 INFO L273 TraceCheckUtils]: 67: Hoare triple {27143#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27143#(<= main_~k~0 21)} is VALID [2018-11-23 11:52:59,081 INFO L273 TraceCheckUtils]: 68: Hoare triple {27143#(<= main_~k~0 21)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27143#(<= main_~k~0 21)} is VALID [2018-11-23 11:52:59,081 INFO L273 TraceCheckUtils]: 69: Hoare triple {27143#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {27153#(<= main_~k~0 22)} is VALID [2018-11-23 11:52:59,082 INFO L273 TraceCheckUtils]: 70: Hoare triple {27153#(<= main_~k~0 22)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27153#(<= main_~k~0 22)} is VALID [2018-11-23 11:52:59,082 INFO L273 TraceCheckUtils]: 71: Hoare triple {27153#(<= main_~k~0 22)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27153#(<= main_~k~0 22)} is VALID [2018-11-23 11:52:59,083 INFO L273 TraceCheckUtils]: 72: Hoare triple {27153#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {27163#(<= main_~k~0 23)} is VALID [2018-11-23 11:52:59,084 INFO L273 TraceCheckUtils]: 73: Hoare triple {27163#(<= main_~k~0 23)} assume !(~k~0 < 100000); {26896#false} is VALID [2018-11-23 11:52:59,084 INFO L273 TraceCheckUtils]: 74: Hoare triple {26896#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26896#false} is VALID [2018-11-23 11:52:59,084 INFO L273 TraceCheckUtils]: 75: Hoare triple {26896#false} ~x~0 := 0; {26896#false} is VALID [2018-11-23 11:52:59,084 INFO L273 TraceCheckUtils]: 76: Hoare triple {26896#false} assume !(~x~0 < ~i~0); {26896#false} is VALID [2018-11-23 11:52:59,084 INFO L273 TraceCheckUtils]: 77: Hoare triple {26896#false} ~x~0 := 0; {26896#false} is VALID [2018-11-23 11:52:59,085 INFO L273 TraceCheckUtils]: 78: Hoare triple {26896#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26896#false} is VALID [2018-11-23 11:52:59,085 INFO L256 TraceCheckUtils]: 79: Hoare triple {26896#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {26896#false} is VALID [2018-11-23 11:52:59,085 INFO L273 TraceCheckUtils]: 80: Hoare triple {26896#false} ~cond := #in~cond; {26896#false} is VALID [2018-11-23 11:52:59,085 INFO L273 TraceCheckUtils]: 81: Hoare triple {26896#false} assume !(0 == ~cond); {26896#false} is VALID [2018-11-23 11:52:59,085 INFO L273 TraceCheckUtils]: 82: Hoare triple {26896#false} assume true; {26896#false} is VALID [2018-11-23 11:52:59,086 INFO L268 TraceCheckUtils]: 83: Hoare quadruple {26896#false} {26896#false} #136#return; {26896#false} is VALID [2018-11-23 11:52:59,086 INFO L273 TraceCheckUtils]: 84: Hoare triple {26896#false} havoc #t~mem9;havoc #t~mem10; {26896#false} is VALID [2018-11-23 11:52:59,086 INFO L273 TraceCheckUtils]: 85: Hoare triple {26896#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {26896#false} is VALID [2018-11-23 11:52:59,086 INFO L273 TraceCheckUtils]: 86: Hoare triple {26896#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26896#false} is VALID [2018-11-23 11:52:59,086 INFO L256 TraceCheckUtils]: 87: Hoare triple {26896#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {26896#false} is VALID [2018-11-23 11:52:59,086 INFO L273 TraceCheckUtils]: 88: Hoare triple {26896#false} ~cond := #in~cond; {26896#false} is VALID [2018-11-23 11:52:59,087 INFO L273 TraceCheckUtils]: 89: Hoare triple {26896#false} assume 0 == ~cond; {26896#false} is VALID [2018-11-23 11:52:59,087 INFO L273 TraceCheckUtils]: 90: Hoare triple {26896#false} assume !false; {26896#false} is VALID [2018-11-23 11:52:59,092 INFO L134 CoverageAnalysis]: Checked inductivity of 719 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:52:59,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:59,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2018-11-23 11:52:59,112 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 91 [2018-11-23 11:52:59,112 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:59,112 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states. [2018-11-23 11:52:59,280 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:59,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-23 11:52:59,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-23 11:52:59,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=926, Invalid=1524, Unknown=0, NotChecked=0, Total=2450 [2018-11-23 11:52:59,283 INFO L87 Difference]: Start difference. First operand 257 states and 358 transitions. Second operand 50 states. [2018-11-23 11:53:00,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:00,521 INFO L93 Difference]: Finished difference Result 390 states and 555 transitions. [2018-11-23 11:53:00,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 11:53:00,521 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 91 [2018-11-23 11:53:00,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:00,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 11:53:00,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 199 transitions. [2018-11-23 11:53:00,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 11:53:00,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 199 transitions. [2018-11-23 11:53:00,525 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 199 transitions. [2018-11-23 11:53:00,709 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:00,715 INFO L225 Difference]: With dead ends: 390 [2018-11-23 11:53:00,715 INFO L226 Difference]: Without dead ends: 272 [2018-11-23 11:53:00,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 829 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=926, Invalid=1524, Unknown=0, NotChecked=0, Total=2450 [2018-11-23 11:53:00,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-11-23 11:53:01,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 263. [2018-11-23 11:53:01,013 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:01,013 INFO L82 GeneralOperation]: Start isEquivalent. First operand 272 states. Second operand 263 states. [2018-11-23 11:53:01,013 INFO L74 IsIncluded]: Start isIncluded. First operand 272 states. Second operand 263 states. [2018-11-23 11:53:01,013 INFO L87 Difference]: Start difference. First operand 272 states. Second operand 263 states. [2018-11-23 11:53:01,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:01,020 INFO L93 Difference]: Finished difference Result 272 states and 379 transitions. [2018-11-23 11:53:01,020 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 379 transitions. [2018-11-23 11:53:01,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:01,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:01,021 INFO L74 IsIncluded]: Start isIncluded. First operand 263 states. Second operand 272 states. [2018-11-23 11:53:01,021 INFO L87 Difference]: Start difference. First operand 263 states. Second operand 272 states. [2018-11-23 11:53:01,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:01,027 INFO L93 Difference]: Finished difference Result 272 states and 379 transitions. [2018-11-23 11:53:01,027 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 379 transitions. [2018-11-23 11:53:01,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:01,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:01,028 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:01,028 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:01,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-11-23 11:53:01,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 366 transitions. [2018-11-23 11:53:01,034 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 366 transitions. Word has length 91 [2018-11-23 11:53:01,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:01,035 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 366 transitions. [2018-11-23 11:53:01,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-23 11:53:01,035 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 366 transitions. [2018-11-23 11:53:01,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-23 11:53:01,035 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:01,036 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:53:01,036 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:01,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:01,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1545739345, now seen corresponding path program 19 times [2018-11-23 11:53:01,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:01,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:01,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:01,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:01,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:01,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:01,904 INFO L256 TraceCheckUtils]: 0: Hoare triple {28649#true} call ULTIMATE.init(); {28649#true} is VALID [2018-11-23 11:53:01,905 INFO L273 TraceCheckUtils]: 1: Hoare triple {28649#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28649#true} is VALID [2018-11-23 11:53:01,905 INFO L273 TraceCheckUtils]: 2: Hoare triple {28649#true} assume true; {28649#true} is VALID [2018-11-23 11:53:01,905 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28649#true} {28649#true} #130#return; {28649#true} is VALID [2018-11-23 11:53:01,905 INFO L256 TraceCheckUtils]: 4: Hoare triple {28649#true} call #t~ret15 := main(); {28649#true} is VALID [2018-11-23 11:53:01,905 INFO L273 TraceCheckUtils]: 5: Hoare triple {28649#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {28651#(= main_~i~0 0)} is VALID [2018-11-23 11:53:01,906 INFO L273 TraceCheckUtils]: 6: Hoare triple {28651#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {28652#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,907 INFO L273 TraceCheckUtils]: 7: Hoare triple {28652#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {28652#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,907 INFO L273 TraceCheckUtils]: 8: Hoare triple {28652#(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; {28652#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,914 INFO L273 TraceCheckUtils]: 9: Hoare triple {28652#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {28653#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,915 INFO L273 TraceCheckUtils]: 10: Hoare triple {28653#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {28653#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,915 INFO L273 TraceCheckUtils]: 11: Hoare triple {28653#(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; {28653#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,916 INFO L273 TraceCheckUtils]: 12: Hoare triple {28653#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {28654#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,916 INFO L273 TraceCheckUtils]: 13: Hoare triple {28654#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {28654#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,916 INFO L273 TraceCheckUtils]: 14: Hoare triple {28654#(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; {28654#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,917 INFO L273 TraceCheckUtils]: 15: Hoare triple {28654#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {28655#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,917 INFO L273 TraceCheckUtils]: 16: Hoare triple {28655#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {28655#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,918 INFO L273 TraceCheckUtils]: 17: Hoare triple {28655#(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; {28655#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,919 INFO L273 TraceCheckUtils]: 18: Hoare triple {28655#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {28656#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,920 INFO L273 TraceCheckUtils]: 19: Hoare triple {28656#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {28656#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,920 INFO L273 TraceCheckUtils]: 20: Hoare triple {28656#(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; {28656#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,921 INFO L273 TraceCheckUtils]: 21: Hoare triple {28656#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {28657#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,922 INFO L273 TraceCheckUtils]: 22: Hoare triple {28657#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {28657#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,923 INFO L273 TraceCheckUtils]: 23: Hoare triple {28657#(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; {28657#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,924 INFO L273 TraceCheckUtils]: 24: Hoare triple {28657#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {28658#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,924 INFO L273 TraceCheckUtils]: 25: Hoare triple {28658#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {28658#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,925 INFO L273 TraceCheckUtils]: 26: Hoare triple {28658#(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; {28658#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,926 INFO L273 TraceCheckUtils]: 27: Hoare triple {28658#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {28659#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,926 INFO L273 TraceCheckUtils]: 28: Hoare triple {28659#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {28659#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,927 INFO L273 TraceCheckUtils]: 29: Hoare triple {28659#(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; {28659#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,928 INFO L273 TraceCheckUtils]: 30: Hoare triple {28659#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {28660#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,929 INFO L273 TraceCheckUtils]: 31: Hoare triple {28660#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {28660#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,929 INFO L273 TraceCheckUtils]: 32: Hoare triple {28660#(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; {28660#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,930 INFO L273 TraceCheckUtils]: 33: Hoare triple {28660#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {28661#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,931 INFO L273 TraceCheckUtils]: 34: Hoare triple {28661#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {28661#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,932 INFO L273 TraceCheckUtils]: 35: Hoare triple {28661#(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; {28661#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,932 INFO L273 TraceCheckUtils]: 36: Hoare triple {28661#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {28662#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,933 INFO L273 TraceCheckUtils]: 37: Hoare triple {28662#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {28662#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,934 INFO L273 TraceCheckUtils]: 38: Hoare triple {28662#(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; {28662#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,935 INFO L273 TraceCheckUtils]: 39: Hoare triple {28662#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {28663#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,936 INFO L273 TraceCheckUtils]: 40: Hoare triple {28663#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {28663#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,936 INFO L273 TraceCheckUtils]: 41: Hoare triple {28663#(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; {28663#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,937 INFO L273 TraceCheckUtils]: 42: Hoare triple {28663#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {28664#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,938 INFO L273 TraceCheckUtils]: 43: Hoare triple {28664#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {28664#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,939 INFO L273 TraceCheckUtils]: 44: Hoare triple {28664#(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; {28664#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,939 INFO L273 TraceCheckUtils]: 45: Hoare triple {28664#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {28665#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,940 INFO L273 TraceCheckUtils]: 46: Hoare triple {28665#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {28665#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,941 INFO L273 TraceCheckUtils]: 47: Hoare triple {28665#(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; {28665#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,942 INFO L273 TraceCheckUtils]: 48: Hoare triple {28665#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {28666#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,942 INFO L273 TraceCheckUtils]: 49: Hoare triple {28666#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {28666#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,943 INFO L273 TraceCheckUtils]: 50: Hoare triple {28666#(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; {28666#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,944 INFO L273 TraceCheckUtils]: 51: Hoare triple {28666#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {28667#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,945 INFO L273 TraceCheckUtils]: 52: Hoare triple {28667#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {28667#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,945 INFO L273 TraceCheckUtils]: 53: Hoare triple {28667#(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; {28667#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,946 INFO L273 TraceCheckUtils]: 54: Hoare triple {28667#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {28668#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:53:01,947 INFO L273 TraceCheckUtils]: 55: Hoare triple {28668#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {28668#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:53:01,948 INFO L273 TraceCheckUtils]: 56: Hoare triple {28668#(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; {28668#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:53:01,949 INFO L273 TraceCheckUtils]: 57: Hoare triple {28668#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} ~k~0 := 1 + ~k~0; {28669#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,949 INFO L273 TraceCheckUtils]: 58: Hoare triple {28669#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {28669#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,950 INFO L273 TraceCheckUtils]: 59: Hoare triple {28669#(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; {28669#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,951 INFO L273 TraceCheckUtils]: 60: Hoare triple {28669#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {28670#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,952 INFO L273 TraceCheckUtils]: 61: Hoare triple {28670#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {28670#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,952 INFO L273 TraceCheckUtils]: 62: Hoare triple {28670#(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; {28670#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,953 INFO L273 TraceCheckUtils]: 63: Hoare triple {28670#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {28671#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,954 INFO L273 TraceCheckUtils]: 64: Hoare triple {28671#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {28671#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,954 INFO L273 TraceCheckUtils]: 65: Hoare triple {28671#(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; {28671#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,955 INFO L273 TraceCheckUtils]: 66: Hoare triple {28671#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {28672#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,956 INFO L273 TraceCheckUtils]: 67: Hoare triple {28672#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {28672#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,957 INFO L273 TraceCheckUtils]: 68: Hoare triple {28672#(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; {28672#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,958 INFO L273 TraceCheckUtils]: 69: Hoare triple {28672#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {28673#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,958 INFO L273 TraceCheckUtils]: 70: Hoare triple {28673#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {28673#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,959 INFO L273 TraceCheckUtils]: 71: Hoare triple {28673#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28673#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,960 INFO L273 TraceCheckUtils]: 72: Hoare triple {28673#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {28674#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,961 INFO L273 TraceCheckUtils]: 73: Hoare triple {28674#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {28674#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,961 INFO L273 TraceCheckUtils]: 74: Hoare triple {28674#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28674#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,962 INFO L273 TraceCheckUtils]: 75: Hoare triple {28674#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {28675#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:01,963 INFO L273 TraceCheckUtils]: 76: Hoare triple {28675#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} assume !(~k~0 < 100000); {28650#false} is VALID [2018-11-23 11:53:01,963 INFO L273 TraceCheckUtils]: 77: Hoare triple {28650#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28650#false} is VALID [2018-11-23 11:53:01,963 INFO L273 TraceCheckUtils]: 78: Hoare triple {28650#false} ~x~0 := 0; {28650#false} is VALID [2018-11-23 11:53:01,963 INFO L273 TraceCheckUtils]: 79: Hoare triple {28650#false} assume !(~x~0 < ~i~0); {28650#false} is VALID [2018-11-23 11:53:01,964 INFO L273 TraceCheckUtils]: 80: Hoare triple {28650#false} ~x~0 := 0; {28650#false} is VALID [2018-11-23 11:53:01,964 INFO L273 TraceCheckUtils]: 81: Hoare triple {28650#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28650#false} is VALID [2018-11-23 11:53:01,964 INFO L256 TraceCheckUtils]: 82: Hoare triple {28650#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {28649#true} is VALID [2018-11-23 11:53:01,964 INFO L273 TraceCheckUtils]: 83: Hoare triple {28649#true} ~cond := #in~cond; {28649#true} is VALID [2018-11-23 11:53:01,965 INFO L273 TraceCheckUtils]: 84: Hoare triple {28649#true} assume !(0 == ~cond); {28649#true} is VALID [2018-11-23 11:53:01,965 INFO L273 TraceCheckUtils]: 85: Hoare triple {28649#true} assume true; {28649#true} is VALID [2018-11-23 11:53:01,965 INFO L268 TraceCheckUtils]: 86: Hoare quadruple {28649#true} {28650#false} #136#return; {28650#false} is VALID [2018-11-23 11:53:01,966 INFO L273 TraceCheckUtils]: 87: Hoare triple {28650#false} havoc #t~mem9;havoc #t~mem10; {28650#false} is VALID [2018-11-23 11:53:01,966 INFO L273 TraceCheckUtils]: 88: Hoare triple {28650#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {28650#false} is VALID [2018-11-23 11:53:01,966 INFO L273 TraceCheckUtils]: 89: Hoare triple {28650#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28650#false} is VALID [2018-11-23 11:53:01,966 INFO L256 TraceCheckUtils]: 90: Hoare triple {28650#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {28650#false} is VALID [2018-11-23 11:53:01,966 INFO L273 TraceCheckUtils]: 91: Hoare triple {28650#false} ~cond := #in~cond; {28650#false} is VALID [2018-11-23 11:53:01,967 INFO L273 TraceCheckUtils]: 92: Hoare triple {28650#false} assume 0 == ~cond; {28650#false} is VALID [2018-11-23 11:53:01,967 INFO L273 TraceCheckUtils]: 93: Hoare triple {28650#false} assume !false; {28650#false} is VALID [2018-11-23 11:53:01,980 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 2 proven. 782 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:53:01,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:01,980 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:53:01,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:53:02,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:02,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:02,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:02,697 INFO L256 TraceCheckUtils]: 0: Hoare triple {28649#true} call ULTIMATE.init(); {28649#true} is VALID [2018-11-23 11:53:02,697 INFO L273 TraceCheckUtils]: 1: Hoare triple {28649#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28649#true} is VALID [2018-11-23 11:53:02,697 INFO L273 TraceCheckUtils]: 2: Hoare triple {28649#true} assume true; {28649#true} is VALID [2018-11-23 11:53:02,698 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28649#true} {28649#true} #130#return; {28649#true} is VALID [2018-11-23 11:53:02,698 INFO L256 TraceCheckUtils]: 4: Hoare triple {28649#true} call #t~ret15 := main(); {28649#true} is VALID [2018-11-23 11:53:02,719 INFO L273 TraceCheckUtils]: 5: Hoare triple {28649#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {28694#(<= main_~i~0 0)} is VALID [2018-11-23 11:53:02,725 INFO L273 TraceCheckUtils]: 6: Hoare triple {28694#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {28698#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:02,726 INFO L273 TraceCheckUtils]: 7: Hoare triple {28698#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {28698#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:02,726 INFO L273 TraceCheckUtils]: 8: Hoare triple {28698#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28698#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:02,726 INFO L273 TraceCheckUtils]: 9: Hoare triple {28698#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {28708#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:02,727 INFO L273 TraceCheckUtils]: 10: Hoare triple {28708#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {28708#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:02,727 INFO L273 TraceCheckUtils]: 11: Hoare triple {28708#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28708#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:02,728 INFO L273 TraceCheckUtils]: 12: Hoare triple {28708#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {28718#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:02,728 INFO L273 TraceCheckUtils]: 13: Hoare triple {28718#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {28718#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:02,729 INFO L273 TraceCheckUtils]: 14: Hoare triple {28718#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28718#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:02,729 INFO L273 TraceCheckUtils]: 15: Hoare triple {28718#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {28728#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:02,730 INFO L273 TraceCheckUtils]: 16: Hoare triple {28728#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {28728#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:02,730 INFO L273 TraceCheckUtils]: 17: Hoare triple {28728#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28728#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:02,731 INFO L273 TraceCheckUtils]: 18: Hoare triple {28728#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {28738#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:02,732 INFO L273 TraceCheckUtils]: 19: Hoare triple {28738#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {28738#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:02,732 INFO L273 TraceCheckUtils]: 20: Hoare triple {28738#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28738#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:02,733 INFO L273 TraceCheckUtils]: 21: Hoare triple {28738#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {28748#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:02,733 INFO L273 TraceCheckUtils]: 22: Hoare triple {28748#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {28748#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:02,734 INFO L273 TraceCheckUtils]: 23: Hoare triple {28748#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28748#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:02,734 INFO L273 TraceCheckUtils]: 24: Hoare triple {28748#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {28758#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:02,735 INFO L273 TraceCheckUtils]: 25: Hoare triple {28758#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {28758#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:02,735 INFO L273 TraceCheckUtils]: 26: Hoare triple {28758#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28758#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:02,736 INFO L273 TraceCheckUtils]: 27: Hoare triple {28758#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {28768#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:02,736 INFO L273 TraceCheckUtils]: 28: Hoare triple {28768#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {28768#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:02,737 INFO L273 TraceCheckUtils]: 29: Hoare triple {28768#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28768#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:02,738 INFO L273 TraceCheckUtils]: 30: Hoare triple {28768#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {28778#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:02,738 INFO L273 TraceCheckUtils]: 31: Hoare triple {28778#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {28778#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:02,739 INFO L273 TraceCheckUtils]: 32: Hoare triple {28778#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28778#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:02,739 INFO L273 TraceCheckUtils]: 33: Hoare triple {28778#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {28788#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:02,740 INFO L273 TraceCheckUtils]: 34: Hoare triple {28788#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {28788#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:02,740 INFO L273 TraceCheckUtils]: 35: Hoare triple {28788#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28788#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:02,741 INFO L273 TraceCheckUtils]: 36: Hoare triple {28788#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {28798#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:02,741 INFO L273 TraceCheckUtils]: 37: Hoare triple {28798#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {28798#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:02,742 INFO L273 TraceCheckUtils]: 38: Hoare triple {28798#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28798#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:02,743 INFO L273 TraceCheckUtils]: 39: Hoare triple {28798#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {28808#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:02,743 INFO L273 TraceCheckUtils]: 40: Hoare triple {28808#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {28808#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:02,744 INFO L273 TraceCheckUtils]: 41: Hoare triple {28808#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28808#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:02,744 INFO L273 TraceCheckUtils]: 42: Hoare triple {28808#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {28818#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:02,745 INFO L273 TraceCheckUtils]: 43: Hoare triple {28818#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {28818#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:02,745 INFO L273 TraceCheckUtils]: 44: Hoare triple {28818#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28818#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:02,746 INFO L273 TraceCheckUtils]: 45: Hoare triple {28818#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {28828#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:02,746 INFO L273 TraceCheckUtils]: 46: Hoare triple {28828#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {28828#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:02,747 INFO L273 TraceCheckUtils]: 47: Hoare triple {28828#(<= main_~k~0 14)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28828#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:02,750 INFO L273 TraceCheckUtils]: 48: Hoare triple {28828#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {28838#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:02,751 INFO L273 TraceCheckUtils]: 49: Hoare triple {28838#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {28838#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:02,751 INFO L273 TraceCheckUtils]: 50: Hoare triple {28838#(<= main_~k~0 15)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28838#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:02,751 INFO L273 TraceCheckUtils]: 51: Hoare triple {28838#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {28848#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:02,752 INFO L273 TraceCheckUtils]: 52: Hoare triple {28848#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {28848#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:02,752 INFO L273 TraceCheckUtils]: 53: Hoare triple {28848#(<= main_~k~0 16)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28848#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:02,753 INFO L273 TraceCheckUtils]: 54: Hoare triple {28848#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {28858#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:02,753 INFO L273 TraceCheckUtils]: 55: Hoare triple {28858#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {28858#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:02,754 INFO L273 TraceCheckUtils]: 56: Hoare triple {28858#(<= main_~k~0 17)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28858#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:02,754 INFO L273 TraceCheckUtils]: 57: Hoare triple {28858#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {28868#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:02,755 INFO L273 TraceCheckUtils]: 58: Hoare triple {28868#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {28868#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:02,755 INFO L273 TraceCheckUtils]: 59: Hoare triple {28868#(<= main_~k~0 18)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28868#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:02,756 INFO L273 TraceCheckUtils]: 60: Hoare triple {28868#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {28878#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:02,757 INFO L273 TraceCheckUtils]: 61: Hoare triple {28878#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {28878#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:02,757 INFO L273 TraceCheckUtils]: 62: Hoare triple {28878#(<= main_~k~0 19)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28878#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:02,758 INFO L273 TraceCheckUtils]: 63: Hoare triple {28878#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {28888#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:02,758 INFO L273 TraceCheckUtils]: 64: Hoare triple {28888#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {28888#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:02,759 INFO L273 TraceCheckUtils]: 65: Hoare triple {28888#(<= main_~k~0 20)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28888#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:02,759 INFO L273 TraceCheckUtils]: 66: Hoare triple {28888#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {28898#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:02,760 INFO L273 TraceCheckUtils]: 67: Hoare triple {28898#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {28898#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:02,760 INFO L273 TraceCheckUtils]: 68: Hoare triple {28898#(<= main_~k~0 21)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28898#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:02,761 INFO L273 TraceCheckUtils]: 69: Hoare triple {28898#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {28908#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:02,761 INFO L273 TraceCheckUtils]: 70: Hoare triple {28908#(<= main_~k~0 22)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {28908#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:02,762 INFO L273 TraceCheckUtils]: 71: Hoare triple {28908#(<= main_~k~0 22)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28908#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:02,763 INFO L273 TraceCheckUtils]: 72: Hoare triple {28908#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {28918#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:02,763 INFO L273 TraceCheckUtils]: 73: Hoare triple {28918#(<= main_~k~0 23)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {28918#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:02,764 INFO L273 TraceCheckUtils]: 74: Hoare triple {28918#(<= main_~k~0 23)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28918#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:02,764 INFO L273 TraceCheckUtils]: 75: Hoare triple {28918#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {28928#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:02,765 INFO L273 TraceCheckUtils]: 76: Hoare triple {28928#(<= main_~k~0 24)} assume !(~k~0 < 100000); {28650#false} is VALID [2018-11-23 11:53:02,765 INFO L273 TraceCheckUtils]: 77: Hoare triple {28650#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28650#false} is VALID [2018-11-23 11:53:02,765 INFO L273 TraceCheckUtils]: 78: Hoare triple {28650#false} ~x~0 := 0; {28650#false} is VALID [2018-11-23 11:53:02,766 INFO L273 TraceCheckUtils]: 79: Hoare triple {28650#false} assume !(~x~0 < ~i~0); {28650#false} is VALID [2018-11-23 11:53:02,766 INFO L273 TraceCheckUtils]: 80: Hoare triple {28650#false} ~x~0 := 0; {28650#false} is VALID [2018-11-23 11:53:02,766 INFO L273 TraceCheckUtils]: 81: Hoare triple {28650#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28650#false} is VALID [2018-11-23 11:53:02,766 INFO L256 TraceCheckUtils]: 82: Hoare triple {28650#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {28650#false} is VALID [2018-11-23 11:53:02,766 INFO L273 TraceCheckUtils]: 83: Hoare triple {28650#false} ~cond := #in~cond; {28650#false} is VALID [2018-11-23 11:53:02,766 INFO L273 TraceCheckUtils]: 84: Hoare triple {28650#false} assume !(0 == ~cond); {28650#false} is VALID [2018-11-23 11:53:02,767 INFO L273 TraceCheckUtils]: 85: Hoare triple {28650#false} assume true; {28650#false} is VALID [2018-11-23 11:53:02,767 INFO L268 TraceCheckUtils]: 86: Hoare quadruple {28650#false} {28650#false} #136#return; {28650#false} is VALID [2018-11-23 11:53:02,767 INFO L273 TraceCheckUtils]: 87: Hoare triple {28650#false} havoc #t~mem9;havoc #t~mem10; {28650#false} is VALID [2018-11-23 11:53:02,767 INFO L273 TraceCheckUtils]: 88: Hoare triple {28650#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {28650#false} is VALID [2018-11-23 11:53:02,767 INFO L273 TraceCheckUtils]: 89: Hoare triple {28650#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28650#false} is VALID [2018-11-23 11:53:02,767 INFO L256 TraceCheckUtils]: 90: Hoare triple {28650#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {28650#false} is VALID [2018-11-23 11:53:02,768 INFO L273 TraceCheckUtils]: 91: Hoare triple {28650#false} ~cond := #in~cond; {28650#false} is VALID [2018-11-23 11:53:02,768 INFO L273 TraceCheckUtils]: 92: Hoare triple {28650#false} assume 0 == ~cond; {28650#false} is VALID [2018-11-23 11:53:02,768 INFO L273 TraceCheckUtils]: 93: Hoare triple {28650#false} assume !false; {28650#false} is VALID [2018-11-23 11:53:02,774 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 0 proven. 782 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:53:02,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:02,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2018-11-23 11:53:02,794 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 94 [2018-11-23 11:53:02,794 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:02,794 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states. [2018-11-23 11:53:02,955 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:02,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-11-23 11:53:02,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-11-23 11:53:02,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1002, Invalid=1650, Unknown=0, NotChecked=0, Total=2652 [2018-11-23 11:53:02,957 INFO L87 Difference]: Start difference. First operand 263 states and 366 transitions. Second operand 52 states. [2018-11-23 11:53:03,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:03,746 INFO L93 Difference]: Finished difference Result 396 states and 563 transitions. [2018-11-23 11:53:03,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 11:53:03,746 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 94 [2018-11-23 11:53:03,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:03,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 11:53:03,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 203 transitions. [2018-11-23 11:53:03,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 11:53:03,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 203 transitions. [2018-11-23 11:53:03,749 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 203 transitions. [2018-11-23 11:53:03,932 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 203 edges. 203 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:03,938 INFO L225 Difference]: With dead ends: 396 [2018-11-23 11:53:03,938 INFO L226 Difference]: Without dead ends: 278 [2018-11-23 11:53:03,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 901 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1002, Invalid=1650, Unknown=0, NotChecked=0, Total=2652 [2018-11-23 11:53:03,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-11-23 11:53:04,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 269. [2018-11-23 11:53:04,328 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:04,328 INFO L82 GeneralOperation]: Start isEquivalent. First operand 278 states. Second operand 269 states. [2018-11-23 11:53:04,328 INFO L74 IsIncluded]: Start isIncluded. First operand 278 states. Second operand 269 states. [2018-11-23 11:53:04,329 INFO L87 Difference]: Start difference. First operand 278 states. Second operand 269 states. [2018-11-23 11:53:04,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:04,335 INFO L93 Difference]: Finished difference Result 278 states and 387 transitions. [2018-11-23 11:53:04,335 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 387 transitions. [2018-11-23 11:53:04,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:04,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:04,335 INFO L74 IsIncluded]: Start isIncluded. First operand 269 states. Second operand 278 states. [2018-11-23 11:53:04,335 INFO L87 Difference]: Start difference. First operand 269 states. Second operand 278 states. [2018-11-23 11:53:04,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:04,340 INFO L93 Difference]: Finished difference Result 278 states and 387 transitions. [2018-11-23 11:53:04,340 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 387 transitions. [2018-11-23 11:53:04,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:04,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:04,341 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:04,341 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:04,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-11-23 11:53:04,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 374 transitions. [2018-11-23 11:53:04,346 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 374 transitions. Word has length 94 [2018-11-23 11:53:04,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:04,346 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 374 transitions. [2018-11-23 11:53:04,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-11-23 11:53:04,346 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 374 transitions. [2018-11-23 11:53:04,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-23 11:53:04,346 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:04,347 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:53:04,347 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:04,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:04,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1612681868, now seen corresponding path program 20 times [2018-11-23 11:53:04,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:04,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:04,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:04,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:53:04,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:04,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:06,325 INFO L256 TraceCheckUtils]: 0: Hoare triple {30442#true} call ULTIMATE.init(); {30442#true} is VALID [2018-11-23 11:53:06,326 INFO L273 TraceCheckUtils]: 1: Hoare triple {30442#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {30442#true} is VALID [2018-11-23 11:53:06,326 INFO L273 TraceCheckUtils]: 2: Hoare triple {30442#true} assume true; {30442#true} is VALID [2018-11-23 11:53:06,326 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30442#true} {30442#true} #130#return; {30442#true} is VALID [2018-11-23 11:53:06,326 INFO L256 TraceCheckUtils]: 4: Hoare triple {30442#true} call #t~ret15 := main(); {30442#true} is VALID [2018-11-23 11:53:06,326 INFO L273 TraceCheckUtils]: 5: Hoare triple {30442#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {30444#(= main_~i~0 0)} is VALID [2018-11-23 11:53:06,327 INFO L273 TraceCheckUtils]: 6: Hoare triple {30444#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {30445#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,328 INFO L273 TraceCheckUtils]: 7: Hoare triple {30445#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30445#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,328 INFO L273 TraceCheckUtils]: 8: Hoare triple {30445#(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; {30445#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,329 INFO L273 TraceCheckUtils]: 9: Hoare triple {30445#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {30446#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,330 INFO L273 TraceCheckUtils]: 10: Hoare triple {30446#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30446#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,331 INFO L273 TraceCheckUtils]: 11: Hoare triple {30446#(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; {30446#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,331 INFO L273 TraceCheckUtils]: 12: Hoare triple {30446#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {30447#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,332 INFO L273 TraceCheckUtils]: 13: Hoare triple {30447#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30447#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,333 INFO L273 TraceCheckUtils]: 14: Hoare triple {30447#(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; {30447#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,334 INFO L273 TraceCheckUtils]: 15: Hoare triple {30447#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {30448#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,335 INFO L273 TraceCheckUtils]: 16: Hoare triple {30448#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30448#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,335 INFO L273 TraceCheckUtils]: 17: Hoare triple {30448#(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; {30448#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,336 INFO L273 TraceCheckUtils]: 18: Hoare triple {30448#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {30449#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,337 INFO L273 TraceCheckUtils]: 19: Hoare triple {30449#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30449#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,338 INFO L273 TraceCheckUtils]: 20: Hoare triple {30449#(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; {30449#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,339 INFO L273 TraceCheckUtils]: 21: Hoare triple {30449#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {30450#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,340 INFO L273 TraceCheckUtils]: 22: Hoare triple {30450#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30450#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,340 INFO L273 TraceCheckUtils]: 23: Hoare triple {30450#(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; {30450#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,341 INFO L273 TraceCheckUtils]: 24: Hoare triple {30450#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {30451#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,342 INFO L273 TraceCheckUtils]: 25: Hoare triple {30451#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30451#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,342 INFO L273 TraceCheckUtils]: 26: Hoare triple {30451#(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; {30451#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,343 INFO L273 TraceCheckUtils]: 27: Hoare triple {30451#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {30452#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,344 INFO L273 TraceCheckUtils]: 28: Hoare triple {30452#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30452#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,345 INFO L273 TraceCheckUtils]: 29: Hoare triple {30452#(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; {30452#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,345 INFO L273 TraceCheckUtils]: 30: Hoare triple {30452#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {30453#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,346 INFO L273 TraceCheckUtils]: 31: Hoare triple {30453#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30453#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,347 INFO L273 TraceCheckUtils]: 32: Hoare triple {30453#(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; {30453#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,348 INFO L273 TraceCheckUtils]: 33: Hoare triple {30453#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {30454#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,348 INFO L273 TraceCheckUtils]: 34: Hoare triple {30454#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30454#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,349 INFO L273 TraceCheckUtils]: 35: Hoare triple {30454#(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; {30454#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,350 INFO L273 TraceCheckUtils]: 36: Hoare triple {30454#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {30455#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,351 INFO L273 TraceCheckUtils]: 37: Hoare triple {30455#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30455#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,352 INFO L273 TraceCheckUtils]: 38: Hoare triple {30455#(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; {30455#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,352 INFO L273 TraceCheckUtils]: 39: Hoare triple {30455#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {30456#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,353 INFO L273 TraceCheckUtils]: 40: Hoare triple {30456#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30456#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,354 INFO L273 TraceCheckUtils]: 41: Hoare triple {30456#(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; {30456#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,355 INFO L273 TraceCheckUtils]: 42: Hoare triple {30456#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {30457#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,355 INFO L273 TraceCheckUtils]: 43: Hoare triple {30457#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30457#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,356 INFO L273 TraceCheckUtils]: 44: Hoare triple {30457#(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; {30457#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,357 INFO L273 TraceCheckUtils]: 45: Hoare triple {30457#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {30458#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,358 INFO L273 TraceCheckUtils]: 46: Hoare triple {30458#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30458#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,358 INFO L273 TraceCheckUtils]: 47: Hoare triple {30458#(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; {30458#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,359 INFO L273 TraceCheckUtils]: 48: Hoare triple {30458#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {30459#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,360 INFO L273 TraceCheckUtils]: 49: Hoare triple {30459#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30459#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,361 INFO L273 TraceCheckUtils]: 50: Hoare triple {30459#(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; {30459#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,362 INFO L273 TraceCheckUtils]: 51: Hoare triple {30459#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {30460#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,363 INFO L273 TraceCheckUtils]: 52: Hoare triple {30460#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30460#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,363 INFO L273 TraceCheckUtils]: 53: Hoare triple {30460#(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; {30460#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,364 INFO L273 TraceCheckUtils]: 54: Hoare triple {30460#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {30461#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:53:06,365 INFO L273 TraceCheckUtils]: 55: Hoare triple {30461#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30461#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:53:06,366 INFO L273 TraceCheckUtils]: 56: Hoare triple {30461#(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; {30461#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:53:06,367 INFO L273 TraceCheckUtils]: 57: Hoare triple {30461#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} ~k~0 := 1 + ~k~0; {30462#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,367 INFO L273 TraceCheckUtils]: 58: Hoare triple {30462#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30462#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,368 INFO L273 TraceCheckUtils]: 59: Hoare triple {30462#(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; {30462#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,369 INFO L273 TraceCheckUtils]: 60: Hoare triple {30462#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {30463#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,370 INFO L273 TraceCheckUtils]: 61: Hoare triple {30463#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30463#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,370 INFO L273 TraceCheckUtils]: 62: Hoare triple {30463#(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; {30463#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,371 INFO L273 TraceCheckUtils]: 63: Hoare triple {30463#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {30464#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,372 INFO L273 TraceCheckUtils]: 64: Hoare triple {30464#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30464#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,373 INFO L273 TraceCheckUtils]: 65: Hoare triple {30464#(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; {30464#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,373 INFO L273 TraceCheckUtils]: 66: Hoare triple {30464#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {30465#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,374 INFO L273 TraceCheckUtils]: 67: Hoare triple {30465#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30465#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,375 INFO L273 TraceCheckUtils]: 68: Hoare triple {30465#(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; {30465#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,376 INFO L273 TraceCheckUtils]: 69: Hoare triple {30465#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {30466#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,376 INFO L273 TraceCheckUtils]: 70: Hoare triple {30466#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30466#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,377 INFO L273 TraceCheckUtils]: 71: Hoare triple {30466#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30466#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,378 INFO L273 TraceCheckUtils]: 72: Hoare triple {30466#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {30467#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,378 INFO L273 TraceCheckUtils]: 73: Hoare triple {30467#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30467#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,379 INFO L273 TraceCheckUtils]: 74: Hoare triple {30467#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30467#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,380 INFO L273 TraceCheckUtils]: 75: Hoare triple {30467#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {30468#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,381 INFO L273 TraceCheckUtils]: 76: Hoare triple {30468#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30468#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,381 INFO L273 TraceCheckUtils]: 77: Hoare triple {30468#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30468#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,382 INFO L273 TraceCheckUtils]: 78: Hoare triple {30468#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {30469#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:06,383 INFO L273 TraceCheckUtils]: 79: Hoare triple {30469#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} assume !(~k~0 < 100000); {30443#false} is VALID [2018-11-23 11:53:06,383 INFO L273 TraceCheckUtils]: 80: Hoare triple {30443#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30443#false} is VALID [2018-11-23 11:53:06,383 INFO L273 TraceCheckUtils]: 81: Hoare triple {30443#false} ~x~0 := 0; {30443#false} is VALID [2018-11-23 11:53:06,383 INFO L273 TraceCheckUtils]: 82: Hoare triple {30443#false} assume !(~x~0 < ~i~0); {30443#false} is VALID [2018-11-23 11:53:06,384 INFO L273 TraceCheckUtils]: 83: Hoare triple {30443#false} ~x~0 := 0; {30443#false} is VALID [2018-11-23 11:53:06,384 INFO L273 TraceCheckUtils]: 84: Hoare triple {30443#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30443#false} is VALID [2018-11-23 11:53:06,384 INFO L256 TraceCheckUtils]: 85: Hoare triple {30443#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {30442#true} is VALID [2018-11-23 11:53:06,384 INFO L273 TraceCheckUtils]: 86: Hoare triple {30442#true} ~cond := #in~cond; {30442#true} is VALID [2018-11-23 11:53:06,384 INFO L273 TraceCheckUtils]: 87: Hoare triple {30442#true} assume !(0 == ~cond); {30442#true} is VALID [2018-11-23 11:53:06,385 INFO L273 TraceCheckUtils]: 88: Hoare triple {30442#true} assume true; {30442#true} is VALID [2018-11-23 11:53:06,385 INFO L268 TraceCheckUtils]: 89: Hoare quadruple {30442#true} {30443#false} #136#return; {30443#false} is VALID [2018-11-23 11:53:06,385 INFO L273 TraceCheckUtils]: 90: Hoare triple {30443#false} havoc #t~mem9;havoc #t~mem10; {30443#false} is VALID [2018-11-23 11:53:06,385 INFO L273 TraceCheckUtils]: 91: Hoare triple {30443#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {30443#false} is VALID [2018-11-23 11:53:06,385 INFO L273 TraceCheckUtils]: 92: Hoare triple {30443#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30443#false} is VALID [2018-11-23 11:53:06,385 INFO L256 TraceCheckUtils]: 93: Hoare triple {30443#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {30443#false} is VALID [2018-11-23 11:53:06,385 INFO L273 TraceCheckUtils]: 94: Hoare triple {30443#false} ~cond := #in~cond; {30443#false} is VALID [2018-11-23 11:53:06,386 INFO L273 TraceCheckUtils]: 95: Hoare triple {30443#false} assume 0 == ~cond; {30443#false} is VALID [2018-11-23 11:53:06,386 INFO L273 TraceCheckUtils]: 96: Hoare triple {30443#false} assume !false; {30443#false} is VALID [2018-11-23 11:53:06,400 INFO L134 CoverageAnalysis]: Checked inductivity of 856 backedges. 2 proven. 852 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:53:06,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:06,400 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:53:06,410 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:53:06,460 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:53:06,461 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:06,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:06,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:07,130 INFO L256 TraceCheckUtils]: 0: Hoare triple {30442#true} call ULTIMATE.init(); {30442#true} is VALID [2018-11-23 11:53:07,130 INFO L273 TraceCheckUtils]: 1: Hoare triple {30442#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {30442#true} is VALID [2018-11-23 11:53:07,130 INFO L273 TraceCheckUtils]: 2: Hoare triple {30442#true} assume true; {30442#true} is VALID [2018-11-23 11:53:07,130 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30442#true} {30442#true} #130#return; {30442#true} is VALID [2018-11-23 11:53:07,131 INFO L256 TraceCheckUtils]: 4: Hoare triple {30442#true} call #t~ret15 := main(); {30442#true} is VALID [2018-11-23 11:53:07,131 INFO L273 TraceCheckUtils]: 5: Hoare triple {30442#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {30488#(<= main_~i~0 0)} is VALID [2018-11-23 11:53:07,132 INFO L273 TraceCheckUtils]: 6: Hoare triple {30488#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {30492#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:07,132 INFO L273 TraceCheckUtils]: 7: Hoare triple {30492#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30492#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:07,133 INFO L273 TraceCheckUtils]: 8: Hoare triple {30492#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30492#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:07,133 INFO L273 TraceCheckUtils]: 9: Hoare triple {30492#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {30502#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:07,133 INFO L273 TraceCheckUtils]: 10: Hoare triple {30502#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30502#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:07,134 INFO L273 TraceCheckUtils]: 11: Hoare triple {30502#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30502#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:07,134 INFO L273 TraceCheckUtils]: 12: Hoare triple {30502#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {30512#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:07,134 INFO L273 TraceCheckUtils]: 13: Hoare triple {30512#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30512#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:07,135 INFO L273 TraceCheckUtils]: 14: Hoare triple {30512#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30512#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:07,135 INFO L273 TraceCheckUtils]: 15: Hoare triple {30512#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {30522#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:07,136 INFO L273 TraceCheckUtils]: 16: Hoare triple {30522#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30522#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:07,136 INFO L273 TraceCheckUtils]: 17: Hoare triple {30522#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30522#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:07,137 INFO L273 TraceCheckUtils]: 18: Hoare triple {30522#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {30532#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:07,138 INFO L273 TraceCheckUtils]: 19: Hoare triple {30532#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30532#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:07,138 INFO L273 TraceCheckUtils]: 20: Hoare triple {30532#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30532#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:07,139 INFO L273 TraceCheckUtils]: 21: Hoare triple {30532#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {30542#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:07,139 INFO L273 TraceCheckUtils]: 22: Hoare triple {30542#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30542#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:07,140 INFO L273 TraceCheckUtils]: 23: Hoare triple {30542#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30542#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:07,140 INFO L273 TraceCheckUtils]: 24: Hoare triple {30542#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {30552#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:07,141 INFO L273 TraceCheckUtils]: 25: Hoare triple {30552#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30552#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:07,141 INFO L273 TraceCheckUtils]: 26: Hoare triple {30552#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30552#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:07,142 INFO L273 TraceCheckUtils]: 27: Hoare triple {30552#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {30562#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:07,143 INFO L273 TraceCheckUtils]: 28: Hoare triple {30562#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30562#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:07,143 INFO L273 TraceCheckUtils]: 29: Hoare triple {30562#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30562#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:07,144 INFO L273 TraceCheckUtils]: 30: Hoare triple {30562#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {30572#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:07,144 INFO L273 TraceCheckUtils]: 31: Hoare triple {30572#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30572#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:07,145 INFO L273 TraceCheckUtils]: 32: Hoare triple {30572#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30572#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:07,145 INFO L273 TraceCheckUtils]: 33: Hoare triple {30572#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {30582#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:07,146 INFO L273 TraceCheckUtils]: 34: Hoare triple {30582#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30582#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:07,146 INFO L273 TraceCheckUtils]: 35: Hoare triple {30582#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30582#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:07,147 INFO L273 TraceCheckUtils]: 36: Hoare triple {30582#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {30592#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:07,148 INFO L273 TraceCheckUtils]: 37: Hoare triple {30592#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30592#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:07,148 INFO L273 TraceCheckUtils]: 38: Hoare triple {30592#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30592#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:07,149 INFO L273 TraceCheckUtils]: 39: Hoare triple {30592#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {30602#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:07,149 INFO L273 TraceCheckUtils]: 40: Hoare triple {30602#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30602#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:07,150 INFO L273 TraceCheckUtils]: 41: Hoare triple {30602#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30602#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:07,150 INFO L273 TraceCheckUtils]: 42: Hoare triple {30602#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {30612#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:07,151 INFO L273 TraceCheckUtils]: 43: Hoare triple {30612#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30612#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:07,151 INFO L273 TraceCheckUtils]: 44: Hoare triple {30612#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30612#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:07,152 INFO L273 TraceCheckUtils]: 45: Hoare triple {30612#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {30622#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:07,153 INFO L273 TraceCheckUtils]: 46: Hoare triple {30622#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30622#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:07,153 INFO L273 TraceCheckUtils]: 47: Hoare triple {30622#(<= main_~k~0 14)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30622#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:07,154 INFO L273 TraceCheckUtils]: 48: Hoare triple {30622#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {30632#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:07,154 INFO L273 TraceCheckUtils]: 49: Hoare triple {30632#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30632#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:07,155 INFO L273 TraceCheckUtils]: 50: Hoare triple {30632#(<= main_~k~0 15)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30632#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:07,155 INFO L273 TraceCheckUtils]: 51: Hoare triple {30632#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {30642#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:07,156 INFO L273 TraceCheckUtils]: 52: Hoare triple {30642#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30642#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:07,156 INFO L273 TraceCheckUtils]: 53: Hoare triple {30642#(<= main_~k~0 16)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30642#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:07,157 INFO L273 TraceCheckUtils]: 54: Hoare triple {30642#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {30652#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:07,158 INFO L273 TraceCheckUtils]: 55: Hoare triple {30652#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30652#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:07,158 INFO L273 TraceCheckUtils]: 56: Hoare triple {30652#(<= main_~k~0 17)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30652#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:07,159 INFO L273 TraceCheckUtils]: 57: Hoare triple {30652#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {30662#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:07,159 INFO L273 TraceCheckUtils]: 58: Hoare triple {30662#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30662#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:07,160 INFO L273 TraceCheckUtils]: 59: Hoare triple {30662#(<= main_~k~0 18)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30662#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:07,160 INFO L273 TraceCheckUtils]: 60: Hoare triple {30662#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {30672#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:07,161 INFO L273 TraceCheckUtils]: 61: Hoare triple {30672#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30672#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:07,161 INFO L273 TraceCheckUtils]: 62: Hoare triple {30672#(<= main_~k~0 19)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30672#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:07,162 INFO L273 TraceCheckUtils]: 63: Hoare triple {30672#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {30682#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:07,162 INFO L273 TraceCheckUtils]: 64: Hoare triple {30682#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30682#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:07,163 INFO L273 TraceCheckUtils]: 65: Hoare triple {30682#(<= main_~k~0 20)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30682#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:07,164 INFO L273 TraceCheckUtils]: 66: Hoare triple {30682#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {30692#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:07,164 INFO L273 TraceCheckUtils]: 67: Hoare triple {30692#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30692#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:07,165 INFO L273 TraceCheckUtils]: 68: Hoare triple {30692#(<= main_~k~0 21)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30692#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:07,165 INFO L273 TraceCheckUtils]: 69: Hoare triple {30692#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {30702#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:07,166 INFO L273 TraceCheckUtils]: 70: Hoare triple {30702#(<= main_~k~0 22)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30702#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:07,166 INFO L273 TraceCheckUtils]: 71: Hoare triple {30702#(<= main_~k~0 22)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30702#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:07,167 INFO L273 TraceCheckUtils]: 72: Hoare triple {30702#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {30712#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:07,167 INFO L273 TraceCheckUtils]: 73: Hoare triple {30712#(<= main_~k~0 23)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30712#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:07,168 INFO L273 TraceCheckUtils]: 74: Hoare triple {30712#(<= main_~k~0 23)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30712#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:07,169 INFO L273 TraceCheckUtils]: 75: Hoare triple {30712#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {30722#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:07,169 INFO L273 TraceCheckUtils]: 76: Hoare triple {30722#(<= main_~k~0 24)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30722#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:07,170 INFO L273 TraceCheckUtils]: 77: Hoare triple {30722#(<= main_~k~0 24)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30722#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:07,170 INFO L273 TraceCheckUtils]: 78: Hoare triple {30722#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {30732#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:07,171 INFO L273 TraceCheckUtils]: 79: Hoare triple {30732#(<= main_~k~0 25)} assume !(~k~0 < 100000); {30443#false} is VALID [2018-11-23 11:53:07,171 INFO L273 TraceCheckUtils]: 80: Hoare triple {30443#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30443#false} is VALID [2018-11-23 11:53:07,171 INFO L273 TraceCheckUtils]: 81: Hoare triple {30443#false} ~x~0 := 0; {30443#false} is VALID [2018-11-23 11:53:07,172 INFO L273 TraceCheckUtils]: 82: Hoare triple {30443#false} assume !(~x~0 < ~i~0); {30443#false} is VALID [2018-11-23 11:53:07,172 INFO L273 TraceCheckUtils]: 83: Hoare triple {30443#false} ~x~0 := 0; {30443#false} is VALID [2018-11-23 11:53:07,172 INFO L273 TraceCheckUtils]: 84: Hoare triple {30443#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30443#false} is VALID [2018-11-23 11:53:07,172 INFO L256 TraceCheckUtils]: 85: Hoare triple {30443#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {30443#false} is VALID [2018-11-23 11:53:07,172 INFO L273 TraceCheckUtils]: 86: Hoare triple {30443#false} ~cond := #in~cond; {30443#false} is VALID [2018-11-23 11:53:07,172 INFO L273 TraceCheckUtils]: 87: Hoare triple {30443#false} assume !(0 == ~cond); {30443#false} is VALID [2018-11-23 11:53:07,173 INFO L273 TraceCheckUtils]: 88: Hoare triple {30443#false} assume true; {30443#false} is VALID [2018-11-23 11:53:07,173 INFO L268 TraceCheckUtils]: 89: Hoare quadruple {30443#false} {30443#false} #136#return; {30443#false} is VALID [2018-11-23 11:53:07,173 INFO L273 TraceCheckUtils]: 90: Hoare triple {30443#false} havoc #t~mem9;havoc #t~mem10; {30443#false} is VALID [2018-11-23 11:53:07,173 INFO L273 TraceCheckUtils]: 91: Hoare triple {30443#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {30443#false} is VALID [2018-11-23 11:53:07,173 INFO L273 TraceCheckUtils]: 92: Hoare triple {30443#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30443#false} is VALID [2018-11-23 11:53:07,174 INFO L256 TraceCheckUtils]: 93: Hoare triple {30443#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {30443#false} is VALID [2018-11-23 11:53:07,174 INFO L273 TraceCheckUtils]: 94: Hoare triple {30443#false} ~cond := #in~cond; {30443#false} is VALID [2018-11-23 11:53:07,174 INFO L273 TraceCheckUtils]: 95: Hoare triple {30443#false} assume 0 == ~cond; {30443#false} is VALID [2018-11-23 11:53:07,174 INFO L273 TraceCheckUtils]: 96: Hoare triple {30443#false} assume !false; {30443#false} is VALID [2018-11-23 11:53:07,180 INFO L134 CoverageAnalysis]: Checked inductivity of 856 backedges. 0 proven. 852 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:53:07,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:07,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 54 [2018-11-23 11:53:07,200 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 97 [2018-11-23 11:53:07,200 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:07,200 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states. [2018-11-23 11:53:07,377 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:07,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-11-23 11:53:07,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-11-23 11:53:07,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1781, Unknown=0, NotChecked=0, Total=2862 [2018-11-23 11:53:07,380 INFO L87 Difference]: Start difference. First operand 269 states and 374 transitions. Second operand 54 states. [2018-11-23 11:53:08,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:08,501 INFO L93 Difference]: Finished difference Result 402 states and 571 transitions. [2018-11-23 11:53:08,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 11:53:08,501 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 97 [2018-11-23 11:53:08,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:08,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 11:53:08,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 207 transitions. [2018-11-23 11:53:08,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 11:53:08,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 207 transitions. [2018-11-23 11:53:08,505 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 207 transitions. [2018-11-23 11:53:08,708 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 207 edges. 207 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:08,715 INFO L225 Difference]: With dead ends: 402 [2018-11-23 11:53:08,715 INFO L226 Difference]: Without dead ends: 284 [2018-11-23 11:53:08,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 976 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1081, Invalid=1781, Unknown=0, NotChecked=0, Total=2862 [2018-11-23 11:53:08,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-11-23 11:53:09,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 275. [2018-11-23 11:53:09,087 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:09,087 INFO L82 GeneralOperation]: Start isEquivalent. First operand 284 states. Second operand 275 states. [2018-11-23 11:53:09,088 INFO L74 IsIncluded]: Start isIncluded. First operand 284 states. Second operand 275 states. [2018-11-23 11:53:09,088 INFO L87 Difference]: Start difference. First operand 284 states. Second operand 275 states. [2018-11-23 11:53:09,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:09,094 INFO L93 Difference]: Finished difference Result 284 states and 395 transitions. [2018-11-23 11:53:09,094 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 395 transitions. [2018-11-23 11:53:09,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:09,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:09,095 INFO L74 IsIncluded]: Start isIncluded. First operand 275 states. Second operand 284 states. [2018-11-23 11:53:09,095 INFO L87 Difference]: Start difference. First operand 275 states. Second operand 284 states. [2018-11-23 11:53:09,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:09,100 INFO L93 Difference]: Finished difference Result 284 states and 395 transitions. [2018-11-23 11:53:09,100 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 395 transitions. [2018-11-23 11:53:09,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:09,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:09,100 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:09,100 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:09,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-11-23 11:53:09,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 382 transitions. [2018-11-23 11:53:09,106 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 382 transitions. Word has length 97 [2018-11-23 11:53:09,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:09,106 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 382 transitions. [2018-11-23 11:53:09,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-11-23 11:53:09,106 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 382 transitions. [2018-11-23 11:53:09,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-23 11:53:09,107 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:09,107 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:53:09,107 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:09,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:09,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1262408079, now seen corresponding path program 21 times [2018-11-23 11:53:09,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:09,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:09,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:09,109 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:09,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:09,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:10,144 INFO L256 TraceCheckUtils]: 0: Hoare triple {32274#true} call ULTIMATE.init(); {32274#true} is VALID [2018-11-23 11:53:10,144 INFO L273 TraceCheckUtils]: 1: Hoare triple {32274#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {32274#true} is VALID [2018-11-23 11:53:10,145 INFO L273 TraceCheckUtils]: 2: Hoare triple {32274#true} assume true; {32274#true} is VALID [2018-11-23 11:53:10,145 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32274#true} {32274#true} #130#return; {32274#true} is VALID [2018-11-23 11:53:10,145 INFO L256 TraceCheckUtils]: 4: Hoare triple {32274#true} call #t~ret15 := main(); {32274#true} is VALID [2018-11-23 11:53:10,145 INFO L273 TraceCheckUtils]: 5: Hoare triple {32274#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {32276#(= main_~i~0 0)} is VALID [2018-11-23 11:53:10,146 INFO L273 TraceCheckUtils]: 6: Hoare triple {32276#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {32277#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,146 INFO L273 TraceCheckUtils]: 7: Hoare triple {32277#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32277#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,147 INFO L273 TraceCheckUtils]: 8: Hoare triple {32277#(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; {32277#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,147 INFO L273 TraceCheckUtils]: 9: Hoare triple {32277#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {32278#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,148 INFO L273 TraceCheckUtils]: 10: Hoare triple {32278#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32278#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,149 INFO L273 TraceCheckUtils]: 11: Hoare triple {32278#(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; {32278#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,150 INFO L273 TraceCheckUtils]: 12: Hoare triple {32278#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {32279#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,151 INFO L273 TraceCheckUtils]: 13: Hoare triple {32279#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32279#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,151 INFO L273 TraceCheckUtils]: 14: Hoare triple {32279#(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; {32279#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,152 INFO L273 TraceCheckUtils]: 15: Hoare triple {32279#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {32280#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,153 INFO L273 TraceCheckUtils]: 16: Hoare triple {32280#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32280#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,154 INFO L273 TraceCheckUtils]: 17: Hoare triple {32280#(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; {32280#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,155 INFO L273 TraceCheckUtils]: 18: Hoare triple {32280#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {32281#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,155 INFO L273 TraceCheckUtils]: 19: Hoare triple {32281#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32281#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,156 INFO L273 TraceCheckUtils]: 20: Hoare triple {32281#(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; {32281#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,157 INFO L273 TraceCheckUtils]: 21: Hoare triple {32281#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {32282#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,158 INFO L273 TraceCheckUtils]: 22: Hoare triple {32282#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32282#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,159 INFO L273 TraceCheckUtils]: 23: Hoare triple {32282#(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; {32282#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,159 INFO L273 TraceCheckUtils]: 24: Hoare triple {32282#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {32283#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,160 INFO L273 TraceCheckUtils]: 25: Hoare triple {32283#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32283#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,161 INFO L273 TraceCheckUtils]: 26: Hoare triple {32283#(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; {32283#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,162 INFO L273 TraceCheckUtils]: 27: Hoare triple {32283#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {32284#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,162 INFO L273 TraceCheckUtils]: 28: Hoare triple {32284#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32284#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,163 INFO L273 TraceCheckUtils]: 29: Hoare triple {32284#(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; {32284#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,164 INFO L273 TraceCheckUtils]: 30: Hoare triple {32284#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {32285#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,165 INFO L273 TraceCheckUtils]: 31: Hoare triple {32285#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32285#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,165 INFO L273 TraceCheckUtils]: 32: Hoare triple {32285#(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; {32285#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,166 INFO L273 TraceCheckUtils]: 33: Hoare triple {32285#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {32286#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,167 INFO L273 TraceCheckUtils]: 34: Hoare triple {32286#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32286#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,168 INFO L273 TraceCheckUtils]: 35: Hoare triple {32286#(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; {32286#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,169 INFO L273 TraceCheckUtils]: 36: Hoare triple {32286#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {32287#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,169 INFO L273 TraceCheckUtils]: 37: Hoare triple {32287#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32287#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,170 INFO L273 TraceCheckUtils]: 38: Hoare triple {32287#(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; {32287#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,171 INFO L273 TraceCheckUtils]: 39: Hoare triple {32287#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {32288#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,172 INFO L273 TraceCheckUtils]: 40: Hoare triple {32288#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32288#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,172 INFO L273 TraceCheckUtils]: 41: Hoare triple {32288#(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; {32288#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,173 INFO L273 TraceCheckUtils]: 42: Hoare triple {32288#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {32289#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,174 INFO L273 TraceCheckUtils]: 43: Hoare triple {32289#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32289#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,175 INFO L273 TraceCheckUtils]: 44: Hoare triple {32289#(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; {32289#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,175 INFO L273 TraceCheckUtils]: 45: Hoare triple {32289#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {32290#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,176 INFO L273 TraceCheckUtils]: 46: Hoare triple {32290#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32290#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,177 INFO L273 TraceCheckUtils]: 47: Hoare triple {32290#(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; {32290#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,178 INFO L273 TraceCheckUtils]: 48: Hoare triple {32290#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {32291#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,179 INFO L273 TraceCheckUtils]: 49: Hoare triple {32291#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32291#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,180 INFO L273 TraceCheckUtils]: 50: Hoare triple {32291#(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; {32291#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,180 INFO L273 TraceCheckUtils]: 51: Hoare triple {32291#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {32292#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,181 INFO L273 TraceCheckUtils]: 52: Hoare triple {32292#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32292#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,182 INFO L273 TraceCheckUtils]: 53: Hoare triple {32292#(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; {32292#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,183 INFO L273 TraceCheckUtils]: 54: Hoare triple {32292#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {32293#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:53:10,184 INFO L273 TraceCheckUtils]: 55: Hoare triple {32293#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32293#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:53:10,185 INFO L273 TraceCheckUtils]: 56: Hoare triple {32293#(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; {32293#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:53:10,186 INFO L273 TraceCheckUtils]: 57: Hoare triple {32293#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} ~k~0 := 1 + ~k~0; {32294#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,187 INFO L273 TraceCheckUtils]: 58: Hoare triple {32294#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32294#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,188 INFO L273 TraceCheckUtils]: 59: Hoare triple {32294#(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; {32294#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,188 INFO L273 TraceCheckUtils]: 60: Hoare triple {32294#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {32295#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,189 INFO L273 TraceCheckUtils]: 61: Hoare triple {32295#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32295#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,190 INFO L273 TraceCheckUtils]: 62: Hoare triple {32295#(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; {32295#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,191 INFO L273 TraceCheckUtils]: 63: Hoare triple {32295#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {32296#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,192 INFO L273 TraceCheckUtils]: 64: Hoare triple {32296#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32296#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,193 INFO L273 TraceCheckUtils]: 65: Hoare triple {32296#(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; {32296#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,194 INFO L273 TraceCheckUtils]: 66: Hoare triple {32296#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {32297#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,194 INFO L273 TraceCheckUtils]: 67: Hoare triple {32297#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32297#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,195 INFO L273 TraceCheckUtils]: 68: Hoare triple {32297#(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; {32297#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,196 INFO L273 TraceCheckUtils]: 69: Hoare triple {32297#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {32298#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,197 INFO L273 TraceCheckUtils]: 70: Hoare triple {32298#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32298#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,198 INFO L273 TraceCheckUtils]: 71: Hoare triple {32298#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32298#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,199 INFO L273 TraceCheckUtils]: 72: Hoare triple {32298#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {32299#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,200 INFO L273 TraceCheckUtils]: 73: Hoare triple {32299#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32299#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,201 INFO L273 TraceCheckUtils]: 74: Hoare triple {32299#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32299#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,201 INFO L273 TraceCheckUtils]: 75: Hoare triple {32299#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {32300#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,202 INFO L273 TraceCheckUtils]: 76: Hoare triple {32300#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32300#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,203 INFO L273 TraceCheckUtils]: 77: Hoare triple {32300#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32300#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,204 INFO L273 TraceCheckUtils]: 78: Hoare triple {32300#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {32301#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,205 INFO L273 TraceCheckUtils]: 79: Hoare triple {32301#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32301#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,206 INFO L273 TraceCheckUtils]: 80: Hoare triple {32301#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32301#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,207 INFO L273 TraceCheckUtils]: 81: Hoare triple {32301#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {32302#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:10,208 INFO L273 TraceCheckUtils]: 82: Hoare triple {32302#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} assume !(~k~0 < 100000); {32275#false} is VALID [2018-11-23 11:53:10,208 INFO L273 TraceCheckUtils]: 83: Hoare triple {32275#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32275#false} is VALID [2018-11-23 11:53:10,208 INFO L273 TraceCheckUtils]: 84: Hoare triple {32275#false} ~x~0 := 0; {32275#false} is VALID [2018-11-23 11:53:10,208 INFO L273 TraceCheckUtils]: 85: Hoare triple {32275#false} assume !(~x~0 < ~i~0); {32275#false} is VALID [2018-11-23 11:53:10,209 INFO L273 TraceCheckUtils]: 86: Hoare triple {32275#false} ~x~0 := 0; {32275#false} is VALID [2018-11-23 11:53:10,209 INFO L273 TraceCheckUtils]: 87: Hoare triple {32275#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32275#false} is VALID [2018-11-23 11:53:10,209 INFO L256 TraceCheckUtils]: 88: Hoare triple {32275#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {32274#true} is VALID [2018-11-23 11:53:10,209 INFO L273 TraceCheckUtils]: 89: Hoare triple {32274#true} ~cond := #in~cond; {32274#true} is VALID [2018-11-23 11:53:10,210 INFO L273 TraceCheckUtils]: 90: Hoare triple {32274#true} assume !(0 == ~cond); {32274#true} is VALID [2018-11-23 11:53:10,210 INFO L273 TraceCheckUtils]: 91: Hoare triple {32274#true} assume true; {32274#true} is VALID [2018-11-23 11:53:10,210 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {32274#true} {32275#false} #136#return; {32275#false} is VALID [2018-11-23 11:53:10,210 INFO L273 TraceCheckUtils]: 93: Hoare triple {32275#false} havoc #t~mem9;havoc #t~mem10; {32275#false} is VALID [2018-11-23 11:53:10,211 INFO L273 TraceCheckUtils]: 94: Hoare triple {32275#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {32275#false} is VALID [2018-11-23 11:53:10,211 INFO L273 TraceCheckUtils]: 95: Hoare triple {32275#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32275#false} is VALID [2018-11-23 11:53:10,211 INFO L256 TraceCheckUtils]: 96: Hoare triple {32275#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {32275#false} is VALID [2018-11-23 11:53:10,211 INFO L273 TraceCheckUtils]: 97: Hoare triple {32275#false} ~cond := #in~cond; {32275#false} is VALID [2018-11-23 11:53:10,211 INFO L273 TraceCheckUtils]: 98: Hoare triple {32275#false} assume 0 == ~cond; {32275#false} is VALID [2018-11-23 11:53:10,213 INFO L273 TraceCheckUtils]: 99: Hoare triple {32275#false} assume !false; {32275#false} is VALID [2018-11-23 11:53:10,236 INFO L134 CoverageAnalysis]: Checked inductivity of 929 backedges. 2 proven. 925 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:53:10,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:10,236 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:53:10,272 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:53:10,400 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-11-23 11:53:10,400 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:10,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:10,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:11,087 INFO L256 TraceCheckUtils]: 0: Hoare triple {32274#true} call ULTIMATE.init(); {32274#true} is VALID [2018-11-23 11:53:11,088 INFO L273 TraceCheckUtils]: 1: Hoare triple {32274#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {32274#true} is VALID [2018-11-23 11:53:11,088 INFO L273 TraceCheckUtils]: 2: Hoare triple {32274#true} assume true; {32274#true} is VALID [2018-11-23 11:53:11,088 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32274#true} {32274#true} #130#return; {32274#true} is VALID [2018-11-23 11:53:11,088 INFO L256 TraceCheckUtils]: 4: Hoare triple {32274#true} call #t~ret15 := main(); {32274#true} is VALID [2018-11-23 11:53:11,089 INFO L273 TraceCheckUtils]: 5: Hoare triple {32274#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {32321#(<= main_~i~0 0)} is VALID [2018-11-23 11:53:11,090 INFO L273 TraceCheckUtils]: 6: Hoare triple {32321#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {32325#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:11,090 INFO L273 TraceCheckUtils]: 7: Hoare triple {32325#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32325#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:11,090 INFO L273 TraceCheckUtils]: 8: Hoare triple {32325#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32325#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:11,091 INFO L273 TraceCheckUtils]: 9: Hoare triple {32325#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {32335#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:11,091 INFO L273 TraceCheckUtils]: 10: Hoare triple {32335#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32335#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:11,091 INFO L273 TraceCheckUtils]: 11: Hoare triple {32335#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32335#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:11,092 INFO L273 TraceCheckUtils]: 12: Hoare triple {32335#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {32345#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:11,093 INFO L273 TraceCheckUtils]: 13: Hoare triple {32345#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32345#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:11,093 INFO L273 TraceCheckUtils]: 14: Hoare triple {32345#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32345#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:11,094 INFO L273 TraceCheckUtils]: 15: Hoare triple {32345#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {32355#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:11,094 INFO L273 TraceCheckUtils]: 16: Hoare triple {32355#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32355#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:11,095 INFO L273 TraceCheckUtils]: 17: Hoare triple {32355#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32355#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:11,095 INFO L273 TraceCheckUtils]: 18: Hoare triple {32355#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {32365#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:11,096 INFO L273 TraceCheckUtils]: 19: Hoare triple {32365#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32365#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:11,096 INFO L273 TraceCheckUtils]: 20: Hoare triple {32365#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32365#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:11,097 INFO L273 TraceCheckUtils]: 21: Hoare triple {32365#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {32375#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:11,098 INFO L273 TraceCheckUtils]: 22: Hoare triple {32375#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32375#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:11,098 INFO L273 TraceCheckUtils]: 23: Hoare triple {32375#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32375#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:11,099 INFO L273 TraceCheckUtils]: 24: Hoare triple {32375#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {32385#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:11,099 INFO L273 TraceCheckUtils]: 25: Hoare triple {32385#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32385#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:11,100 INFO L273 TraceCheckUtils]: 26: Hoare triple {32385#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32385#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:11,100 INFO L273 TraceCheckUtils]: 27: Hoare triple {32385#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {32395#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:11,101 INFO L273 TraceCheckUtils]: 28: Hoare triple {32395#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32395#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:11,101 INFO L273 TraceCheckUtils]: 29: Hoare triple {32395#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32395#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:11,102 INFO L273 TraceCheckUtils]: 30: Hoare triple {32395#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {32405#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:11,103 INFO L273 TraceCheckUtils]: 31: Hoare triple {32405#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32405#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:11,103 INFO L273 TraceCheckUtils]: 32: Hoare triple {32405#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32405#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:11,104 INFO L273 TraceCheckUtils]: 33: Hoare triple {32405#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {32415#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:11,104 INFO L273 TraceCheckUtils]: 34: Hoare triple {32415#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32415#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:11,105 INFO L273 TraceCheckUtils]: 35: Hoare triple {32415#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32415#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:11,105 INFO L273 TraceCheckUtils]: 36: Hoare triple {32415#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {32425#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:11,106 INFO L273 TraceCheckUtils]: 37: Hoare triple {32425#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32425#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:11,106 INFO L273 TraceCheckUtils]: 38: Hoare triple {32425#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32425#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:11,107 INFO L273 TraceCheckUtils]: 39: Hoare triple {32425#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {32435#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:11,108 INFO L273 TraceCheckUtils]: 40: Hoare triple {32435#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32435#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:11,108 INFO L273 TraceCheckUtils]: 41: Hoare triple {32435#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32435#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:11,109 INFO L273 TraceCheckUtils]: 42: Hoare triple {32435#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {32445#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:11,109 INFO L273 TraceCheckUtils]: 43: Hoare triple {32445#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32445#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:11,110 INFO L273 TraceCheckUtils]: 44: Hoare triple {32445#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32445#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:11,110 INFO L273 TraceCheckUtils]: 45: Hoare triple {32445#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {32455#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:11,111 INFO L273 TraceCheckUtils]: 46: Hoare triple {32455#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32455#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:11,112 INFO L273 TraceCheckUtils]: 47: Hoare triple {32455#(<= main_~k~0 14)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32455#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:11,112 INFO L273 TraceCheckUtils]: 48: Hoare triple {32455#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {32465#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:11,113 INFO L273 TraceCheckUtils]: 49: Hoare triple {32465#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32465#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:11,113 INFO L273 TraceCheckUtils]: 50: Hoare triple {32465#(<= main_~k~0 15)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32465#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:11,114 INFO L273 TraceCheckUtils]: 51: Hoare triple {32465#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {32475#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:11,115 INFO L273 TraceCheckUtils]: 52: Hoare triple {32475#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32475#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:11,115 INFO L273 TraceCheckUtils]: 53: Hoare triple {32475#(<= main_~k~0 16)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32475#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:11,116 INFO L273 TraceCheckUtils]: 54: Hoare triple {32475#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {32485#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:11,116 INFO L273 TraceCheckUtils]: 55: Hoare triple {32485#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32485#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:11,117 INFO L273 TraceCheckUtils]: 56: Hoare triple {32485#(<= main_~k~0 17)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32485#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:11,117 INFO L273 TraceCheckUtils]: 57: Hoare triple {32485#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {32495#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:11,118 INFO L273 TraceCheckUtils]: 58: Hoare triple {32495#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32495#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:11,118 INFO L273 TraceCheckUtils]: 59: Hoare triple {32495#(<= main_~k~0 18)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32495#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:11,119 INFO L273 TraceCheckUtils]: 60: Hoare triple {32495#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {32505#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:11,120 INFO L273 TraceCheckUtils]: 61: Hoare triple {32505#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32505#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:11,120 INFO L273 TraceCheckUtils]: 62: Hoare triple {32505#(<= main_~k~0 19)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32505#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:11,121 INFO L273 TraceCheckUtils]: 63: Hoare triple {32505#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {32515#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:11,121 INFO L273 TraceCheckUtils]: 64: Hoare triple {32515#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32515#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:11,122 INFO L273 TraceCheckUtils]: 65: Hoare triple {32515#(<= main_~k~0 20)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32515#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:11,123 INFO L273 TraceCheckUtils]: 66: Hoare triple {32515#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {32525#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:11,123 INFO L273 TraceCheckUtils]: 67: Hoare triple {32525#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32525#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:11,123 INFO L273 TraceCheckUtils]: 68: Hoare triple {32525#(<= main_~k~0 21)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32525#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:11,124 INFO L273 TraceCheckUtils]: 69: Hoare triple {32525#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {32535#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:11,125 INFO L273 TraceCheckUtils]: 70: Hoare triple {32535#(<= main_~k~0 22)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32535#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:11,125 INFO L273 TraceCheckUtils]: 71: Hoare triple {32535#(<= main_~k~0 22)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32535#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:11,126 INFO L273 TraceCheckUtils]: 72: Hoare triple {32535#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {32545#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:11,126 INFO L273 TraceCheckUtils]: 73: Hoare triple {32545#(<= main_~k~0 23)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32545#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:11,127 INFO L273 TraceCheckUtils]: 74: Hoare triple {32545#(<= main_~k~0 23)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32545#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:11,128 INFO L273 TraceCheckUtils]: 75: Hoare triple {32545#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {32555#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:11,128 INFO L273 TraceCheckUtils]: 76: Hoare triple {32555#(<= main_~k~0 24)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32555#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:11,129 INFO L273 TraceCheckUtils]: 77: Hoare triple {32555#(<= main_~k~0 24)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32555#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:11,129 INFO L273 TraceCheckUtils]: 78: Hoare triple {32555#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {32565#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:11,130 INFO L273 TraceCheckUtils]: 79: Hoare triple {32565#(<= main_~k~0 25)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32565#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:11,130 INFO L273 TraceCheckUtils]: 80: Hoare triple {32565#(<= main_~k~0 25)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32565#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:11,131 INFO L273 TraceCheckUtils]: 81: Hoare triple {32565#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {32575#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:11,132 INFO L273 TraceCheckUtils]: 82: Hoare triple {32575#(<= main_~k~0 26)} assume !(~k~0 < 100000); {32275#false} is VALID [2018-11-23 11:53:11,132 INFO L273 TraceCheckUtils]: 83: Hoare triple {32275#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32275#false} is VALID [2018-11-23 11:53:11,132 INFO L273 TraceCheckUtils]: 84: Hoare triple {32275#false} ~x~0 := 0; {32275#false} is VALID [2018-11-23 11:53:11,132 INFO L273 TraceCheckUtils]: 85: Hoare triple {32275#false} assume !(~x~0 < ~i~0); {32275#false} is VALID [2018-11-23 11:53:11,132 INFO L273 TraceCheckUtils]: 86: Hoare triple {32275#false} ~x~0 := 0; {32275#false} is VALID [2018-11-23 11:53:11,132 INFO L273 TraceCheckUtils]: 87: Hoare triple {32275#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32275#false} is VALID [2018-11-23 11:53:11,133 INFO L256 TraceCheckUtils]: 88: Hoare triple {32275#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {32275#false} is VALID [2018-11-23 11:53:11,133 INFO L273 TraceCheckUtils]: 89: Hoare triple {32275#false} ~cond := #in~cond; {32275#false} is VALID [2018-11-23 11:53:11,133 INFO L273 TraceCheckUtils]: 90: Hoare triple {32275#false} assume !(0 == ~cond); {32275#false} is VALID [2018-11-23 11:53:11,133 INFO L273 TraceCheckUtils]: 91: Hoare triple {32275#false} assume true; {32275#false} is VALID [2018-11-23 11:53:11,133 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {32275#false} {32275#false} #136#return; {32275#false} is VALID [2018-11-23 11:53:11,134 INFO L273 TraceCheckUtils]: 93: Hoare triple {32275#false} havoc #t~mem9;havoc #t~mem10; {32275#false} is VALID [2018-11-23 11:53:11,134 INFO L273 TraceCheckUtils]: 94: Hoare triple {32275#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {32275#false} is VALID [2018-11-23 11:53:11,134 INFO L273 TraceCheckUtils]: 95: Hoare triple {32275#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32275#false} is VALID [2018-11-23 11:53:11,134 INFO L256 TraceCheckUtils]: 96: Hoare triple {32275#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {32275#false} is VALID [2018-11-23 11:53:11,135 INFO L273 TraceCheckUtils]: 97: Hoare triple {32275#false} ~cond := #in~cond; {32275#false} is VALID [2018-11-23 11:53:11,135 INFO L273 TraceCheckUtils]: 98: Hoare triple {32275#false} assume 0 == ~cond; {32275#false} is VALID [2018-11-23 11:53:11,135 INFO L273 TraceCheckUtils]: 99: Hoare triple {32275#false} assume !false; {32275#false} is VALID [2018-11-23 11:53:11,142 INFO L134 CoverageAnalysis]: Checked inductivity of 929 backedges. 0 proven. 925 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:53:11,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:11,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 56 [2018-11-23 11:53:11,162 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 100 [2018-11-23 11:53:11,162 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:11,163 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 56 states. [2018-11-23 11:53:11,364 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-23 11:53:11,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-11-23 11:53:11,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-11-23 11:53:11,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1163, Invalid=1917, Unknown=0, NotChecked=0, Total=3080 [2018-11-23 11:53:11,367 INFO L87 Difference]: Start difference. First operand 275 states and 382 transitions. Second operand 56 states. [2018-11-23 11:53:12,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:12,579 INFO L93 Difference]: Finished difference Result 408 states and 579 transitions. [2018-11-23 11:53:12,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 11:53:12,580 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 100 [2018-11-23 11:53:12,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:12,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 11:53:12,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 211 transitions. [2018-11-23 11:53:12,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 11:53:12,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 211 transitions. [2018-11-23 11:53:12,584 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 211 transitions. [2018-11-23 11:53:12,841 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 211 edges. 211 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:12,849 INFO L225 Difference]: With dead ends: 408 [2018-11-23 11:53:12,849 INFO L226 Difference]: Without dead ends: 290 [2018-11-23 11:53:12,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1163, Invalid=1917, Unknown=0, NotChecked=0, Total=3080 [2018-11-23 11:53:12,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-11-23 11:53:13,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 281. [2018-11-23 11:53:13,232 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:13,232 INFO L82 GeneralOperation]: Start isEquivalent. First operand 290 states. Second operand 281 states. [2018-11-23 11:53:13,233 INFO L74 IsIncluded]: Start isIncluded. First operand 290 states. Second operand 281 states. [2018-11-23 11:53:13,233 INFO L87 Difference]: Start difference. First operand 290 states. Second operand 281 states. [2018-11-23 11:53:13,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:13,239 INFO L93 Difference]: Finished difference Result 290 states and 403 transitions. [2018-11-23 11:53:13,239 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 403 transitions. [2018-11-23 11:53:13,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:13,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:13,240 INFO L74 IsIncluded]: Start isIncluded. First operand 281 states. Second operand 290 states. [2018-11-23 11:53:13,240 INFO L87 Difference]: Start difference. First operand 281 states. Second operand 290 states. [2018-11-23 11:53:13,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:13,245 INFO L93 Difference]: Finished difference Result 290 states and 403 transitions. [2018-11-23 11:53:13,246 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 403 transitions. [2018-11-23 11:53:13,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:13,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:13,246 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:13,246 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:13,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-11-23 11:53:13,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 390 transitions. [2018-11-23 11:53:13,251 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 390 transitions. Word has length 100 [2018-11-23 11:53:13,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:13,252 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 390 transitions. [2018-11-23 11:53:13,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-11-23 11:53:13,252 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 390 transitions. [2018-11-23 11:53:13,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-23 11:53:13,252 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:13,252 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:53:13,253 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:13,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:13,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1465764972, now seen corresponding path program 22 times [2018-11-23 11:53:13,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:13,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:13,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:13,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:13,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:13,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:14,000 INFO L256 TraceCheckUtils]: 0: Hoare triple {34145#true} call ULTIMATE.init(); {34145#true} is VALID [2018-11-23 11:53:14,001 INFO L273 TraceCheckUtils]: 1: Hoare triple {34145#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {34145#true} is VALID [2018-11-23 11:53:14,001 INFO L273 TraceCheckUtils]: 2: Hoare triple {34145#true} assume true; {34145#true} is VALID [2018-11-23 11:53:14,001 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34145#true} {34145#true} #130#return; {34145#true} is VALID [2018-11-23 11:53:14,001 INFO L256 TraceCheckUtils]: 4: Hoare triple {34145#true} call #t~ret15 := main(); {34145#true} is VALID [2018-11-23 11:53:14,002 INFO L273 TraceCheckUtils]: 5: Hoare triple {34145#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {34147#(= main_~i~0 0)} is VALID [2018-11-23 11:53:14,002 INFO L273 TraceCheckUtils]: 6: Hoare triple {34147#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {34148#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,003 INFO L273 TraceCheckUtils]: 7: Hoare triple {34148#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {34148#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,005 INFO L273 TraceCheckUtils]: 8: Hoare triple {34148#(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; {34148#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,005 INFO L273 TraceCheckUtils]: 9: Hoare triple {34148#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {34149#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,006 INFO L273 TraceCheckUtils]: 10: Hoare triple {34149#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {34149#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,007 INFO L273 TraceCheckUtils]: 11: Hoare triple {34149#(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; {34149#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,007 INFO L273 TraceCheckUtils]: 12: Hoare triple {34149#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {34150#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,008 INFO L273 TraceCheckUtils]: 13: Hoare triple {34150#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {34150#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,009 INFO L273 TraceCheckUtils]: 14: Hoare triple {34150#(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; {34150#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,010 INFO L273 TraceCheckUtils]: 15: Hoare triple {34150#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {34151#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,010 INFO L273 TraceCheckUtils]: 16: Hoare triple {34151#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {34151#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,011 INFO L273 TraceCheckUtils]: 17: Hoare triple {34151#(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; {34151#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,012 INFO L273 TraceCheckUtils]: 18: Hoare triple {34151#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {34152#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,013 INFO L273 TraceCheckUtils]: 19: Hoare triple {34152#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {34152#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,014 INFO L273 TraceCheckUtils]: 20: Hoare triple {34152#(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; {34152#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,014 INFO L273 TraceCheckUtils]: 21: Hoare triple {34152#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {34153#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,015 INFO L273 TraceCheckUtils]: 22: Hoare triple {34153#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {34153#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,016 INFO L273 TraceCheckUtils]: 23: Hoare triple {34153#(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; {34153#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,017 INFO L273 TraceCheckUtils]: 24: Hoare triple {34153#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {34154#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,018 INFO L273 TraceCheckUtils]: 25: Hoare triple {34154#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {34154#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,018 INFO L273 TraceCheckUtils]: 26: Hoare triple {34154#(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; {34154#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,019 INFO L273 TraceCheckUtils]: 27: Hoare triple {34154#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {34155#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,020 INFO L273 TraceCheckUtils]: 28: Hoare triple {34155#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {34155#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,021 INFO L273 TraceCheckUtils]: 29: Hoare triple {34155#(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; {34155#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,021 INFO L273 TraceCheckUtils]: 30: Hoare triple {34155#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {34156#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,022 INFO L273 TraceCheckUtils]: 31: Hoare triple {34156#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {34156#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,028 INFO L273 TraceCheckUtils]: 32: Hoare triple {34156#(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; {34156#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,028 INFO L273 TraceCheckUtils]: 33: Hoare triple {34156#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {34157#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,029 INFO L273 TraceCheckUtils]: 34: Hoare triple {34157#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {34157#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,029 INFO L273 TraceCheckUtils]: 35: Hoare triple {34157#(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; {34157#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,030 INFO L273 TraceCheckUtils]: 36: Hoare triple {34157#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {34158#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,030 INFO L273 TraceCheckUtils]: 37: Hoare triple {34158#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {34158#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,031 INFO L273 TraceCheckUtils]: 38: Hoare triple {34158#(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; {34158#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,031 INFO L273 TraceCheckUtils]: 39: Hoare triple {34158#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {34159#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,032 INFO L273 TraceCheckUtils]: 40: Hoare triple {34159#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {34159#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,033 INFO L273 TraceCheckUtils]: 41: Hoare triple {34159#(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; {34159#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,033 INFO L273 TraceCheckUtils]: 42: Hoare triple {34159#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {34160#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,034 INFO L273 TraceCheckUtils]: 43: Hoare triple {34160#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {34160#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,035 INFO L273 TraceCheckUtils]: 44: Hoare triple {34160#(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; {34160#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,036 INFO L273 TraceCheckUtils]: 45: Hoare triple {34160#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {34161#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,036 INFO L273 TraceCheckUtils]: 46: Hoare triple {34161#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {34161#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,037 INFO L273 TraceCheckUtils]: 47: Hoare triple {34161#(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; {34161#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,038 INFO L273 TraceCheckUtils]: 48: Hoare triple {34161#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {34162#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,039 INFO L273 TraceCheckUtils]: 49: Hoare triple {34162#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {34162#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,039 INFO L273 TraceCheckUtils]: 50: Hoare triple {34162#(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; {34162#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,040 INFO L273 TraceCheckUtils]: 51: Hoare triple {34162#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {34163#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,041 INFO L273 TraceCheckUtils]: 52: Hoare triple {34163#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {34163#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,042 INFO L273 TraceCheckUtils]: 53: Hoare triple {34163#(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; {34163#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,043 INFO L273 TraceCheckUtils]: 54: Hoare triple {34163#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {34164#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:53:14,043 INFO L273 TraceCheckUtils]: 55: Hoare triple {34164#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {34164#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:53:14,044 INFO L273 TraceCheckUtils]: 56: Hoare triple {34164#(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; {34164#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:53:14,045 INFO L273 TraceCheckUtils]: 57: Hoare triple {34164#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} ~k~0 := 1 + ~k~0; {34165#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,046 INFO L273 TraceCheckUtils]: 58: Hoare triple {34165#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {34165#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,046 INFO L273 TraceCheckUtils]: 59: Hoare triple {34165#(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; {34165#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,047 INFO L273 TraceCheckUtils]: 60: Hoare triple {34165#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {34166#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,048 INFO L273 TraceCheckUtils]: 61: Hoare triple {34166#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {34166#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,048 INFO L273 TraceCheckUtils]: 62: Hoare triple {34166#(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; {34166#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,049 INFO L273 TraceCheckUtils]: 63: Hoare triple {34166#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {34167#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,050 INFO L273 TraceCheckUtils]: 64: Hoare triple {34167#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {34167#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,051 INFO L273 TraceCheckUtils]: 65: Hoare triple {34167#(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; {34167#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,051 INFO L273 TraceCheckUtils]: 66: Hoare triple {34167#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {34168#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,052 INFO L273 TraceCheckUtils]: 67: Hoare triple {34168#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {34168#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,053 INFO L273 TraceCheckUtils]: 68: Hoare triple {34168#(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; {34168#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,054 INFO L273 TraceCheckUtils]: 69: Hoare triple {34168#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {34169#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,054 INFO L273 TraceCheckUtils]: 70: Hoare triple {34169#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {34169#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,055 INFO L273 TraceCheckUtils]: 71: Hoare triple {34169#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {34169#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,056 INFO L273 TraceCheckUtils]: 72: Hoare triple {34169#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {34170#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,057 INFO L273 TraceCheckUtils]: 73: Hoare triple {34170#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {34170#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,057 INFO L273 TraceCheckUtils]: 74: Hoare triple {34170#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {34170#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,058 INFO L273 TraceCheckUtils]: 75: Hoare triple {34170#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {34171#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,059 INFO L273 TraceCheckUtils]: 76: Hoare triple {34171#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {34171#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,059 INFO L273 TraceCheckUtils]: 77: Hoare triple {34171#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {34171#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,060 INFO L273 TraceCheckUtils]: 78: Hoare triple {34171#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {34172#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,061 INFO L273 TraceCheckUtils]: 79: Hoare triple {34172#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {34172#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,062 INFO L273 TraceCheckUtils]: 80: Hoare triple {34172#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {34172#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,063 INFO L273 TraceCheckUtils]: 81: Hoare triple {34172#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {34173#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,064 INFO L273 TraceCheckUtils]: 82: Hoare triple {34173#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {34173#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,086 INFO L273 TraceCheckUtils]: 83: Hoare triple {34173#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {34173#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,101 INFO L273 TraceCheckUtils]: 84: Hoare triple {34173#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {34174#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:14,110 INFO L273 TraceCheckUtils]: 85: Hoare triple {34174#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} assume !(~k~0 < 100000); {34146#false} is VALID [2018-11-23 11:53:14,110 INFO L273 TraceCheckUtils]: 86: Hoare triple {34146#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34146#false} is VALID [2018-11-23 11:53:14,110 INFO L273 TraceCheckUtils]: 87: Hoare triple {34146#false} ~x~0 := 0; {34146#false} is VALID [2018-11-23 11:53:14,110 INFO L273 TraceCheckUtils]: 88: Hoare triple {34146#false} assume !(~x~0 < ~i~0); {34146#false} is VALID [2018-11-23 11:53:14,111 INFO L273 TraceCheckUtils]: 89: Hoare triple {34146#false} ~x~0 := 0; {34146#false} is VALID [2018-11-23 11:53:14,111 INFO L273 TraceCheckUtils]: 90: Hoare triple {34146#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34146#false} is VALID [2018-11-23 11:53:14,111 INFO L256 TraceCheckUtils]: 91: Hoare triple {34146#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {34145#true} is VALID [2018-11-23 11:53:14,111 INFO L273 TraceCheckUtils]: 92: Hoare triple {34145#true} ~cond := #in~cond; {34145#true} is VALID [2018-11-23 11:53:14,111 INFO L273 TraceCheckUtils]: 93: Hoare triple {34145#true} assume !(0 == ~cond); {34145#true} is VALID [2018-11-23 11:53:14,111 INFO L273 TraceCheckUtils]: 94: Hoare triple {34145#true} assume true; {34145#true} is VALID [2018-11-23 11:53:14,112 INFO L268 TraceCheckUtils]: 95: Hoare quadruple {34145#true} {34146#false} #136#return; {34146#false} is VALID [2018-11-23 11:53:14,112 INFO L273 TraceCheckUtils]: 96: Hoare triple {34146#false} havoc #t~mem9;havoc #t~mem10; {34146#false} is VALID [2018-11-23 11:53:14,112 INFO L273 TraceCheckUtils]: 97: Hoare triple {34146#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {34146#false} is VALID [2018-11-23 11:53:14,112 INFO L273 TraceCheckUtils]: 98: Hoare triple {34146#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34146#false} is VALID [2018-11-23 11:53:14,112 INFO L256 TraceCheckUtils]: 99: Hoare triple {34146#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {34146#false} is VALID [2018-11-23 11:53:14,112 INFO L273 TraceCheckUtils]: 100: Hoare triple {34146#false} ~cond := #in~cond; {34146#false} is VALID [2018-11-23 11:53:14,113 INFO L273 TraceCheckUtils]: 101: Hoare triple {34146#false} assume 0 == ~cond; {34146#false} is VALID [2018-11-23 11:53:14,113 INFO L273 TraceCheckUtils]: 102: Hoare triple {34146#false} assume !false; {34146#false} is VALID [2018-11-23 11:53:14,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1005 backedges. 2 proven. 1001 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:53:14,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:14,136 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:53:14,150 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:53:14,216 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:53:14,216 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:14,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:14,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:15,493 INFO L256 TraceCheckUtils]: 0: Hoare triple {34145#true} call ULTIMATE.init(); {34145#true} is VALID [2018-11-23 11:53:15,493 INFO L273 TraceCheckUtils]: 1: Hoare triple {34145#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {34145#true} is VALID [2018-11-23 11:53:15,494 INFO L273 TraceCheckUtils]: 2: Hoare triple {34145#true} assume true; {34145#true} is VALID [2018-11-23 11:53:15,494 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34145#true} {34145#true} #130#return; {34145#true} is VALID [2018-11-23 11:53:15,494 INFO L256 TraceCheckUtils]: 4: Hoare triple {34145#true} call #t~ret15 := main(); {34145#true} is VALID [2018-11-23 11:53:15,494 INFO L273 TraceCheckUtils]: 5: Hoare triple {34145#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {34145#true} is VALID [2018-11-23 11:53:15,495 INFO L273 TraceCheckUtils]: 6: Hoare triple {34145#true} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {34196#(<= main_~k~0 (+ main_~i~0 1))} is VALID [2018-11-23 11:53:15,495 INFO L273 TraceCheckUtils]: 7: Hoare triple {34196#(<= main_~k~0 (+ main_~i~0 1))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {34196#(<= main_~k~0 (+ main_~i~0 1))} is VALID [2018-11-23 11:53:15,496 INFO L273 TraceCheckUtils]: 8: Hoare triple {34196#(<= main_~k~0 (+ main_~i~0 1))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {34196#(<= main_~k~0 (+ main_~i~0 1))} is VALID [2018-11-23 11:53:15,496 INFO L273 TraceCheckUtils]: 9: Hoare triple {34196#(<= main_~k~0 (+ main_~i~0 1))} ~k~0 := 1 + ~k~0; {34206#(<= main_~k~0 (+ main_~i~0 2))} is VALID [2018-11-23 11:53:15,496 INFO L273 TraceCheckUtils]: 10: Hoare triple {34206#(<= main_~k~0 (+ main_~i~0 2))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {34206#(<= main_~k~0 (+ main_~i~0 2))} is VALID [2018-11-23 11:53:15,497 INFO L273 TraceCheckUtils]: 11: Hoare triple {34206#(<= main_~k~0 (+ main_~i~0 2))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {34206#(<= main_~k~0 (+ main_~i~0 2))} is VALID [2018-11-23 11:53:15,497 INFO L273 TraceCheckUtils]: 12: Hoare triple {34206#(<= main_~k~0 (+ main_~i~0 2))} ~k~0 := 1 + ~k~0; {34216#(<= main_~k~0 (+ main_~i~0 3))} is VALID [2018-11-23 11:53:15,497 INFO L273 TraceCheckUtils]: 13: Hoare triple {34216#(<= main_~k~0 (+ main_~i~0 3))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {34216#(<= main_~k~0 (+ main_~i~0 3))} is VALID [2018-11-23 11:53:15,498 INFO L273 TraceCheckUtils]: 14: Hoare triple {34216#(<= main_~k~0 (+ main_~i~0 3))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {34216#(<= main_~k~0 (+ main_~i~0 3))} is VALID [2018-11-23 11:53:15,498 INFO L273 TraceCheckUtils]: 15: Hoare triple {34216#(<= main_~k~0 (+ main_~i~0 3))} ~k~0 := 1 + ~k~0; {34226#(<= main_~k~0 (+ main_~i~0 4))} is VALID [2018-11-23 11:53:15,499 INFO L273 TraceCheckUtils]: 16: Hoare triple {34226#(<= main_~k~0 (+ main_~i~0 4))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {34226#(<= main_~k~0 (+ main_~i~0 4))} is VALID [2018-11-23 11:53:15,499 INFO L273 TraceCheckUtils]: 17: Hoare triple {34226#(<= main_~k~0 (+ main_~i~0 4))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {34226#(<= main_~k~0 (+ main_~i~0 4))} is VALID [2018-11-23 11:53:15,500 INFO L273 TraceCheckUtils]: 18: Hoare triple {34226#(<= main_~k~0 (+ main_~i~0 4))} ~k~0 := 1 + ~k~0; {34236#(<= main_~k~0 (+ main_~i~0 5))} is VALID [2018-11-23 11:53:15,501 INFO L273 TraceCheckUtils]: 19: Hoare triple {34236#(<= main_~k~0 (+ main_~i~0 5))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {34236#(<= main_~k~0 (+ main_~i~0 5))} is VALID [2018-11-23 11:53:15,501 INFO L273 TraceCheckUtils]: 20: Hoare triple {34236#(<= main_~k~0 (+ main_~i~0 5))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {34236#(<= main_~k~0 (+ main_~i~0 5))} is VALID [2018-11-23 11:53:15,502 INFO L273 TraceCheckUtils]: 21: Hoare triple {34236#(<= main_~k~0 (+ main_~i~0 5))} ~k~0 := 1 + ~k~0; {34246#(<= main_~k~0 (+ main_~i~0 6))} is VALID [2018-11-23 11:53:15,502 INFO L273 TraceCheckUtils]: 22: Hoare triple {34246#(<= main_~k~0 (+ main_~i~0 6))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {34246#(<= main_~k~0 (+ main_~i~0 6))} is VALID [2018-11-23 11:53:15,503 INFO L273 TraceCheckUtils]: 23: Hoare triple {34246#(<= main_~k~0 (+ main_~i~0 6))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {34246#(<= main_~k~0 (+ main_~i~0 6))} is VALID [2018-11-23 11:53:15,503 INFO L273 TraceCheckUtils]: 24: Hoare triple {34246#(<= main_~k~0 (+ main_~i~0 6))} ~k~0 := 1 + ~k~0; {34256#(<= main_~k~0 (+ main_~i~0 7))} is VALID [2018-11-23 11:53:15,504 INFO L273 TraceCheckUtils]: 25: Hoare triple {34256#(<= main_~k~0 (+ main_~i~0 7))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {34256#(<= main_~k~0 (+ main_~i~0 7))} is VALID [2018-11-23 11:53:15,504 INFO L273 TraceCheckUtils]: 26: Hoare triple {34256#(<= main_~k~0 (+ main_~i~0 7))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {34256#(<= main_~k~0 (+ main_~i~0 7))} is VALID [2018-11-23 11:53:15,505 INFO L273 TraceCheckUtils]: 27: Hoare triple {34256#(<= main_~k~0 (+ main_~i~0 7))} ~k~0 := 1 + ~k~0; {34266#(<= main_~k~0 (+ main_~i~0 8))} is VALID [2018-11-23 11:53:15,506 INFO L273 TraceCheckUtils]: 28: Hoare triple {34266#(<= main_~k~0 (+ main_~i~0 8))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {34266#(<= main_~k~0 (+ main_~i~0 8))} is VALID [2018-11-23 11:53:15,506 INFO L273 TraceCheckUtils]: 29: Hoare triple {34266#(<= main_~k~0 (+ main_~i~0 8))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {34266#(<= main_~k~0 (+ main_~i~0 8))} is VALID [2018-11-23 11:53:15,507 INFO L273 TraceCheckUtils]: 30: Hoare triple {34266#(<= main_~k~0 (+ main_~i~0 8))} ~k~0 := 1 + ~k~0; {34276#(<= main_~k~0 (+ main_~i~0 9))} is VALID [2018-11-23 11:53:15,508 INFO L273 TraceCheckUtils]: 31: Hoare triple {34276#(<= main_~k~0 (+ main_~i~0 9))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {34276#(<= main_~k~0 (+ main_~i~0 9))} is VALID [2018-11-23 11:53:15,508 INFO L273 TraceCheckUtils]: 32: Hoare triple {34276#(<= main_~k~0 (+ main_~i~0 9))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {34276#(<= main_~k~0 (+ main_~i~0 9))} is VALID [2018-11-23 11:53:15,509 INFO L273 TraceCheckUtils]: 33: Hoare triple {34276#(<= main_~k~0 (+ main_~i~0 9))} ~k~0 := 1 + ~k~0; {34286#(<= main_~k~0 (+ main_~i~0 10))} is VALID [2018-11-23 11:53:15,509 INFO L273 TraceCheckUtils]: 34: Hoare triple {34286#(<= main_~k~0 (+ main_~i~0 10))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {34286#(<= main_~k~0 (+ main_~i~0 10))} is VALID [2018-11-23 11:53:15,510 INFO L273 TraceCheckUtils]: 35: Hoare triple {34286#(<= main_~k~0 (+ main_~i~0 10))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {34286#(<= main_~k~0 (+ main_~i~0 10))} is VALID [2018-11-23 11:53:15,510 INFO L273 TraceCheckUtils]: 36: Hoare triple {34286#(<= main_~k~0 (+ main_~i~0 10))} ~k~0 := 1 + ~k~0; {34296#(<= main_~k~0 (+ main_~i~0 11))} is VALID [2018-11-23 11:53:15,511 INFO L273 TraceCheckUtils]: 37: Hoare triple {34296#(<= main_~k~0 (+ main_~i~0 11))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {34296#(<= main_~k~0 (+ main_~i~0 11))} is VALID [2018-11-23 11:53:15,511 INFO L273 TraceCheckUtils]: 38: Hoare triple {34296#(<= main_~k~0 (+ main_~i~0 11))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {34296#(<= main_~k~0 (+ main_~i~0 11))} is VALID [2018-11-23 11:53:15,512 INFO L273 TraceCheckUtils]: 39: Hoare triple {34296#(<= main_~k~0 (+ main_~i~0 11))} ~k~0 := 1 + ~k~0; {34306#(<= main_~k~0 (+ main_~i~0 12))} is VALID [2018-11-23 11:53:15,513 INFO L273 TraceCheckUtils]: 40: Hoare triple {34306#(<= main_~k~0 (+ main_~i~0 12))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {34306#(<= main_~k~0 (+ main_~i~0 12))} is VALID [2018-11-23 11:53:15,513 INFO L273 TraceCheckUtils]: 41: Hoare triple {34306#(<= main_~k~0 (+ main_~i~0 12))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {34306#(<= main_~k~0 (+ main_~i~0 12))} is VALID [2018-11-23 11:53:15,514 INFO L273 TraceCheckUtils]: 42: Hoare triple {34306#(<= main_~k~0 (+ main_~i~0 12))} ~k~0 := 1 + ~k~0; {34316#(<= main_~k~0 (+ main_~i~0 13))} is VALID [2018-11-23 11:53:15,514 INFO L273 TraceCheckUtils]: 43: Hoare triple {34316#(<= main_~k~0 (+ main_~i~0 13))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {34316#(<= main_~k~0 (+ main_~i~0 13))} is VALID [2018-11-23 11:53:15,515 INFO L273 TraceCheckUtils]: 44: Hoare triple {34316#(<= main_~k~0 (+ main_~i~0 13))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {34316#(<= main_~k~0 (+ main_~i~0 13))} is VALID [2018-11-23 11:53:15,515 INFO L273 TraceCheckUtils]: 45: Hoare triple {34316#(<= main_~k~0 (+ main_~i~0 13))} ~k~0 := 1 + ~k~0; {34326#(<= main_~k~0 (+ main_~i~0 14))} is VALID [2018-11-23 11:53:15,516 INFO L273 TraceCheckUtils]: 46: Hoare triple {34326#(<= main_~k~0 (+ main_~i~0 14))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {34326#(<= main_~k~0 (+ main_~i~0 14))} is VALID [2018-11-23 11:53:15,516 INFO L273 TraceCheckUtils]: 47: Hoare triple {34326#(<= main_~k~0 (+ main_~i~0 14))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {34326#(<= main_~k~0 (+ main_~i~0 14))} is VALID [2018-11-23 11:53:15,517 INFO L273 TraceCheckUtils]: 48: Hoare triple {34326#(<= main_~k~0 (+ main_~i~0 14))} ~k~0 := 1 + ~k~0; {34336#(<= main_~k~0 (+ main_~i~0 15))} is VALID [2018-11-23 11:53:15,518 INFO L273 TraceCheckUtils]: 49: Hoare triple {34336#(<= main_~k~0 (+ main_~i~0 15))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {34336#(<= main_~k~0 (+ main_~i~0 15))} is VALID [2018-11-23 11:53:15,518 INFO L273 TraceCheckUtils]: 50: Hoare triple {34336#(<= main_~k~0 (+ main_~i~0 15))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {34336#(<= main_~k~0 (+ main_~i~0 15))} is VALID [2018-11-23 11:53:15,519 INFO L273 TraceCheckUtils]: 51: Hoare triple {34336#(<= main_~k~0 (+ main_~i~0 15))} ~k~0 := 1 + ~k~0; {34346#(<= main_~k~0 (+ main_~i~0 16))} is VALID [2018-11-23 11:53:15,519 INFO L273 TraceCheckUtils]: 52: Hoare triple {34346#(<= main_~k~0 (+ main_~i~0 16))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {34346#(<= main_~k~0 (+ main_~i~0 16))} is VALID [2018-11-23 11:53:15,520 INFO L273 TraceCheckUtils]: 53: Hoare triple {34346#(<= main_~k~0 (+ main_~i~0 16))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {34346#(<= main_~k~0 (+ main_~i~0 16))} is VALID [2018-11-23 11:53:15,521 INFO L273 TraceCheckUtils]: 54: Hoare triple {34346#(<= main_~k~0 (+ main_~i~0 16))} ~k~0 := 1 + ~k~0; {34356#(<= main_~k~0 (+ main_~i~0 17))} is VALID [2018-11-23 11:53:15,521 INFO L273 TraceCheckUtils]: 55: Hoare triple {34356#(<= main_~k~0 (+ main_~i~0 17))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {34356#(<= main_~k~0 (+ main_~i~0 17))} is VALID [2018-11-23 11:53:15,521 INFO L273 TraceCheckUtils]: 56: Hoare triple {34356#(<= main_~k~0 (+ main_~i~0 17))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {34356#(<= main_~k~0 (+ main_~i~0 17))} is VALID [2018-11-23 11:53:15,522 INFO L273 TraceCheckUtils]: 57: Hoare triple {34356#(<= main_~k~0 (+ main_~i~0 17))} ~k~0 := 1 + ~k~0; {34366#(<= main_~k~0 (+ main_~i~0 18))} is VALID [2018-11-23 11:53:15,523 INFO L273 TraceCheckUtils]: 58: Hoare triple {34366#(<= main_~k~0 (+ main_~i~0 18))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {34366#(<= main_~k~0 (+ main_~i~0 18))} is VALID [2018-11-23 11:53:15,523 INFO L273 TraceCheckUtils]: 59: Hoare triple {34366#(<= main_~k~0 (+ main_~i~0 18))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {34366#(<= main_~k~0 (+ main_~i~0 18))} is VALID [2018-11-23 11:53:15,524 INFO L273 TraceCheckUtils]: 60: Hoare triple {34366#(<= main_~k~0 (+ main_~i~0 18))} ~k~0 := 1 + ~k~0; {34376#(<= main_~k~0 (+ main_~i~0 19))} is VALID [2018-11-23 11:53:15,524 INFO L273 TraceCheckUtils]: 61: Hoare triple {34376#(<= main_~k~0 (+ main_~i~0 19))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {34376#(<= main_~k~0 (+ main_~i~0 19))} is VALID [2018-11-23 11:53:15,525 INFO L273 TraceCheckUtils]: 62: Hoare triple {34376#(<= main_~k~0 (+ main_~i~0 19))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {34376#(<= main_~k~0 (+ main_~i~0 19))} is VALID [2018-11-23 11:53:15,526 INFO L273 TraceCheckUtils]: 63: Hoare triple {34376#(<= main_~k~0 (+ main_~i~0 19))} ~k~0 := 1 + ~k~0; {34386#(<= main_~k~0 (+ main_~i~0 20))} is VALID [2018-11-23 11:53:15,526 INFO L273 TraceCheckUtils]: 64: Hoare triple {34386#(<= main_~k~0 (+ main_~i~0 20))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {34386#(<= main_~k~0 (+ main_~i~0 20))} is VALID [2018-11-23 11:53:15,527 INFO L273 TraceCheckUtils]: 65: Hoare triple {34386#(<= main_~k~0 (+ main_~i~0 20))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {34386#(<= main_~k~0 (+ main_~i~0 20))} is VALID [2018-11-23 11:53:15,527 INFO L273 TraceCheckUtils]: 66: Hoare triple {34386#(<= main_~k~0 (+ main_~i~0 20))} ~k~0 := 1 + ~k~0; {34396#(<= main_~k~0 (+ main_~i~0 21))} is VALID [2018-11-23 11:53:15,528 INFO L273 TraceCheckUtils]: 67: Hoare triple {34396#(<= main_~k~0 (+ main_~i~0 21))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {34396#(<= main_~k~0 (+ main_~i~0 21))} is VALID [2018-11-23 11:53:15,528 INFO L273 TraceCheckUtils]: 68: Hoare triple {34396#(<= main_~k~0 (+ main_~i~0 21))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {34396#(<= main_~k~0 (+ main_~i~0 21))} is VALID [2018-11-23 11:53:15,529 INFO L273 TraceCheckUtils]: 69: Hoare triple {34396#(<= main_~k~0 (+ main_~i~0 21))} ~k~0 := 1 + ~k~0; {34406#(<= main_~k~0 (+ main_~i~0 22))} is VALID [2018-11-23 11:53:15,529 INFO L273 TraceCheckUtils]: 70: Hoare triple {34406#(<= main_~k~0 (+ main_~i~0 22))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {34406#(<= main_~k~0 (+ main_~i~0 22))} is VALID [2018-11-23 11:53:15,530 INFO L273 TraceCheckUtils]: 71: Hoare triple {34406#(<= main_~k~0 (+ main_~i~0 22))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {34406#(<= main_~k~0 (+ main_~i~0 22))} is VALID [2018-11-23 11:53:15,531 INFO L273 TraceCheckUtils]: 72: Hoare triple {34406#(<= main_~k~0 (+ main_~i~0 22))} ~k~0 := 1 + ~k~0; {34416#(<= main_~k~0 (+ main_~i~0 23))} is VALID [2018-11-23 11:53:15,531 INFO L273 TraceCheckUtils]: 73: Hoare triple {34416#(<= main_~k~0 (+ main_~i~0 23))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {34416#(<= main_~k~0 (+ main_~i~0 23))} is VALID [2018-11-23 11:53:15,532 INFO L273 TraceCheckUtils]: 74: Hoare triple {34416#(<= main_~k~0 (+ main_~i~0 23))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {34416#(<= main_~k~0 (+ main_~i~0 23))} is VALID [2018-11-23 11:53:15,533 INFO L273 TraceCheckUtils]: 75: Hoare triple {34416#(<= main_~k~0 (+ main_~i~0 23))} ~k~0 := 1 + ~k~0; {34426#(<= main_~k~0 (+ main_~i~0 24))} is VALID [2018-11-23 11:53:15,533 INFO L273 TraceCheckUtils]: 76: Hoare triple {34426#(<= main_~k~0 (+ main_~i~0 24))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {34426#(<= main_~k~0 (+ main_~i~0 24))} is VALID [2018-11-23 11:53:15,534 INFO L273 TraceCheckUtils]: 77: Hoare triple {34426#(<= main_~k~0 (+ main_~i~0 24))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {34426#(<= main_~k~0 (+ main_~i~0 24))} is VALID [2018-11-23 11:53:15,534 INFO L273 TraceCheckUtils]: 78: Hoare triple {34426#(<= main_~k~0 (+ main_~i~0 24))} ~k~0 := 1 + ~k~0; {34436#(<= main_~k~0 (+ main_~i~0 25))} is VALID [2018-11-23 11:53:15,535 INFO L273 TraceCheckUtils]: 79: Hoare triple {34436#(<= main_~k~0 (+ main_~i~0 25))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {34436#(<= main_~k~0 (+ main_~i~0 25))} is VALID [2018-11-23 11:53:15,535 INFO L273 TraceCheckUtils]: 80: Hoare triple {34436#(<= main_~k~0 (+ main_~i~0 25))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {34436#(<= main_~k~0 (+ main_~i~0 25))} is VALID [2018-11-23 11:53:15,536 INFO L273 TraceCheckUtils]: 81: Hoare triple {34436#(<= main_~k~0 (+ main_~i~0 25))} ~k~0 := 1 + ~k~0; {34446#(<= main_~k~0 (+ main_~i~0 26))} is VALID [2018-11-23 11:53:15,537 INFO L273 TraceCheckUtils]: 82: Hoare triple {34446#(<= main_~k~0 (+ main_~i~0 26))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {34446#(<= main_~k~0 (+ main_~i~0 26))} is VALID [2018-11-23 11:53:15,537 INFO L273 TraceCheckUtils]: 83: Hoare triple {34446#(<= main_~k~0 (+ main_~i~0 26))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {34446#(<= main_~k~0 (+ main_~i~0 26))} is VALID [2018-11-23 11:53:15,538 INFO L273 TraceCheckUtils]: 84: Hoare triple {34446#(<= main_~k~0 (+ main_~i~0 26))} ~k~0 := 1 + ~k~0; {34456#(<= main_~k~0 (+ main_~i~0 27))} is VALID [2018-11-23 11:53:15,539 INFO L273 TraceCheckUtils]: 85: Hoare triple {34456#(<= main_~k~0 (+ main_~i~0 27))} assume !(~k~0 < 100000); {34460#(<= 99973 main_~i~0)} is VALID [2018-11-23 11:53:15,539 INFO L273 TraceCheckUtils]: 86: Hoare triple {34460#(<= 99973 main_~i~0)} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34460#(<= 99973 main_~i~0)} is VALID [2018-11-23 11:53:15,540 INFO L273 TraceCheckUtils]: 87: Hoare triple {34460#(<= 99973 main_~i~0)} ~x~0 := 0; {34467#(and (<= 99973 main_~i~0) (<= main_~x~0 0))} is VALID [2018-11-23 11:53:15,540 INFO L273 TraceCheckUtils]: 88: Hoare triple {34467#(and (<= 99973 main_~i~0) (<= main_~x~0 0))} assume !(~x~0 < ~i~0); {34146#false} is VALID [2018-11-23 11:53:15,541 INFO L273 TraceCheckUtils]: 89: Hoare triple {34146#false} ~x~0 := 0; {34146#false} is VALID [2018-11-23 11:53:15,541 INFO L273 TraceCheckUtils]: 90: Hoare triple {34146#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34146#false} is VALID [2018-11-23 11:53:15,541 INFO L256 TraceCheckUtils]: 91: Hoare triple {34146#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {34146#false} is VALID [2018-11-23 11:53:15,541 INFO L273 TraceCheckUtils]: 92: Hoare triple {34146#false} ~cond := #in~cond; {34146#false} is VALID [2018-11-23 11:53:15,541 INFO L273 TraceCheckUtils]: 93: Hoare triple {34146#false} assume !(0 == ~cond); {34146#false} is VALID [2018-11-23 11:53:15,542 INFO L273 TraceCheckUtils]: 94: Hoare triple {34146#false} assume true; {34146#false} is VALID [2018-11-23 11:53:15,542 INFO L268 TraceCheckUtils]: 95: Hoare quadruple {34146#false} {34146#false} #136#return; {34146#false} is VALID [2018-11-23 11:53:15,542 INFO L273 TraceCheckUtils]: 96: Hoare triple {34146#false} havoc #t~mem9;havoc #t~mem10; {34146#false} is VALID [2018-11-23 11:53:15,543 INFO L273 TraceCheckUtils]: 97: Hoare triple {34146#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {34146#false} is VALID [2018-11-23 11:53:15,543 INFO L273 TraceCheckUtils]: 98: Hoare triple {34146#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34146#false} is VALID [2018-11-23 11:53:15,543 INFO L256 TraceCheckUtils]: 99: Hoare triple {34146#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {34146#false} is VALID [2018-11-23 11:53:15,543 INFO L273 TraceCheckUtils]: 100: Hoare triple {34146#false} ~cond := #in~cond; {34146#false} is VALID [2018-11-23 11:53:15,544 INFO L273 TraceCheckUtils]: 101: Hoare triple {34146#false} assume 0 == ~cond; {34146#false} is VALID [2018-11-23 11:53:15,544 INFO L273 TraceCheckUtils]: 102: Hoare triple {34146#false} assume !false; {34146#false} is VALID [2018-11-23 11:53:15,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1005 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:53:15,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:15,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31] total 59 [2018-11-23 11:53:15,585 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 103 [2018-11-23 11:53:15,586 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:15,586 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 59 states. [2018-11-23 11:53:15,784 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:15,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-11-23 11:53:15,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-11-23 11:53:15,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1223, Invalid=2199, Unknown=0, NotChecked=0, Total=3422 [2018-11-23 11:53:15,788 INFO L87 Difference]: Start difference. First operand 281 states and 390 transitions. Second operand 59 states. [2018-11-23 11:53:37,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:37,581 INFO L93 Difference]: Finished difference Result 2326 states and 3360 transitions. [2018-11-23 11:53:37,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-11-23 11:53:37,581 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 103 [2018-11-23 11:53:37,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:37,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 11:53:37,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 1910 transitions. [2018-11-23 11:53:37,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 11:53:37,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 1910 transitions. [2018-11-23 11:53:37,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 113 states and 1910 transitions. [2018-11-23 11:53:39,719 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 1910 edges. 1910 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:39,899 INFO L225 Difference]: With dead ends: 2326 [2018-11-23 11:53:39,899 INFO L226 Difference]: Without dead ends: 2208 [2018-11-23 11:53:39,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4427 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3248, Invalid=9408, Unknown=0, NotChecked=0, Total=12656 [2018-11-23 11:53:39,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2208 states. [2018-11-23 11:53:41,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2208 to 395. [2018-11-23 11:53:41,262 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:41,262 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2208 states. Second operand 395 states. [2018-11-23 11:53:41,262 INFO L74 IsIncluded]: Start isIncluded. First operand 2208 states. Second operand 395 states. [2018-11-23 11:53:41,262 INFO L87 Difference]: Start difference. First operand 2208 states. Second operand 395 states. [2018-11-23 11:53:41,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:41,480 INFO L93 Difference]: Finished difference Result 2208 states and 3148 transitions. [2018-11-23 11:53:41,480 INFO L276 IsEmpty]: Start isEmpty. Operand 2208 states and 3148 transitions. [2018-11-23 11:53:41,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:41,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:41,485 INFO L74 IsIncluded]: Start isIncluded. First operand 395 states. Second operand 2208 states. [2018-11-23 11:53:41,485 INFO L87 Difference]: Start difference. First operand 395 states. Second operand 2208 states. [2018-11-23 11:53:41,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:41,665 INFO L93 Difference]: Finished difference Result 2208 states and 3148 transitions. [2018-11-23 11:53:41,665 INFO L276 IsEmpty]: Start isEmpty. Operand 2208 states and 3148 transitions. [2018-11-23 11:53:41,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:41,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:41,670 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:41,670 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:41,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-11-23 11:53:41,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 578 transitions. [2018-11-23 11:53:41,678 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 578 transitions. Word has length 103 [2018-11-23 11:53:41,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:41,679 INFO L480 AbstractCegarLoop]: Abstraction has 395 states and 578 transitions. [2018-11-23 11:53:41,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-11-23 11:53:41,679 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 578 transitions. [2018-11-23 11:53:41,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-23 11:53:41,679 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:41,679 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:53:41,679 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:41,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:41,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1491982191, now seen corresponding path program 23 times [2018-11-23 11:53:41,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:41,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:41,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:41,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:41,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:41,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:43,334 INFO L256 TraceCheckUtils]: 0: Hoare triple {42829#true} call ULTIMATE.init(); {42829#true} is VALID [2018-11-23 11:53:43,334 INFO L273 TraceCheckUtils]: 1: Hoare triple {42829#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {42829#true} is VALID [2018-11-23 11:53:43,335 INFO L273 TraceCheckUtils]: 2: Hoare triple {42829#true} assume true; {42829#true} is VALID [2018-11-23 11:53:43,335 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {42829#true} {42829#true} #130#return; {42829#true} is VALID [2018-11-23 11:53:43,335 INFO L256 TraceCheckUtils]: 4: Hoare triple {42829#true} call #t~ret15 := main(); {42829#true} is VALID [2018-11-23 11:53:43,335 INFO L273 TraceCheckUtils]: 5: Hoare triple {42829#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {42831#(= main_~i~0 0)} is VALID [2018-11-23 11:53:43,336 INFO L273 TraceCheckUtils]: 6: Hoare triple {42831#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {42832#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,336 INFO L273 TraceCheckUtils]: 7: Hoare triple {42832#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {42832#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,337 INFO L273 TraceCheckUtils]: 8: Hoare triple {42832#(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; {42832#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,337 INFO L273 TraceCheckUtils]: 9: Hoare triple {42832#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {42833#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,338 INFO L273 TraceCheckUtils]: 10: Hoare triple {42833#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {42833#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,339 INFO L273 TraceCheckUtils]: 11: Hoare triple {42833#(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; {42833#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,339 INFO L273 TraceCheckUtils]: 12: Hoare triple {42833#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {42834#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,340 INFO L273 TraceCheckUtils]: 13: Hoare triple {42834#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {42834#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,341 INFO L273 TraceCheckUtils]: 14: Hoare triple {42834#(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; {42834#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,341 INFO L273 TraceCheckUtils]: 15: Hoare triple {42834#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {42835#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,342 INFO L273 TraceCheckUtils]: 16: Hoare triple {42835#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {42835#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,343 INFO L273 TraceCheckUtils]: 17: Hoare triple {42835#(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; {42835#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,344 INFO L273 TraceCheckUtils]: 18: Hoare triple {42835#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {42836#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,345 INFO L273 TraceCheckUtils]: 19: Hoare triple {42836#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {42836#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,345 INFO L273 TraceCheckUtils]: 20: Hoare triple {42836#(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; {42836#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,346 INFO L273 TraceCheckUtils]: 21: Hoare triple {42836#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {42837#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,347 INFO L273 TraceCheckUtils]: 22: Hoare triple {42837#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {42837#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,348 INFO L273 TraceCheckUtils]: 23: Hoare triple {42837#(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; {42837#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,348 INFO L273 TraceCheckUtils]: 24: Hoare triple {42837#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {42838#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,349 INFO L273 TraceCheckUtils]: 25: Hoare triple {42838#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {42838#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,350 INFO L273 TraceCheckUtils]: 26: Hoare triple {42838#(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; {42838#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,351 INFO L273 TraceCheckUtils]: 27: Hoare triple {42838#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {42839#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,351 INFO L273 TraceCheckUtils]: 28: Hoare triple {42839#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {42839#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,352 INFO L273 TraceCheckUtils]: 29: Hoare triple {42839#(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; {42839#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,353 INFO L273 TraceCheckUtils]: 30: Hoare triple {42839#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {42840#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,353 INFO L273 TraceCheckUtils]: 31: Hoare triple {42840#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {42840#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,354 INFO L273 TraceCheckUtils]: 32: Hoare triple {42840#(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; {42840#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,355 INFO L273 TraceCheckUtils]: 33: Hoare triple {42840#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {42841#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,356 INFO L273 TraceCheckUtils]: 34: Hoare triple {42841#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {42841#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,356 INFO L273 TraceCheckUtils]: 35: Hoare triple {42841#(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; {42841#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,357 INFO L273 TraceCheckUtils]: 36: Hoare triple {42841#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {42842#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,358 INFO L273 TraceCheckUtils]: 37: Hoare triple {42842#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {42842#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,359 INFO L273 TraceCheckUtils]: 38: Hoare triple {42842#(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; {42842#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,360 INFO L273 TraceCheckUtils]: 39: Hoare triple {42842#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {42843#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,361 INFO L273 TraceCheckUtils]: 40: Hoare triple {42843#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {42843#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,361 INFO L273 TraceCheckUtils]: 41: Hoare triple {42843#(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; {42843#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,362 INFO L273 TraceCheckUtils]: 42: Hoare triple {42843#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {42844#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,363 INFO L273 TraceCheckUtils]: 43: Hoare triple {42844#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {42844#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,364 INFO L273 TraceCheckUtils]: 44: Hoare triple {42844#(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; {42844#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,364 INFO L273 TraceCheckUtils]: 45: Hoare triple {42844#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {42845#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,365 INFO L273 TraceCheckUtils]: 46: Hoare triple {42845#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {42845#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,366 INFO L273 TraceCheckUtils]: 47: Hoare triple {42845#(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; {42845#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,367 INFO L273 TraceCheckUtils]: 48: Hoare triple {42845#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {42846#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,368 INFO L273 TraceCheckUtils]: 49: Hoare triple {42846#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {42846#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,368 INFO L273 TraceCheckUtils]: 50: Hoare triple {42846#(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; {42846#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,369 INFO L273 TraceCheckUtils]: 51: Hoare triple {42846#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {42847#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,370 INFO L273 TraceCheckUtils]: 52: Hoare triple {42847#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {42847#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,387 INFO L273 TraceCheckUtils]: 53: Hoare triple {42847#(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; {42847#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,400 INFO L273 TraceCheckUtils]: 54: Hoare triple {42847#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {42848#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:53:43,412 INFO L273 TraceCheckUtils]: 55: Hoare triple {42848#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {42848#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:53:43,413 INFO L273 TraceCheckUtils]: 56: Hoare triple {42848#(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; {42848#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:53:43,413 INFO L273 TraceCheckUtils]: 57: Hoare triple {42848#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} ~k~0 := 1 + ~k~0; {42849#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,414 INFO L273 TraceCheckUtils]: 58: Hoare triple {42849#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {42849#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,414 INFO L273 TraceCheckUtils]: 59: Hoare triple {42849#(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; {42849#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,415 INFO L273 TraceCheckUtils]: 60: Hoare triple {42849#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {42850#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,415 INFO L273 TraceCheckUtils]: 61: Hoare triple {42850#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {42850#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,416 INFO L273 TraceCheckUtils]: 62: Hoare triple {42850#(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; {42850#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,417 INFO L273 TraceCheckUtils]: 63: Hoare triple {42850#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {42851#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,418 INFO L273 TraceCheckUtils]: 64: Hoare triple {42851#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {42851#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,418 INFO L273 TraceCheckUtils]: 65: Hoare triple {42851#(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; {42851#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,419 INFO L273 TraceCheckUtils]: 66: Hoare triple {42851#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {42852#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,420 INFO L273 TraceCheckUtils]: 67: Hoare triple {42852#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {42852#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,420 INFO L273 TraceCheckUtils]: 68: Hoare triple {42852#(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; {42852#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,421 INFO L273 TraceCheckUtils]: 69: Hoare triple {42852#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {42853#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,422 INFO L273 TraceCheckUtils]: 70: Hoare triple {42853#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {42853#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,423 INFO L273 TraceCheckUtils]: 71: Hoare triple {42853#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42853#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,423 INFO L273 TraceCheckUtils]: 72: Hoare triple {42853#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {42854#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,424 INFO L273 TraceCheckUtils]: 73: Hoare triple {42854#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {42854#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,425 INFO L273 TraceCheckUtils]: 74: Hoare triple {42854#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42854#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,426 INFO L273 TraceCheckUtils]: 75: Hoare triple {42854#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {42855#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,426 INFO L273 TraceCheckUtils]: 76: Hoare triple {42855#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {42855#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,427 INFO L273 TraceCheckUtils]: 77: Hoare triple {42855#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42855#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,428 INFO L273 TraceCheckUtils]: 78: Hoare triple {42855#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {42856#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,429 INFO L273 TraceCheckUtils]: 79: Hoare triple {42856#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {42856#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,430 INFO L273 TraceCheckUtils]: 80: Hoare triple {42856#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42856#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,431 INFO L273 TraceCheckUtils]: 81: Hoare triple {42856#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {42857#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,431 INFO L273 TraceCheckUtils]: 82: Hoare triple {42857#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {42857#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,432 INFO L273 TraceCheckUtils]: 83: Hoare triple {42857#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42857#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,433 INFO L273 TraceCheckUtils]: 84: Hoare triple {42857#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {42858#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,434 INFO L273 TraceCheckUtils]: 85: Hoare triple {42858#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {42858#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,434 INFO L273 TraceCheckUtils]: 86: Hoare triple {42858#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42858#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,435 INFO L273 TraceCheckUtils]: 87: Hoare triple {42858#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {42859#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:43,436 INFO L273 TraceCheckUtils]: 88: Hoare triple {42859#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} assume !(~k~0 < 100000); {42830#false} is VALID [2018-11-23 11:53:43,436 INFO L273 TraceCheckUtils]: 89: Hoare triple {42830#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42830#false} is VALID [2018-11-23 11:53:43,436 INFO L273 TraceCheckUtils]: 90: Hoare triple {42830#false} ~x~0 := 0; {42830#false} is VALID [2018-11-23 11:53:43,437 INFO L273 TraceCheckUtils]: 91: Hoare triple {42830#false} assume !(~x~0 < ~i~0); {42830#false} is VALID [2018-11-23 11:53:43,437 INFO L273 TraceCheckUtils]: 92: Hoare triple {42830#false} ~x~0 := 0; {42830#false} is VALID [2018-11-23 11:53:43,437 INFO L273 TraceCheckUtils]: 93: Hoare triple {42830#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42830#false} is VALID [2018-11-23 11:53:43,437 INFO L256 TraceCheckUtils]: 94: Hoare triple {42830#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {42829#true} is VALID [2018-11-23 11:53:43,437 INFO L273 TraceCheckUtils]: 95: Hoare triple {42829#true} ~cond := #in~cond; {42829#true} is VALID [2018-11-23 11:53:43,437 INFO L273 TraceCheckUtils]: 96: Hoare triple {42829#true} assume !(0 == ~cond); {42829#true} is VALID [2018-11-23 11:53:43,438 INFO L273 TraceCheckUtils]: 97: Hoare triple {42829#true} assume true; {42829#true} is VALID [2018-11-23 11:53:43,438 INFO L268 TraceCheckUtils]: 98: Hoare quadruple {42829#true} {42830#false} #136#return; {42830#false} is VALID [2018-11-23 11:53:43,438 INFO L273 TraceCheckUtils]: 99: Hoare triple {42830#false} havoc #t~mem9;havoc #t~mem10; {42830#false} is VALID [2018-11-23 11:53:43,438 INFO L273 TraceCheckUtils]: 100: Hoare triple {42830#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {42830#false} is VALID [2018-11-23 11:53:43,438 INFO L273 TraceCheckUtils]: 101: Hoare triple {42830#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42830#false} is VALID [2018-11-23 11:53:43,438 INFO L256 TraceCheckUtils]: 102: Hoare triple {42830#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {42830#false} is VALID [2018-11-23 11:53:43,438 INFO L273 TraceCheckUtils]: 103: Hoare triple {42830#false} ~cond := #in~cond; {42830#false} is VALID [2018-11-23 11:53:43,439 INFO L273 TraceCheckUtils]: 104: Hoare triple {42830#false} assume 0 == ~cond; {42830#false} is VALID [2018-11-23 11:53:43,439 INFO L273 TraceCheckUtils]: 105: Hoare triple {42830#false} assume !false; {42830#false} is VALID [2018-11-23 11:53:43,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1084 backedges. 2 proven. 1080 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:53:43,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:43,456 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:53:43,472 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:53:43,556 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 28 check-sat command(s) [2018-11-23 11:53:43,556 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:43,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:43,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:44,512 INFO L256 TraceCheckUtils]: 0: Hoare triple {42829#true} call ULTIMATE.init(); {42829#true} is VALID [2018-11-23 11:53:44,513 INFO L273 TraceCheckUtils]: 1: Hoare triple {42829#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {42829#true} is VALID [2018-11-23 11:53:44,513 INFO L273 TraceCheckUtils]: 2: Hoare triple {42829#true} assume true; {42829#true} is VALID [2018-11-23 11:53:44,513 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {42829#true} {42829#true} #130#return; {42829#true} is VALID [2018-11-23 11:53:44,513 INFO L256 TraceCheckUtils]: 4: Hoare triple {42829#true} call #t~ret15 := main(); {42829#true} is VALID [2018-11-23 11:53:44,514 INFO L273 TraceCheckUtils]: 5: Hoare triple {42829#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {42878#(<= main_~i~0 0)} is VALID [2018-11-23 11:53:44,515 INFO L273 TraceCheckUtils]: 6: Hoare triple {42878#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {42882#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:44,515 INFO L273 TraceCheckUtils]: 7: Hoare triple {42882#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {42882#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:44,515 INFO L273 TraceCheckUtils]: 8: Hoare triple {42882#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42882#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:44,516 INFO L273 TraceCheckUtils]: 9: Hoare triple {42882#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {42892#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:44,516 INFO L273 TraceCheckUtils]: 10: Hoare triple {42892#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {42892#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:44,516 INFO L273 TraceCheckUtils]: 11: Hoare triple {42892#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42892#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:44,517 INFO L273 TraceCheckUtils]: 12: Hoare triple {42892#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {42902#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:44,517 INFO L273 TraceCheckUtils]: 13: Hoare triple {42902#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {42902#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:44,518 INFO L273 TraceCheckUtils]: 14: Hoare triple {42902#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42902#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:44,519 INFO L273 TraceCheckUtils]: 15: Hoare triple {42902#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {42912#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:44,519 INFO L273 TraceCheckUtils]: 16: Hoare triple {42912#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {42912#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:44,520 INFO L273 TraceCheckUtils]: 17: Hoare triple {42912#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42912#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:44,520 INFO L273 TraceCheckUtils]: 18: Hoare triple {42912#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {42922#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:44,521 INFO L273 TraceCheckUtils]: 19: Hoare triple {42922#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {42922#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:44,521 INFO L273 TraceCheckUtils]: 20: Hoare triple {42922#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42922#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:44,522 INFO L273 TraceCheckUtils]: 21: Hoare triple {42922#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {42932#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:44,523 INFO L273 TraceCheckUtils]: 22: Hoare triple {42932#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {42932#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:44,523 INFO L273 TraceCheckUtils]: 23: Hoare triple {42932#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42932#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:44,524 INFO L273 TraceCheckUtils]: 24: Hoare triple {42932#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {42942#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:44,524 INFO L273 TraceCheckUtils]: 25: Hoare triple {42942#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {42942#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:44,525 INFO L273 TraceCheckUtils]: 26: Hoare triple {42942#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42942#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:44,526 INFO L273 TraceCheckUtils]: 27: Hoare triple {42942#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {42952#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:44,526 INFO L273 TraceCheckUtils]: 28: Hoare triple {42952#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {42952#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:44,527 INFO L273 TraceCheckUtils]: 29: Hoare triple {42952#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42952#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:44,527 INFO L273 TraceCheckUtils]: 30: Hoare triple {42952#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {42962#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:44,528 INFO L273 TraceCheckUtils]: 31: Hoare triple {42962#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {42962#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:44,528 INFO L273 TraceCheckUtils]: 32: Hoare triple {42962#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42962#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:44,529 INFO L273 TraceCheckUtils]: 33: Hoare triple {42962#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {42972#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:44,530 INFO L273 TraceCheckUtils]: 34: Hoare triple {42972#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {42972#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:44,530 INFO L273 TraceCheckUtils]: 35: Hoare triple {42972#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42972#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:44,531 INFO L273 TraceCheckUtils]: 36: Hoare triple {42972#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {42982#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:44,531 INFO L273 TraceCheckUtils]: 37: Hoare triple {42982#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {42982#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:44,532 INFO L273 TraceCheckUtils]: 38: Hoare triple {42982#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42982#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:44,532 INFO L273 TraceCheckUtils]: 39: Hoare triple {42982#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {42992#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:44,533 INFO L273 TraceCheckUtils]: 40: Hoare triple {42992#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {42992#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:44,533 INFO L273 TraceCheckUtils]: 41: Hoare triple {42992#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42992#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:44,534 INFO L273 TraceCheckUtils]: 42: Hoare triple {42992#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {43002#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:44,535 INFO L273 TraceCheckUtils]: 43: Hoare triple {43002#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43002#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:44,535 INFO L273 TraceCheckUtils]: 44: Hoare triple {43002#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43002#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:44,536 INFO L273 TraceCheckUtils]: 45: Hoare triple {43002#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {43012#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:44,536 INFO L273 TraceCheckUtils]: 46: Hoare triple {43012#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43012#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:44,537 INFO L273 TraceCheckUtils]: 47: Hoare triple {43012#(<= main_~k~0 14)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43012#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:44,538 INFO L273 TraceCheckUtils]: 48: Hoare triple {43012#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {43022#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:44,538 INFO L273 TraceCheckUtils]: 49: Hoare triple {43022#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43022#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:44,539 INFO L273 TraceCheckUtils]: 50: Hoare triple {43022#(<= main_~k~0 15)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43022#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:44,539 INFO L273 TraceCheckUtils]: 51: Hoare triple {43022#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {43032#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:44,540 INFO L273 TraceCheckUtils]: 52: Hoare triple {43032#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43032#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:44,540 INFO L273 TraceCheckUtils]: 53: Hoare triple {43032#(<= main_~k~0 16)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43032#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:44,541 INFO L273 TraceCheckUtils]: 54: Hoare triple {43032#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {43042#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:44,541 INFO L273 TraceCheckUtils]: 55: Hoare triple {43042#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43042#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:44,542 INFO L273 TraceCheckUtils]: 56: Hoare triple {43042#(<= main_~k~0 17)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43042#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:44,542 INFO L273 TraceCheckUtils]: 57: Hoare triple {43042#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {43052#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:44,543 INFO L273 TraceCheckUtils]: 58: Hoare triple {43052#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43052#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:44,543 INFO L273 TraceCheckUtils]: 59: Hoare triple {43052#(<= main_~k~0 18)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43052#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:44,544 INFO L273 TraceCheckUtils]: 60: Hoare triple {43052#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {43062#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:44,545 INFO L273 TraceCheckUtils]: 61: Hoare triple {43062#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43062#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:44,545 INFO L273 TraceCheckUtils]: 62: Hoare triple {43062#(<= main_~k~0 19)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43062#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:44,546 INFO L273 TraceCheckUtils]: 63: Hoare triple {43062#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {43072#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:44,546 INFO L273 TraceCheckUtils]: 64: Hoare triple {43072#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43072#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:44,547 INFO L273 TraceCheckUtils]: 65: Hoare triple {43072#(<= main_~k~0 20)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43072#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:44,547 INFO L273 TraceCheckUtils]: 66: Hoare triple {43072#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {43082#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:44,548 INFO L273 TraceCheckUtils]: 67: Hoare triple {43082#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43082#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:44,548 INFO L273 TraceCheckUtils]: 68: Hoare triple {43082#(<= main_~k~0 21)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43082#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:44,549 INFO L273 TraceCheckUtils]: 69: Hoare triple {43082#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {43092#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:44,549 INFO L273 TraceCheckUtils]: 70: Hoare triple {43092#(<= main_~k~0 22)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43092#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:44,550 INFO L273 TraceCheckUtils]: 71: Hoare triple {43092#(<= main_~k~0 22)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43092#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:44,551 INFO L273 TraceCheckUtils]: 72: Hoare triple {43092#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {43102#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:44,551 INFO L273 TraceCheckUtils]: 73: Hoare triple {43102#(<= main_~k~0 23)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43102#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:44,552 INFO L273 TraceCheckUtils]: 74: Hoare triple {43102#(<= main_~k~0 23)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43102#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:44,552 INFO L273 TraceCheckUtils]: 75: Hoare triple {43102#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {43112#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:44,553 INFO L273 TraceCheckUtils]: 76: Hoare triple {43112#(<= main_~k~0 24)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43112#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:44,553 INFO L273 TraceCheckUtils]: 77: Hoare triple {43112#(<= main_~k~0 24)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43112#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:44,554 INFO L273 TraceCheckUtils]: 78: Hoare triple {43112#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {43122#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:44,554 INFO L273 TraceCheckUtils]: 79: Hoare triple {43122#(<= main_~k~0 25)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43122#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:44,555 INFO L273 TraceCheckUtils]: 80: Hoare triple {43122#(<= main_~k~0 25)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43122#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:44,556 INFO L273 TraceCheckUtils]: 81: Hoare triple {43122#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {43132#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:44,556 INFO L273 TraceCheckUtils]: 82: Hoare triple {43132#(<= main_~k~0 26)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43132#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:44,556 INFO L273 TraceCheckUtils]: 83: Hoare triple {43132#(<= main_~k~0 26)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43132#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:44,557 INFO L273 TraceCheckUtils]: 84: Hoare triple {43132#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {43142#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:44,558 INFO L273 TraceCheckUtils]: 85: Hoare triple {43142#(<= main_~k~0 27)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43142#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:44,558 INFO L273 TraceCheckUtils]: 86: Hoare triple {43142#(<= main_~k~0 27)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43142#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:44,559 INFO L273 TraceCheckUtils]: 87: Hoare triple {43142#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {43152#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:44,559 INFO L273 TraceCheckUtils]: 88: Hoare triple {43152#(<= main_~k~0 28)} assume !(~k~0 < 100000); {42830#false} is VALID [2018-11-23 11:53:44,560 INFO L273 TraceCheckUtils]: 89: Hoare triple {42830#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42830#false} is VALID [2018-11-23 11:53:44,560 INFO L273 TraceCheckUtils]: 90: Hoare triple {42830#false} ~x~0 := 0; {42830#false} is VALID [2018-11-23 11:53:44,560 INFO L273 TraceCheckUtils]: 91: Hoare triple {42830#false} assume !(~x~0 < ~i~0); {42830#false} is VALID [2018-11-23 11:53:44,560 INFO L273 TraceCheckUtils]: 92: Hoare triple {42830#false} ~x~0 := 0; {42830#false} is VALID [2018-11-23 11:53:44,560 INFO L273 TraceCheckUtils]: 93: Hoare triple {42830#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42830#false} is VALID [2018-11-23 11:53:44,561 INFO L256 TraceCheckUtils]: 94: Hoare triple {42830#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {42830#false} is VALID [2018-11-23 11:53:44,561 INFO L273 TraceCheckUtils]: 95: Hoare triple {42830#false} ~cond := #in~cond; {42830#false} is VALID [2018-11-23 11:53:44,561 INFO L273 TraceCheckUtils]: 96: Hoare triple {42830#false} assume !(0 == ~cond); {42830#false} is VALID [2018-11-23 11:53:44,561 INFO L273 TraceCheckUtils]: 97: Hoare triple {42830#false} assume true; {42830#false} is VALID [2018-11-23 11:53:44,561 INFO L268 TraceCheckUtils]: 98: Hoare quadruple {42830#false} {42830#false} #136#return; {42830#false} is VALID [2018-11-23 11:53:44,561 INFO L273 TraceCheckUtils]: 99: Hoare triple {42830#false} havoc #t~mem9;havoc #t~mem10; {42830#false} is VALID [2018-11-23 11:53:44,561 INFO L273 TraceCheckUtils]: 100: Hoare triple {42830#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {42830#false} is VALID [2018-11-23 11:53:44,562 INFO L273 TraceCheckUtils]: 101: Hoare triple {42830#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42830#false} is VALID [2018-11-23 11:53:44,562 INFO L256 TraceCheckUtils]: 102: Hoare triple {42830#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {42830#false} is VALID [2018-11-23 11:53:44,562 INFO L273 TraceCheckUtils]: 103: Hoare triple {42830#false} ~cond := #in~cond; {42830#false} is VALID [2018-11-23 11:53:44,562 INFO L273 TraceCheckUtils]: 104: Hoare triple {42830#false} assume 0 == ~cond; {42830#false} is VALID [2018-11-23 11:53:44,562 INFO L273 TraceCheckUtils]: 105: Hoare triple {42830#false} assume !false; {42830#false} is VALID [2018-11-23 11:53:44,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1084 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:53:44,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:44,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 60 [2018-11-23 11:53:44,590 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 106 [2018-11-23 11:53:44,590 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:44,590 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 60 states. [2018-11-23 11:53:44,777 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:44,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-11-23 11:53:44,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-11-23 11:53:44,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1336, Invalid=2204, Unknown=0, NotChecked=0, Total=3540 [2018-11-23 11:53:44,779 INFO L87 Difference]: Start difference. First operand 395 states and 578 transitions. Second operand 60 states. [2018-11-23 11:53:46,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:46,199 INFO L93 Difference]: Finished difference Result 636 states and 955 transitions. [2018-11-23 11:53:46,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 11:53:46,199 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 106 [2018-11-23 11:53:46,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:46,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 11:53:46,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 219 transitions. [2018-11-23 11:53:46,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 11:53:46,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 219 transitions. [2018-11-23 11:53:46,204 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 219 transitions. [2018-11-23 11:53:46,438 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 219 edges. 219 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:46,449 INFO L225 Difference]: With dead ends: 636 [2018-11-23 11:53:46,449 INFO L226 Difference]: Without dead ends: 410 [2018-11-23 11:53:46,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1219 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1336, Invalid=2204, Unknown=0, NotChecked=0, Total=3540 [2018-11-23 11:53:46,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-11-23 11:53:47,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 401. [2018-11-23 11:53:47,011 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:47,011 INFO L82 GeneralOperation]: Start isEquivalent. First operand 410 states. Second operand 401 states. [2018-11-23 11:53:47,011 INFO L74 IsIncluded]: Start isIncluded. First operand 410 states. Second operand 401 states. [2018-11-23 11:53:47,011 INFO L87 Difference]: Start difference. First operand 410 states. Second operand 401 states. [2018-11-23 11:53:47,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:47,021 INFO L93 Difference]: Finished difference Result 410 states and 599 transitions. [2018-11-23 11:53:47,021 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 599 transitions. [2018-11-23 11:53:47,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:47,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:47,022 INFO L74 IsIncluded]: Start isIncluded. First operand 401 states. Second operand 410 states. [2018-11-23 11:53:47,022 INFO L87 Difference]: Start difference. First operand 401 states. Second operand 410 states. [2018-11-23 11:53:47,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:47,031 INFO L93 Difference]: Finished difference Result 410 states and 599 transitions. [2018-11-23 11:53:47,031 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 599 transitions. [2018-11-23 11:53:47,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:47,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:47,031 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:47,031 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:47,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-11-23 11:53:47,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 586 transitions. [2018-11-23 11:53:47,040 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 586 transitions. Word has length 106 [2018-11-23 11:53:47,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:47,040 INFO L480 AbstractCegarLoop]: Abstraction has 401 states and 586 transitions. [2018-11-23 11:53:47,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-11-23 11:53:47,040 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 586 transitions. [2018-11-23 11:53:47,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-23 11:53:47,041 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:47,041 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:53:47,041 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:47,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:47,042 INFO L82 PathProgramCache]: Analyzing trace with hash -188670388, now seen corresponding path program 24 times [2018-11-23 11:53:47,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:47,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:47,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:47,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:47,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:47,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:48,072 INFO L256 TraceCheckUtils]: 0: Hoare triple {45426#true} call ULTIMATE.init(); {45426#true} is VALID [2018-11-23 11:53:48,072 INFO L273 TraceCheckUtils]: 1: Hoare triple {45426#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {45426#true} is VALID [2018-11-23 11:53:48,073 INFO L273 TraceCheckUtils]: 2: Hoare triple {45426#true} assume true; {45426#true} is VALID [2018-11-23 11:53:48,073 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {45426#true} {45426#true} #130#return; {45426#true} is VALID [2018-11-23 11:53:48,073 INFO L256 TraceCheckUtils]: 4: Hoare triple {45426#true} call #t~ret15 := main(); {45426#true} is VALID [2018-11-23 11:53:48,073 INFO L273 TraceCheckUtils]: 5: Hoare triple {45426#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {45428#(= main_~i~0 0)} is VALID [2018-11-23 11:53:48,073 INFO L273 TraceCheckUtils]: 6: Hoare triple {45428#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {45429#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,074 INFO L273 TraceCheckUtils]: 7: Hoare triple {45429#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45429#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,075 INFO L273 TraceCheckUtils]: 8: Hoare triple {45429#(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; {45429#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,076 INFO L273 TraceCheckUtils]: 9: Hoare triple {45429#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45430#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,076 INFO L273 TraceCheckUtils]: 10: Hoare triple {45430#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45430#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,077 INFO L273 TraceCheckUtils]: 11: Hoare triple {45430#(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; {45430#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,078 INFO L273 TraceCheckUtils]: 12: Hoare triple {45430#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45431#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,079 INFO L273 TraceCheckUtils]: 13: Hoare triple {45431#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45431#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,079 INFO L273 TraceCheckUtils]: 14: Hoare triple {45431#(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; {45431#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,080 INFO L273 TraceCheckUtils]: 15: Hoare triple {45431#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45432#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,081 INFO L273 TraceCheckUtils]: 16: Hoare triple {45432#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45432#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,082 INFO L273 TraceCheckUtils]: 17: Hoare triple {45432#(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; {45432#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,083 INFO L273 TraceCheckUtils]: 18: Hoare triple {45432#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45433#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,084 INFO L273 TraceCheckUtils]: 19: Hoare triple {45433#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45433#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,084 INFO L273 TraceCheckUtils]: 20: Hoare triple {45433#(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; {45433#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,085 INFO L273 TraceCheckUtils]: 21: Hoare triple {45433#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45434#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,086 INFO L273 TraceCheckUtils]: 22: Hoare triple {45434#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45434#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,087 INFO L273 TraceCheckUtils]: 23: Hoare triple {45434#(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; {45434#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,088 INFO L273 TraceCheckUtils]: 24: Hoare triple {45434#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45435#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,088 INFO L273 TraceCheckUtils]: 25: Hoare triple {45435#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45435#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,089 INFO L273 TraceCheckUtils]: 26: Hoare triple {45435#(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; {45435#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,090 INFO L273 TraceCheckUtils]: 27: Hoare triple {45435#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45436#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,091 INFO L273 TraceCheckUtils]: 28: Hoare triple {45436#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45436#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,091 INFO L273 TraceCheckUtils]: 29: Hoare triple {45436#(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; {45436#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,092 INFO L273 TraceCheckUtils]: 30: Hoare triple {45436#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45437#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,093 INFO L273 TraceCheckUtils]: 31: Hoare triple {45437#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45437#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,094 INFO L273 TraceCheckUtils]: 32: Hoare triple {45437#(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; {45437#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,095 INFO L273 TraceCheckUtils]: 33: Hoare triple {45437#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45438#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,095 INFO L273 TraceCheckUtils]: 34: Hoare triple {45438#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45438#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,096 INFO L273 TraceCheckUtils]: 35: Hoare triple {45438#(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; {45438#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,097 INFO L273 TraceCheckUtils]: 36: Hoare triple {45438#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45439#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,098 INFO L273 TraceCheckUtils]: 37: Hoare triple {45439#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45439#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,099 INFO L273 TraceCheckUtils]: 38: Hoare triple {45439#(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; {45439#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,099 INFO L273 TraceCheckUtils]: 39: Hoare triple {45439#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45440#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,100 INFO L273 TraceCheckUtils]: 40: Hoare triple {45440#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45440#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,101 INFO L273 TraceCheckUtils]: 41: Hoare triple {45440#(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; {45440#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,102 INFO L273 TraceCheckUtils]: 42: Hoare triple {45440#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45441#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,102 INFO L273 TraceCheckUtils]: 43: Hoare triple {45441#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45441#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,103 INFO L273 TraceCheckUtils]: 44: Hoare triple {45441#(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; {45441#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,104 INFO L273 TraceCheckUtils]: 45: Hoare triple {45441#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45442#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,105 INFO L273 TraceCheckUtils]: 46: Hoare triple {45442#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45442#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,105 INFO L273 TraceCheckUtils]: 47: Hoare triple {45442#(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; {45442#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,106 INFO L273 TraceCheckUtils]: 48: Hoare triple {45442#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45443#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,107 INFO L273 TraceCheckUtils]: 49: Hoare triple {45443#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45443#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,108 INFO L273 TraceCheckUtils]: 50: Hoare triple {45443#(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; {45443#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,108 INFO L273 TraceCheckUtils]: 51: Hoare triple {45443#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45444#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,109 INFO L273 TraceCheckUtils]: 52: Hoare triple {45444#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45444#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,110 INFO L273 TraceCheckUtils]: 53: Hoare triple {45444#(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; {45444#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,111 INFO L273 TraceCheckUtils]: 54: Hoare triple {45444#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45445#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:53:48,112 INFO L273 TraceCheckUtils]: 55: Hoare triple {45445#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45445#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:53:48,112 INFO L273 TraceCheckUtils]: 56: Hoare triple {45445#(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; {45445#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:53:48,113 INFO L273 TraceCheckUtils]: 57: Hoare triple {45445#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} ~k~0 := 1 + ~k~0; {45446#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,114 INFO L273 TraceCheckUtils]: 58: Hoare triple {45446#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45446#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,115 INFO L273 TraceCheckUtils]: 59: Hoare triple {45446#(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; {45446#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,115 INFO L273 TraceCheckUtils]: 60: Hoare triple {45446#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45447#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,116 INFO L273 TraceCheckUtils]: 61: Hoare triple {45447#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45447#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,117 INFO L273 TraceCheckUtils]: 62: Hoare triple {45447#(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; {45447#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,118 INFO L273 TraceCheckUtils]: 63: Hoare triple {45447#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45448#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,118 INFO L273 TraceCheckUtils]: 64: Hoare triple {45448#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45448#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,119 INFO L273 TraceCheckUtils]: 65: Hoare triple {45448#(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; {45448#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,120 INFO L273 TraceCheckUtils]: 66: Hoare triple {45448#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45449#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,121 INFO L273 TraceCheckUtils]: 67: Hoare triple {45449#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45449#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,121 INFO L273 TraceCheckUtils]: 68: Hoare triple {45449#(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; {45449#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,122 INFO L273 TraceCheckUtils]: 69: Hoare triple {45449#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45450#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,123 INFO L273 TraceCheckUtils]: 70: Hoare triple {45450#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45450#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,124 INFO L273 TraceCheckUtils]: 71: Hoare triple {45450#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45450#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,125 INFO L273 TraceCheckUtils]: 72: Hoare triple {45450#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45451#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,126 INFO L273 TraceCheckUtils]: 73: Hoare triple {45451#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45451#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,126 INFO L273 TraceCheckUtils]: 74: Hoare triple {45451#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45451#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,127 INFO L273 TraceCheckUtils]: 75: Hoare triple {45451#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45452#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,128 INFO L273 TraceCheckUtils]: 76: Hoare triple {45452#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45452#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,128 INFO L273 TraceCheckUtils]: 77: Hoare triple {45452#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45452#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,129 INFO L273 TraceCheckUtils]: 78: Hoare triple {45452#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45453#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,130 INFO L273 TraceCheckUtils]: 79: Hoare triple {45453#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45453#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,131 INFO L273 TraceCheckUtils]: 80: Hoare triple {45453#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45453#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,132 INFO L273 TraceCheckUtils]: 81: Hoare triple {45453#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45454#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,133 INFO L273 TraceCheckUtils]: 82: Hoare triple {45454#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45454#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,133 INFO L273 TraceCheckUtils]: 83: Hoare triple {45454#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45454#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,134 INFO L273 TraceCheckUtils]: 84: Hoare triple {45454#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45455#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,135 INFO L273 TraceCheckUtils]: 85: Hoare triple {45455#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45455#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,135 INFO L273 TraceCheckUtils]: 86: Hoare triple {45455#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45455#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,136 INFO L273 TraceCheckUtils]: 87: Hoare triple {45455#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45456#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,137 INFO L273 TraceCheckUtils]: 88: Hoare triple {45456#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45456#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,138 INFO L273 TraceCheckUtils]: 89: Hoare triple {45456#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45456#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,139 INFO L273 TraceCheckUtils]: 90: Hoare triple {45456#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45457#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:48,139 INFO L273 TraceCheckUtils]: 91: Hoare triple {45457#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} assume !(~k~0 < 100000); {45427#false} is VALID [2018-11-23 11:53:48,140 INFO L273 TraceCheckUtils]: 92: Hoare triple {45427#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45427#false} is VALID [2018-11-23 11:53:48,140 INFO L273 TraceCheckUtils]: 93: Hoare triple {45427#false} ~x~0 := 0; {45427#false} is VALID [2018-11-23 11:53:48,140 INFO L273 TraceCheckUtils]: 94: Hoare triple {45427#false} assume !(~x~0 < ~i~0); {45427#false} is VALID [2018-11-23 11:53:48,140 INFO L273 TraceCheckUtils]: 95: Hoare triple {45427#false} ~x~0 := 0; {45427#false} is VALID [2018-11-23 11:53:48,141 INFO L273 TraceCheckUtils]: 96: Hoare triple {45427#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45427#false} is VALID [2018-11-23 11:53:48,141 INFO L256 TraceCheckUtils]: 97: Hoare triple {45427#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {45426#true} is VALID [2018-11-23 11:53:48,141 INFO L273 TraceCheckUtils]: 98: Hoare triple {45426#true} ~cond := #in~cond; {45426#true} is VALID [2018-11-23 11:53:48,141 INFO L273 TraceCheckUtils]: 99: Hoare triple {45426#true} assume !(0 == ~cond); {45426#true} is VALID [2018-11-23 11:53:48,141 INFO L273 TraceCheckUtils]: 100: Hoare triple {45426#true} assume true; {45426#true} is VALID [2018-11-23 11:53:48,142 INFO L268 TraceCheckUtils]: 101: Hoare quadruple {45426#true} {45427#false} #136#return; {45427#false} is VALID [2018-11-23 11:53:48,142 INFO L273 TraceCheckUtils]: 102: Hoare triple {45427#false} havoc #t~mem9;havoc #t~mem10; {45427#false} is VALID [2018-11-23 11:53:48,142 INFO L273 TraceCheckUtils]: 103: Hoare triple {45427#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {45427#false} is VALID [2018-11-23 11:53:48,142 INFO L273 TraceCheckUtils]: 104: Hoare triple {45427#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45427#false} is VALID [2018-11-23 11:53:48,142 INFO L256 TraceCheckUtils]: 105: Hoare triple {45427#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {45427#false} is VALID [2018-11-23 11:53:48,142 INFO L273 TraceCheckUtils]: 106: Hoare triple {45427#false} ~cond := #in~cond; {45427#false} is VALID [2018-11-23 11:53:48,142 INFO L273 TraceCheckUtils]: 107: Hoare triple {45427#false} assume 0 == ~cond; {45427#false} is VALID [2018-11-23 11:53:48,143 INFO L273 TraceCheckUtils]: 108: Hoare triple {45427#false} assume !false; {45427#false} is VALID [2018-11-23 11:53:48,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1166 backedges. 2 proven. 1162 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:53:48,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:48,162 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:53:48,171 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:53:48,356 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 29 check-sat command(s) [2018-11-23 11:53:48,356 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:48,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:48,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:49,212 INFO L256 TraceCheckUtils]: 0: Hoare triple {45426#true} call ULTIMATE.init(); {45426#true} is VALID [2018-11-23 11:53:49,212 INFO L273 TraceCheckUtils]: 1: Hoare triple {45426#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {45426#true} is VALID [2018-11-23 11:53:49,212 INFO L273 TraceCheckUtils]: 2: Hoare triple {45426#true} assume true; {45426#true} is VALID [2018-11-23 11:53:49,213 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {45426#true} {45426#true} #130#return; {45426#true} is VALID [2018-11-23 11:53:49,213 INFO L256 TraceCheckUtils]: 4: Hoare triple {45426#true} call #t~ret15 := main(); {45426#true} is VALID [2018-11-23 11:53:49,213 INFO L273 TraceCheckUtils]: 5: Hoare triple {45426#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {45476#(<= main_~i~0 0)} is VALID [2018-11-23 11:53:49,214 INFO L273 TraceCheckUtils]: 6: Hoare triple {45476#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {45480#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:49,214 INFO L273 TraceCheckUtils]: 7: Hoare triple {45480#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45480#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:49,215 INFO L273 TraceCheckUtils]: 8: Hoare triple {45480#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45480#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:49,215 INFO L273 TraceCheckUtils]: 9: Hoare triple {45480#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {45490#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:49,215 INFO L273 TraceCheckUtils]: 10: Hoare triple {45490#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45490#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:49,216 INFO L273 TraceCheckUtils]: 11: Hoare triple {45490#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45490#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:49,216 INFO L273 TraceCheckUtils]: 12: Hoare triple {45490#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {45500#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:49,217 INFO L273 TraceCheckUtils]: 13: Hoare triple {45500#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45500#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:49,217 INFO L273 TraceCheckUtils]: 14: Hoare triple {45500#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45500#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:49,218 INFO L273 TraceCheckUtils]: 15: Hoare triple {45500#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {45510#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:49,218 INFO L273 TraceCheckUtils]: 16: Hoare triple {45510#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45510#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:49,219 INFO L273 TraceCheckUtils]: 17: Hoare triple {45510#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45510#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:49,220 INFO L273 TraceCheckUtils]: 18: Hoare triple {45510#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {45520#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:49,220 INFO L273 TraceCheckUtils]: 19: Hoare triple {45520#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45520#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:49,221 INFO L273 TraceCheckUtils]: 20: Hoare triple {45520#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45520#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:49,221 INFO L273 TraceCheckUtils]: 21: Hoare triple {45520#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {45530#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:49,222 INFO L273 TraceCheckUtils]: 22: Hoare triple {45530#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45530#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:49,222 INFO L273 TraceCheckUtils]: 23: Hoare triple {45530#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45530#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:49,223 INFO L273 TraceCheckUtils]: 24: Hoare triple {45530#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {45540#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:49,224 INFO L273 TraceCheckUtils]: 25: Hoare triple {45540#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45540#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:49,224 INFO L273 TraceCheckUtils]: 26: Hoare triple {45540#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45540#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:49,225 INFO L273 TraceCheckUtils]: 27: Hoare triple {45540#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {45550#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:49,225 INFO L273 TraceCheckUtils]: 28: Hoare triple {45550#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45550#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:49,226 INFO L273 TraceCheckUtils]: 29: Hoare triple {45550#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45550#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:49,227 INFO L273 TraceCheckUtils]: 30: Hoare triple {45550#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {45560#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:49,227 INFO L273 TraceCheckUtils]: 31: Hoare triple {45560#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45560#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:49,228 INFO L273 TraceCheckUtils]: 32: Hoare triple {45560#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45560#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:49,228 INFO L273 TraceCheckUtils]: 33: Hoare triple {45560#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {45570#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:49,229 INFO L273 TraceCheckUtils]: 34: Hoare triple {45570#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45570#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:49,229 INFO L273 TraceCheckUtils]: 35: Hoare triple {45570#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45570#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:49,230 INFO L273 TraceCheckUtils]: 36: Hoare triple {45570#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {45580#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:49,231 INFO L273 TraceCheckUtils]: 37: Hoare triple {45580#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45580#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:49,231 INFO L273 TraceCheckUtils]: 38: Hoare triple {45580#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45580#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:49,232 INFO L273 TraceCheckUtils]: 39: Hoare triple {45580#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {45590#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:49,232 INFO L273 TraceCheckUtils]: 40: Hoare triple {45590#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45590#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:49,233 INFO L273 TraceCheckUtils]: 41: Hoare triple {45590#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45590#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:49,234 INFO L273 TraceCheckUtils]: 42: Hoare triple {45590#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {45600#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:49,234 INFO L273 TraceCheckUtils]: 43: Hoare triple {45600#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45600#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:49,235 INFO L273 TraceCheckUtils]: 44: Hoare triple {45600#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45600#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:49,235 INFO L273 TraceCheckUtils]: 45: Hoare triple {45600#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {45610#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:49,236 INFO L273 TraceCheckUtils]: 46: Hoare triple {45610#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45610#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:49,236 INFO L273 TraceCheckUtils]: 47: Hoare triple {45610#(<= main_~k~0 14)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45610#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:49,237 INFO L273 TraceCheckUtils]: 48: Hoare triple {45610#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {45620#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:49,238 INFO L273 TraceCheckUtils]: 49: Hoare triple {45620#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45620#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:49,238 INFO L273 TraceCheckUtils]: 50: Hoare triple {45620#(<= main_~k~0 15)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45620#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:49,239 INFO L273 TraceCheckUtils]: 51: Hoare triple {45620#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {45630#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:49,239 INFO L273 TraceCheckUtils]: 52: Hoare triple {45630#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45630#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:49,240 INFO L273 TraceCheckUtils]: 53: Hoare triple {45630#(<= main_~k~0 16)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45630#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:49,241 INFO L273 TraceCheckUtils]: 54: Hoare triple {45630#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {45640#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:49,241 INFO L273 TraceCheckUtils]: 55: Hoare triple {45640#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45640#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:49,242 INFO L273 TraceCheckUtils]: 56: Hoare triple {45640#(<= main_~k~0 17)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45640#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:49,242 INFO L273 TraceCheckUtils]: 57: Hoare triple {45640#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {45650#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:49,243 INFO L273 TraceCheckUtils]: 58: Hoare triple {45650#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45650#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:49,243 INFO L273 TraceCheckUtils]: 59: Hoare triple {45650#(<= main_~k~0 18)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45650#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:49,244 INFO L273 TraceCheckUtils]: 60: Hoare triple {45650#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {45660#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:49,245 INFO L273 TraceCheckUtils]: 61: Hoare triple {45660#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45660#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:49,245 INFO L273 TraceCheckUtils]: 62: Hoare triple {45660#(<= main_~k~0 19)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45660#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:49,246 INFO L273 TraceCheckUtils]: 63: Hoare triple {45660#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {45670#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:49,246 INFO L273 TraceCheckUtils]: 64: Hoare triple {45670#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45670#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:49,247 INFO L273 TraceCheckUtils]: 65: Hoare triple {45670#(<= main_~k~0 20)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45670#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:49,248 INFO L273 TraceCheckUtils]: 66: Hoare triple {45670#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {45680#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:49,248 INFO L273 TraceCheckUtils]: 67: Hoare triple {45680#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45680#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:49,249 INFO L273 TraceCheckUtils]: 68: Hoare triple {45680#(<= main_~k~0 21)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45680#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:49,249 INFO L273 TraceCheckUtils]: 69: Hoare triple {45680#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {45690#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:49,250 INFO L273 TraceCheckUtils]: 70: Hoare triple {45690#(<= main_~k~0 22)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45690#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:49,250 INFO L273 TraceCheckUtils]: 71: Hoare triple {45690#(<= main_~k~0 22)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45690#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:49,251 INFO L273 TraceCheckUtils]: 72: Hoare triple {45690#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {45700#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:49,252 INFO L273 TraceCheckUtils]: 73: Hoare triple {45700#(<= main_~k~0 23)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45700#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:49,252 INFO L273 TraceCheckUtils]: 74: Hoare triple {45700#(<= main_~k~0 23)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45700#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:49,253 INFO L273 TraceCheckUtils]: 75: Hoare triple {45700#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {45710#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:49,253 INFO L273 TraceCheckUtils]: 76: Hoare triple {45710#(<= main_~k~0 24)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45710#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:49,254 INFO L273 TraceCheckUtils]: 77: Hoare triple {45710#(<= main_~k~0 24)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45710#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:49,255 INFO L273 TraceCheckUtils]: 78: Hoare triple {45710#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {45720#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:49,255 INFO L273 TraceCheckUtils]: 79: Hoare triple {45720#(<= main_~k~0 25)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45720#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:49,256 INFO L273 TraceCheckUtils]: 80: Hoare triple {45720#(<= main_~k~0 25)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45720#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:49,256 INFO L273 TraceCheckUtils]: 81: Hoare triple {45720#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {45730#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:49,257 INFO L273 TraceCheckUtils]: 82: Hoare triple {45730#(<= main_~k~0 26)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45730#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:49,257 INFO L273 TraceCheckUtils]: 83: Hoare triple {45730#(<= main_~k~0 26)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45730#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:49,258 INFO L273 TraceCheckUtils]: 84: Hoare triple {45730#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {45740#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:49,259 INFO L273 TraceCheckUtils]: 85: Hoare triple {45740#(<= main_~k~0 27)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45740#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:49,259 INFO L273 TraceCheckUtils]: 86: Hoare triple {45740#(<= main_~k~0 27)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45740#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:49,260 INFO L273 TraceCheckUtils]: 87: Hoare triple {45740#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {45750#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:49,260 INFO L273 TraceCheckUtils]: 88: Hoare triple {45750#(<= main_~k~0 28)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45750#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:49,261 INFO L273 TraceCheckUtils]: 89: Hoare triple {45750#(<= main_~k~0 28)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45750#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:49,262 INFO L273 TraceCheckUtils]: 90: Hoare triple {45750#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {45760#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:49,262 INFO L273 TraceCheckUtils]: 91: Hoare triple {45760#(<= main_~k~0 29)} assume !(~k~0 < 100000); {45427#false} is VALID [2018-11-23 11:53:49,262 INFO L273 TraceCheckUtils]: 92: Hoare triple {45427#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45427#false} is VALID [2018-11-23 11:53:49,263 INFO L273 TraceCheckUtils]: 93: Hoare triple {45427#false} ~x~0 := 0; {45427#false} is VALID [2018-11-23 11:53:49,263 INFO L273 TraceCheckUtils]: 94: Hoare triple {45427#false} assume !(~x~0 < ~i~0); {45427#false} is VALID [2018-11-23 11:53:49,263 INFO L273 TraceCheckUtils]: 95: Hoare triple {45427#false} ~x~0 := 0; {45427#false} is VALID [2018-11-23 11:53:49,263 INFO L273 TraceCheckUtils]: 96: Hoare triple {45427#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45427#false} is VALID [2018-11-23 11:53:49,263 INFO L256 TraceCheckUtils]: 97: Hoare triple {45427#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {45427#false} is VALID [2018-11-23 11:53:49,264 INFO L273 TraceCheckUtils]: 98: Hoare triple {45427#false} ~cond := #in~cond; {45427#false} is VALID [2018-11-23 11:53:49,264 INFO L273 TraceCheckUtils]: 99: Hoare triple {45427#false} assume !(0 == ~cond); {45427#false} is VALID [2018-11-23 11:53:49,264 INFO L273 TraceCheckUtils]: 100: Hoare triple {45427#false} assume true; {45427#false} is VALID [2018-11-23 11:53:49,264 INFO L268 TraceCheckUtils]: 101: Hoare quadruple {45427#false} {45427#false} #136#return; {45427#false} is VALID [2018-11-23 11:53:49,264 INFO L273 TraceCheckUtils]: 102: Hoare triple {45427#false} havoc #t~mem9;havoc #t~mem10; {45427#false} is VALID [2018-11-23 11:53:49,264 INFO L273 TraceCheckUtils]: 103: Hoare triple {45427#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {45427#false} is VALID [2018-11-23 11:53:49,265 INFO L273 TraceCheckUtils]: 104: Hoare triple {45427#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45427#false} is VALID [2018-11-23 11:53:49,265 INFO L256 TraceCheckUtils]: 105: Hoare triple {45427#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {45427#false} is VALID [2018-11-23 11:53:49,265 INFO L273 TraceCheckUtils]: 106: Hoare triple {45427#false} ~cond := #in~cond; {45427#false} is VALID [2018-11-23 11:53:49,265 INFO L273 TraceCheckUtils]: 107: Hoare triple {45427#false} assume 0 == ~cond; {45427#false} is VALID [2018-11-23 11:53:49,265 INFO L273 TraceCheckUtils]: 108: Hoare triple {45427#false} assume !false; {45427#false} is VALID [2018-11-23 11:53:49,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1166 backedges. 0 proven. 1162 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:53:49,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:49,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 62 [2018-11-23 11:53:49,294 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 109 [2018-11-23 11:53:49,295 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:49,295 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 62 states. [2018-11-23 11:53:49,497 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:49,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-11-23 11:53:49,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-11-23 11:53:49,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1427, Invalid=2355, Unknown=0, NotChecked=0, Total=3782 [2018-11-23 11:53:49,500 INFO L87 Difference]: Start difference. First operand 401 states and 586 transitions. Second operand 62 states. [2018-11-23 11:53:51,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:51,968 INFO L93 Difference]: Finished difference Result 642 states and 963 transitions. [2018-11-23 11:53:51,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-23 11:53:51,968 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 109 [2018-11-23 11:53:51,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:51,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-23 11:53:51,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 223 transitions. [2018-11-23 11:53:51,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-23 11:53:51,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 223 transitions. [2018-11-23 11:53:51,971 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 223 transitions. [2018-11-23 11:53:52,244 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 223 edges. 223 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:52,255 INFO L225 Difference]: With dead ends: 642 [2018-11-23 11:53:52,255 INFO L226 Difference]: Without dead ends: 416 [2018-11-23 11:53:52,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1306 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1427, Invalid=2355, Unknown=0, NotChecked=0, Total=3782 [2018-11-23 11:53:52,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2018-11-23 11:53:52,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 407. [2018-11-23 11:53:52,726 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:52,726 INFO L82 GeneralOperation]: Start isEquivalent. First operand 416 states. Second operand 407 states. [2018-11-23 11:53:52,726 INFO L74 IsIncluded]: Start isIncluded. First operand 416 states. Second operand 407 states. [2018-11-23 11:53:52,726 INFO L87 Difference]: Start difference. First operand 416 states. Second operand 407 states. [2018-11-23 11:53:52,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:52,736 INFO L93 Difference]: Finished difference Result 416 states and 607 transitions. [2018-11-23 11:53:52,736 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 607 transitions. [2018-11-23 11:53:52,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:52,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:52,737 INFO L74 IsIncluded]: Start isIncluded. First operand 407 states. Second operand 416 states. [2018-11-23 11:53:52,737 INFO L87 Difference]: Start difference. First operand 407 states. Second operand 416 states. [2018-11-23 11:53:52,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:52,746 INFO L93 Difference]: Finished difference Result 416 states and 607 transitions. [2018-11-23 11:53:52,746 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 607 transitions. [2018-11-23 11:53:52,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:52,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:52,747 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:52,747 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:52,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2018-11-23 11:53:52,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 594 transitions. [2018-11-23 11:53:52,757 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 594 transitions. Word has length 109 [2018-11-23 11:53:52,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:52,757 INFO L480 AbstractCegarLoop]: Abstraction has 407 states and 594 transitions. [2018-11-23 11:53:52,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-11-23 11:53:52,757 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 594 transitions. [2018-11-23 11:53:52,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-23 11:53:52,758 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:52,758 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 29, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:53:52,758 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:52,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:52,758 INFO L82 PathProgramCache]: Analyzing trace with hash 268896945, now seen corresponding path program 25 times [2018-11-23 11:53:52,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:52,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:52,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:52,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:52,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:52,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:53,647 INFO L256 TraceCheckUtils]: 0: Hoare triple {48062#true} call ULTIMATE.init(); {48062#true} is VALID [2018-11-23 11:53:53,647 INFO L273 TraceCheckUtils]: 1: Hoare triple {48062#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {48062#true} is VALID [2018-11-23 11:53:53,647 INFO L273 TraceCheckUtils]: 2: Hoare triple {48062#true} assume true; {48062#true} is VALID [2018-11-23 11:53:53,647 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {48062#true} {48062#true} #130#return; {48062#true} is VALID [2018-11-23 11:53:53,648 INFO L256 TraceCheckUtils]: 4: Hoare triple {48062#true} call #t~ret15 := main(); {48062#true} is VALID [2018-11-23 11:53:53,648 INFO L273 TraceCheckUtils]: 5: Hoare triple {48062#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {48064#(= main_~i~0 0)} is VALID [2018-11-23 11:53:53,649 INFO L273 TraceCheckUtils]: 6: Hoare triple {48064#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {48065#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,649 INFO L273 TraceCheckUtils]: 7: Hoare triple {48065#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48065#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,650 INFO L273 TraceCheckUtils]: 8: Hoare triple {48065#(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; {48065#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,650 INFO L273 TraceCheckUtils]: 9: Hoare triple {48065#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {48066#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,651 INFO L273 TraceCheckUtils]: 10: Hoare triple {48066#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48066#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,651 INFO L273 TraceCheckUtils]: 11: Hoare triple {48066#(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; {48066#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,652 INFO L273 TraceCheckUtils]: 12: Hoare triple {48066#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {48067#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,653 INFO L273 TraceCheckUtils]: 13: Hoare triple {48067#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48067#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,653 INFO L273 TraceCheckUtils]: 14: Hoare triple {48067#(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; {48067#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,654 INFO L273 TraceCheckUtils]: 15: Hoare triple {48067#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {48068#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,655 INFO L273 TraceCheckUtils]: 16: Hoare triple {48068#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48068#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,656 INFO L273 TraceCheckUtils]: 17: Hoare triple {48068#(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; {48068#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,656 INFO L273 TraceCheckUtils]: 18: Hoare triple {48068#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {48069#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,657 INFO L273 TraceCheckUtils]: 19: Hoare triple {48069#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48069#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,658 INFO L273 TraceCheckUtils]: 20: Hoare triple {48069#(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; {48069#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,659 INFO L273 TraceCheckUtils]: 21: Hoare triple {48069#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {48070#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,660 INFO L273 TraceCheckUtils]: 22: Hoare triple {48070#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48070#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,660 INFO L273 TraceCheckUtils]: 23: Hoare triple {48070#(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; {48070#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,661 INFO L273 TraceCheckUtils]: 24: Hoare triple {48070#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {48071#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,662 INFO L273 TraceCheckUtils]: 25: Hoare triple {48071#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48071#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,662 INFO L273 TraceCheckUtils]: 26: Hoare triple {48071#(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; {48071#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,663 INFO L273 TraceCheckUtils]: 27: Hoare triple {48071#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {48072#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,664 INFO L273 TraceCheckUtils]: 28: Hoare triple {48072#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48072#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,665 INFO L273 TraceCheckUtils]: 29: Hoare triple {48072#(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; {48072#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,665 INFO L273 TraceCheckUtils]: 30: Hoare triple {48072#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {48073#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,666 INFO L273 TraceCheckUtils]: 31: Hoare triple {48073#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48073#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,667 INFO L273 TraceCheckUtils]: 32: Hoare triple {48073#(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; {48073#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,668 INFO L273 TraceCheckUtils]: 33: Hoare triple {48073#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {48074#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,668 INFO L273 TraceCheckUtils]: 34: Hoare triple {48074#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48074#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,669 INFO L273 TraceCheckUtils]: 35: Hoare triple {48074#(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; {48074#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,670 INFO L273 TraceCheckUtils]: 36: Hoare triple {48074#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {48075#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,671 INFO L273 TraceCheckUtils]: 37: Hoare triple {48075#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48075#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,671 INFO L273 TraceCheckUtils]: 38: Hoare triple {48075#(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; {48075#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,672 INFO L273 TraceCheckUtils]: 39: Hoare triple {48075#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {48076#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,673 INFO L273 TraceCheckUtils]: 40: Hoare triple {48076#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48076#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,674 INFO L273 TraceCheckUtils]: 41: Hoare triple {48076#(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; {48076#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,674 INFO L273 TraceCheckUtils]: 42: Hoare triple {48076#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {48077#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,675 INFO L273 TraceCheckUtils]: 43: Hoare triple {48077#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48077#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,676 INFO L273 TraceCheckUtils]: 44: Hoare triple {48077#(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; {48077#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,677 INFO L273 TraceCheckUtils]: 45: Hoare triple {48077#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {48078#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,677 INFO L273 TraceCheckUtils]: 46: Hoare triple {48078#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48078#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,678 INFO L273 TraceCheckUtils]: 47: Hoare triple {48078#(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; {48078#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,679 INFO L273 TraceCheckUtils]: 48: Hoare triple {48078#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {48079#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,680 INFO L273 TraceCheckUtils]: 49: Hoare triple {48079#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48079#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,680 INFO L273 TraceCheckUtils]: 50: Hoare triple {48079#(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; {48079#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,681 INFO L273 TraceCheckUtils]: 51: Hoare triple {48079#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {48080#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,682 INFO L273 TraceCheckUtils]: 52: Hoare triple {48080#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48080#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,683 INFO L273 TraceCheckUtils]: 53: Hoare triple {48080#(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; {48080#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,683 INFO L273 TraceCheckUtils]: 54: Hoare triple {48080#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {48081#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:53:53,684 INFO L273 TraceCheckUtils]: 55: Hoare triple {48081#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48081#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:53:53,685 INFO L273 TraceCheckUtils]: 56: Hoare triple {48081#(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; {48081#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:53:53,686 INFO L273 TraceCheckUtils]: 57: Hoare triple {48081#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} ~k~0 := 1 + ~k~0; {48082#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,686 INFO L273 TraceCheckUtils]: 58: Hoare triple {48082#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48082#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,687 INFO L273 TraceCheckUtils]: 59: Hoare triple {48082#(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; {48082#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,688 INFO L273 TraceCheckUtils]: 60: Hoare triple {48082#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {48083#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,689 INFO L273 TraceCheckUtils]: 61: Hoare triple {48083#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48083#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,689 INFO L273 TraceCheckUtils]: 62: Hoare triple {48083#(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; {48083#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,690 INFO L273 TraceCheckUtils]: 63: Hoare triple {48083#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {48084#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,691 INFO L273 TraceCheckUtils]: 64: Hoare triple {48084#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48084#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,691 INFO L273 TraceCheckUtils]: 65: Hoare triple {48084#(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; {48084#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,692 INFO L273 TraceCheckUtils]: 66: Hoare triple {48084#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {48085#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,693 INFO L273 TraceCheckUtils]: 67: Hoare triple {48085#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48085#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,694 INFO L273 TraceCheckUtils]: 68: Hoare triple {48085#(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; {48085#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,694 INFO L273 TraceCheckUtils]: 69: Hoare triple {48085#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {48086#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,695 INFO L273 TraceCheckUtils]: 70: Hoare triple {48086#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48086#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,696 INFO L273 TraceCheckUtils]: 71: Hoare triple {48086#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48086#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,697 INFO L273 TraceCheckUtils]: 72: Hoare triple {48086#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {48087#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,697 INFO L273 TraceCheckUtils]: 73: Hoare triple {48087#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48087#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,698 INFO L273 TraceCheckUtils]: 74: Hoare triple {48087#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48087#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,699 INFO L273 TraceCheckUtils]: 75: Hoare triple {48087#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {48088#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,700 INFO L273 TraceCheckUtils]: 76: Hoare triple {48088#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48088#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,700 INFO L273 TraceCheckUtils]: 77: Hoare triple {48088#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48088#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,701 INFO L273 TraceCheckUtils]: 78: Hoare triple {48088#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {48089#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,702 INFO L273 TraceCheckUtils]: 79: Hoare triple {48089#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48089#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,703 INFO L273 TraceCheckUtils]: 80: Hoare triple {48089#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48089#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,703 INFO L273 TraceCheckUtils]: 81: Hoare triple {48089#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {48090#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,704 INFO L273 TraceCheckUtils]: 82: Hoare triple {48090#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48090#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,705 INFO L273 TraceCheckUtils]: 83: Hoare triple {48090#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48090#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,706 INFO L273 TraceCheckUtils]: 84: Hoare triple {48090#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {48091#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,706 INFO L273 TraceCheckUtils]: 85: Hoare triple {48091#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48091#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,707 INFO L273 TraceCheckUtils]: 86: Hoare triple {48091#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48091#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,708 INFO L273 TraceCheckUtils]: 87: Hoare triple {48091#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {48092#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,709 INFO L273 TraceCheckUtils]: 88: Hoare triple {48092#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48092#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,710 INFO L273 TraceCheckUtils]: 89: Hoare triple {48092#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48092#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,710 INFO L273 TraceCheckUtils]: 90: Hoare triple {48092#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {48093#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,711 INFO L273 TraceCheckUtils]: 91: Hoare triple {48093#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48093#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,712 INFO L273 TraceCheckUtils]: 92: Hoare triple {48093#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48093#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,713 INFO L273 TraceCheckUtils]: 93: Hoare triple {48093#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {48094#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 11:53:53,713 INFO L273 TraceCheckUtils]: 94: Hoare triple {48094#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} assume !(~k~0 < 100000); {48063#false} is VALID [2018-11-23 11:53:53,714 INFO L273 TraceCheckUtils]: 95: Hoare triple {48063#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {48063#false} is VALID [2018-11-23 11:53:53,714 INFO L273 TraceCheckUtils]: 96: Hoare triple {48063#false} ~x~0 := 0; {48063#false} is VALID [2018-11-23 11:53:53,714 INFO L273 TraceCheckUtils]: 97: Hoare triple {48063#false} assume !(~x~0 < ~i~0); {48063#false} is VALID [2018-11-23 11:53:53,714 INFO L273 TraceCheckUtils]: 98: Hoare triple {48063#false} ~x~0 := 0; {48063#false} is VALID [2018-11-23 11:53:53,714 INFO L273 TraceCheckUtils]: 99: Hoare triple {48063#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {48063#false} is VALID [2018-11-23 11:53:53,715 INFO L256 TraceCheckUtils]: 100: Hoare triple {48063#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {48062#true} is VALID [2018-11-23 11:53:53,715 INFO L273 TraceCheckUtils]: 101: Hoare triple {48062#true} ~cond := #in~cond; {48062#true} is VALID [2018-11-23 11:53:53,715 INFO L273 TraceCheckUtils]: 102: Hoare triple {48062#true} assume !(0 == ~cond); {48062#true} is VALID [2018-11-23 11:53:53,715 INFO L273 TraceCheckUtils]: 103: Hoare triple {48062#true} assume true; {48062#true} is VALID [2018-11-23 11:53:53,715 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {48062#true} {48063#false} #136#return; {48063#false} is VALID [2018-11-23 11:53:53,716 INFO L273 TraceCheckUtils]: 105: Hoare triple {48063#false} havoc #t~mem9;havoc #t~mem10; {48063#false} is VALID [2018-11-23 11:53:53,716 INFO L273 TraceCheckUtils]: 106: Hoare triple {48063#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {48063#false} is VALID [2018-11-23 11:53:53,716 INFO L273 TraceCheckUtils]: 107: Hoare triple {48063#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {48063#false} is VALID [2018-11-23 11:53:53,716 INFO L256 TraceCheckUtils]: 108: Hoare triple {48063#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {48063#false} is VALID [2018-11-23 11:53:53,717 INFO L273 TraceCheckUtils]: 109: Hoare triple {48063#false} ~cond := #in~cond; {48063#false} is VALID [2018-11-23 11:53:53,717 INFO L273 TraceCheckUtils]: 110: Hoare triple {48063#false} assume 0 == ~cond; {48063#false} is VALID [2018-11-23 11:53:53,717 INFO L273 TraceCheckUtils]: 111: Hoare triple {48063#false} assume !false; {48063#false} is VALID [2018-11-23 11:53:53,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1251 backedges. 2 proven. 1247 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:53:53,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:53,737 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:53:53,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:53:53,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:53,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:53,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:55,986 INFO L256 TraceCheckUtils]: 0: Hoare triple {48062#true} call ULTIMATE.init(); {48062#true} is VALID [2018-11-23 11:53:55,986 INFO L273 TraceCheckUtils]: 1: Hoare triple {48062#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {48062#true} is VALID [2018-11-23 11:53:55,986 INFO L273 TraceCheckUtils]: 2: Hoare triple {48062#true} assume true; {48062#true} is VALID [2018-11-23 11:53:55,986 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {48062#true} {48062#true} #130#return; {48062#true} is VALID [2018-11-23 11:53:55,987 INFO L256 TraceCheckUtils]: 4: Hoare triple {48062#true} call #t~ret15 := main(); {48062#true} is VALID [2018-11-23 11:53:55,987 INFO L273 TraceCheckUtils]: 5: Hoare triple {48062#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {48113#(<= main_~i~0 0)} is VALID [2018-11-23 11:53:55,988 INFO L273 TraceCheckUtils]: 6: Hoare triple {48113#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {48117#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:55,989 INFO L273 TraceCheckUtils]: 7: Hoare triple {48117#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48117#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:55,989 INFO L273 TraceCheckUtils]: 8: Hoare triple {48117#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48117#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:55,989 INFO L273 TraceCheckUtils]: 9: Hoare triple {48117#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {48127#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:55,990 INFO L273 TraceCheckUtils]: 10: Hoare triple {48127#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48127#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:55,990 INFO L273 TraceCheckUtils]: 11: Hoare triple {48127#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48127#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:55,990 INFO L273 TraceCheckUtils]: 12: Hoare triple {48127#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {48137#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:55,991 INFO L273 TraceCheckUtils]: 13: Hoare triple {48137#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48137#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:55,991 INFO L273 TraceCheckUtils]: 14: Hoare triple {48137#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48137#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:55,992 INFO L273 TraceCheckUtils]: 15: Hoare triple {48137#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {48147#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:55,992 INFO L273 TraceCheckUtils]: 16: Hoare triple {48147#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48147#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:55,993 INFO L273 TraceCheckUtils]: 17: Hoare triple {48147#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48147#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:55,994 INFO L273 TraceCheckUtils]: 18: Hoare triple {48147#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {48157#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:55,994 INFO L273 TraceCheckUtils]: 19: Hoare triple {48157#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48157#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:55,995 INFO L273 TraceCheckUtils]: 20: Hoare triple {48157#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48157#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:55,995 INFO L273 TraceCheckUtils]: 21: Hoare triple {48157#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {48167#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:55,996 INFO L273 TraceCheckUtils]: 22: Hoare triple {48167#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48167#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:55,996 INFO L273 TraceCheckUtils]: 23: Hoare triple {48167#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48167#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:55,997 INFO L273 TraceCheckUtils]: 24: Hoare triple {48167#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {48177#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:55,997 INFO L273 TraceCheckUtils]: 25: Hoare triple {48177#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48177#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:55,998 INFO L273 TraceCheckUtils]: 26: Hoare triple {48177#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48177#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:56,003 INFO L273 TraceCheckUtils]: 27: Hoare triple {48177#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {48187#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:56,004 INFO L273 TraceCheckUtils]: 28: Hoare triple {48187#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48187#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:56,004 INFO L273 TraceCheckUtils]: 29: Hoare triple {48187#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48187#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:56,005 INFO L273 TraceCheckUtils]: 30: Hoare triple {48187#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {48197#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:56,005 INFO L273 TraceCheckUtils]: 31: Hoare triple {48197#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48197#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:56,005 INFO L273 TraceCheckUtils]: 32: Hoare triple {48197#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48197#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:56,006 INFO L273 TraceCheckUtils]: 33: Hoare triple {48197#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {48207#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:56,006 INFO L273 TraceCheckUtils]: 34: Hoare triple {48207#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48207#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:56,006 INFO L273 TraceCheckUtils]: 35: Hoare triple {48207#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48207#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:56,007 INFO L273 TraceCheckUtils]: 36: Hoare triple {48207#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {48217#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:56,007 INFO L273 TraceCheckUtils]: 37: Hoare triple {48217#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48217#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:56,007 INFO L273 TraceCheckUtils]: 38: Hoare triple {48217#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48217#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:56,008 INFO L273 TraceCheckUtils]: 39: Hoare triple {48217#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {48227#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:56,009 INFO L273 TraceCheckUtils]: 40: Hoare triple {48227#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48227#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:56,009 INFO L273 TraceCheckUtils]: 41: Hoare triple {48227#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48227#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:56,010 INFO L273 TraceCheckUtils]: 42: Hoare triple {48227#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {48237#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:56,010 INFO L273 TraceCheckUtils]: 43: Hoare triple {48237#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48237#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:56,011 INFO L273 TraceCheckUtils]: 44: Hoare triple {48237#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48237#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:56,011 INFO L273 TraceCheckUtils]: 45: Hoare triple {48237#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {48247#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:56,012 INFO L273 TraceCheckUtils]: 46: Hoare triple {48247#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48247#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:56,012 INFO L273 TraceCheckUtils]: 47: Hoare triple {48247#(<= main_~k~0 14)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48247#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:56,013 INFO L273 TraceCheckUtils]: 48: Hoare triple {48247#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {48257#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:56,013 INFO L273 TraceCheckUtils]: 49: Hoare triple {48257#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48257#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:56,014 INFO L273 TraceCheckUtils]: 50: Hoare triple {48257#(<= main_~k~0 15)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48257#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:56,015 INFO L273 TraceCheckUtils]: 51: Hoare triple {48257#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {48267#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:56,015 INFO L273 TraceCheckUtils]: 52: Hoare triple {48267#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48267#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:56,016 INFO L273 TraceCheckUtils]: 53: Hoare triple {48267#(<= main_~k~0 16)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48267#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:56,016 INFO L273 TraceCheckUtils]: 54: Hoare triple {48267#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {48277#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:56,017 INFO L273 TraceCheckUtils]: 55: Hoare triple {48277#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48277#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:56,017 INFO L273 TraceCheckUtils]: 56: Hoare triple {48277#(<= main_~k~0 17)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48277#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:56,018 INFO L273 TraceCheckUtils]: 57: Hoare triple {48277#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {48287#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:56,018 INFO L273 TraceCheckUtils]: 58: Hoare triple {48287#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48287#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:56,019 INFO L273 TraceCheckUtils]: 59: Hoare triple {48287#(<= main_~k~0 18)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48287#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:56,020 INFO L273 TraceCheckUtils]: 60: Hoare triple {48287#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {48297#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:56,020 INFO L273 TraceCheckUtils]: 61: Hoare triple {48297#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48297#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:56,021 INFO L273 TraceCheckUtils]: 62: Hoare triple {48297#(<= main_~k~0 19)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48297#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:56,021 INFO L273 TraceCheckUtils]: 63: Hoare triple {48297#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {48307#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:56,022 INFO L273 TraceCheckUtils]: 64: Hoare triple {48307#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48307#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:56,022 INFO L273 TraceCheckUtils]: 65: Hoare triple {48307#(<= main_~k~0 20)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48307#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:56,023 INFO L273 TraceCheckUtils]: 66: Hoare triple {48307#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {48317#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:56,023 INFO L273 TraceCheckUtils]: 67: Hoare triple {48317#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48317#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:56,024 INFO L273 TraceCheckUtils]: 68: Hoare triple {48317#(<= main_~k~0 21)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48317#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:56,024 INFO L273 TraceCheckUtils]: 69: Hoare triple {48317#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {48327#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:56,025 INFO L273 TraceCheckUtils]: 70: Hoare triple {48327#(<= main_~k~0 22)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48327#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:56,025 INFO L273 TraceCheckUtils]: 71: Hoare triple {48327#(<= main_~k~0 22)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48327#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:56,028 INFO L273 TraceCheckUtils]: 72: Hoare triple {48327#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {48337#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:56,028 INFO L273 TraceCheckUtils]: 73: Hoare triple {48337#(<= main_~k~0 23)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48337#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:56,029 INFO L273 TraceCheckUtils]: 74: Hoare triple {48337#(<= main_~k~0 23)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48337#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:56,029 INFO L273 TraceCheckUtils]: 75: Hoare triple {48337#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {48347#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:56,030 INFO L273 TraceCheckUtils]: 76: Hoare triple {48347#(<= main_~k~0 24)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48347#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:56,030 INFO L273 TraceCheckUtils]: 77: Hoare triple {48347#(<= main_~k~0 24)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48347#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:56,030 INFO L273 TraceCheckUtils]: 78: Hoare triple {48347#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {48357#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:56,031 INFO L273 TraceCheckUtils]: 79: Hoare triple {48357#(<= main_~k~0 25)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48357#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:56,031 INFO L273 TraceCheckUtils]: 80: Hoare triple {48357#(<= main_~k~0 25)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48357#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:56,032 INFO L273 TraceCheckUtils]: 81: Hoare triple {48357#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {48367#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:56,032 INFO L273 TraceCheckUtils]: 82: Hoare triple {48367#(<= main_~k~0 26)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48367#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:56,033 INFO L273 TraceCheckUtils]: 83: Hoare triple {48367#(<= main_~k~0 26)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48367#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:56,033 INFO L273 TraceCheckUtils]: 84: Hoare triple {48367#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {48377#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:56,034 INFO L273 TraceCheckUtils]: 85: Hoare triple {48377#(<= main_~k~0 27)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48377#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:56,034 INFO L273 TraceCheckUtils]: 86: Hoare triple {48377#(<= main_~k~0 27)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48377#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:56,035 INFO L273 TraceCheckUtils]: 87: Hoare triple {48377#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {48387#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:56,035 INFO L273 TraceCheckUtils]: 88: Hoare triple {48387#(<= main_~k~0 28)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48387#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:56,036 INFO L273 TraceCheckUtils]: 89: Hoare triple {48387#(<= main_~k~0 28)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48387#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:56,037 INFO L273 TraceCheckUtils]: 90: Hoare triple {48387#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {48397#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:56,037 INFO L273 TraceCheckUtils]: 91: Hoare triple {48397#(<= main_~k~0 29)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48397#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:56,038 INFO L273 TraceCheckUtils]: 92: Hoare triple {48397#(<= main_~k~0 29)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48397#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:56,038 INFO L273 TraceCheckUtils]: 93: Hoare triple {48397#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {48407#(<= main_~k~0 30)} is VALID [2018-11-23 11:53:56,039 INFO L273 TraceCheckUtils]: 94: Hoare triple {48407#(<= main_~k~0 30)} assume !(~k~0 < 100000); {48063#false} is VALID [2018-11-23 11:53:56,039 INFO L273 TraceCheckUtils]: 95: Hoare triple {48063#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {48063#false} is VALID [2018-11-23 11:53:56,039 INFO L273 TraceCheckUtils]: 96: Hoare triple {48063#false} ~x~0 := 0; {48063#false} is VALID [2018-11-23 11:53:56,039 INFO L273 TraceCheckUtils]: 97: Hoare triple {48063#false} assume !(~x~0 < ~i~0); {48063#false} is VALID [2018-11-23 11:53:56,040 INFO L273 TraceCheckUtils]: 98: Hoare triple {48063#false} ~x~0 := 0; {48063#false} is VALID [2018-11-23 11:53:56,040 INFO L273 TraceCheckUtils]: 99: Hoare triple {48063#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {48063#false} is VALID [2018-11-23 11:53:56,040 INFO L256 TraceCheckUtils]: 100: Hoare triple {48063#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {48063#false} is VALID [2018-11-23 11:53:56,040 INFO L273 TraceCheckUtils]: 101: Hoare triple {48063#false} ~cond := #in~cond; {48063#false} is VALID [2018-11-23 11:53:56,040 INFO L273 TraceCheckUtils]: 102: Hoare triple {48063#false} assume !(0 == ~cond); {48063#false} is VALID [2018-11-23 11:53:56,040 INFO L273 TraceCheckUtils]: 103: Hoare triple {48063#false} assume true; {48063#false} is VALID [2018-11-23 11:53:56,041 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {48063#false} {48063#false} #136#return; {48063#false} is VALID [2018-11-23 11:53:56,041 INFO L273 TraceCheckUtils]: 105: Hoare triple {48063#false} havoc #t~mem9;havoc #t~mem10; {48063#false} is VALID [2018-11-23 11:53:56,041 INFO L273 TraceCheckUtils]: 106: Hoare triple {48063#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {48063#false} is VALID [2018-11-23 11:53:56,041 INFO L273 TraceCheckUtils]: 107: Hoare triple {48063#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {48063#false} is VALID [2018-11-23 11:53:56,041 INFO L256 TraceCheckUtils]: 108: Hoare triple {48063#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {48063#false} is VALID [2018-11-23 11:53:56,041 INFO L273 TraceCheckUtils]: 109: Hoare triple {48063#false} ~cond := #in~cond; {48063#false} is VALID [2018-11-23 11:53:56,042 INFO L273 TraceCheckUtils]: 110: Hoare triple {48063#false} assume 0 == ~cond; {48063#false} is VALID [2018-11-23 11:53:56,042 INFO L273 TraceCheckUtils]: 111: Hoare triple {48063#false} assume !false; {48063#false} is VALID [2018-11-23 11:53:56,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1251 backedges. 0 proven. 1247 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:53:56,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:56,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 64 [2018-11-23 11:53:56,071 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 112 [2018-11-23 11:53:56,072 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:56,072 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 64 states. [2018-11-23 11:53:56,306 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-23 11:53:56,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-11-23 11:53:56,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-11-23 11:53:56,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1521, Invalid=2511, Unknown=0, NotChecked=0, Total=4032 [2018-11-23 11:53:56,308 INFO L87 Difference]: Start difference. First operand 407 states and 594 transitions. Second operand 64 states. [2018-11-23 11:53:57,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:57,768 INFO L93 Difference]: Finished difference Result 648 states and 971 transitions. [2018-11-23 11:53:57,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-23 11:53:57,768 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 112 [2018-11-23 11:53:57,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:57,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 11:53:57,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 227 transitions. [2018-11-23 11:53:57,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 11:53:57,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 227 transitions. [2018-11-23 11:53:57,772 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 227 transitions. [2018-11-23 11:53:57,993 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 227 edges. 227 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:58,002 INFO L225 Difference]: With dead ends: 648 [2018-11-23 11:53:58,003 INFO L226 Difference]: Without dead ends: 422 [2018-11-23 11:53:58,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1396 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1521, Invalid=2511, Unknown=0, NotChecked=0, Total=4032 [2018-11-23 11:53:58,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2018-11-23 11:53:59,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 413. [2018-11-23 11:53:59,118 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:59,118 INFO L82 GeneralOperation]: Start isEquivalent. First operand 422 states. Second operand 413 states. [2018-11-23 11:53:59,118 INFO L74 IsIncluded]: Start isIncluded. First operand 422 states. Second operand 413 states. [2018-11-23 11:53:59,118 INFO L87 Difference]: Start difference. First operand 422 states. Second operand 413 states. [2018-11-23 11:53:59,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:59,128 INFO L93 Difference]: Finished difference Result 422 states and 615 transitions. [2018-11-23 11:53:59,128 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 615 transitions. [2018-11-23 11:53:59,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:59,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:59,129 INFO L74 IsIncluded]: Start isIncluded. First operand 413 states. Second operand 422 states. [2018-11-23 11:53:59,129 INFO L87 Difference]: Start difference. First operand 413 states. Second operand 422 states. [2018-11-23 11:53:59,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:59,138 INFO L93 Difference]: Finished difference Result 422 states and 615 transitions. [2018-11-23 11:53:59,138 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 615 transitions. [2018-11-23 11:53:59,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:59,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:59,139 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:59,139 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:59,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-11-23 11:53:59,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 602 transitions. [2018-11-23 11:53:59,148 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 602 transitions. Word has length 112 [2018-11-23 11:53:59,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:59,148 INFO L480 AbstractCegarLoop]: Abstraction has 413 states and 602 transitions. [2018-11-23 11:53:59,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-11-23 11:53:59,148 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 602 transitions. [2018-11-23 11:53:59,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-23 11:53:59,149 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:59,149 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:53:59,149 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:59,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:59,149 INFO L82 PathProgramCache]: Analyzing trace with hash -568883156, now seen corresponding path program 26 times [2018-11-23 11:53:59,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:59,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:59,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:59,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:53:59,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:59,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:00,375 INFO L256 TraceCheckUtils]: 0: Hoare triple {50737#true} call ULTIMATE.init(); {50737#true} is VALID [2018-11-23 11:54:00,375 INFO L273 TraceCheckUtils]: 1: Hoare triple {50737#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {50737#true} is VALID [2018-11-23 11:54:00,375 INFO L273 TraceCheckUtils]: 2: Hoare triple {50737#true} assume true; {50737#true} is VALID [2018-11-23 11:54:00,375 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {50737#true} {50737#true} #130#return; {50737#true} is VALID [2018-11-23 11:54:00,375 INFO L256 TraceCheckUtils]: 4: Hoare triple {50737#true} call #t~ret15 := main(); {50737#true} is VALID [2018-11-23 11:54:00,376 INFO L273 TraceCheckUtils]: 5: Hoare triple {50737#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {50739#(= main_~i~0 0)} is VALID [2018-11-23 11:54:00,376 INFO L273 TraceCheckUtils]: 6: Hoare triple {50739#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {50740#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,377 INFO L273 TraceCheckUtils]: 7: Hoare triple {50740#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50740#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,377 INFO L273 TraceCheckUtils]: 8: Hoare triple {50740#(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; {50740#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,378 INFO L273 TraceCheckUtils]: 9: Hoare triple {50740#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {50741#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,378 INFO L273 TraceCheckUtils]: 10: Hoare triple {50741#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50741#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,378 INFO L273 TraceCheckUtils]: 11: Hoare triple {50741#(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; {50741#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,379 INFO L273 TraceCheckUtils]: 12: Hoare triple {50741#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {50742#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,380 INFO L273 TraceCheckUtils]: 13: Hoare triple {50742#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50742#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,380 INFO L273 TraceCheckUtils]: 14: Hoare triple {50742#(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; {50742#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,381 INFO L273 TraceCheckUtils]: 15: Hoare triple {50742#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {50743#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,382 INFO L273 TraceCheckUtils]: 16: Hoare triple {50743#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50743#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,382 INFO L273 TraceCheckUtils]: 17: Hoare triple {50743#(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; {50743#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,383 INFO L273 TraceCheckUtils]: 18: Hoare triple {50743#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {50744#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,384 INFO L273 TraceCheckUtils]: 19: Hoare triple {50744#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50744#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,385 INFO L273 TraceCheckUtils]: 20: Hoare triple {50744#(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; {50744#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,386 INFO L273 TraceCheckUtils]: 21: Hoare triple {50744#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {50745#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,386 INFO L273 TraceCheckUtils]: 22: Hoare triple {50745#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50745#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,387 INFO L273 TraceCheckUtils]: 23: Hoare triple {50745#(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; {50745#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,388 INFO L273 TraceCheckUtils]: 24: Hoare triple {50745#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {50746#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,389 INFO L273 TraceCheckUtils]: 25: Hoare triple {50746#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50746#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,389 INFO L273 TraceCheckUtils]: 26: Hoare triple {50746#(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; {50746#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,390 INFO L273 TraceCheckUtils]: 27: Hoare triple {50746#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {50747#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,391 INFO L273 TraceCheckUtils]: 28: Hoare triple {50747#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50747#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,392 INFO L273 TraceCheckUtils]: 29: Hoare triple {50747#(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; {50747#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,392 INFO L273 TraceCheckUtils]: 30: Hoare triple {50747#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {50748#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,393 INFO L273 TraceCheckUtils]: 31: Hoare triple {50748#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50748#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,394 INFO L273 TraceCheckUtils]: 32: Hoare triple {50748#(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; {50748#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,395 INFO L273 TraceCheckUtils]: 33: Hoare triple {50748#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {50749#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,395 INFO L273 TraceCheckUtils]: 34: Hoare triple {50749#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50749#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,396 INFO L273 TraceCheckUtils]: 35: Hoare triple {50749#(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; {50749#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,397 INFO L273 TraceCheckUtils]: 36: Hoare triple {50749#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {50750#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,398 INFO L273 TraceCheckUtils]: 37: Hoare triple {50750#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50750#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,398 INFO L273 TraceCheckUtils]: 38: Hoare triple {50750#(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; {50750#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,399 INFO L273 TraceCheckUtils]: 39: Hoare triple {50750#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {50751#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,400 INFO L273 TraceCheckUtils]: 40: Hoare triple {50751#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50751#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,401 INFO L273 TraceCheckUtils]: 41: Hoare triple {50751#(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; {50751#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,401 INFO L273 TraceCheckUtils]: 42: Hoare triple {50751#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {50752#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,402 INFO L273 TraceCheckUtils]: 43: Hoare triple {50752#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50752#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,403 INFO L273 TraceCheckUtils]: 44: Hoare triple {50752#(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; {50752#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,404 INFO L273 TraceCheckUtils]: 45: Hoare triple {50752#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {50753#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,404 INFO L273 TraceCheckUtils]: 46: Hoare triple {50753#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50753#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,405 INFO L273 TraceCheckUtils]: 47: Hoare triple {50753#(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; {50753#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,406 INFO L273 TraceCheckUtils]: 48: Hoare triple {50753#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {50754#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,407 INFO L273 TraceCheckUtils]: 49: Hoare triple {50754#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50754#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,407 INFO L273 TraceCheckUtils]: 50: Hoare triple {50754#(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; {50754#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,408 INFO L273 TraceCheckUtils]: 51: Hoare triple {50754#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {50755#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,409 INFO L273 TraceCheckUtils]: 52: Hoare triple {50755#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50755#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,410 INFO L273 TraceCheckUtils]: 53: Hoare triple {50755#(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; {50755#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,411 INFO L273 TraceCheckUtils]: 54: Hoare triple {50755#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {50756#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:54:00,411 INFO L273 TraceCheckUtils]: 55: Hoare triple {50756#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50756#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:54:00,412 INFO L273 TraceCheckUtils]: 56: Hoare triple {50756#(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; {50756#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:54:00,413 INFO L273 TraceCheckUtils]: 57: Hoare triple {50756#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} ~k~0 := 1 + ~k~0; {50757#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,414 INFO L273 TraceCheckUtils]: 58: Hoare triple {50757#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50757#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,414 INFO L273 TraceCheckUtils]: 59: Hoare triple {50757#(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; {50757#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,415 INFO L273 TraceCheckUtils]: 60: Hoare triple {50757#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {50758#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,416 INFO L273 TraceCheckUtils]: 61: Hoare triple {50758#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50758#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,417 INFO L273 TraceCheckUtils]: 62: Hoare triple {50758#(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; {50758#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,417 INFO L273 TraceCheckUtils]: 63: Hoare triple {50758#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {50759#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,418 INFO L273 TraceCheckUtils]: 64: Hoare triple {50759#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50759#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,419 INFO L273 TraceCheckUtils]: 65: Hoare triple {50759#(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; {50759#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,420 INFO L273 TraceCheckUtils]: 66: Hoare triple {50759#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {50760#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,421 INFO L273 TraceCheckUtils]: 67: Hoare triple {50760#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50760#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,421 INFO L273 TraceCheckUtils]: 68: Hoare triple {50760#(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; {50760#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,422 INFO L273 TraceCheckUtils]: 69: Hoare triple {50760#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {50761#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,423 INFO L273 TraceCheckUtils]: 70: Hoare triple {50761#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50761#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,424 INFO L273 TraceCheckUtils]: 71: Hoare triple {50761#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50761#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,424 INFO L273 TraceCheckUtils]: 72: Hoare triple {50761#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {50762#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,425 INFO L273 TraceCheckUtils]: 73: Hoare triple {50762#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50762#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,426 INFO L273 TraceCheckUtils]: 74: Hoare triple {50762#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50762#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,427 INFO L273 TraceCheckUtils]: 75: Hoare triple {50762#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {50763#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,427 INFO L273 TraceCheckUtils]: 76: Hoare triple {50763#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50763#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,428 INFO L273 TraceCheckUtils]: 77: Hoare triple {50763#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50763#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,429 INFO L273 TraceCheckUtils]: 78: Hoare triple {50763#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {50764#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,430 INFO L273 TraceCheckUtils]: 79: Hoare triple {50764#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50764#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,430 INFO L273 TraceCheckUtils]: 80: Hoare triple {50764#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50764#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,431 INFO L273 TraceCheckUtils]: 81: Hoare triple {50764#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {50765#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,451 INFO L273 TraceCheckUtils]: 82: Hoare triple {50765#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50765#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,451 INFO L273 TraceCheckUtils]: 83: Hoare triple {50765#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50765#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,452 INFO L273 TraceCheckUtils]: 84: Hoare triple {50765#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {50766#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,452 INFO L273 TraceCheckUtils]: 85: Hoare triple {50766#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50766#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,453 INFO L273 TraceCheckUtils]: 86: Hoare triple {50766#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50766#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,453 INFO L273 TraceCheckUtils]: 87: Hoare triple {50766#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {50767#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,454 INFO L273 TraceCheckUtils]: 88: Hoare triple {50767#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50767#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,455 INFO L273 TraceCheckUtils]: 89: Hoare triple {50767#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50767#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,456 INFO L273 TraceCheckUtils]: 90: Hoare triple {50767#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {50768#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,457 INFO L273 TraceCheckUtils]: 91: Hoare triple {50768#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50768#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,458 INFO L273 TraceCheckUtils]: 92: Hoare triple {50768#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50768#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,459 INFO L273 TraceCheckUtils]: 93: Hoare triple {50768#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {50769#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,459 INFO L273 TraceCheckUtils]: 94: Hoare triple {50769#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50769#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,460 INFO L273 TraceCheckUtils]: 95: Hoare triple {50769#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50769#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,461 INFO L273 TraceCheckUtils]: 96: Hoare triple {50769#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {50770#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:00,462 INFO L273 TraceCheckUtils]: 97: Hoare triple {50770#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} assume !(~k~0 < 100000); {50738#false} is VALID [2018-11-23 11:54:00,462 INFO L273 TraceCheckUtils]: 98: Hoare triple {50738#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50738#false} is VALID [2018-11-23 11:54:00,462 INFO L273 TraceCheckUtils]: 99: Hoare triple {50738#false} ~x~0 := 0; {50738#false} is VALID [2018-11-23 11:54:00,462 INFO L273 TraceCheckUtils]: 100: Hoare triple {50738#false} assume !(~x~0 < ~i~0); {50738#false} is VALID [2018-11-23 11:54:00,462 INFO L273 TraceCheckUtils]: 101: Hoare triple {50738#false} ~x~0 := 0; {50738#false} is VALID [2018-11-23 11:54:00,463 INFO L273 TraceCheckUtils]: 102: Hoare triple {50738#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50738#false} is VALID [2018-11-23 11:54:00,463 INFO L256 TraceCheckUtils]: 103: Hoare triple {50738#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {50737#true} is VALID [2018-11-23 11:54:00,463 INFO L273 TraceCheckUtils]: 104: Hoare triple {50737#true} ~cond := #in~cond; {50737#true} is VALID [2018-11-23 11:54:00,463 INFO L273 TraceCheckUtils]: 105: Hoare triple {50737#true} assume !(0 == ~cond); {50737#true} is VALID [2018-11-23 11:54:00,463 INFO L273 TraceCheckUtils]: 106: Hoare triple {50737#true} assume true; {50737#true} is VALID [2018-11-23 11:54:00,464 INFO L268 TraceCheckUtils]: 107: Hoare quadruple {50737#true} {50738#false} #136#return; {50738#false} is VALID [2018-11-23 11:54:00,464 INFO L273 TraceCheckUtils]: 108: Hoare triple {50738#false} havoc #t~mem9;havoc #t~mem10; {50738#false} is VALID [2018-11-23 11:54:00,464 INFO L273 TraceCheckUtils]: 109: Hoare triple {50738#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {50738#false} is VALID [2018-11-23 11:54:00,464 INFO L273 TraceCheckUtils]: 110: Hoare triple {50738#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50738#false} is VALID [2018-11-23 11:54:00,464 INFO L256 TraceCheckUtils]: 111: Hoare triple {50738#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {50738#false} is VALID [2018-11-23 11:54:00,464 INFO L273 TraceCheckUtils]: 112: Hoare triple {50738#false} ~cond := #in~cond; {50738#false} is VALID [2018-11-23 11:54:00,465 INFO L273 TraceCheckUtils]: 113: Hoare triple {50738#false} assume 0 == ~cond; {50738#false} is VALID [2018-11-23 11:54:00,465 INFO L273 TraceCheckUtils]: 114: Hoare triple {50738#false} assume !false; {50738#false} is VALID [2018-11-23 11:54:00,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1339 backedges. 2 proven. 1335 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:54:00,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:00,486 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:54:00,495 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:54:00,555 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:54:00,555 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:00,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:00,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:01,690 INFO L256 TraceCheckUtils]: 0: Hoare triple {50737#true} call ULTIMATE.init(); {50737#true} is VALID [2018-11-23 11:54:01,691 INFO L273 TraceCheckUtils]: 1: Hoare triple {50737#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {50737#true} is VALID [2018-11-23 11:54:01,691 INFO L273 TraceCheckUtils]: 2: Hoare triple {50737#true} assume true; {50737#true} is VALID [2018-11-23 11:54:01,691 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {50737#true} {50737#true} #130#return; {50737#true} is VALID [2018-11-23 11:54:01,692 INFO L256 TraceCheckUtils]: 4: Hoare triple {50737#true} call #t~ret15 := main(); {50737#true} is VALID [2018-11-23 11:54:01,692 INFO L273 TraceCheckUtils]: 5: Hoare triple {50737#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {50789#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:01,693 INFO L273 TraceCheckUtils]: 6: Hoare triple {50789#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {50793#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:01,693 INFO L273 TraceCheckUtils]: 7: Hoare triple {50793#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50793#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:01,694 INFO L273 TraceCheckUtils]: 8: Hoare triple {50793#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50793#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:01,694 INFO L273 TraceCheckUtils]: 9: Hoare triple {50793#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {50803#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:01,694 INFO L273 TraceCheckUtils]: 10: Hoare triple {50803#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50803#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:01,695 INFO L273 TraceCheckUtils]: 11: Hoare triple {50803#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50803#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:01,695 INFO L273 TraceCheckUtils]: 12: Hoare triple {50803#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {50813#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:01,696 INFO L273 TraceCheckUtils]: 13: Hoare triple {50813#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50813#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:01,696 INFO L273 TraceCheckUtils]: 14: Hoare triple {50813#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50813#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:01,697 INFO L273 TraceCheckUtils]: 15: Hoare triple {50813#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {50823#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:01,697 INFO L273 TraceCheckUtils]: 16: Hoare triple {50823#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50823#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:01,698 INFO L273 TraceCheckUtils]: 17: Hoare triple {50823#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50823#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:01,699 INFO L273 TraceCheckUtils]: 18: Hoare triple {50823#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {50833#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:01,699 INFO L273 TraceCheckUtils]: 19: Hoare triple {50833#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50833#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:01,700 INFO L273 TraceCheckUtils]: 20: Hoare triple {50833#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50833#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:01,700 INFO L273 TraceCheckUtils]: 21: Hoare triple {50833#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {50843#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:01,701 INFO L273 TraceCheckUtils]: 22: Hoare triple {50843#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50843#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:01,701 INFO L273 TraceCheckUtils]: 23: Hoare triple {50843#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50843#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:01,702 INFO L273 TraceCheckUtils]: 24: Hoare triple {50843#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {50853#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:01,702 INFO L273 TraceCheckUtils]: 25: Hoare triple {50853#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50853#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:01,703 INFO L273 TraceCheckUtils]: 26: Hoare triple {50853#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50853#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:01,704 INFO L273 TraceCheckUtils]: 27: Hoare triple {50853#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {50863#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:01,704 INFO L273 TraceCheckUtils]: 28: Hoare triple {50863#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50863#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:01,704 INFO L273 TraceCheckUtils]: 29: Hoare triple {50863#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50863#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:01,705 INFO L273 TraceCheckUtils]: 30: Hoare triple {50863#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {50873#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:01,706 INFO L273 TraceCheckUtils]: 31: Hoare triple {50873#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50873#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:01,706 INFO L273 TraceCheckUtils]: 32: Hoare triple {50873#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50873#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:01,707 INFO L273 TraceCheckUtils]: 33: Hoare triple {50873#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {50883#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:01,707 INFO L273 TraceCheckUtils]: 34: Hoare triple {50883#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50883#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:01,708 INFO L273 TraceCheckUtils]: 35: Hoare triple {50883#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50883#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:01,708 INFO L273 TraceCheckUtils]: 36: Hoare triple {50883#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {50893#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:01,709 INFO L273 TraceCheckUtils]: 37: Hoare triple {50893#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50893#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:01,709 INFO L273 TraceCheckUtils]: 38: Hoare triple {50893#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50893#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:01,710 INFO L273 TraceCheckUtils]: 39: Hoare triple {50893#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {50903#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:01,711 INFO L273 TraceCheckUtils]: 40: Hoare triple {50903#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50903#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:01,711 INFO L273 TraceCheckUtils]: 41: Hoare triple {50903#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50903#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:01,712 INFO L273 TraceCheckUtils]: 42: Hoare triple {50903#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {50913#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:01,712 INFO L273 TraceCheckUtils]: 43: Hoare triple {50913#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50913#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:01,713 INFO L273 TraceCheckUtils]: 44: Hoare triple {50913#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50913#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:01,713 INFO L273 TraceCheckUtils]: 45: Hoare triple {50913#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {50923#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:01,714 INFO L273 TraceCheckUtils]: 46: Hoare triple {50923#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50923#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:01,714 INFO L273 TraceCheckUtils]: 47: Hoare triple {50923#(<= main_~k~0 14)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50923#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:01,715 INFO L273 TraceCheckUtils]: 48: Hoare triple {50923#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {50933#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:01,715 INFO L273 TraceCheckUtils]: 49: Hoare triple {50933#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50933#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:01,716 INFO L273 TraceCheckUtils]: 50: Hoare triple {50933#(<= main_~k~0 15)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50933#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:01,717 INFO L273 TraceCheckUtils]: 51: Hoare triple {50933#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {50943#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:01,717 INFO L273 TraceCheckUtils]: 52: Hoare triple {50943#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50943#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:01,718 INFO L273 TraceCheckUtils]: 53: Hoare triple {50943#(<= main_~k~0 16)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50943#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:01,718 INFO L273 TraceCheckUtils]: 54: Hoare triple {50943#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {50953#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:01,719 INFO L273 TraceCheckUtils]: 55: Hoare triple {50953#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50953#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:01,719 INFO L273 TraceCheckUtils]: 56: Hoare triple {50953#(<= main_~k~0 17)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50953#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:01,720 INFO L273 TraceCheckUtils]: 57: Hoare triple {50953#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {50963#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:01,720 INFO L273 TraceCheckUtils]: 58: Hoare triple {50963#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50963#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:01,721 INFO L273 TraceCheckUtils]: 59: Hoare triple {50963#(<= main_~k~0 18)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50963#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:01,721 INFO L273 TraceCheckUtils]: 60: Hoare triple {50963#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {50973#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:01,722 INFO L273 TraceCheckUtils]: 61: Hoare triple {50973#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50973#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:01,722 INFO L273 TraceCheckUtils]: 62: Hoare triple {50973#(<= main_~k~0 19)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50973#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:01,723 INFO L273 TraceCheckUtils]: 63: Hoare triple {50973#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {50983#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:01,724 INFO L273 TraceCheckUtils]: 64: Hoare triple {50983#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50983#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:01,724 INFO L273 TraceCheckUtils]: 65: Hoare triple {50983#(<= main_~k~0 20)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50983#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:01,725 INFO L273 TraceCheckUtils]: 66: Hoare triple {50983#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {50993#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:01,725 INFO L273 TraceCheckUtils]: 67: Hoare triple {50993#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50993#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:01,726 INFO L273 TraceCheckUtils]: 68: Hoare triple {50993#(<= main_~k~0 21)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50993#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:01,726 INFO L273 TraceCheckUtils]: 69: Hoare triple {50993#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {51003#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:01,727 INFO L273 TraceCheckUtils]: 70: Hoare triple {51003#(<= main_~k~0 22)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {51003#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:01,727 INFO L273 TraceCheckUtils]: 71: Hoare triple {51003#(<= main_~k~0 22)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {51003#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:01,728 INFO L273 TraceCheckUtils]: 72: Hoare triple {51003#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {51013#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:01,728 INFO L273 TraceCheckUtils]: 73: Hoare triple {51013#(<= main_~k~0 23)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {51013#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:01,729 INFO L273 TraceCheckUtils]: 74: Hoare triple {51013#(<= main_~k~0 23)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {51013#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:01,730 INFO L273 TraceCheckUtils]: 75: Hoare triple {51013#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {51023#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:01,730 INFO L273 TraceCheckUtils]: 76: Hoare triple {51023#(<= main_~k~0 24)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {51023#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:01,730 INFO L273 TraceCheckUtils]: 77: Hoare triple {51023#(<= main_~k~0 24)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {51023#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:01,731 INFO L273 TraceCheckUtils]: 78: Hoare triple {51023#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {51033#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:01,732 INFO L273 TraceCheckUtils]: 79: Hoare triple {51033#(<= main_~k~0 25)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {51033#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:01,732 INFO L273 TraceCheckUtils]: 80: Hoare triple {51033#(<= main_~k~0 25)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {51033#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:01,733 INFO L273 TraceCheckUtils]: 81: Hoare triple {51033#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {51043#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:01,733 INFO L273 TraceCheckUtils]: 82: Hoare triple {51043#(<= main_~k~0 26)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {51043#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:01,734 INFO L273 TraceCheckUtils]: 83: Hoare triple {51043#(<= main_~k~0 26)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {51043#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:01,734 INFO L273 TraceCheckUtils]: 84: Hoare triple {51043#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {51053#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:01,735 INFO L273 TraceCheckUtils]: 85: Hoare triple {51053#(<= main_~k~0 27)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {51053#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:01,735 INFO L273 TraceCheckUtils]: 86: Hoare triple {51053#(<= main_~k~0 27)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {51053#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:01,736 INFO L273 TraceCheckUtils]: 87: Hoare triple {51053#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {51063#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:01,737 INFO L273 TraceCheckUtils]: 88: Hoare triple {51063#(<= main_~k~0 28)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {51063#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:01,737 INFO L273 TraceCheckUtils]: 89: Hoare triple {51063#(<= main_~k~0 28)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {51063#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:01,738 INFO L273 TraceCheckUtils]: 90: Hoare triple {51063#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {51073#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:01,738 INFO L273 TraceCheckUtils]: 91: Hoare triple {51073#(<= main_~k~0 29)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {51073#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:01,739 INFO L273 TraceCheckUtils]: 92: Hoare triple {51073#(<= main_~k~0 29)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {51073#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:01,739 INFO L273 TraceCheckUtils]: 93: Hoare triple {51073#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {51083#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:01,740 INFO L273 TraceCheckUtils]: 94: Hoare triple {51083#(<= main_~k~0 30)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {51083#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:01,740 INFO L273 TraceCheckUtils]: 95: Hoare triple {51083#(<= main_~k~0 30)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {51083#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:01,741 INFO L273 TraceCheckUtils]: 96: Hoare triple {51083#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {51093#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:01,742 INFO L273 TraceCheckUtils]: 97: Hoare triple {51093#(<= main_~k~0 31)} assume !(~k~0 < 100000); {50738#false} is VALID [2018-11-23 11:54:01,742 INFO L273 TraceCheckUtils]: 98: Hoare triple {50738#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50738#false} is VALID [2018-11-23 11:54:01,742 INFO L273 TraceCheckUtils]: 99: Hoare triple {50738#false} ~x~0 := 0; {50738#false} is VALID [2018-11-23 11:54:01,742 INFO L273 TraceCheckUtils]: 100: Hoare triple {50738#false} assume !(~x~0 < ~i~0); {50738#false} is VALID [2018-11-23 11:54:01,742 INFO L273 TraceCheckUtils]: 101: Hoare triple {50738#false} ~x~0 := 0; {50738#false} is VALID [2018-11-23 11:54:01,742 INFO L273 TraceCheckUtils]: 102: Hoare triple {50738#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50738#false} is VALID [2018-11-23 11:54:01,743 INFO L256 TraceCheckUtils]: 103: Hoare triple {50738#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {50738#false} is VALID [2018-11-23 11:54:01,743 INFO L273 TraceCheckUtils]: 104: Hoare triple {50738#false} ~cond := #in~cond; {50738#false} is VALID [2018-11-23 11:54:01,743 INFO L273 TraceCheckUtils]: 105: Hoare triple {50738#false} assume !(0 == ~cond); {50738#false} is VALID [2018-11-23 11:54:01,743 INFO L273 TraceCheckUtils]: 106: Hoare triple {50738#false} assume true; {50738#false} is VALID [2018-11-23 11:54:01,743 INFO L268 TraceCheckUtils]: 107: Hoare quadruple {50738#false} {50738#false} #136#return; {50738#false} is VALID [2018-11-23 11:54:01,743 INFO L273 TraceCheckUtils]: 108: Hoare triple {50738#false} havoc #t~mem9;havoc #t~mem10; {50738#false} is VALID [2018-11-23 11:54:01,744 INFO L273 TraceCheckUtils]: 109: Hoare triple {50738#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {50738#false} is VALID [2018-11-23 11:54:01,744 INFO L273 TraceCheckUtils]: 110: Hoare triple {50738#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50738#false} is VALID [2018-11-23 11:54:01,744 INFO L256 TraceCheckUtils]: 111: Hoare triple {50738#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {50738#false} is VALID [2018-11-23 11:54:01,744 INFO L273 TraceCheckUtils]: 112: Hoare triple {50738#false} ~cond := #in~cond; {50738#false} is VALID [2018-11-23 11:54:01,744 INFO L273 TraceCheckUtils]: 113: Hoare triple {50738#false} assume 0 == ~cond; {50738#false} is VALID [2018-11-23 11:54:01,745 INFO L273 TraceCheckUtils]: 114: Hoare triple {50738#false} assume !false; {50738#false} is VALID [2018-11-23 11:54:01,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1339 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:54:01,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:01,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 66 [2018-11-23 11:54:01,775 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 115 [2018-11-23 11:54:01,775 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:01,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 66 states. [2018-11-23 11:54:01,980 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 210 edges. 210 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:01,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-11-23 11:54:01,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-11-23 11:54:01,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1618, Invalid=2672, Unknown=0, NotChecked=0, Total=4290 [2018-11-23 11:54:01,982 INFO L87 Difference]: Start difference. First operand 413 states and 602 transitions. Second operand 66 states. [2018-11-23 11:54:03,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:03,314 INFO L93 Difference]: Finished difference Result 654 states and 979 transitions. [2018-11-23 11:54:03,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 11:54:03,314 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 115 [2018-11-23 11:54:03,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:03,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 11:54:03,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 231 transitions. [2018-11-23 11:54:03,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 11:54:03,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 231 transitions. [2018-11-23 11:54:03,317 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 231 transitions. [2018-11-23 11:54:03,533 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 231 edges. 231 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:03,543 INFO L225 Difference]: With dead ends: 654 [2018-11-23 11:54:03,543 INFO L226 Difference]: Without dead ends: 428 [2018-11-23 11:54:03,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1489 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1618, Invalid=2672, Unknown=0, NotChecked=0, Total=4290 [2018-11-23 11:54:03,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-11-23 11:54:04,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 419. [2018-11-23 11:54:04,123 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:04,123 INFO L82 GeneralOperation]: Start isEquivalent. First operand 428 states. Second operand 419 states. [2018-11-23 11:54:04,123 INFO L74 IsIncluded]: Start isIncluded. First operand 428 states. Second operand 419 states. [2018-11-23 11:54:04,123 INFO L87 Difference]: Start difference. First operand 428 states. Second operand 419 states. [2018-11-23 11:54:04,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:04,133 INFO L93 Difference]: Finished difference Result 428 states and 623 transitions. [2018-11-23 11:54:04,133 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 623 transitions. [2018-11-23 11:54:04,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:04,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:04,134 INFO L74 IsIncluded]: Start isIncluded. First operand 419 states. Second operand 428 states. [2018-11-23 11:54:04,134 INFO L87 Difference]: Start difference. First operand 419 states. Second operand 428 states. [2018-11-23 11:54:04,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:04,143 INFO L93 Difference]: Finished difference Result 428 states and 623 transitions. [2018-11-23 11:54:04,143 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 623 transitions. [2018-11-23 11:54:04,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:04,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:04,144 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:04,144 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:04,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-11-23 11:54:04,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 610 transitions. [2018-11-23 11:54:04,154 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 610 transitions. Word has length 115 [2018-11-23 11:54:04,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:04,154 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 610 transitions. [2018-11-23 11:54:04,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-11-23 11:54:04,154 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 610 transitions. [2018-11-23 11:54:04,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-23 11:54:04,155 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:04,155 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 31, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:04,155 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:04,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:04,156 INFO L82 PathProgramCache]: Analyzing trace with hash -820914991, now seen corresponding path program 27 times [2018-11-23 11:54:04,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:04,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:04,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:04,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:04,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:04,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:05,339 INFO L256 TraceCheckUtils]: 0: Hoare triple {53451#true} call ULTIMATE.init(); {53451#true} is VALID [2018-11-23 11:54:05,339 INFO L273 TraceCheckUtils]: 1: Hoare triple {53451#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {53451#true} is VALID [2018-11-23 11:54:05,339 INFO L273 TraceCheckUtils]: 2: Hoare triple {53451#true} assume true; {53451#true} is VALID [2018-11-23 11:54:05,340 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {53451#true} {53451#true} #130#return; {53451#true} is VALID [2018-11-23 11:54:05,340 INFO L256 TraceCheckUtils]: 4: Hoare triple {53451#true} call #t~ret15 := main(); {53451#true} is VALID [2018-11-23 11:54:05,340 INFO L273 TraceCheckUtils]: 5: Hoare triple {53451#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {53453#(= main_~i~0 0)} is VALID [2018-11-23 11:54:05,340 INFO L273 TraceCheckUtils]: 6: Hoare triple {53453#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {53454#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,341 INFO L273 TraceCheckUtils]: 7: Hoare triple {53454#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53454#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,341 INFO L273 TraceCheckUtils]: 8: Hoare triple {53454#(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; {53454#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,342 INFO L273 TraceCheckUtils]: 9: Hoare triple {53454#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53455#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,343 INFO L273 TraceCheckUtils]: 10: Hoare triple {53455#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53455#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,343 INFO L273 TraceCheckUtils]: 11: Hoare triple {53455#(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; {53455#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,344 INFO L273 TraceCheckUtils]: 12: Hoare triple {53455#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53456#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,345 INFO L273 TraceCheckUtils]: 13: Hoare triple {53456#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53456#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,346 INFO L273 TraceCheckUtils]: 14: Hoare triple {53456#(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; {53456#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,346 INFO L273 TraceCheckUtils]: 15: Hoare triple {53456#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53457#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,347 INFO L273 TraceCheckUtils]: 16: Hoare triple {53457#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53457#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,348 INFO L273 TraceCheckUtils]: 17: Hoare triple {53457#(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; {53457#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,349 INFO L273 TraceCheckUtils]: 18: Hoare triple {53457#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53458#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,349 INFO L273 TraceCheckUtils]: 19: Hoare triple {53458#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53458#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,350 INFO L273 TraceCheckUtils]: 20: Hoare triple {53458#(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; {53458#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,351 INFO L273 TraceCheckUtils]: 21: Hoare triple {53458#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53459#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,352 INFO L273 TraceCheckUtils]: 22: Hoare triple {53459#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53459#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,352 INFO L273 TraceCheckUtils]: 23: Hoare triple {53459#(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; {53459#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,353 INFO L273 TraceCheckUtils]: 24: Hoare triple {53459#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53460#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,354 INFO L273 TraceCheckUtils]: 25: Hoare triple {53460#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53460#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,355 INFO L273 TraceCheckUtils]: 26: Hoare triple {53460#(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; {53460#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,355 INFO L273 TraceCheckUtils]: 27: Hoare triple {53460#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53461#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,356 INFO L273 TraceCheckUtils]: 28: Hoare triple {53461#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53461#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,357 INFO L273 TraceCheckUtils]: 29: Hoare triple {53461#(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; {53461#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,358 INFO L273 TraceCheckUtils]: 30: Hoare triple {53461#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53462#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,358 INFO L273 TraceCheckUtils]: 31: Hoare triple {53462#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53462#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,359 INFO L273 TraceCheckUtils]: 32: Hoare triple {53462#(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; {53462#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,360 INFO L273 TraceCheckUtils]: 33: Hoare triple {53462#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53463#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,361 INFO L273 TraceCheckUtils]: 34: Hoare triple {53463#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53463#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,361 INFO L273 TraceCheckUtils]: 35: Hoare triple {53463#(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; {53463#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,362 INFO L273 TraceCheckUtils]: 36: Hoare triple {53463#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53464#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,363 INFO L273 TraceCheckUtils]: 37: Hoare triple {53464#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53464#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,364 INFO L273 TraceCheckUtils]: 38: Hoare triple {53464#(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; {53464#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,365 INFO L273 TraceCheckUtils]: 39: Hoare triple {53464#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53465#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,366 INFO L273 TraceCheckUtils]: 40: Hoare triple {53465#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53465#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,366 INFO L273 TraceCheckUtils]: 41: Hoare triple {53465#(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; {53465#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,367 INFO L273 TraceCheckUtils]: 42: Hoare triple {53465#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53466#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,368 INFO L273 TraceCheckUtils]: 43: Hoare triple {53466#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53466#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,368 INFO L273 TraceCheckUtils]: 44: Hoare triple {53466#(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; {53466#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,369 INFO L273 TraceCheckUtils]: 45: Hoare triple {53466#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53467#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,370 INFO L273 TraceCheckUtils]: 46: Hoare triple {53467#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53467#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,371 INFO L273 TraceCheckUtils]: 47: Hoare triple {53467#(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; {53467#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,371 INFO L273 TraceCheckUtils]: 48: Hoare triple {53467#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53468#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,372 INFO L273 TraceCheckUtils]: 49: Hoare triple {53468#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53468#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,373 INFO L273 TraceCheckUtils]: 50: Hoare triple {53468#(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; {53468#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,374 INFO L273 TraceCheckUtils]: 51: Hoare triple {53468#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53469#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,374 INFO L273 TraceCheckUtils]: 52: Hoare triple {53469#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53469#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,375 INFO L273 TraceCheckUtils]: 53: Hoare triple {53469#(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; {53469#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,376 INFO L273 TraceCheckUtils]: 54: Hoare triple {53469#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53470#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:54:05,377 INFO L273 TraceCheckUtils]: 55: Hoare triple {53470#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53470#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:54:05,377 INFO L273 TraceCheckUtils]: 56: Hoare triple {53470#(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; {53470#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:54:05,378 INFO L273 TraceCheckUtils]: 57: Hoare triple {53470#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} ~k~0 := 1 + ~k~0; {53471#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,379 INFO L273 TraceCheckUtils]: 58: Hoare triple {53471#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53471#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,380 INFO L273 TraceCheckUtils]: 59: Hoare triple {53471#(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; {53471#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,380 INFO L273 TraceCheckUtils]: 60: Hoare triple {53471#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53472#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,381 INFO L273 TraceCheckUtils]: 61: Hoare triple {53472#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53472#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,382 INFO L273 TraceCheckUtils]: 62: Hoare triple {53472#(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; {53472#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,383 INFO L273 TraceCheckUtils]: 63: Hoare triple {53472#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53473#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,383 INFO L273 TraceCheckUtils]: 64: Hoare triple {53473#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53473#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,384 INFO L273 TraceCheckUtils]: 65: Hoare triple {53473#(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; {53473#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,385 INFO L273 TraceCheckUtils]: 66: Hoare triple {53473#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53474#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,386 INFO L273 TraceCheckUtils]: 67: Hoare triple {53474#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53474#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,386 INFO L273 TraceCheckUtils]: 68: Hoare triple {53474#(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; {53474#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,387 INFO L273 TraceCheckUtils]: 69: Hoare triple {53474#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53475#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,388 INFO L273 TraceCheckUtils]: 70: Hoare triple {53475#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53475#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,389 INFO L273 TraceCheckUtils]: 71: Hoare triple {53475#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {53475#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,389 INFO L273 TraceCheckUtils]: 72: Hoare triple {53475#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53476#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,390 INFO L273 TraceCheckUtils]: 73: Hoare triple {53476#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53476#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,391 INFO L273 TraceCheckUtils]: 74: Hoare triple {53476#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {53476#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,391 INFO L273 TraceCheckUtils]: 75: Hoare triple {53476#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53477#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,392 INFO L273 TraceCheckUtils]: 76: Hoare triple {53477#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53477#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,393 INFO L273 TraceCheckUtils]: 77: Hoare triple {53477#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {53477#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,394 INFO L273 TraceCheckUtils]: 78: Hoare triple {53477#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53478#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,395 INFO L273 TraceCheckUtils]: 79: Hoare triple {53478#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53478#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,395 INFO L273 TraceCheckUtils]: 80: Hoare triple {53478#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {53478#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,396 INFO L273 TraceCheckUtils]: 81: Hoare triple {53478#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53479#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,397 INFO L273 TraceCheckUtils]: 82: Hoare triple {53479#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53479#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,397 INFO L273 TraceCheckUtils]: 83: Hoare triple {53479#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {53479#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,398 INFO L273 TraceCheckUtils]: 84: Hoare triple {53479#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53480#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,399 INFO L273 TraceCheckUtils]: 85: Hoare triple {53480#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53480#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,400 INFO L273 TraceCheckUtils]: 86: Hoare triple {53480#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {53480#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,400 INFO L273 TraceCheckUtils]: 87: Hoare triple {53480#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53481#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,401 INFO L273 TraceCheckUtils]: 88: Hoare triple {53481#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53481#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,402 INFO L273 TraceCheckUtils]: 89: Hoare triple {53481#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {53481#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,403 INFO L273 TraceCheckUtils]: 90: Hoare triple {53481#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53482#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,404 INFO L273 TraceCheckUtils]: 91: Hoare triple {53482#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53482#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,405 INFO L273 TraceCheckUtils]: 92: Hoare triple {53482#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {53482#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,405 INFO L273 TraceCheckUtils]: 93: Hoare triple {53482#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53483#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,406 INFO L273 TraceCheckUtils]: 94: Hoare triple {53483#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53483#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,407 INFO L273 TraceCheckUtils]: 95: Hoare triple {53483#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {53483#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,408 INFO L273 TraceCheckUtils]: 96: Hoare triple {53483#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53484#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,408 INFO L273 TraceCheckUtils]: 97: Hoare triple {53484#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53484#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,409 INFO L273 TraceCheckUtils]: 98: Hoare triple {53484#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {53484#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,410 INFO L273 TraceCheckUtils]: 99: Hoare triple {53484#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53485#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:05,411 INFO L273 TraceCheckUtils]: 100: Hoare triple {53485#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} assume !(~k~0 < 100000); {53452#false} is VALID [2018-11-23 11:54:05,411 INFO L273 TraceCheckUtils]: 101: Hoare triple {53452#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53452#false} is VALID [2018-11-23 11:54:05,411 INFO L273 TraceCheckUtils]: 102: Hoare triple {53452#false} ~x~0 := 0; {53452#false} is VALID [2018-11-23 11:54:05,411 INFO L273 TraceCheckUtils]: 103: Hoare triple {53452#false} assume !(~x~0 < ~i~0); {53452#false} is VALID [2018-11-23 11:54:05,411 INFO L273 TraceCheckUtils]: 104: Hoare triple {53452#false} ~x~0 := 0; {53452#false} is VALID [2018-11-23 11:54:05,412 INFO L273 TraceCheckUtils]: 105: Hoare triple {53452#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53452#false} is VALID [2018-11-23 11:54:05,412 INFO L256 TraceCheckUtils]: 106: Hoare triple {53452#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {53451#true} is VALID [2018-11-23 11:54:05,412 INFO L273 TraceCheckUtils]: 107: Hoare triple {53451#true} ~cond := #in~cond; {53451#true} is VALID [2018-11-23 11:54:05,412 INFO L273 TraceCheckUtils]: 108: Hoare triple {53451#true} assume !(0 == ~cond); {53451#true} is VALID [2018-11-23 11:54:05,412 INFO L273 TraceCheckUtils]: 109: Hoare triple {53451#true} assume true; {53451#true} is VALID [2018-11-23 11:54:05,412 INFO L268 TraceCheckUtils]: 110: Hoare quadruple {53451#true} {53452#false} #136#return; {53452#false} is VALID [2018-11-23 11:54:05,413 INFO L273 TraceCheckUtils]: 111: Hoare triple {53452#false} havoc #t~mem9;havoc #t~mem10; {53452#false} is VALID [2018-11-23 11:54:05,413 INFO L273 TraceCheckUtils]: 112: Hoare triple {53452#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {53452#false} is VALID [2018-11-23 11:54:05,413 INFO L273 TraceCheckUtils]: 113: Hoare triple {53452#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53452#false} is VALID [2018-11-23 11:54:05,413 INFO L256 TraceCheckUtils]: 114: Hoare triple {53452#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {53452#false} is VALID [2018-11-23 11:54:05,413 INFO L273 TraceCheckUtils]: 115: Hoare triple {53452#false} ~cond := #in~cond; {53452#false} is VALID [2018-11-23 11:54:05,413 INFO L273 TraceCheckUtils]: 116: Hoare triple {53452#false} assume 0 == ~cond; {53452#false} is VALID [2018-11-23 11:54:05,414 INFO L273 TraceCheckUtils]: 117: Hoare triple {53452#false} assume !false; {53452#false} is VALID [2018-11-23 11:54:05,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1430 backedges. 2 proven. 1426 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:54:05,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:05,437 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:54:05,445 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:54:05,606 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-11-23 11:54:05,606 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:05,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:05,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:06,775 INFO L256 TraceCheckUtils]: 0: Hoare triple {53451#true} call ULTIMATE.init(); {53451#true} is VALID [2018-11-23 11:54:06,775 INFO L273 TraceCheckUtils]: 1: Hoare triple {53451#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {53451#true} is VALID [2018-11-23 11:54:06,776 INFO L273 TraceCheckUtils]: 2: Hoare triple {53451#true} assume true; {53451#true} is VALID [2018-11-23 11:54:06,776 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {53451#true} {53451#true} #130#return; {53451#true} is VALID [2018-11-23 11:54:06,776 INFO L256 TraceCheckUtils]: 4: Hoare triple {53451#true} call #t~ret15 := main(); {53451#true} is VALID [2018-11-23 11:54:06,777 INFO L273 TraceCheckUtils]: 5: Hoare triple {53451#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {53504#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:06,777 INFO L273 TraceCheckUtils]: 6: Hoare triple {53504#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {53508#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:06,778 INFO L273 TraceCheckUtils]: 7: Hoare triple {53508#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53508#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:06,778 INFO L273 TraceCheckUtils]: 8: Hoare triple {53508#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {53508#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:06,779 INFO L273 TraceCheckUtils]: 9: Hoare triple {53508#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {53518#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:06,779 INFO L273 TraceCheckUtils]: 10: Hoare triple {53518#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53518#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:06,779 INFO L273 TraceCheckUtils]: 11: Hoare triple {53518#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {53518#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:06,780 INFO L273 TraceCheckUtils]: 12: Hoare triple {53518#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {53528#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:06,780 INFO L273 TraceCheckUtils]: 13: Hoare triple {53528#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53528#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:06,780 INFO L273 TraceCheckUtils]: 14: Hoare triple {53528#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {53528#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:06,781 INFO L273 TraceCheckUtils]: 15: Hoare triple {53528#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {53538#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:06,781 INFO L273 TraceCheckUtils]: 16: Hoare triple {53538#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53538#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:06,781 INFO L273 TraceCheckUtils]: 17: Hoare triple {53538#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {53538#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:06,782 INFO L273 TraceCheckUtils]: 18: Hoare triple {53538#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {53548#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:06,783 INFO L273 TraceCheckUtils]: 19: Hoare triple {53548#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53548#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:06,783 INFO L273 TraceCheckUtils]: 20: Hoare triple {53548#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {53548#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:06,784 INFO L273 TraceCheckUtils]: 21: Hoare triple {53548#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {53558#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:06,784 INFO L273 TraceCheckUtils]: 22: Hoare triple {53558#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53558#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:06,785 INFO L273 TraceCheckUtils]: 23: Hoare triple {53558#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {53558#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:06,785 INFO L273 TraceCheckUtils]: 24: Hoare triple {53558#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {53568#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:06,786 INFO L273 TraceCheckUtils]: 25: Hoare triple {53568#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53568#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:06,786 INFO L273 TraceCheckUtils]: 26: Hoare triple {53568#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {53568#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:06,787 INFO L273 TraceCheckUtils]: 27: Hoare triple {53568#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {53578#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:06,787 INFO L273 TraceCheckUtils]: 28: Hoare triple {53578#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53578#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:06,788 INFO L273 TraceCheckUtils]: 29: Hoare triple {53578#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {53578#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:06,789 INFO L273 TraceCheckUtils]: 30: Hoare triple {53578#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {53588#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:06,789 INFO L273 TraceCheckUtils]: 31: Hoare triple {53588#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53588#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:06,790 INFO L273 TraceCheckUtils]: 32: Hoare triple {53588#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {53588#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:06,790 INFO L273 TraceCheckUtils]: 33: Hoare triple {53588#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {53598#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:06,791 INFO L273 TraceCheckUtils]: 34: Hoare triple {53598#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53598#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:06,791 INFO L273 TraceCheckUtils]: 35: Hoare triple {53598#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {53598#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:06,792 INFO L273 TraceCheckUtils]: 36: Hoare triple {53598#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {53608#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:06,792 INFO L273 TraceCheckUtils]: 37: Hoare triple {53608#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53608#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:06,793 INFO L273 TraceCheckUtils]: 38: Hoare triple {53608#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {53608#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:06,793 INFO L273 TraceCheckUtils]: 39: Hoare triple {53608#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {53618#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:06,794 INFO L273 TraceCheckUtils]: 40: Hoare triple {53618#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53618#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:06,794 INFO L273 TraceCheckUtils]: 41: Hoare triple {53618#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {53618#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:06,795 INFO L273 TraceCheckUtils]: 42: Hoare triple {53618#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {53628#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:06,796 INFO L273 TraceCheckUtils]: 43: Hoare triple {53628#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53628#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:06,796 INFO L273 TraceCheckUtils]: 44: Hoare triple {53628#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {53628#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:06,797 INFO L273 TraceCheckUtils]: 45: Hoare triple {53628#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {53638#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:06,797 INFO L273 TraceCheckUtils]: 46: Hoare triple {53638#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53638#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:06,798 INFO L273 TraceCheckUtils]: 47: Hoare triple {53638#(<= main_~k~0 14)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {53638#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:06,798 INFO L273 TraceCheckUtils]: 48: Hoare triple {53638#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {53648#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:06,799 INFO L273 TraceCheckUtils]: 49: Hoare triple {53648#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53648#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:06,799 INFO L273 TraceCheckUtils]: 50: Hoare triple {53648#(<= main_~k~0 15)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {53648#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:06,800 INFO L273 TraceCheckUtils]: 51: Hoare triple {53648#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {53658#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:06,800 INFO L273 TraceCheckUtils]: 52: Hoare triple {53658#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53658#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:06,801 INFO L273 TraceCheckUtils]: 53: Hoare triple {53658#(<= main_~k~0 16)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {53658#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:06,802 INFO L273 TraceCheckUtils]: 54: Hoare triple {53658#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {53668#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:06,802 INFO L273 TraceCheckUtils]: 55: Hoare triple {53668#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53668#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:06,803 INFO L273 TraceCheckUtils]: 56: Hoare triple {53668#(<= main_~k~0 17)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {53668#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:06,803 INFO L273 TraceCheckUtils]: 57: Hoare triple {53668#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {53678#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:06,804 INFO L273 TraceCheckUtils]: 58: Hoare triple {53678#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53678#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:06,804 INFO L273 TraceCheckUtils]: 59: Hoare triple {53678#(<= main_~k~0 18)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {53678#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:06,805 INFO L273 TraceCheckUtils]: 60: Hoare triple {53678#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {53688#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:06,806 INFO L273 TraceCheckUtils]: 61: Hoare triple {53688#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53688#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:06,806 INFO L273 TraceCheckUtils]: 62: Hoare triple {53688#(<= main_~k~0 19)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {53688#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:06,807 INFO L273 TraceCheckUtils]: 63: Hoare triple {53688#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {53698#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:06,807 INFO L273 TraceCheckUtils]: 64: Hoare triple {53698#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53698#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:06,808 INFO L273 TraceCheckUtils]: 65: Hoare triple {53698#(<= main_~k~0 20)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {53698#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:06,809 INFO L273 TraceCheckUtils]: 66: Hoare triple {53698#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {53708#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:06,809 INFO L273 TraceCheckUtils]: 67: Hoare triple {53708#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53708#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:06,810 INFO L273 TraceCheckUtils]: 68: Hoare triple {53708#(<= main_~k~0 21)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {53708#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:06,810 INFO L273 TraceCheckUtils]: 69: Hoare triple {53708#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {53718#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:06,811 INFO L273 TraceCheckUtils]: 70: Hoare triple {53718#(<= main_~k~0 22)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53718#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:06,811 INFO L273 TraceCheckUtils]: 71: Hoare triple {53718#(<= main_~k~0 22)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {53718#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:06,812 INFO L273 TraceCheckUtils]: 72: Hoare triple {53718#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {53728#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:06,813 INFO L273 TraceCheckUtils]: 73: Hoare triple {53728#(<= main_~k~0 23)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53728#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:06,813 INFO L273 TraceCheckUtils]: 74: Hoare triple {53728#(<= main_~k~0 23)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {53728#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:06,814 INFO L273 TraceCheckUtils]: 75: Hoare triple {53728#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {53738#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:06,814 INFO L273 TraceCheckUtils]: 76: Hoare triple {53738#(<= main_~k~0 24)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53738#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:06,815 INFO L273 TraceCheckUtils]: 77: Hoare triple {53738#(<= main_~k~0 24)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {53738#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:06,815 INFO L273 TraceCheckUtils]: 78: Hoare triple {53738#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {53748#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:06,816 INFO L273 TraceCheckUtils]: 79: Hoare triple {53748#(<= main_~k~0 25)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53748#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:06,816 INFO L273 TraceCheckUtils]: 80: Hoare triple {53748#(<= main_~k~0 25)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {53748#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:06,817 INFO L273 TraceCheckUtils]: 81: Hoare triple {53748#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {53758#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:06,817 INFO L273 TraceCheckUtils]: 82: Hoare triple {53758#(<= main_~k~0 26)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53758#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:06,818 INFO L273 TraceCheckUtils]: 83: Hoare triple {53758#(<= main_~k~0 26)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {53758#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:06,819 INFO L273 TraceCheckUtils]: 84: Hoare triple {53758#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {53768#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:06,819 INFO L273 TraceCheckUtils]: 85: Hoare triple {53768#(<= main_~k~0 27)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53768#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:06,819 INFO L273 TraceCheckUtils]: 86: Hoare triple {53768#(<= main_~k~0 27)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {53768#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:06,820 INFO L273 TraceCheckUtils]: 87: Hoare triple {53768#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {53778#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:06,821 INFO L273 TraceCheckUtils]: 88: Hoare triple {53778#(<= main_~k~0 28)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53778#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:06,821 INFO L273 TraceCheckUtils]: 89: Hoare triple {53778#(<= main_~k~0 28)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {53778#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:06,822 INFO L273 TraceCheckUtils]: 90: Hoare triple {53778#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {53788#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:06,822 INFO L273 TraceCheckUtils]: 91: Hoare triple {53788#(<= main_~k~0 29)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53788#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:06,823 INFO L273 TraceCheckUtils]: 92: Hoare triple {53788#(<= main_~k~0 29)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {53788#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:06,823 INFO L273 TraceCheckUtils]: 93: Hoare triple {53788#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {53798#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:06,824 INFO L273 TraceCheckUtils]: 94: Hoare triple {53798#(<= main_~k~0 30)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53798#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:06,824 INFO L273 TraceCheckUtils]: 95: Hoare triple {53798#(<= main_~k~0 30)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {53798#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:06,825 INFO L273 TraceCheckUtils]: 96: Hoare triple {53798#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {53808#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:06,826 INFO L273 TraceCheckUtils]: 97: Hoare triple {53808#(<= main_~k~0 31)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53808#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:06,826 INFO L273 TraceCheckUtils]: 98: Hoare triple {53808#(<= main_~k~0 31)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {53808#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:06,827 INFO L273 TraceCheckUtils]: 99: Hoare triple {53808#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {53818#(<= main_~k~0 32)} is VALID [2018-11-23 11:54:06,827 INFO L273 TraceCheckUtils]: 100: Hoare triple {53818#(<= main_~k~0 32)} assume !(~k~0 < 100000); {53452#false} is VALID [2018-11-23 11:54:06,827 INFO L273 TraceCheckUtils]: 101: Hoare triple {53452#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53452#false} is VALID [2018-11-23 11:54:06,828 INFO L273 TraceCheckUtils]: 102: Hoare triple {53452#false} ~x~0 := 0; {53452#false} is VALID [2018-11-23 11:54:06,828 INFO L273 TraceCheckUtils]: 103: Hoare triple {53452#false} assume !(~x~0 < ~i~0); {53452#false} is VALID [2018-11-23 11:54:06,828 INFO L273 TraceCheckUtils]: 104: Hoare triple {53452#false} ~x~0 := 0; {53452#false} is VALID [2018-11-23 11:54:06,828 INFO L273 TraceCheckUtils]: 105: Hoare triple {53452#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53452#false} is VALID [2018-11-23 11:54:06,828 INFO L256 TraceCheckUtils]: 106: Hoare triple {53452#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {53452#false} is VALID [2018-11-23 11:54:06,829 INFO L273 TraceCheckUtils]: 107: Hoare triple {53452#false} ~cond := #in~cond; {53452#false} is VALID [2018-11-23 11:54:06,829 INFO L273 TraceCheckUtils]: 108: Hoare triple {53452#false} assume !(0 == ~cond); {53452#false} is VALID [2018-11-23 11:54:06,829 INFO L273 TraceCheckUtils]: 109: Hoare triple {53452#false} assume true; {53452#false} is VALID [2018-11-23 11:54:06,829 INFO L268 TraceCheckUtils]: 110: Hoare quadruple {53452#false} {53452#false} #136#return; {53452#false} is VALID [2018-11-23 11:54:06,829 INFO L273 TraceCheckUtils]: 111: Hoare triple {53452#false} havoc #t~mem9;havoc #t~mem10; {53452#false} is VALID [2018-11-23 11:54:06,829 INFO L273 TraceCheckUtils]: 112: Hoare triple {53452#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {53452#false} is VALID [2018-11-23 11:54:06,830 INFO L273 TraceCheckUtils]: 113: Hoare triple {53452#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53452#false} is VALID [2018-11-23 11:54:06,830 INFO L256 TraceCheckUtils]: 114: Hoare triple {53452#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {53452#false} is VALID [2018-11-23 11:54:06,830 INFO L273 TraceCheckUtils]: 115: Hoare triple {53452#false} ~cond := #in~cond; {53452#false} is VALID [2018-11-23 11:54:06,830 INFO L273 TraceCheckUtils]: 116: Hoare triple {53452#false} assume 0 == ~cond; {53452#false} is VALID [2018-11-23 11:54:06,830 INFO L273 TraceCheckUtils]: 117: Hoare triple {53452#false} assume !false; {53452#false} is VALID [2018-11-23 11:54:06,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1430 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:54:06,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:06,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 68 [2018-11-23 11:54:06,861 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 118 [2018-11-23 11:54:06,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:06,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 68 states. [2018-11-23 11:54:07,073 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:07,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-11-23 11:54:07,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-11-23 11:54:07,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1718, Invalid=2838, Unknown=0, NotChecked=0, Total=4556 [2018-11-23 11:54:07,076 INFO L87 Difference]: Start difference. First operand 419 states and 610 transitions. Second operand 68 states. [2018-11-23 11:54:08,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:08,654 INFO L93 Difference]: Finished difference Result 660 states and 987 transitions. [2018-11-23 11:54:08,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-23 11:54:08,654 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 118 [2018-11-23 11:54:08,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:08,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-23 11:54:08,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 235 transitions. [2018-11-23 11:54:08,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-23 11:54:08,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 235 transitions. [2018-11-23 11:54:08,658 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 235 transitions. [2018-11-23 11:54:08,897 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-23 11:54:08,908 INFO L225 Difference]: With dead ends: 660 [2018-11-23 11:54:08,908 INFO L226 Difference]: Without dead ends: 434 [2018-11-23 11:54:08,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1585 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1718, Invalid=2838, Unknown=0, NotChecked=0, Total=4556 [2018-11-23 11:54:08,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-11-23 11:54:09,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 425. [2018-11-23 11:54:09,923 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:09,923 INFO L82 GeneralOperation]: Start isEquivalent. First operand 434 states. Second operand 425 states. [2018-11-23 11:54:09,923 INFO L74 IsIncluded]: Start isIncluded. First operand 434 states. Second operand 425 states. [2018-11-23 11:54:09,923 INFO L87 Difference]: Start difference. First operand 434 states. Second operand 425 states. [2018-11-23 11:54:09,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:09,934 INFO L93 Difference]: Finished difference Result 434 states and 631 transitions. [2018-11-23 11:54:09,934 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 631 transitions. [2018-11-23 11:54:09,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:09,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:09,935 INFO L74 IsIncluded]: Start isIncluded. First operand 425 states. Second operand 434 states. [2018-11-23 11:54:09,935 INFO L87 Difference]: Start difference. First operand 425 states. Second operand 434 states. [2018-11-23 11:54:09,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:09,946 INFO L93 Difference]: Finished difference Result 434 states and 631 transitions. [2018-11-23 11:54:09,946 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 631 transitions. [2018-11-23 11:54:09,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:09,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:09,946 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:09,947 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:09,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-11-23 11:54:09,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 618 transitions. [2018-11-23 11:54:09,957 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 618 transitions. Word has length 118 [2018-11-23 11:54:09,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:09,957 INFO L480 AbstractCegarLoop]: Abstraction has 425 states and 618 transitions. [2018-11-23 11:54:09,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-11-23 11:54:09,957 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 618 transitions. [2018-11-23 11:54:09,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-23 11:54:09,957 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:09,958 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 32, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:09,958 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:09,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:09,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1498478068, now seen corresponding path program 28 times [2018-11-23 11:54:09,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:09,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:09,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:09,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:09,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:09,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:11,242 INFO L256 TraceCheckUtils]: 0: Hoare triple {56204#true} call ULTIMATE.init(); {56204#true} is VALID [2018-11-23 11:54:11,242 INFO L273 TraceCheckUtils]: 1: Hoare triple {56204#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {56204#true} is VALID [2018-11-23 11:54:11,242 INFO L273 TraceCheckUtils]: 2: Hoare triple {56204#true} assume true; {56204#true} is VALID [2018-11-23 11:54:11,242 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {56204#true} {56204#true} #130#return; {56204#true} is VALID [2018-11-23 11:54:11,242 INFO L256 TraceCheckUtils]: 4: Hoare triple {56204#true} call #t~ret15 := main(); {56204#true} is VALID [2018-11-23 11:54:11,243 INFO L273 TraceCheckUtils]: 5: Hoare triple {56204#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {56206#(= main_~i~0 0)} is VALID [2018-11-23 11:54:11,244 INFO L273 TraceCheckUtils]: 6: Hoare triple {56206#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {56207#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,244 INFO L273 TraceCheckUtils]: 7: Hoare triple {56207#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56207#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,246 INFO L273 TraceCheckUtils]: 8: Hoare triple {56207#(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; {56207#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,246 INFO L273 TraceCheckUtils]: 9: Hoare triple {56207#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {56208#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,249 INFO L273 TraceCheckUtils]: 10: Hoare triple {56208#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56208#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,249 INFO L273 TraceCheckUtils]: 11: Hoare triple {56208#(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; {56208#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,252 INFO L273 TraceCheckUtils]: 12: Hoare triple {56208#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {56209#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,252 INFO L273 TraceCheckUtils]: 13: Hoare triple {56209#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56209#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,254 INFO L273 TraceCheckUtils]: 14: Hoare triple {56209#(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; {56209#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,254 INFO L273 TraceCheckUtils]: 15: Hoare triple {56209#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {56210#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,257 INFO L273 TraceCheckUtils]: 16: Hoare triple {56210#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56210#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,257 INFO L273 TraceCheckUtils]: 17: Hoare triple {56210#(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; {56210#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,259 INFO L273 TraceCheckUtils]: 18: Hoare triple {56210#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {56211#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,260 INFO L273 TraceCheckUtils]: 19: Hoare triple {56211#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56211#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,261 INFO L273 TraceCheckUtils]: 20: Hoare triple {56211#(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; {56211#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,261 INFO L273 TraceCheckUtils]: 21: Hoare triple {56211#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {56212#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,263 INFO L273 TraceCheckUtils]: 22: Hoare triple {56212#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56212#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,263 INFO L273 TraceCheckUtils]: 23: Hoare triple {56212#(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; {56212#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,265 INFO L273 TraceCheckUtils]: 24: Hoare triple {56212#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {56213#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,265 INFO L273 TraceCheckUtils]: 25: Hoare triple {56213#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56213#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,268 INFO L273 TraceCheckUtils]: 26: Hoare triple {56213#(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; {56213#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,268 INFO L273 TraceCheckUtils]: 27: Hoare triple {56213#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {56214#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,271 INFO L273 TraceCheckUtils]: 28: Hoare triple {56214#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56214#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,271 INFO L273 TraceCheckUtils]: 29: Hoare triple {56214#(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; {56214#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,273 INFO L273 TraceCheckUtils]: 30: Hoare triple {56214#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {56215#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,273 INFO L273 TraceCheckUtils]: 31: Hoare triple {56215#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56215#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,274 INFO L273 TraceCheckUtils]: 32: Hoare triple {56215#(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; {56215#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,274 INFO L273 TraceCheckUtils]: 33: Hoare triple {56215#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {56216#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,275 INFO L273 TraceCheckUtils]: 34: Hoare triple {56216#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56216#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,275 INFO L273 TraceCheckUtils]: 35: Hoare triple {56216#(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; {56216#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,276 INFO L273 TraceCheckUtils]: 36: Hoare triple {56216#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {56217#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,276 INFO L273 TraceCheckUtils]: 37: Hoare triple {56217#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56217#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,278 INFO L273 TraceCheckUtils]: 38: Hoare triple {56217#(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; {56217#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,278 INFO L273 TraceCheckUtils]: 39: Hoare triple {56217#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {56218#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,280 INFO L273 TraceCheckUtils]: 40: Hoare triple {56218#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56218#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,280 INFO L273 TraceCheckUtils]: 41: Hoare triple {56218#(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; {56218#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,281 INFO L273 TraceCheckUtils]: 42: Hoare triple {56218#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {56219#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,282 INFO L273 TraceCheckUtils]: 43: Hoare triple {56219#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56219#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,283 INFO L273 TraceCheckUtils]: 44: Hoare triple {56219#(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; {56219#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,284 INFO L273 TraceCheckUtils]: 45: Hoare triple {56219#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {56220#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,285 INFO L273 TraceCheckUtils]: 46: Hoare triple {56220#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56220#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,285 INFO L273 TraceCheckUtils]: 47: Hoare triple {56220#(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; {56220#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,287 INFO L273 TraceCheckUtils]: 48: Hoare triple {56220#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {56221#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,288 INFO L273 TraceCheckUtils]: 49: Hoare triple {56221#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56221#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,289 INFO L273 TraceCheckUtils]: 50: Hoare triple {56221#(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; {56221#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,290 INFO L273 TraceCheckUtils]: 51: Hoare triple {56221#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {56222#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,290 INFO L273 TraceCheckUtils]: 52: Hoare triple {56222#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56222#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,291 INFO L273 TraceCheckUtils]: 53: Hoare triple {56222#(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; {56222#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,296 INFO L273 TraceCheckUtils]: 54: Hoare triple {56222#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {56223#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:54:11,299 INFO L273 TraceCheckUtils]: 55: Hoare triple {56223#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56223#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:54:11,299 INFO L273 TraceCheckUtils]: 56: Hoare triple {56223#(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; {56223#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:54:11,304 INFO L273 TraceCheckUtils]: 57: Hoare triple {56223#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} ~k~0 := 1 + ~k~0; {56224#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,307 INFO L273 TraceCheckUtils]: 58: Hoare triple {56224#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56224#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,310 INFO L273 TraceCheckUtils]: 59: Hoare triple {56224#(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; {56224#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,313 INFO L273 TraceCheckUtils]: 60: Hoare triple {56224#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {56225#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,313 INFO L273 TraceCheckUtils]: 61: Hoare triple {56225#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56225#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,315 INFO L273 TraceCheckUtils]: 62: Hoare triple {56225#(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; {56225#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,315 INFO L273 TraceCheckUtils]: 63: Hoare triple {56225#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {56226#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,317 INFO L273 TraceCheckUtils]: 64: Hoare triple {56226#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56226#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,317 INFO L273 TraceCheckUtils]: 65: Hoare triple {56226#(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; {56226#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,320 INFO L273 TraceCheckUtils]: 66: Hoare triple {56226#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {56227#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,320 INFO L273 TraceCheckUtils]: 67: Hoare triple {56227#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56227#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,323 INFO L273 TraceCheckUtils]: 68: Hoare triple {56227#(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; {56227#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,323 INFO L273 TraceCheckUtils]: 69: Hoare triple {56227#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {56228#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,324 INFO L273 TraceCheckUtils]: 70: Hoare triple {56228#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56228#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,324 INFO L273 TraceCheckUtils]: 71: Hoare triple {56228#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {56228#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,325 INFO L273 TraceCheckUtils]: 72: Hoare triple {56228#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {56229#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,325 INFO L273 TraceCheckUtils]: 73: Hoare triple {56229#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56229#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,325 INFO L273 TraceCheckUtils]: 74: Hoare triple {56229#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {56229#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,326 INFO L273 TraceCheckUtils]: 75: Hoare triple {56229#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {56230#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,326 INFO L273 TraceCheckUtils]: 76: Hoare triple {56230#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56230#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,327 INFO L273 TraceCheckUtils]: 77: Hoare triple {56230#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {56230#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,327 INFO L273 TraceCheckUtils]: 78: Hoare triple {56230#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {56231#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,328 INFO L273 TraceCheckUtils]: 79: Hoare triple {56231#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56231#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,329 INFO L273 TraceCheckUtils]: 80: Hoare triple {56231#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {56231#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,330 INFO L273 TraceCheckUtils]: 81: Hoare triple {56231#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {56232#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,330 INFO L273 TraceCheckUtils]: 82: Hoare triple {56232#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56232#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,331 INFO L273 TraceCheckUtils]: 83: Hoare triple {56232#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {56232#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,332 INFO L273 TraceCheckUtils]: 84: Hoare triple {56232#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {56233#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,333 INFO L273 TraceCheckUtils]: 85: Hoare triple {56233#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56233#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,333 INFO L273 TraceCheckUtils]: 86: Hoare triple {56233#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {56233#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,334 INFO L273 TraceCheckUtils]: 87: Hoare triple {56233#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {56234#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,335 INFO L273 TraceCheckUtils]: 88: Hoare triple {56234#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56234#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,336 INFO L273 TraceCheckUtils]: 89: Hoare triple {56234#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {56234#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,337 INFO L273 TraceCheckUtils]: 90: Hoare triple {56234#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {56235#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,337 INFO L273 TraceCheckUtils]: 91: Hoare triple {56235#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56235#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,338 INFO L273 TraceCheckUtils]: 92: Hoare triple {56235#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {56235#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,339 INFO L273 TraceCheckUtils]: 93: Hoare triple {56235#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {56236#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,340 INFO L273 TraceCheckUtils]: 94: Hoare triple {56236#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56236#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,341 INFO L273 TraceCheckUtils]: 95: Hoare triple {56236#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {56236#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,341 INFO L273 TraceCheckUtils]: 96: Hoare triple {56236#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {56237#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,342 INFO L273 TraceCheckUtils]: 97: Hoare triple {56237#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56237#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,343 INFO L273 TraceCheckUtils]: 98: Hoare triple {56237#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {56237#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,344 INFO L273 TraceCheckUtils]: 99: Hoare triple {56237#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {56238#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,345 INFO L273 TraceCheckUtils]: 100: Hoare triple {56238#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56238#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,345 INFO L273 TraceCheckUtils]: 101: Hoare triple {56238#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {56238#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,346 INFO L273 TraceCheckUtils]: 102: Hoare triple {56238#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {56239#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:11,347 INFO L273 TraceCheckUtils]: 103: Hoare triple {56239#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} assume !(~k~0 < 100000); {56205#false} is VALID [2018-11-23 11:54:11,347 INFO L273 TraceCheckUtils]: 104: Hoare triple {56205#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56205#false} is VALID [2018-11-23 11:54:11,347 INFO L273 TraceCheckUtils]: 105: Hoare triple {56205#false} ~x~0 := 0; {56205#false} is VALID [2018-11-23 11:54:11,347 INFO L273 TraceCheckUtils]: 106: Hoare triple {56205#false} assume !(~x~0 < ~i~0); {56205#false} is VALID [2018-11-23 11:54:11,348 INFO L273 TraceCheckUtils]: 107: Hoare triple {56205#false} ~x~0 := 0; {56205#false} is VALID [2018-11-23 11:54:11,348 INFO L273 TraceCheckUtils]: 108: Hoare triple {56205#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56205#false} is VALID [2018-11-23 11:54:11,348 INFO L256 TraceCheckUtils]: 109: Hoare triple {56205#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {56204#true} is VALID [2018-11-23 11:54:11,348 INFO L273 TraceCheckUtils]: 110: Hoare triple {56204#true} ~cond := #in~cond; {56204#true} is VALID [2018-11-23 11:54:11,348 INFO L273 TraceCheckUtils]: 111: Hoare triple {56204#true} assume !(0 == ~cond); {56204#true} is VALID [2018-11-23 11:54:11,348 INFO L273 TraceCheckUtils]: 112: Hoare triple {56204#true} assume true; {56204#true} is VALID [2018-11-23 11:54:11,349 INFO L268 TraceCheckUtils]: 113: Hoare quadruple {56204#true} {56205#false} #136#return; {56205#false} is VALID [2018-11-23 11:54:11,349 INFO L273 TraceCheckUtils]: 114: Hoare triple {56205#false} havoc #t~mem9;havoc #t~mem10; {56205#false} is VALID [2018-11-23 11:54:11,349 INFO L273 TraceCheckUtils]: 115: Hoare triple {56205#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {56205#false} is VALID [2018-11-23 11:54:11,349 INFO L273 TraceCheckUtils]: 116: Hoare triple {56205#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56205#false} is VALID [2018-11-23 11:54:11,349 INFO L256 TraceCheckUtils]: 117: Hoare triple {56205#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {56205#false} is VALID [2018-11-23 11:54:11,350 INFO L273 TraceCheckUtils]: 118: Hoare triple {56205#false} ~cond := #in~cond; {56205#false} is VALID [2018-11-23 11:54:11,350 INFO L273 TraceCheckUtils]: 119: Hoare triple {56205#false} assume 0 == ~cond; {56205#false} is VALID [2018-11-23 11:54:11,350 INFO L273 TraceCheckUtils]: 120: Hoare triple {56205#false} assume !false; {56205#false} is VALID [2018-11-23 11:54:11,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1524 backedges. 2 proven. 1520 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:54:11,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:11,375 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:54:11,383 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:54:11,451 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:54:11,451 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:11,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:11,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:12,462 INFO L256 TraceCheckUtils]: 0: Hoare triple {56204#true} call ULTIMATE.init(); {56204#true} is VALID [2018-11-23 11:54:12,463 INFO L273 TraceCheckUtils]: 1: Hoare triple {56204#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {56204#true} is VALID [2018-11-23 11:54:12,463 INFO L273 TraceCheckUtils]: 2: Hoare triple {56204#true} assume true; {56204#true} is VALID [2018-11-23 11:54:12,463 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {56204#true} {56204#true} #130#return; {56204#true} is VALID [2018-11-23 11:54:12,463 INFO L256 TraceCheckUtils]: 4: Hoare triple {56204#true} call #t~ret15 := main(); {56204#true} is VALID [2018-11-23 11:54:12,464 INFO L273 TraceCheckUtils]: 5: Hoare triple {56204#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {56258#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:12,464 INFO L273 TraceCheckUtils]: 6: Hoare triple {56258#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {56262#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:12,465 INFO L273 TraceCheckUtils]: 7: Hoare triple {56262#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56262#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:12,465 INFO L273 TraceCheckUtils]: 8: Hoare triple {56262#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {56262#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:12,465 INFO L273 TraceCheckUtils]: 9: Hoare triple {56262#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {56272#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:12,466 INFO L273 TraceCheckUtils]: 10: Hoare triple {56272#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56272#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:12,466 INFO L273 TraceCheckUtils]: 11: Hoare triple {56272#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {56272#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:12,467 INFO L273 TraceCheckUtils]: 12: Hoare triple {56272#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {56282#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:12,467 INFO L273 TraceCheckUtils]: 13: Hoare triple {56282#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56282#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:12,468 INFO L273 TraceCheckUtils]: 14: Hoare triple {56282#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {56282#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:12,468 INFO L273 TraceCheckUtils]: 15: Hoare triple {56282#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {56292#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:12,469 INFO L273 TraceCheckUtils]: 16: Hoare triple {56292#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56292#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:12,469 INFO L273 TraceCheckUtils]: 17: Hoare triple {56292#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {56292#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:12,470 INFO L273 TraceCheckUtils]: 18: Hoare triple {56292#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {56302#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:12,471 INFO L273 TraceCheckUtils]: 19: Hoare triple {56302#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56302#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:12,471 INFO L273 TraceCheckUtils]: 20: Hoare triple {56302#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {56302#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:12,472 INFO L273 TraceCheckUtils]: 21: Hoare triple {56302#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {56312#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:12,472 INFO L273 TraceCheckUtils]: 22: Hoare triple {56312#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56312#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:12,473 INFO L273 TraceCheckUtils]: 23: Hoare triple {56312#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {56312#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:12,473 INFO L273 TraceCheckUtils]: 24: Hoare triple {56312#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {56322#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:12,474 INFO L273 TraceCheckUtils]: 25: Hoare triple {56322#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56322#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:12,474 INFO L273 TraceCheckUtils]: 26: Hoare triple {56322#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {56322#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:12,475 INFO L273 TraceCheckUtils]: 27: Hoare triple {56322#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {56332#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:12,476 INFO L273 TraceCheckUtils]: 28: Hoare triple {56332#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56332#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:12,476 INFO L273 TraceCheckUtils]: 29: Hoare triple {56332#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {56332#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:12,477 INFO L273 TraceCheckUtils]: 30: Hoare triple {56332#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {56342#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:12,477 INFO L273 TraceCheckUtils]: 31: Hoare triple {56342#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56342#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:12,478 INFO L273 TraceCheckUtils]: 32: Hoare triple {56342#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {56342#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:12,478 INFO L273 TraceCheckUtils]: 33: Hoare triple {56342#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {56352#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:12,479 INFO L273 TraceCheckUtils]: 34: Hoare triple {56352#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56352#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:12,479 INFO L273 TraceCheckUtils]: 35: Hoare triple {56352#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {56352#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:12,480 INFO L273 TraceCheckUtils]: 36: Hoare triple {56352#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {56362#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:12,480 INFO L273 TraceCheckUtils]: 37: Hoare triple {56362#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56362#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:12,481 INFO L273 TraceCheckUtils]: 38: Hoare triple {56362#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {56362#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:12,482 INFO L273 TraceCheckUtils]: 39: Hoare triple {56362#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {56372#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:12,482 INFO L273 TraceCheckUtils]: 40: Hoare triple {56372#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56372#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:12,483 INFO L273 TraceCheckUtils]: 41: Hoare triple {56372#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {56372#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:12,483 INFO L273 TraceCheckUtils]: 42: Hoare triple {56372#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {56382#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:12,484 INFO L273 TraceCheckUtils]: 43: Hoare triple {56382#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56382#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:12,484 INFO L273 TraceCheckUtils]: 44: Hoare triple {56382#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {56382#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:12,485 INFO L273 TraceCheckUtils]: 45: Hoare triple {56382#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {56392#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:12,485 INFO L273 TraceCheckUtils]: 46: Hoare triple {56392#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56392#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:12,486 INFO L273 TraceCheckUtils]: 47: Hoare triple {56392#(<= main_~k~0 14)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {56392#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:12,487 INFO L273 TraceCheckUtils]: 48: Hoare triple {56392#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {56402#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:12,487 INFO L273 TraceCheckUtils]: 49: Hoare triple {56402#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56402#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:12,488 INFO L273 TraceCheckUtils]: 50: Hoare triple {56402#(<= main_~k~0 15)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {56402#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:12,488 INFO L273 TraceCheckUtils]: 51: Hoare triple {56402#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {56412#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:12,489 INFO L273 TraceCheckUtils]: 52: Hoare triple {56412#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56412#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:12,489 INFO L273 TraceCheckUtils]: 53: Hoare triple {56412#(<= main_~k~0 16)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {56412#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:12,490 INFO L273 TraceCheckUtils]: 54: Hoare triple {56412#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {56422#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:12,490 INFO L273 TraceCheckUtils]: 55: Hoare triple {56422#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56422#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:12,491 INFO L273 TraceCheckUtils]: 56: Hoare triple {56422#(<= main_~k~0 17)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {56422#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:12,492 INFO L273 TraceCheckUtils]: 57: Hoare triple {56422#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {56432#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:12,492 INFO L273 TraceCheckUtils]: 58: Hoare triple {56432#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56432#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:12,492 INFO L273 TraceCheckUtils]: 59: Hoare triple {56432#(<= main_~k~0 18)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {56432#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:12,493 INFO L273 TraceCheckUtils]: 60: Hoare triple {56432#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {56442#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:12,494 INFO L273 TraceCheckUtils]: 61: Hoare triple {56442#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56442#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:12,494 INFO L273 TraceCheckUtils]: 62: Hoare triple {56442#(<= main_~k~0 19)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {56442#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:12,495 INFO L273 TraceCheckUtils]: 63: Hoare triple {56442#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {56452#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:12,495 INFO L273 TraceCheckUtils]: 64: Hoare triple {56452#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56452#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:12,496 INFO L273 TraceCheckUtils]: 65: Hoare triple {56452#(<= main_~k~0 20)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {56452#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:12,496 INFO L273 TraceCheckUtils]: 66: Hoare triple {56452#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {56462#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:12,497 INFO L273 TraceCheckUtils]: 67: Hoare triple {56462#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56462#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:12,497 INFO L273 TraceCheckUtils]: 68: Hoare triple {56462#(<= main_~k~0 21)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {56462#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:12,498 INFO L273 TraceCheckUtils]: 69: Hoare triple {56462#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {56472#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:12,499 INFO L273 TraceCheckUtils]: 70: Hoare triple {56472#(<= main_~k~0 22)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56472#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:12,499 INFO L273 TraceCheckUtils]: 71: Hoare triple {56472#(<= main_~k~0 22)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {56472#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:12,500 INFO L273 TraceCheckUtils]: 72: Hoare triple {56472#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {56482#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:12,500 INFO L273 TraceCheckUtils]: 73: Hoare triple {56482#(<= main_~k~0 23)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56482#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:12,501 INFO L273 TraceCheckUtils]: 74: Hoare triple {56482#(<= main_~k~0 23)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {56482#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:12,501 INFO L273 TraceCheckUtils]: 75: Hoare triple {56482#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {56492#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:12,502 INFO L273 TraceCheckUtils]: 76: Hoare triple {56492#(<= main_~k~0 24)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56492#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:12,502 INFO L273 TraceCheckUtils]: 77: Hoare triple {56492#(<= main_~k~0 24)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {56492#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:12,503 INFO L273 TraceCheckUtils]: 78: Hoare triple {56492#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {56502#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:12,503 INFO L273 TraceCheckUtils]: 79: Hoare triple {56502#(<= main_~k~0 25)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56502#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:12,504 INFO L273 TraceCheckUtils]: 80: Hoare triple {56502#(<= main_~k~0 25)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {56502#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:12,505 INFO L273 TraceCheckUtils]: 81: Hoare triple {56502#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {56512#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:12,505 INFO L273 TraceCheckUtils]: 82: Hoare triple {56512#(<= main_~k~0 26)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56512#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:12,506 INFO L273 TraceCheckUtils]: 83: Hoare triple {56512#(<= main_~k~0 26)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {56512#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:12,506 INFO L273 TraceCheckUtils]: 84: Hoare triple {56512#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {56522#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:12,507 INFO L273 TraceCheckUtils]: 85: Hoare triple {56522#(<= main_~k~0 27)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56522#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:12,507 INFO L273 TraceCheckUtils]: 86: Hoare triple {56522#(<= main_~k~0 27)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {56522#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:12,508 INFO L273 TraceCheckUtils]: 87: Hoare triple {56522#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {56532#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:12,508 INFO L273 TraceCheckUtils]: 88: Hoare triple {56532#(<= main_~k~0 28)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56532#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:12,509 INFO L273 TraceCheckUtils]: 89: Hoare triple {56532#(<= main_~k~0 28)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {56532#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:12,510 INFO L273 TraceCheckUtils]: 90: Hoare triple {56532#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {56542#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:12,510 INFO L273 TraceCheckUtils]: 91: Hoare triple {56542#(<= main_~k~0 29)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56542#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:12,511 INFO L273 TraceCheckUtils]: 92: Hoare triple {56542#(<= main_~k~0 29)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {56542#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:12,511 INFO L273 TraceCheckUtils]: 93: Hoare triple {56542#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {56552#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:12,512 INFO L273 TraceCheckUtils]: 94: Hoare triple {56552#(<= main_~k~0 30)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56552#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:12,512 INFO L273 TraceCheckUtils]: 95: Hoare triple {56552#(<= main_~k~0 30)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {56552#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:12,513 INFO L273 TraceCheckUtils]: 96: Hoare triple {56552#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {56562#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:12,513 INFO L273 TraceCheckUtils]: 97: Hoare triple {56562#(<= main_~k~0 31)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56562#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:12,514 INFO L273 TraceCheckUtils]: 98: Hoare triple {56562#(<= main_~k~0 31)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {56562#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:12,514 INFO L273 TraceCheckUtils]: 99: Hoare triple {56562#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {56572#(<= main_~k~0 32)} is VALID [2018-11-23 11:54:12,515 INFO L273 TraceCheckUtils]: 100: Hoare triple {56572#(<= main_~k~0 32)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {56572#(<= main_~k~0 32)} is VALID [2018-11-23 11:54:12,515 INFO L273 TraceCheckUtils]: 101: Hoare triple {56572#(<= main_~k~0 32)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {56572#(<= main_~k~0 32)} is VALID [2018-11-23 11:54:12,516 INFO L273 TraceCheckUtils]: 102: Hoare triple {56572#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {56582#(<= main_~k~0 33)} is VALID [2018-11-23 11:54:12,517 INFO L273 TraceCheckUtils]: 103: Hoare triple {56582#(<= main_~k~0 33)} assume !(~k~0 < 100000); {56205#false} is VALID [2018-11-23 11:54:12,517 INFO L273 TraceCheckUtils]: 104: Hoare triple {56205#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56205#false} is VALID [2018-11-23 11:54:12,517 INFO L273 TraceCheckUtils]: 105: Hoare triple {56205#false} ~x~0 := 0; {56205#false} is VALID [2018-11-23 11:54:12,517 INFO L273 TraceCheckUtils]: 106: Hoare triple {56205#false} assume !(~x~0 < ~i~0); {56205#false} is VALID [2018-11-23 11:54:12,517 INFO L273 TraceCheckUtils]: 107: Hoare triple {56205#false} ~x~0 := 0; {56205#false} is VALID [2018-11-23 11:54:12,518 INFO L273 TraceCheckUtils]: 108: Hoare triple {56205#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56205#false} is VALID [2018-11-23 11:54:12,518 INFO L256 TraceCheckUtils]: 109: Hoare triple {56205#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {56205#false} is VALID [2018-11-23 11:54:12,518 INFO L273 TraceCheckUtils]: 110: Hoare triple {56205#false} ~cond := #in~cond; {56205#false} is VALID [2018-11-23 11:54:12,518 INFO L273 TraceCheckUtils]: 111: Hoare triple {56205#false} assume !(0 == ~cond); {56205#false} is VALID [2018-11-23 11:54:12,518 INFO L273 TraceCheckUtils]: 112: Hoare triple {56205#false} assume true; {56205#false} is VALID [2018-11-23 11:54:12,519 INFO L268 TraceCheckUtils]: 113: Hoare quadruple {56205#false} {56205#false} #136#return; {56205#false} is VALID [2018-11-23 11:54:12,519 INFO L273 TraceCheckUtils]: 114: Hoare triple {56205#false} havoc #t~mem9;havoc #t~mem10; {56205#false} is VALID [2018-11-23 11:54:12,519 INFO L273 TraceCheckUtils]: 115: Hoare triple {56205#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {56205#false} is VALID [2018-11-23 11:54:12,519 INFO L273 TraceCheckUtils]: 116: Hoare triple {56205#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {56205#false} is VALID [2018-11-23 11:54:12,519 INFO L256 TraceCheckUtils]: 117: Hoare triple {56205#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {56205#false} is VALID [2018-11-23 11:54:12,519 INFO L273 TraceCheckUtils]: 118: Hoare triple {56205#false} ~cond := #in~cond; {56205#false} is VALID [2018-11-23 11:54:12,519 INFO L273 TraceCheckUtils]: 119: Hoare triple {56205#false} assume 0 == ~cond; {56205#false} is VALID [2018-11-23 11:54:12,520 INFO L273 TraceCheckUtils]: 120: Hoare triple {56205#false} assume !false; {56205#false} is VALID [2018-11-23 11:54:12,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1524 backedges. 0 proven. 1520 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:54:12,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:12,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 70 [2018-11-23 11:54:12,549 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 121 [2018-11-23 11:54:12,550 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:12,550 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 70 states. [2018-11-23 11:54:12,775 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 222 edges. 222 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:12,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-11-23 11:54:12,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-11-23 11:54:12,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1821, Invalid=3009, Unknown=0, NotChecked=0, Total=4830 [2018-11-23 11:54:12,777 INFO L87 Difference]: Start difference. First operand 425 states and 618 transitions. Second operand 70 states. [2018-11-23 11:54:14,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:14,578 INFO L93 Difference]: Finished difference Result 666 states and 995 transitions. [2018-11-23 11:54:14,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-23 11:54:14,578 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 121 [2018-11-23 11:54:14,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:14,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 11:54:14,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 239 transitions. [2018-11-23 11:54:14,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 11:54:14,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 239 transitions. [2018-11-23 11:54:14,582 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 239 transitions. [2018-11-23 11:54:14,836 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 239 edges. 239 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:14,848 INFO L225 Difference]: With dead ends: 666 [2018-11-23 11:54:14,849 INFO L226 Difference]: Without dead ends: 440 [2018-11-23 11:54:14,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1684 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1821, Invalid=3009, Unknown=0, NotChecked=0, Total=4830 [2018-11-23 11:54:14,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-11-23 11:54:15,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 431. [2018-11-23 11:54:15,474 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:15,475 INFO L82 GeneralOperation]: Start isEquivalent. First operand 440 states. Second operand 431 states. [2018-11-23 11:54:15,475 INFO L74 IsIncluded]: Start isIncluded. First operand 440 states. Second operand 431 states. [2018-11-23 11:54:15,475 INFO L87 Difference]: Start difference. First operand 440 states. Second operand 431 states. [2018-11-23 11:54:15,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:15,484 INFO L93 Difference]: Finished difference Result 440 states and 639 transitions. [2018-11-23 11:54:15,484 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 639 transitions. [2018-11-23 11:54:15,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:15,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:15,485 INFO L74 IsIncluded]: Start isIncluded. First operand 431 states. Second operand 440 states. [2018-11-23 11:54:15,485 INFO L87 Difference]: Start difference. First operand 431 states. Second operand 440 states. [2018-11-23 11:54:15,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:15,494 INFO L93 Difference]: Finished difference Result 440 states and 639 transitions. [2018-11-23 11:54:15,494 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 639 transitions. [2018-11-23 11:54:15,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:15,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:15,495 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:15,495 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:15,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2018-11-23 11:54:15,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 626 transitions. [2018-11-23 11:54:15,505 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 626 transitions. Word has length 121 [2018-11-23 11:54:15,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:15,505 INFO L480 AbstractCegarLoop]: Abstraction has 431 states and 626 transitions. [2018-11-23 11:54:15,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-11-23 11:54:15,505 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 626 transitions. [2018-11-23 11:54:15,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-23 11:54:15,506 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:15,506 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 33, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:15,506 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:15,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:15,506 INFO L82 PathProgramCache]: Analyzing trace with hash -433813775, now seen corresponding path program 29 times [2018-11-23 11:54:15,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:15,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:15,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:15,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:15,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:15,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:18,422 INFO L256 TraceCheckUtils]: 0: Hoare triple {58996#true} call ULTIMATE.init(); {58996#true} is VALID [2018-11-23 11:54:18,422 INFO L273 TraceCheckUtils]: 1: Hoare triple {58996#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {58996#true} is VALID [2018-11-23 11:54:18,422 INFO L273 TraceCheckUtils]: 2: Hoare triple {58996#true} assume true; {58996#true} is VALID [2018-11-23 11:54:18,422 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {58996#true} {58996#true} #130#return; {58996#true} is VALID [2018-11-23 11:54:18,423 INFO L256 TraceCheckUtils]: 4: Hoare triple {58996#true} call #t~ret15 := main(); {58996#true} is VALID [2018-11-23 11:54:18,423 INFO L273 TraceCheckUtils]: 5: Hoare triple {58996#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {58998#(= main_~i~0 0)} is VALID [2018-11-23 11:54:18,423 INFO L273 TraceCheckUtils]: 6: Hoare triple {58998#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {58999#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,424 INFO L273 TraceCheckUtils]: 7: Hoare triple {58999#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {58999#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,424 INFO L273 TraceCheckUtils]: 8: Hoare triple {58999#(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; {58999#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,425 INFO L273 TraceCheckUtils]: 9: Hoare triple {58999#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {59000#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,425 INFO L273 TraceCheckUtils]: 10: Hoare triple {59000#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59000#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,426 INFO L273 TraceCheckUtils]: 11: Hoare triple {59000#(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; {59000#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,427 INFO L273 TraceCheckUtils]: 12: Hoare triple {59000#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {59001#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,428 INFO L273 TraceCheckUtils]: 13: Hoare triple {59001#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59001#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,428 INFO L273 TraceCheckUtils]: 14: Hoare triple {59001#(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; {59001#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,429 INFO L273 TraceCheckUtils]: 15: Hoare triple {59001#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {59002#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,430 INFO L273 TraceCheckUtils]: 16: Hoare triple {59002#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59002#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,431 INFO L273 TraceCheckUtils]: 17: Hoare triple {59002#(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; {59002#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,432 INFO L273 TraceCheckUtils]: 18: Hoare triple {59002#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {59003#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,433 INFO L273 TraceCheckUtils]: 19: Hoare triple {59003#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59003#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,433 INFO L273 TraceCheckUtils]: 20: Hoare triple {59003#(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; {59003#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,434 INFO L273 TraceCheckUtils]: 21: Hoare triple {59003#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {59004#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,435 INFO L273 TraceCheckUtils]: 22: Hoare triple {59004#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59004#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,436 INFO L273 TraceCheckUtils]: 23: Hoare triple {59004#(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; {59004#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,436 INFO L273 TraceCheckUtils]: 24: Hoare triple {59004#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {59005#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,437 INFO L273 TraceCheckUtils]: 25: Hoare triple {59005#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59005#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,438 INFO L273 TraceCheckUtils]: 26: Hoare triple {59005#(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; {59005#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,439 INFO L273 TraceCheckUtils]: 27: Hoare triple {59005#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {59006#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,440 INFO L273 TraceCheckUtils]: 28: Hoare triple {59006#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59006#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,440 INFO L273 TraceCheckUtils]: 29: Hoare triple {59006#(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; {59006#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,441 INFO L273 TraceCheckUtils]: 30: Hoare triple {59006#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {59007#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,442 INFO L273 TraceCheckUtils]: 31: Hoare triple {59007#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59007#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,443 INFO L273 TraceCheckUtils]: 32: Hoare triple {59007#(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; {59007#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,444 INFO L273 TraceCheckUtils]: 33: Hoare triple {59007#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {59008#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,444 INFO L273 TraceCheckUtils]: 34: Hoare triple {59008#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59008#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,445 INFO L273 TraceCheckUtils]: 35: Hoare triple {59008#(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; {59008#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,446 INFO L273 TraceCheckUtils]: 36: Hoare triple {59008#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {59009#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,447 INFO L273 TraceCheckUtils]: 37: Hoare triple {59009#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59009#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,448 INFO L273 TraceCheckUtils]: 38: Hoare triple {59009#(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; {59009#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,449 INFO L273 TraceCheckUtils]: 39: Hoare triple {59009#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {59010#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,449 INFO L273 TraceCheckUtils]: 40: Hoare triple {59010#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59010#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,450 INFO L273 TraceCheckUtils]: 41: Hoare triple {59010#(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; {59010#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,451 INFO L273 TraceCheckUtils]: 42: Hoare triple {59010#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {59011#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,452 INFO L273 TraceCheckUtils]: 43: Hoare triple {59011#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59011#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,452 INFO L273 TraceCheckUtils]: 44: Hoare triple {59011#(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; {59011#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,453 INFO L273 TraceCheckUtils]: 45: Hoare triple {59011#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {59012#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,454 INFO L273 TraceCheckUtils]: 46: Hoare triple {59012#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59012#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,455 INFO L273 TraceCheckUtils]: 47: Hoare triple {59012#(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; {59012#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,456 INFO L273 TraceCheckUtils]: 48: Hoare triple {59012#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {59013#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,456 INFO L273 TraceCheckUtils]: 49: Hoare triple {59013#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59013#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,457 INFO L273 TraceCheckUtils]: 50: Hoare triple {59013#(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; {59013#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,458 INFO L273 TraceCheckUtils]: 51: Hoare triple {59013#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {59014#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,459 INFO L273 TraceCheckUtils]: 52: Hoare triple {59014#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59014#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,460 INFO L273 TraceCheckUtils]: 53: Hoare triple {59014#(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; {59014#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,461 INFO L273 TraceCheckUtils]: 54: Hoare triple {59014#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {59015#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:54:18,461 INFO L273 TraceCheckUtils]: 55: Hoare triple {59015#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59015#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:54:18,462 INFO L273 TraceCheckUtils]: 56: Hoare triple {59015#(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; {59015#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:54:18,463 INFO L273 TraceCheckUtils]: 57: Hoare triple {59015#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} ~k~0 := 1 + ~k~0; {59016#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,464 INFO L273 TraceCheckUtils]: 58: Hoare triple {59016#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59016#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,465 INFO L273 TraceCheckUtils]: 59: Hoare triple {59016#(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; {59016#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,465 INFO L273 TraceCheckUtils]: 60: Hoare triple {59016#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {59017#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,466 INFO L273 TraceCheckUtils]: 61: Hoare triple {59017#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59017#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,467 INFO L273 TraceCheckUtils]: 62: Hoare triple {59017#(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; {59017#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,468 INFO L273 TraceCheckUtils]: 63: Hoare triple {59017#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {59018#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,469 INFO L273 TraceCheckUtils]: 64: Hoare triple {59018#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59018#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,469 INFO L273 TraceCheckUtils]: 65: Hoare triple {59018#(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; {59018#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,470 INFO L273 TraceCheckUtils]: 66: Hoare triple {59018#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {59019#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,471 INFO L273 TraceCheckUtils]: 67: Hoare triple {59019#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59019#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,471 INFO L273 TraceCheckUtils]: 68: Hoare triple {59019#(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; {59019#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,472 INFO L273 TraceCheckUtils]: 69: Hoare triple {59019#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {59020#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,473 INFO L273 TraceCheckUtils]: 70: Hoare triple {59020#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59020#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,474 INFO L273 TraceCheckUtils]: 71: Hoare triple {59020#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {59020#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,475 INFO L273 TraceCheckUtils]: 72: Hoare triple {59020#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {59021#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,475 INFO L273 TraceCheckUtils]: 73: Hoare triple {59021#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59021#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,476 INFO L273 TraceCheckUtils]: 74: Hoare triple {59021#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {59021#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,477 INFO L273 TraceCheckUtils]: 75: Hoare triple {59021#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {59022#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,478 INFO L273 TraceCheckUtils]: 76: Hoare triple {59022#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59022#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,479 INFO L273 TraceCheckUtils]: 77: Hoare triple {59022#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {59022#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,479 INFO L273 TraceCheckUtils]: 78: Hoare triple {59022#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {59023#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,480 INFO L273 TraceCheckUtils]: 79: Hoare triple {59023#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59023#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,481 INFO L273 TraceCheckUtils]: 80: Hoare triple {59023#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {59023#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,482 INFO L273 TraceCheckUtils]: 81: Hoare triple {59023#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {59024#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,483 INFO L273 TraceCheckUtils]: 82: Hoare triple {59024#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59024#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,483 INFO L273 TraceCheckUtils]: 83: Hoare triple {59024#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {59024#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,484 INFO L273 TraceCheckUtils]: 84: Hoare triple {59024#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {59025#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,485 INFO L273 TraceCheckUtils]: 85: Hoare triple {59025#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59025#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,486 INFO L273 TraceCheckUtils]: 86: Hoare triple {59025#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {59025#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,487 INFO L273 TraceCheckUtils]: 87: Hoare triple {59025#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {59026#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,488 INFO L273 TraceCheckUtils]: 88: Hoare triple {59026#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59026#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,488 INFO L273 TraceCheckUtils]: 89: Hoare triple {59026#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {59026#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,489 INFO L273 TraceCheckUtils]: 90: Hoare triple {59026#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {59027#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,490 INFO L273 TraceCheckUtils]: 91: Hoare triple {59027#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59027#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,491 INFO L273 TraceCheckUtils]: 92: Hoare triple {59027#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {59027#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,492 INFO L273 TraceCheckUtils]: 93: Hoare triple {59027#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {59028#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,493 INFO L273 TraceCheckUtils]: 94: Hoare triple {59028#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59028#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,493 INFO L273 TraceCheckUtils]: 95: Hoare triple {59028#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {59028#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,494 INFO L273 TraceCheckUtils]: 96: Hoare triple {59028#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {59029#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,495 INFO L273 TraceCheckUtils]: 97: Hoare triple {59029#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59029#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,496 INFO L273 TraceCheckUtils]: 98: Hoare triple {59029#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {59029#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,497 INFO L273 TraceCheckUtils]: 99: Hoare triple {59029#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {59030#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,498 INFO L273 TraceCheckUtils]: 100: Hoare triple {59030#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59030#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,498 INFO L273 TraceCheckUtils]: 101: Hoare triple {59030#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {59030#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,499 INFO L273 TraceCheckUtils]: 102: Hoare triple {59030#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {59031#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,500 INFO L273 TraceCheckUtils]: 103: Hoare triple {59031#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59031#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,501 INFO L273 TraceCheckUtils]: 104: Hoare triple {59031#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {59031#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,502 INFO L273 TraceCheckUtils]: 105: Hoare triple {59031#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {59032#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:18,502 INFO L273 TraceCheckUtils]: 106: Hoare triple {59032#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} assume !(~k~0 < 100000); {58997#false} is VALID [2018-11-23 11:54:18,503 INFO L273 TraceCheckUtils]: 107: Hoare triple {58997#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58997#false} is VALID [2018-11-23 11:54:18,503 INFO L273 TraceCheckUtils]: 108: Hoare triple {58997#false} ~x~0 := 0; {58997#false} is VALID [2018-11-23 11:54:18,503 INFO L273 TraceCheckUtils]: 109: Hoare triple {58997#false} assume !(~x~0 < ~i~0); {58997#false} is VALID [2018-11-23 11:54:18,503 INFO L273 TraceCheckUtils]: 110: Hoare triple {58997#false} ~x~0 := 0; {58997#false} is VALID [2018-11-23 11:54:18,503 INFO L273 TraceCheckUtils]: 111: Hoare triple {58997#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58997#false} is VALID [2018-11-23 11:54:18,504 INFO L256 TraceCheckUtils]: 112: Hoare triple {58997#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {58996#true} is VALID [2018-11-23 11:54:18,504 INFO L273 TraceCheckUtils]: 113: Hoare triple {58996#true} ~cond := #in~cond; {58996#true} is VALID [2018-11-23 11:54:18,504 INFO L273 TraceCheckUtils]: 114: Hoare triple {58996#true} assume !(0 == ~cond); {58996#true} is VALID [2018-11-23 11:54:18,504 INFO L273 TraceCheckUtils]: 115: Hoare triple {58996#true} assume true; {58996#true} is VALID [2018-11-23 11:54:18,504 INFO L268 TraceCheckUtils]: 116: Hoare quadruple {58996#true} {58997#false} #136#return; {58997#false} is VALID [2018-11-23 11:54:18,505 INFO L273 TraceCheckUtils]: 117: Hoare triple {58997#false} havoc #t~mem9;havoc #t~mem10; {58997#false} is VALID [2018-11-23 11:54:18,505 INFO L273 TraceCheckUtils]: 118: Hoare triple {58997#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {58997#false} is VALID [2018-11-23 11:54:18,505 INFO L273 TraceCheckUtils]: 119: Hoare triple {58997#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58997#false} is VALID [2018-11-23 11:54:18,505 INFO L256 TraceCheckUtils]: 120: Hoare triple {58997#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {58997#false} is VALID [2018-11-23 11:54:18,505 INFO L273 TraceCheckUtils]: 121: Hoare triple {58997#false} ~cond := #in~cond; {58997#false} is VALID [2018-11-23 11:54:18,505 INFO L273 TraceCheckUtils]: 122: Hoare triple {58997#false} assume 0 == ~cond; {58997#false} is VALID [2018-11-23 11:54:18,506 INFO L273 TraceCheckUtils]: 123: Hoare triple {58997#false} assume !false; {58997#false} is VALID [2018-11-23 11:54:18,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1621 backedges. 2 proven. 1617 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:54:18,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:18,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 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:54:18,542 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:54:18,658 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 34 check-sat command(s) [2018-11-23 11:54:18,658 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:18,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:18,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:19,839 INFO L256 TraceCheckUtils]: 0: Hoare triple {58996#true} call ULTIMATE.init(); {58996#true} is VALID [2018-11-23 11:54:19,839 INFO L273 TraceCheckUtils]: 1: Hoare triple {58996#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {58996#true} is VALID [2018-11-23 11:54:19,839 INFO L273 TraceCheckUtils]: 2: Hoare triple {58996#true} assume true; {58996#true} is VALID [2018-11-23 11:54:19,839 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {58996#true} {58996#true} #130#return; {58996#true} is VALID [2018-11-23 11:54:19,839 INFO L256 TraceCheckUtils]: 4: Hoare triple {58996#true} call #t~ret15 := main(); {58996#true} is VALID [2018-11-23 11:54:19,840 INFO L273 TraceCheckUtils]: 5: Hoare triple {58996#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {59051#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:19,840 INFO L273 TraceCheckUtils]: 6: Hoare triple {59051#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {59055#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:19,841 INFO L273 TraceCheckUtils]: 7: Hoare triple {59055#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59055#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:19,841 INFO L273 TraceCheckUtils]: 8: Hoare triple {59055#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {59055#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:19,842 INFO L273 TraceCheckUtils]: 9: Hoare triple {59055#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {59065#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:19,842 INFO L273 TraceCheckUtils]: 10: Hoare triple {59065#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59065#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:19,842 INFO L273 TraceCheckUtils]: 11: Hoare triple {59065#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {59065#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:19,843 INFO L273 TraceCheckUtils]: 12: Hoare triple {59065#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {59075#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:19,843 INFO L273 TraceCheckUtils]: 13: Hoare triple {59075#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59075#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:19,843 INFO L273 TraceCheckUtils]: 14: Hoare triple {59075#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {59075#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:19,844 INFO L273 TraceCheckUtils]: 15: Hoare triple {59075#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {59085#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:19,844 INFO L273 TraceCheckUtils]: 16: Hoare triple {59085#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59085#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:19,845 INFO L273 TraceCheckUtils]: 17: Hoare triple {59085#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {59085#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:19,846 INFO L273 TraceCheckUtils]: 18: Hoare triple {59085#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {59095#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:19,846 INFO L273 TraceCheckUtils]: 19: Hoare triple {59095#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59095#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:19,846 INFO L273 TraceCheckUtils]: 20: Hoare triple {59095#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {59095#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:19,847 INFO L273 TraceCheckUtils]: 21: Hoare triple {59095#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {59105#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:19,848 INFO L273 TraceCheckUtils]: 22: Hoare triple {59105#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59105#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:19,848 INFO L273 TraceCheckUtils]: 23: Hoare triple {59105#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {59105#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:19,849 INFO L273 TraceCheckUtils]: 24: Hoare triple {59105#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {59115#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:19,849 INFO L273 TraceCheckUtils]: 25: Hoare triple {59115#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59115#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:19,850 INFO L273 TraceCheckUtils]: 26: Hoare triple {59115#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {59115#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:19,851 INFO L273 TraceCheckUtils]: 27: Hoare triple {59115#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {59125#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:19,851 INFO L273 TraceCheckUtils]: 28: Hoare triple {59125#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59125#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:19,852 INFO L273 TraceCheckUtils]: 29: Hoare triple {59125#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {59125#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:19,852 INFO L273 TraceCheckUtils]: 30: Hoare triple {59125#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {59135#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:19,853 INFO L273 TraceCheckUtils]: 31: Hoare triple {59135#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59135#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:19,853 INFO L273 TraceCheckUtils]: 32: Hoare triple {59135#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {59135#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:19,854 INFO L273 TraceCheckUtils]: 33: Hoare triple {59135#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {59145#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:19,855 INFO L273 TraceCheckUtils]: 34: Hoare triple {59145#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59145#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:19,855 INFO L273 TraceCheckUtils]: 35: Hoare triple {59145#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {59145#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:19,856 INFO L273 TraceCheckUtils]: 36: Hoare triple {59145#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {59155#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:19,856 INFO L273 TraceCheckUtils]: 37: Hoare triple {59155#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59155#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:19,857 INFO L273 TraceCheckUtils]: 38: Hoare triple {59155#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {59155#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:19,858 INFO L273 TraceCheckUtils]: 39: Hoare triple {59155#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {59165#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:19,858 INFO L273 TraceCheckUtils]: 40: Hoare triple {59165#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59165#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:19,859 INFO L273 TraceCheckUtils]: 41: Hoare triple {59165#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {59165#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:19,859 INFO L273 TraceCheckUtils]: 42: Hoare triple {59165#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {59175#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:19,860 INFO L273 TraceCheckUtils]: 43: Hoare triple {59175#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59175#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:19,860 INFO L273 TraceCheckUtils]: 44: Hoare triple {59175#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {59175#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:19,861 INFO L273 TraceCheckUtils]: 45: Hoare triple {59175#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {59185#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:19,862 INFO L273 TraceCheckUtils]: 46: Hoare triple {59185#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59185#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:19,862 INFO L273 TraceCheckUtils]: 47: Hoare triple {59185#(<= main_~k~0 14)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {59185#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:19,863 INFO L273 TraceCheckUtils]: 48: Hoare triple {59185#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {59195#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:19,863 INFO L273 TraceCheckUtils]: 49: Hoare triple {59195#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59195#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:19,884 INFO L273 TraceCheckUtils]: 50: Hoare triple {59195#(<= main_~k~0 15)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {59195#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:19,895 INFO L273 TraceCheckUtils]: 51: Hoare triple {59195#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {59205#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:19,895 INFO L273 TraceCheckUtils]: 52: Hoare triple {59205#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59205#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:19,896 INFO L273 TraceCheckUtils]: 53: Hoare triple {59205#(<= main_~k~0 16)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {59205#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:19,896 INFO L273 TraceCheckUtils]: 54: Hoare triple {59205#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {59215#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:19,896 INFO L273 TraceCheckUtils]: 55: Hoare triple {59215#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59215#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:19,897 INFO L273 TraceCheckUtils]: 56: Hoare triple {59215#(<= main_~k~0 17)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {59215#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:19,897 INFO L273 TraceCheckUtils]: 57: Hoare triple {59215#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {59225#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:19,897 INFO L273 TraceCheckUtils]: 58: Hoare triple {59225#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59225#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:19,898 INFO L273 TraceCheckUtils]: 59: Hoare triple {59225#(<= main_~k~0 18)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {59225#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:19,898 INFO L273 TraceCheckUtils]: 60: Hoare triple {59225#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {59235#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:19,899 INFO L273 TraceCheckUtils]: 61: Hoare triple {59235#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59235#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:19,899 INFO L273 TraceCheckUtils]: 62: Hoare triple {59235#(<= main_~k~0 19)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {59235#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:19,900 INFO L273 TraceCheckUtils]: 63: Hoare triple {59235#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {59245#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:19,900 INFO L273 TraceCheckUtils]: 64: Hoare triple {59245#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59245#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:19,901 INFO L273 TraceCheckUtils]: 65: Hoare triple {59245#(<= main_~k~0 20)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {59245#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:19,901 INFO L273 TraceCheckUtils]: 66: Hoare triple {59245#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {59255#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:19,902 INFO L273 TraceCheckUtils]: 67: Hoare triple {59255#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59255#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:19,902 INFO L273 TraceCheckUtils]: 68: Hoare triple {59255#(<= main_~k~0 21)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {59255#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:19,903 INFO L273 TraceCheckUtils]: 69: Hoare triple {59255#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {59265#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:19,904 INFO L273 TraceCheckUtils]: 70: Hoare triple {59265#(<= main_~k~0 22)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59265#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:19,904 INFO L273 TraceCheckUtils]: 71: Hoare triple {59265#(<= main_~k~0 22)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {59265#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:19,905 INFO L273 TraceCheckUtils]: 72: Hoare triple {59265#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {59275#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:19,905 INFO L273 TraceCheckUtils]: 73: Hoare triple {59275#(<= main_~k~0 23)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59275#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:19,906 INFO L273 TraceCheckUtils]: 74: Hoare triple {59275#(<= main_~k~0 23)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {59275#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:19,906 INFO L273 TraceCheckUtils]: 75: Hoare triple {59275#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {59285#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:19,907 INFO L273 TraceCheckUtils]: 76: Hoare triple {59285#(<= main_~k~0 24)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59285#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:19,907 INFO L273 TraceCheckUtils]: 77: Hoare triple {59285#(<= main_~k~0 24)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {59285#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:19,908 INFO L273 TraceCheckUtils]: 78: Hoare triple {59285#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {59295#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:19,909 INFO L273 TraceCheckUtils]: 79: Hoare triple {59295#(<= main_~k~0 25)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59295#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:19,909 INFO L273 TraceCheckUtils]: 80: Hoare triple {59295#(<= main_~k~0 25)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {59295#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:19,910 INFO L273 TraceCheckUtils]: 81: Hoare triple {59295#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {59305#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:19,910 INFO L273 TraceCheckUtils]: 82: Hoare triple {59305#(<= main_~k~0 26)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59305#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:19,911 INFO L273 TraceCheckUtils]: 83: Hoare triple {59305#(<= main_~k~0 26)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {59305#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:19,912 INFO L273 TraceCheckUtils]: 84: Hoare triple {59305#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {59315#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:19,912 INFO L273 TraceCheckUtils]: 85: Hoare triple {59315#(<= main_~k~0 27)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59315#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:19,912 INFO L273 TraceCheckUtils]: 86: Hoare triple {59315#(<= main_~k~0 27)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {59315#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:19,913 INFO L273 TraceCheckUtils]: 87: Hoare triple {59315#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {59325#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:19,914 INFO L273 TraceCheckUtils]: 88: Hoare triple {59325#(<= main_~k~0 28)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59325#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:19,914 INFO L273 TraceCheckUtils]: 89: Hoare triple {59325#(<= main_~k~0 28)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {59325#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:19,915 INFO L273 TraceCheckUtils]: 90: Hoare triple {59325#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {59335#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:19,915 INFO L273 TraceCheckUtils]: 91: Hoare triple {59335#(<= main_~k~0 29)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59335#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:19,916 INFO L273 TraceCheckUtils]: 92: Hoare triple {59335#(<= main_~k~0 29)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {59335#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:19,916 INFO L273 TraceCheckUtils]: 93: Hoare triple {59335#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {59345#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:19,917 INFO L273 TraceCheckUtils]: 94: Hoare triple {59345#(<= main_~k~0 30)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59345#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:19,917 INFO L273 TraceCheckUtils]: 95: Hoare triple {59345#(<= main_~k~0 30)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {59345#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:19,918 INFO L273 TraceCheckUtils]: 96: Hoare triple {59345#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {59355#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:19,919 INFO L273 TraceCheckUtils]: 97: Hoare triple {59355#(<= main_~k~0 31)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59355#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:19,919 INFO L273 TraceCheckUtils]: 98: Hoare triple {59355#(<= main_~k~0 31)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {59355#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:19,920 INFO L273 TraceCheckUtils]: 99: Hoare triple {59355#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {59365#(<= main_~k~0 32)} is VALID [2018-11-23 11:54:19,920 INFO L273 TraceCheckUtils]: 100: Hoare triple {59365#(<= main_~k~0 32)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59365#(<= main_~k~0 32)} is VALID [2018-11-23 11:54:19,921 INFO L273 TraceCheckUtils]: 101: Hoare triple {59365#(<= main_~k~0 32)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {59365#(<= main_~k~0 32)} is VALID [2018-11-23 11:54:19,922 INFO L273 TraceCheckUtils]: 102: Hoare triple {59365#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {59375#(<= main_~k~0 33)} is VALID [2018-11-23 11:54:19,922 INFO L273 TraceCheckUtils]: 103: Hoare triple {59375#(<= main_~k~0 33)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {59375#(<= main_~k~0 33)} is VALID [2018-11-23 11:54:19,923 INFO L273 TraceCheckUtils]: 104: Hoare triple {59375#(<= main_~k~0 33)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {59375#(<= main_~k~0 33)} is VALID [2018-11-23 11:54:19,923 INFO L273 TraceCheckUtils]: 105: Hoare triple {59375#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {59385#(<= main_~k~0 34)} is VALID [2018-11-23 11:54:19,924 INFO L273 TraceCheckUtils]: 106: Hoare triple {59385#(<= main_~k~0 34)} assume !(~k~0 < 100000); {58997#false} is VALID [2018-11-23 11:54:19,924 INFO L273 TraceCheckUtils]: 107: Hoare triple {58997#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58997#false} is VALID [2018-11-23 11:54:19,924 INFO L273 TraceCheckUtils]: 108: Hoare triple {58997#false} ~x~0 := 0; {58997#false} is VALID [2018-11-23 11:54:19,924 INFO L273 TraceCheckUtils]: 109: Hoare triple {58997#false} assume !(~x~0 < ~i~0); {58997#false} is VALID [2018-11-23 11:54:19,925 INFO L273 TraceCheckUtils]: 110: Hoare triple {58997#false} ~x~0 := 0; {58997#false} is VALID [2018-11-23 11:54:19,925 INFO L273 TraceCheckUtils]: 111: Hoare triple {58997#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58997#false} is VALID [2018-11-23 11:54:19,925 INFO L256 TraceCheckUtils]: 112: Hoare triple {58997#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {58997#false} is VALID [2018-11-23 11:54:19,925 INFO L273 TraceCheckUtils]: 113: Hoare triple {58997#false} ~cond := #in~cond; {58997#false} is VALID [2018-11-23 11:54:19,925 INFO L273 TraceCheckUtils]: 114: Hoare triple {58997#false} assume !(0 == ~cond); {58997#false} is VALID [2018-11-23 11:54:19,926 INFO L273 TraceCheckUtils]: 115: Hoare triple {58997#false} assume true; {58997#false} is VALID [2018-11-23 11:54:19,926 INFO L268 TraceCheckUtils]: 116: Hoare quadruple {58997#false} {58997#false} #136#return; {58997#false} is VALID [2018-11-23 11:54:19,926 INFO L273 TraceCheckUtils]: 117: Hoare triple {58997#false} havoc #t~mem9;havoc #t~mem10; {58997#false} is VALID [2018-11-23 11:54:19,926 INFO L273 TraceCheckUtils]: 118: Hoare triple {58997#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {58997#false} is VALID [2018-11-23 11:54:19,926 INFO L273 TraceCheckUtils]: 119: Hoare triple {58997#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58997#false} is VALID [2018-11-23 11:54:19,926 INFO L256 TraceCheckUtils]: 120: Hoare triple {58997#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {58997#false} is VALID [2018-11-23 11:54:19,926 INFO L273 TraceCheckUtils]: 121: Hoare triple {58997#false} ~cond := #in~cond; {58997#false} is VALID [2018-11-23 11:54:19,927 INFO L273 TraceCheckUtils]: 122: Hoare triple {58997#false} assume 0 == ~cond; {58997#false} is VALID [2018-11-23 11:54:19,927 INFO L273 TraceCheckUtils]: 123: Hoare triple {58997#false} assume !false; {58997#false} is VALID [2018-11-23 11:54:19,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1621 backedges. 0 proven. 1617 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:54:19,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:19,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 72 [2018-11-23 11:54:19,958 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 124 [2018-11-23 11:54:19,958 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:19,958 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 72 states. [2018-11-23 11:54:20,186 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 228 edges. 228 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:20,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-11-23 11:54:20,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-11-23 11:54:20,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1927, Invalid=3185, Unknown=0, NotChecked=0, Total=5112 [2018-11-23 11:54:20,188 INFO L87 Difference]: Start difference. First operand 431 states and 626 transitions. Second operand 72 states. [2018-11-23 11:54:22,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:22,985 INFO L93 Difference]: Finished difference Result 672 states and 1003 transitions. [2018-11-23 11:54:22,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-23 11:54:22,985 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 124 [2018-11-23 11:54:22,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:22,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-23 11:54:22,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 243 transitions. [2018-11-23 11:54:22,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-23 11:54:22,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 243 transitions. [2018-11-23 11:54:22,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 243 transitions. [2018-11-23 11:54:23,234 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 243 edges. 243 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:23,246 INFO L225 Difference]: With dead ends: 672 [2018-11-23 11:54:23,247 INFO L226 Difference]: Without dead ends: 446 [2018-11-23 11:54:23,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1786 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1927, Invalid=3185, Unknown=0, NotChecked=0, Total=5112 [2018-11-23 11:54:23,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2018-11-23 11:54:24,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 437. [2018-11-23 11:54:24,100 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:24,100 INFO L82 GeneralOperation]: Start isEquivalent. First operand 446 states. Second operand 437 states. [2018-11-23 11:54:24,100 INFO L74 IsIncluded]: Start isIncluded. First operand 446 states. Second operand 437 states. [2018-11-23 11:54:24,100 INFO L87 Difference]: Start difference. First operand 446 states. Second operand 437 states. [2018-11-23 11:54:24,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:24,111 INFO L93 Difference]: Finished difference Result 446 states and 647 transitions. [2018-11-23 11:54:24,137 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 647 transitions. [2018-11-23 11:54:24,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:24,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:24,138 INFO L74 IsIncluded]: Start isIncluded. First operand 437 states. Second operand 446 states. [2018-11-23 11:54:24,138 INFO L87 Difference]: Start difference. First operand 437 states. Second operand 446 states. [2018-11-23 11:54:24,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:24,149 INFO L93 Difference]: Finished difference Result 446 states and 647 transitions. [2018-11-23 11:54:24,149 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 647 transitions. [2018-11-23 11:54:24,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:24,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:24,150 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:24,150 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:24,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2018-11-23 11:54:24,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 634 transitions. [2018-11-23 11:54:24,160 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 634 transitions. Word has length 124 [2018-11-23 11:54:24,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:24,160 INFO L480 AbstractCegarLoop]: Abstraction has 437 states and 634 transitions. [2018-11-23 11:54:24,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-11-23 11:54:24,161 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 634 transitions. [2018-11-23 11:54:24,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-23 11:54:24,161 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:24,161 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 34, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:24,161 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:24,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:24,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1353341972, now seen corresponding path program 30 times [2018-11-23 11:54:24,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:24,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:24,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:24,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:24,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:24,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:27,329 INFO L256 TraceCheckUtils]: 0: Hoare triple {61827#true} call ULTIMATE.init(); {61827#true} is VALID [2018-11-23 11:54:27,329 INFO L273 TraceCheckUtils]: 1: Hoare triple {61827#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {61827#true} is VALID [2018-11-23 11:54:27,330 INFO L273 TraceCheckUtils]: 2: Hoare triple {61827#true} assume true; {61827#true} is VALID [2018-11-23 11:54:27,330 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {61827#true} {61827#true} #130#return; {61827#true} is VALID [2018-11-23 11:54:27,330 INFO L256 TraceCheckUtils]: 4: Hoare triple {61827#true} call #t~ret15 := main(); {61827#true} is VALID [2018-11-23 11:54:27,331 INFO L273 TraceCheckUtils]: 5: Hoare triple {61827#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {61829#(= main_~i~0 0)} is VALID [2018-11-23 11:54:27,331 INFO L273 TraceCheckUtils]: 6: Hoare triple {61829#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {61830#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,332 INFO L273 TraceCheckUtils]: 7: Hoare triple {61830#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {61830#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,332 INFO L273 TraceCheckUtils]: 8: Hoare triple {61830#(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; {61830#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,333 INFO L273 TraceCheckUtils]: 9: Hoare triple {61830#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {61831#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,333 INFO L273 TraceCheckUtils]: 10: Hoare triple {61831#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {61831#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,334 INFO L273 TraceCheckUtils]: 11: Hoare triple {61831#(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; {61831#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,335 INFO L273 TraceCheckUtils]: 12: Hoare triple {61831#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {61832#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,336 INFO L273 TraceCheckUtils]: 13: Hoare triple {61832#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {61832#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,336 INFO L273 TraceCheckUtils]: 14: Hoare triple {61832#(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; {61832#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,337 INFO L273 TraceCheckUtils]: 15: Hoare triple {61832#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {61833#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,338 INFO L273 TraceCheckUtils]: 16: Hoare triple {61833#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {61833#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,339 INFO L273 TraceCheckUtils]: 17: Hoare triple {61833#(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; {61833#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,340 INFO L273 TraceCheckUtils]: 18: Hoare triple {61833#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {61834#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,341 INFO L273 TraceCheckUtils]: 19: Hoare triple {61834#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {61834#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,341 INFO L273 TraceCheckUtils]: 20: Hoare triple {61834#(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; {61834#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,342 INFO L273 TraceCheckUtils]: 21: Hoare triple {61834#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {61835#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,343 INFO L273 TraceCheckUtils]: 22: Hoare triple {61835#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {61835#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,344 INFO L273 TraceCheckUtils]: 23: Hoare triple {61835#(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; {61835#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,345 INFO L273 TraceCheckUtils]: 24: Hoare triple {61835#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {61836#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,346 INFO L273 TraceCheckUtils]: 25: Hoare triple {61836#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {61836#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,346 INFO L273 TraceCheckUtils]: 26: Hoare triple {61836#(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; {61836#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,347 INFO L273 TraceCheckUtils]: 27: Hoare triple {61836#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {61837#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,348 INFO L273 TraceCheckUtils]: 28: Hoare triple {61837#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {61837#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,349 INFO L273 TraceCheckUtils]: 29: Hoare triple {61837#(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; {61837#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,349 INFO L273 TraceCheckUtils]: 30: Hoare triple {61837#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {61838#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,350 INFO L273 TraceCheckUtils]: 31: Hoare triple {61838#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {61838#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,351 INFO L273 TraceCheckUtils]: 32: Hoare triple {61838#(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; {61838#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,352 INFO L273 TraceCheckUtils]: 33: Hoare triple {61838#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {61839#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,353 INFO L273 TraceCheckUtils]: 34: Hoare triple {61839#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {61839#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,353 INFO L273 TraceCheckUtils]: 35: Hoare triple {61839#(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; {61839#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,354 INFO L273 TraceCheckUtils]: 36: Hoare triple {61839#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {61840#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,355 INFO L273 TraceCheckUtils]: 37: Hoare triple {61840#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {61840#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,356 INFO L273 TraceCheckUtils]: 38: Hoare triple {61840#(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; {61840#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,357 INFO L273 TraceCheckUtils]: 39: Hoare triple {61840#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {61841#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,358 INFO L273 TraceCheckUtils]: 40: Hoare triple {61841#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {61841#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,358 INFO L273 TraceCheckUtils]: 41: Hoare triple {61841#(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; {61841#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,359 INFO L273 TraceCheckUtils]: 42: Hoare triple {61841#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {61842#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,360 INFO L273 TraceCheckUtils]: 43: Hoare triple {61842#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {61842#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,361 INFO L273 TraceCheckUtils]: 44: Hoare triple {61842#(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; {61842#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,362 INFO L273 TraceCheckUtils]: 45: Hoare triple {61842#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {61843#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,362 INFO L273 TraceCheckUtils]: 46: Hoare triple {61843#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {61843#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,363 INFO L273 TraceCheckUtils]: 47: Hoare triple {61843#(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; {61843#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,364 INFO L273 TraceCheckUtils]: 48: Hoare triple {61843#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {61844#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,365 INFO L273 TraceCheckUtils]: 49: Hoare triple {61844#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {61844#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,365 INFO L273 TraceCheckUtils]: 50: Hoare triple {61844#(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; {61844#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,366 INFO L273 TraceCheckUtils]: 51: Hoare triple {61844#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {61845#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,367 INFO L273 TraceCheckUtils]: 52: Hoare triple {61845#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {61845#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,368 INFO L273 TraceCheckUtils]: 53: Hoare triple {61845#(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; {61845#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,369 INFO L273 TraceCheckUtils]: 54: Hoare triple {61845#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {61846#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:54:27,370 INFO L273 TraceCheckUtils]: 55: Hoare triple {61846#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {61846#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:54:27,371 INFO L273 TraceCheckUtils]: 56: Hoare triple {61846#(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; {61846#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:54:27,372 INFO L273 TraceCheckUtils]: 57: Hoare triple {61846#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} ~k~0 := 1 + ~k~0; {61847#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,372 INFO L273 TraceCheckUtils]: 58: Hoare triple {61847#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {61847#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,373 INFO L273 TraceCheckUtils]: 59: Hoare triple {61847#(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; {61847#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,374 INFO L273 TraceCheckUtils]: 60: Hoare triple {61847#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {61848#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,375 INFO L273 TraceCheckUtils]: 61: Hoare triple {61848#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {61848#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,376 INFO L273 TraceCheckUtils]: 62: Hoare triple {61848#(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; {61848#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,376 INFO L273 TraceCheckUtils]: 63: Hoare triple {61848#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {61849#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,377 INFO L273 TraceCheckUtils]: 64: Hoare triple {61849#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {61849#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,378 INFO L273 TraceCheckUtils]: 65: Hoare triple {61849#(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; {61849#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,379 INFO L273 TraceCheckUtils]: 66: Hoare triple {61849#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {61850#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,380 INFO L273 TraceCheckUtils]: 67: Hoare triple {61850#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {61850#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,380 INFO L273 TraceCheckUtils]: 68: Hoare triple {61850#(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; {61850#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,381 INFO L273 TraceCheckUtils]: 69: Hoare triple {61850#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {61851#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,382 INFO L273 TraceCheckUtils]: 70: Hoare triple {61851#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {61851#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,383 INFO L273 TraceCheckUtils]: 71: Hoare triple {61851#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {61851#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,384 INFO L273 TraceCheckUtils]: 72: Hoare triple {61851#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {61852#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,384 INFO L273 TraceCheckUtils]: 73: Hoare triple {61852#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {61852#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,385 INFO L273 TraceCheckUtils]: 74: Hoare triple {61852#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {61852#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,386 INFO L273 TraceCheckUtils]: 75: Hoare triple {61852#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {61853#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,387 INFO L273 TraceCheckUtils]: 76: Hoare triple {61853#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {61853#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,388 INFO L273 TraceCheckUtils]: 77: Hoare triple {61853#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {61853#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,388 INFO L273 TraceCheckUtils]: 78: Hoare triple {61853#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {61854#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,389 INFO L273 TraceCheckUtils]: 79: Hoare triple {61854#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {61854#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,390 INFO L273 TraceCheckUtils]: 80: Hoare triple {61854#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {61854#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,391 INFO L273 TraceCheckUtils]: 81: Hoare triple {61854#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {61855#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,392 INFO L273 TraceCheckUtils]: 82: Hoare triple {61855#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {61855#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,393 INFO L273 TraceCheckUtils]: 83: Hoare triple {61855#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {61855#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,394 INFO L273 TraceCheckUtils]: 84: Hoare triple {61855#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {61856#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,394 INFO L273 TraceCheckUtils]: 85: Hoare triple {61856#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {61856#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,395 INFO L273 TraceCheckUtils]: 86: Hoare triple {61856#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {61856#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,396 INFO L273 TraceCheckUtils]: 87: Hoare triple {61856#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {61857#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,397 INFO L273 TraceCheckUtils]: 88: Hoare triple {61857#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {61857#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,398 INFO L273 TraceCheckUtils]: 89: Hoare triple {61857#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {61857#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,399 INFO L273 TraceCheckUtils]: 90: Hoare triple {61857#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {61858#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,400 INFO L273 TraceCheckUtils]: 91: Hoare triple {61858#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {61858#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,400 INFO L273 TraceCheckUtils]: 92: Hoare triple {61858#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {61858#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,401 INFO L273 TraceCheckUtils]: 93: Hoare triple {61858#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {61859#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,402 INFO L273 TraceCheckUtils]: 94: Hoare triple {61859#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {61859#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,403 INFO L273 TraceCheckUtils]: 95: Hoare triple {61859#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {61859#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,403 INFO L273 TraceCheckUtils]: 96: Hoare triple {61859#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {61860#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,404 INFO L273 TraceCheckUtils]: 97: Hoare triple {61860#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {61860#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,405 INFO L273 TraceCheckUtils]: 98: Hoare triple {61860#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {61860#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,406 INFO L273 TraceCheckUtils]: 99: Hoare triple {61860#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {61861#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,407 INFO L273 TraceCheckUtils]: 100: Hoare triple {61861#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {61861#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,407 INFO L273 TraceCheckUtils]: 101: Hoare triple {61861#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {61861#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,408 INFO L273 TraceCheckUtils]: 102: Hoare triple {61861#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {61862#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,409 INFO L273 TraceCheckUtils]: 103: Hoare triple {61862#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {61862#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,410 INFO L273 TraceCheckUtils]: 104: Hoare triple {61862#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {61862#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,411 INFO L273 TraceCheckUtils]: 105: Hoare triple {61862#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {61863#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,412 INFO L273 TraceCheckUtils]: 106: Hoare triple {61863#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {61863#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,413 INFO L273 TraceCheckUtils]: 107: Hoare triple {61863#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {61863#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,413 INFO L273 TraceCheckUtils]: 108: Hoare triple {61863#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {61864#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:27,414 INFO L273 TraceCheckUtils]: 109: Hoare triple {61864#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} assume !(~k~0 < 100000); {61828#false} is VALID [2018-11-23 11:54:27,414 INFO L273 TraceCheckUtils]: 110: Hoare triple {61828#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {61828#false} is VALID [2018-11-23 11:54:27,415 INFO L273 TraceCheckUtils]: 111: Hoare triple {61828#false} ~x~0 := 0; {61828#false} is VALID [2018-11-23 11:54:27,415 INFO L273 TraceCheckUtils]: 112: Hoare triple {61828#false} assume !(~x~0 < ~i~0); {61828#false} is VALID [2018-11-23 11:54:27,415 INFO L273 TraceCheckUtils]: 113: Hoare triple {61828#false} ~x~0 := 0; {61828#false} is VALID [2018-11-23 11:54:27,415 INFO L273 TraceCheckUtils]: 114: Hoare triple {61828#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {61828#false} is VALID [2018-11-23 11:54:27,415 INFO L256 TraceCheckUtils]: 115: Hoare triple {61828#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {61827#true} is VALID [2018-11-23 11:54:27,415 INFO L273 TraceCheckUtils]: 116: Hoare triple {61827#true} ~cond := #in~cond; {61827#true} is VALID [2018-11-23 11:54:27,416 INFO L273 TraceCheckUtils]: 117: Hoare triple {61827#true} assume !(0 == ~cond); {61827#true} is VALID [2018-11-23 11:54:27,416 INFO L273 TraceCheckUtils]: 118: Hoare triple {61827#true} assume true; {61827#true} is VALID [2018-11-23 11:54:27,416 INFO L268 TraceCheckUtils]: 119: Hoare quadruple {61827#true} {61828#false} #136#return; {61828#false} is VALID [2018-11-23 11:54:27,416 INFO L273 TraceCheckUtils]: 120: Hoare triple {61828#false} havoc #t~mem9;havoc #t~mem10; {61828#false} is VALID [2018-11-23 11:54:27,416 INFO L273 TraceCheckUtils]: 121: Hoare triple {61828#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {61828#false} is VALID [2018-11-23 11:54:27,416 INFO L273 TraceCheckUtils]: 122: Hoare triple {61828#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {61828#false} is VALID [2018-11-23 11:54:27,417 INFO L256 TraceCheckUtils]: 123: Hoare triple {61828#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {61828#false} is VALID [2018-11-23 11:54:27,417 INFO L273 TraceCheckUtils]: 124: Hoare triple {61828#false} ~cond := #in~cond; {61828#false} is VALID [2018-11-23 11:54:27,417 INFO L273 TraceCheckUtils]: 125: Hoare triple {61828#false} assume 0 == ~cond; {61828#false} is VALID [2018-11-23 11:54:27,417 INFO L273 TraceCheckUtils]: 126: Hoare triple {61828#false} assume !false; {61828#false} is VALID [2018-11-23 11:54:27,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1721 backedges. 2 proven. 1717 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:54:27,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:27,446 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:54:27,454 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:54:27,728 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 35 check-sat command(s) [2018-11-23 11:54:27,729 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:27,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:27,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:29,106 INFO L256 TraceCheckUtils]: 0: Hoare triple {61827#true} call ULTIMATE.init(); {61827#true} is VALID [2018-11-23 11:54:29,106 INFO L273 TraceCheckUtils]: 1: Hoare triple {61827#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {61827#true} is VALID [2018-11-23 11:54:29,106 INFO L273 TraceCheckUtils]: 2: Hoare triple {61827#true} assume true; {61827#true} is VALID [2018-11-23 11:54:29,106 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {61827#true} {61827#true} #130#return; {61827#true} is VALID [2018-11-23 11:54:29,107 INFO L256 TraceCheckUtils]: 4: Hoare triple {61827#true} call #t~ret15 := main(); {61827#true} is VALID [2018-11-23 11:54:29,107 INFO L273 TraceCheckUtils]: 5: Hoare triple {61827#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {61883#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:29,108 INFO L273 TraceCheckUtils]: 6: Hoare triple {61883#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {61887#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:29,108 INFO L273 TraceCheckUtils]: 7: Hoare triple {61887#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {61887#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:29,109 INFO L273 TraceCheckUtils]: 8: Hoare triple {61887#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {61887#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:29,109 INFO L273 TraceCheckUtils]: 9: Hoare triple {61887#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {61897#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:29,109 INFO L273 TraceCheckUtils]: 10: Hoare triple {61897#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {61897#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:29,110 INFO L273 TraceCheckUtils]: 11: Hoare triple {61897#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {61897#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:29,110 INFO L273 TraceCheckUtils]: 12: Hoare triple {61897#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {61907#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:29,111 INFO L273 TraceCheckUtils]: 13: Hoare triple {61907#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {61907#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:29,111 INFO L273 TraceCheckUtils]: 14: Hoare triple {61907#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {61907#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:29,112 INFO L273 TraceCheckUtils]: 15: Hoare triple {61907#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {61917#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:29,113 INFO L273 TraceCheckUtils]: 16: Hoare triple {61917#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {61917#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:29,113 INFO L273 TraceCheckUtils]: 17: Hoare triple {61917#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {61917#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:29,114 INFO L273 TraceCheckUtils]: 18: Hoare triple {61917#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {61927#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:29,114 INFO L273 TraceCheckUtils]: 19: Hoare triple {61927#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {61927#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:29,115 INFO L273 TraceCheckUtils]: 20: Hoare triple {61927#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {61927#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:29,116 INFO L273 TraceCheckUtils]: 21: Hoare triple {61927#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {61937#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:29,116 INFO L273 TraceCheckUtils]: 22: Hoare triple {61937#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {61937#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:29,117 INFO L273 TraceCheckUtils]: 23: Hoare triple {61937#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {61937#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:29,117 INFO L273 TraceCheckUtils]: 24: Hoare triple {61937#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {61947#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:29,118 INFO L273 TraceCheckUtils]: 25: Hoare triple {61947#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {61947#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:29,118 INFO L273 TraceCheckUtils]: 26: Hoare triple {61947#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {61947#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:29,119 INFO L273 TraceCheckUtils]: 27: Hoare triple {61947#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {61957#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:29,120 INFO L273 TraceCheckUtils]: 28: Hoare triple {61957#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {61957#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:29,120 INFO L273 TraceCheckUtils]: 29: Hoare triple {61957#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {61957#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:29,121 INFO L273 TraceCheckUtils]: 30: Hoare triple {61957#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {61967#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:29,121 INFO L273 TraceCheckUtils]: 31: Hoare triple {61967#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {61967#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:29,122 INFO L273 TraceCheckUtils]: 32: Hoare triple {61967#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {61967#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:29,123 INFO L273 TraceCheckUtils]: 33: Hoare triple {61967#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {61977#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:29,123 INFO L273 TraceCheckUtils]: 34: Hoare triple {61977#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {61977#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:29,124 INFO L273 TraceCheckUtils]: 35: Hoare triple {61977#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {61977#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:29,124 INFO L273 TraceCheckUtils]: 36: Hoare triple {61977#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {61987#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:29,125 INFO L273 TraceCheckUtils]: 37: Hoare triple {61987#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {61987#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:29,125 INFO L273 TraceCheckUtils]: 38: Hoare triple {61987#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {61987#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:29,126 INFO L273 TraceCheckUtils]: 39: Hoare triple {61987#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {61997#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:29,127 INFO L273 TraceCheckUtils]: 40: Hoare triple {61997#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {61997#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:29,127 INFO L273 TraceCheckUtils]: 41: Hoare triple {61997#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {61997#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:29,128 INFO L273 TraceCheckUtils]: 42: Hoare triple {61997#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {62007#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:29,128 INFO L273 TraceCheckUtils]: 43: Hoare triple {62007#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {62007#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:29,129 INFO L273 TraceCheckUtils]: 44: Hoare triple {62007#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {62007#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:29,130 INFO L273 TraceCheckUtils]: 45: Hoare triple {62007#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {62017#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:29,130 INFO L273 TraceCheckUtils]: 46: Hoare triple {62017#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {62017#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:29,131 INFO L273 TraceCheckUtils]: 47: Hoare triple {62017#(<= main_~k~0 14)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {62017#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:29,131 INFO L273 TraceCheckUtils]: 48: Hoare triple {62017#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {62027#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:29,132 INFO L273 TraceCheckUtils]: 49: Hoare triple {62027#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {62027#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:29,132 INFO L273 TraceCheckUtils]: 50: Hoare triple {62027#(<= main_~k~0 15)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {62027#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:29,133 INFO L273 TraceCheckUtils]: 51: Hoare triple {62027#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {62037#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:29,134 INFO L273 TraceCheckUtils]: 52: Hoare triple {62037#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {62037#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:29,134 INFO L273 TraceCheckUtils]: 53: Hoare triple {62037#(<= main_~k~0 16)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {62037#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:29,135 INFO L273 TraceCheckUtils]: 54: Hoare triple {62037#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {62047#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:29,135 INFO L273 TraceCheckUtils]: 55: Hoare triple {62047#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {62047#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:29,136 INFO L273 TraceCheckUtils]: 56: Hoare triple {62047#(<= main_~k~0 17)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {62047#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:29,137 INFO L273 TraceCheckUtils]: 57: Hoare triple {62047#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {62057#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:29,137 INFO L273 TraceCheckUtils]: 58: Hoare triple {62057#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {62057#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:29,138 INFO L273 TraceCheckUtils]: 59: Hoare triple {62057#(<= main_~k~0 18)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {62057#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:29,138 INFO L273 TraceCheckUtils]: 60: Hoare triple {62057#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {62067#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:29,139 INFO L273 TraceCheckUtils]: 61: Hoare triple {62067#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {62067#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:29,139 INFO L273 TraceCheckUtils]: 62: Hoare triple {62067#(<= main_~k~0 19)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {62067#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:29,140 INFO L273 TraceCheckUtils]: 63: Hoare triple {62067#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {62077#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:29,141 INFO L273 TraceCheckUtils]: 64: Hoare triple {62077#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {62077#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:29,141 INFO L273 TraceCheckUtils]: 65: Hoare triple {62077#(<= main_~k~0 20)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {62077#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:29,142 INFO L273 TraceCheckUtils]: 66: Hoare triple {62077#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {62087#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:29,142 INFO L273 TraceCheckUtils]: 67: Hoare triple {62087#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {62087#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:29,143 INFO L273 TraceCheckUtils]: 68: Hoare triple {62087#(<= main_~k~0 21)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {62087#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:29,144 INFO L273 TraceCheckUtils]: 69: Hoare triple {62087#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {62097#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:29,144 INFO L273 TraceCheckUtils]: 70: Hoare triple {62097#(<= main_~k~0 22)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {62097#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:29,145 INFO L273 TraceCheckUtils]: 71: Hoare triple {62097#(<= main_~k~0 22)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {62097#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:29,145 INFO L273 TraceCheckUtils]: 72: Hoare triple {62097#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {62107#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:29,146 INFO L273 TraceCheckUtils]: 73: Hoare triple {62107#(<= main_~k~0 23)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {62107#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:29,146 INFO L273 TraceCheckUtils]: 74: Hoare triple {62107#(<= main_~k~0 23)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {62107#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:29,147 INFO L273 TraceCheckUtils]: 75: Hoare triple {62107#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {62117#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:29,148 INFO L273 TraceCheckUtils]: 76: Hoare triple {62117#(<= main_~k~0 24)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {62117#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:29,148 INFO L273 TraceCheckUtils]: 77: Hoare triple {62117#(<= main_~k~0 24)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {62117#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:29,149 INFO L273 TraceCheckUtils]: 78: Hoare triple {62117#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {62127#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:29,149 INFO L273 TraceCheckUtils]: 79: Hoare triple {62127#(<= main_~k~0 25)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {62127#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:29,150 INFO L273 TraceCheckUtils]: 80: Hoare triple {62127#(<= main_~k~0 25)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {62127#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:29,150 INFO L273 TraceCheckUtils]: 81: Hoare triple {62127#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {62137#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:29,151 INFO L273 TraceCheckUtils]: 82: Hoare triple {62137#(<= main_~k~0 26)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {62137#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:29,151 INFO L273 TraceCheckUtils]: 83: Hoare triple {62137#(<= main_~k~0 26)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {62137#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:29,152 INFO L273 TraceCheckUtils]: 84: Hoare triple {62137#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {62147#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:29,153 INFO L273 TraceCheckUtils]: 85: Hoare triple {62147#(<= main_~k~0 27)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {62147#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:29,153 INFO L273 TraceCheckUtils]: 86: Hoare triple {62147#(<= main_~k~0 27)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {62147#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:29,154 INFO L273 TraceCheckUtils]: 87: Hoare triple {62147#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {62157#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:29,154 INFO L273 TraceCheckUtils]: 88: Hoare triple {62157#(<= main_~k~0 28)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {62157#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:29,155 INFO L273 TraceCheckUtils]: 89: Hoare triple {62157#(<= main_~k~0 28)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {62157#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:29,156 INFO L273 TraceCheckUtils]: 90: Hoare triple {62157#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {62167#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:29,156 INFO L273 TraceCheckUtils]: 91: Hoare triple {62167#(<= main_~k~0 29)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {62167#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:29,157 INFO L273 TraceCheckUtils]: 92: Hoare triple {62167#(<= main_~k~0 29)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {62167#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:29,157 INFO L273 TraceCheckUtils]: 93: Hoare triple {62167#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {62177#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:29,158 INFO L273 TraceCheckUtils]: 94: Hoare triple {62177#(<= main_~k~0 30)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {62177#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:29,158 INFO L273 TraceCheckUtils]: 95: Hoare triple {62177#(<= main_~k~0 30)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {62177#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:29,159 INFO L273 TraceCheckUtils]: 96: Hoare triple {62177#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {62187#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:29,160 INFO L273 TraceCheckUtils]: 97: Hoare triple {62187#(<= main_~k~0 31)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {62187#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:29,160 INFO L273 TraceCheckUtils]: 98: Hoare triple {62187#(<= main_~k~0 31)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {62187#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:29,161 INFO L273 TraceCheckUtils]: 99: Hoare triple {62187#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {62197#(<= main_~k~0 32)} is VALID [2018-11-23 11:54:29,161 INFO L273 TraceCheckUtils]: 100: Hoare triple {62197#(<= main_~k~0 32)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {62197#(<= main_~k~0 32)} is VALID [2018-11-23 11:54:29,162 INFO L273 TraceCheckUtils]: 101: Hoare triple {62197#(<= main_~k~0 32)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {62197#(<= main_~k~0 32)} is VALID [2018-11-23 11:54:29,163 INFO L273 TraceCheckUtils]: 102: Hoare triple {62197#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {62207#(<= main_~k~0 33)} is VALID [2018-11-23 11:54:29,163 INFO L273 TraceCheckUtils]: 103: Hoare triple {62207#(<= main_~k~0 33)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {62207#(<= main_~k~0 33)} is VALID [2018-11-23 11:54:29,164 INFO L273 TraceCheckUtils]: 104: Hoare triple {62207#(<= main_~k~0 33)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {62207#(<= main_~k~0 33)} is VALID [2018-11-23 11:54:29,164 INFO L273 TraceCheckUtils]: 105: Hoare triple {62207#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {62217#(<= main_~k~0 34)} is VALID [2018-11-23 11:54:29,165 INFO L273 TraceCheckUtils]: 106: Hoare triple {62217#(<= main_~k~0 34)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {62217#(<= main_~k~0 34)} is VALID [2018-11-23 11:54:29,165 INFO L273 TraceCheckUtils]: 107: Hoare triple {62217#(<= main_~k~0 34)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {62217#(<= main_~k~0 34)} is VALID [2018-11-23 11:54:29,166 INFO L273 TraceCheckUtils]: 108: Hoare triple {62217#(<= main_~k~0 34)} ~k~0 := 1 + ~k~0; {62227#(<= main_~k~0 35)} is VALID [2018-11-23 11:54:29,167 INFO L273 TraceCheckUtils]: 109: Hoare triple {62227#(<= main_~k~0 35)} assume !(~k~0 < 100000); {61828#false} is VALID [2018-11-23 11:54:29,167 INFO L273 TraceCheckUtils]: 110: Hoare triple {61828#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {61828#false} is VALID [2018-11-23 11:54:29,167 INFO L273 TraceCheckUtils]: 111: Hoare triple {61828#false} ~x~0 := 0; {61828#false} is VALID [2018-11-23 11:54:29,167 INFO L273 TraceCheckUtils]: 112: Hoare triple {61828#false} assume !(~x~0 < ~i~0); {61828#false} is VALID [2018-11-23 11:54:29,167 INFO L273 TraceCheckUtils]: 113: Hoare triple {61828#false} ~x~0 := 0; {61828#false} is VALID [2018-11-23 11:54:29,168 INFO L273 TraceCheckUtils]: 114: Hoare triple {61828#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {61828#false} is VALID [2018-11-23 11:54:29,168 INFO L256 TraceCheckUtils]: 115: Hoare triple {61828#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {61828#false} is VALID [2018-11-23 11:54:29,168 INFO L273 TraceCheckUtils]: 116: Hoare triple {61828#false} ~cond := #in~cond; {61828#false} is VALID [2018-11-23 11:54:29,168 INFO L273 TraceCheckUtils]: 117: Hoare triple {61828#false} assume !(0 == ~cond); {61828#false} is VALID [2018-11-23 11:54:29,168 INFO L273 TraceCheckUtils]: 118: Hoare triple {61828#false} assume true; {61828#false} is VALID [2018-11-23 11:54:29,169 INFO L268 TraceCheckUtils]: 119: Hoare quadruple {61828#false} {61828#false} #136#return; {61828#false} is VALID [2018-11-23 11:54:29,169 INFO L273 TraceCheckUtils]: 120: Hoare triple {61828#false} havoc #t~mem9;havoc #t~mem10; {61828#false} is VALID [2018-11-23 11:54:29,169 INFO L273 TraceCheckUtils]: 121: Hoare triple {61828#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {61828#false} is VALID [2018-11-23 11:54:29,169 INFO L273 TraceCheckUtils]: 122: Hoare triple {61828#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {61828#false} is VALID [2018-11-23 11:54:29,169 INFO L256 TraceCheckUtils]: 123: Hoare triple {61828#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {61828#false} is VALID [2018-11-23 11:54:29,169 INFO L273 TraceCheckUtils]: 124: Hoare triple {61828#false} ~cond := #in~cond; {61828#false} is VALID [2018-11-23 11:54:29,170 INFO L273 TraceCheckUtils]: 125: Hoare triple {61828#false} assume 0 == ~cond; {61828#false} is VALID [2018-11-23 11:54:29,170 INFO L273 TraceCheckUtils]: 126: Hoare triple {61828#false} assume !false; {61828#false} is VALID [2018-11-23 11:54:29,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1721 backedges. 0 proven. 1717 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:54:29,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:29,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 74 [2018-11-23 11:54:29,203 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 127 [2018-11-23 11:54:29,203 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:29,203 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 74 states. [2018-11-23 11:54:29,443 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 234 edges. 234 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:29,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-11-23 11:54:29,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-11-23 11:54:29,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2036, Invalid=3366, Unknown=0, NotChecked=0, Total=5402 [2018-11-23 11:54:29,445 INFO L87 Difference]: Start difference. First operand 437 states and 634 transitions. Second operand 74 states. [2018-11-23 11:54:31,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:31,158 INFO L93 Difference]: Finished difference Result 678 states and 1011 transitions. [2018-11-23 11:54:31,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-23 11:54:31,159 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 127 [2018-11-23 11:54:31,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:31,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-23 11:54:31,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 247 transitions. [2018-11-23 11:54:31,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-23 11:54:31,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 247 transitions. [2018-11-23 11:54:31,162 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 247 transitions. [2018-11-23 11:54:31,420 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 247 edges. 247 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:31,432 INFO L225 Difference]: With dead ends: 678 [2018-11-23 11:54:31,432 INFO L226 Difference]: Without dead ends: 452 [2018-11-23 11:54:31,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1891 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2036, Invalid=3366, Unknown=0, NotChecked=0, Total=5402 [2018-11-23 11:54:31,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2018-11-23 11:54:32,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 443. [2018-11-23 11:54:32,464 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:32,464 INFO L82 GeneralOperation]: Start isEquivalent. First operand 452 states. Second operand 443 states. [2018-11-23 11:54:32,464 INFO L74 IsIncluded]: Start isIncluded. First operand 452 states. Second operand 443 states. [2018-11-23 11:54:32,464 INFO L87 Difference]: Start difference. First operand 452 states. Second operand 443 states. [2018-11-23 11:54:32,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:32,476 INFO L93 Difference]: Finished difference Result 452 states and 655 transitions. [2018-11-23 11:54:32,476 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 655 transitions. [2018-11-23 11:54:32,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:32,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:32,477 INFO L74 IsIncluded]: Start isIncluded. First operand 443 states. Second operand 452 states. [2018-11-23 11:54:32,477 INFO L87 Difference]: Start difference. First operand 443 states. Second operand 452 states. [2018-11-23 11:54:32,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:32,487 INFO L93 Difference]: Finished difference Result 452 states and 655 transitions. [2018-11-23 11:54:32,487 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 655 transitions. [2018-11-23 11:54:32,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:32,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:32,488 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:32,488 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:32,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-11-23 11:54:32,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 642 transitions. [2018-11-23 11:54:32,499 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 642 transitions. Word has length 127 [2018-11-23 11:54:32,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:32,499 INFO L480 AbstractCegarLoop]: Abstraction has 443 states and 642 transitions. [2018-11-23 11:54:32,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-11-23 11:54:32,499 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 642 transitions. [2018-11-23 11:54:32,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-23 11:54:32,500 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:32,500 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 35, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:32,501 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:32,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:32,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1716444911, now seen corresponding path program 31 times [2018-11-23 11:54:32,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:32,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:32,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:32,502 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:32,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:32,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:34,618 INFO L256 TraceCheckUtils]: 0: Hoare triple {64697#true} call ULTIMATE.init(); {64697#true} is VALID [2018-11-23 11:54:34,618 INFO L273 TraceCheckUtils]: 1: Hoare triple {64697#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {64697#true} is VALID [2018-11-23 11:54:34,618 INFO L273 TraceCheckUtils]: 2: Hoare triple {64697#true} assume true; {64697#true} is VALID [2018-11-23 11:54:34,618 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {64697#true} {64697#true} #130#return; {64697#true} is VALID [2018-11-23 11:54:34,619 INFO L256 TraceCheckUtils]: 4: Hoare triple {64697#true} call #t~ret15 := main(); {64697#true} is VALID [2018-11-23 11:54:34,619 INFO L273 TraceCheckUtils]: 5: Hoare triple {64697#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {64699#(= main_~i~0 0)} is VALID [2018-11-23 11:54:34,620 INFO L273 TraceCheckUtils]: 6: Hoare triple {64699#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {64700#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,620 INFO L273 TraceCheckUtils]: 7: Hoare triple {64700#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {64700#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,621 INFO L273 TraceCheckUtils]: 8: Hoare triple {64700#(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; {64700#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,621 INFO L273 TraceCheckUtils]: 9: Hoare triple {64700#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {64701#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,622 INFO L273 TraceCheckUtils]: 10: Hoare triple {64701#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {64701#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,623 INFO L273 TraceCheckUtils]: 11: Hoare triple {64701#(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; {64701#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,623 INFO L273 TraceCheckUtils]: 12: Hoare triple {64701#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {64702#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,624 INFO L273 TraceCheckUtils]: 13: Hoare triple {64702#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {64702#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,625 INFO L273 TraceCheckUtils]: 14: Hoare triple {64702#(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; {64702#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,626 INFO L273 TraceCheckUtils]: 15: Hoare triple {64702#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {64703#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,627 INFO L273 TraceCheckUtils]: 16: Hoare triple {64703#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {64703#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,627 INFO L273 TraceCheckUtils]: 17: Hoare triple {64703#(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; {64703#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,628 INFO L273 TraceCheckUtils]: 18: Hoare triple {64703#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {64704#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,629 INFO L273 TraceCheckUtils]: 19: Hoare triple {64704#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {64704#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,630 INFO L273 TraceCheckUtils]: 20: Hoare triple {64704#(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; {64704#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,631 INFO L273 TraceCheckUtils]: 21: Hoare triple {64704#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {64705#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,632 INFO L273 TraceCheckUtils]: 22: Hoare triple {64705#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {64705#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,632 INFO L273 TraceCheckUtils]: 23: Hoare triple {64705#(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; {64705#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,633 INFO L273 TraceCheckUtils]: 24: Hoare triple {64705#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {64706#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,634 INFO L273 TraceCheckUtils]: 25: Hoare triple {64706#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {64706#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,635 INFO L273 TraceCheckUtils]: 26: Hoare triple {64706#(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; {64706#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,636 INFO L273 TraceCheckUtils]: 27: Hoare triple {64706#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {64707#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,636 INFO L273 TraceCheckUtils]: 28: Hoare triple {64707#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {64707#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,637 INFO L273 TraceCheckUtils]: 29: Hoare triple {64707#(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; {64707#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,638 INFO L273 TraceCheckUtils]: 30: Hoare triple {64707#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {64708#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,639 INFO L273 TraceCheckUtils]: 31: Hoare triple {64708#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {64708#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,639 INFO L273 TraceCheckUtils]: 32: Hoare triple {64708#(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; {64708#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,640 INFO L273 TraceCheckUtils]: 33: Hoare triple {64708#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {64709#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,641 INFO L273 TraceCheckUtils]: 34: Hoare triple {64709#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {64709#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,642 INFO L273 TraceCheckUtils]: 35: Hoare triple {64709#(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; {64709#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,642 INFO L273 TraceCheckUtils]: 36: Hoare triple {64709#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {64710#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,643 INFO L273 TraceCheckUtils]: 37: Hoare triple {64710#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {64710#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,644 INFO L273 TraceCheckUtils]: 38: Hoare triple {64710#(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; {64710#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,645 INFO L273 TraceCheckUtils]: 39: Hoare triple {64710#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {64711#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,646 INFO L273 TraceCheckUtils]: 40: Hoare triple {64711#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {64711#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,646 INFO L273 TraceCheckUtils]: 41: Hoare triple {64711#(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; {64711#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,647 INFO L273 TraceCheckUtils]: 42: Hoare triple {64711#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {64712#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,648 INFO L273 TraceCheckUtils]: 43: Hoare triple {64712#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {64712#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,649 INFO L273 TraceCheckUtils]: 44: Hoare triple {64712#(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; {64712#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,650 INFO L273 TraceCheckUtils]: 45: Hoare triple {64712#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {64713#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,650 INFO L273 TraceCheckUtils]: 46: Hoare triple {64713#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {64713#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,651 INFO L273 TraceCheckUtils]: 47: Hoare triple {64713#(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; {64713#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,652 INFO L273 TraceCheckUtils]: 48: Hoare triple {64713#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {64714#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,653 INFO L273 TraceCheckUtils]: 49: Hoare triple {64714#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {64714#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,654 INFO L273 TraceCheckUtils]: 50: Hoare triple {64714#(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; {64714#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,654 INFO L273 TraceCheckUtils]: 51: Hoare triple {64714#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {64715#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,655 INFO L273 TraceCheckUtils]: 52: Hoare triple {64715#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {64715#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,656 INFO L273 TraceCheckUtils]: 53: Hoare triple {64715#(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; {64715#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,657 INFO L273 TraceCheckUtils]: 54: Hoare triple {64715#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {64716#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:54:34,658 INFO L273 TraceCheckUtils]: 55: Hoare triple {64716#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {64716#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:54:34,658 INFO L273 TraceCheckUtils]: 56: Hoare triple {64716#(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; {64716#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:54:34,659 INFO L273 TraceCheckUtils]: 57: Hoare triple {64716#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} ~k~0 := 1 + ~k~0; {64717#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,660 INFO L273 TraceCheckUtils]: 58: Hoare triple {64717#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {64717#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,661 INFO L273 TraceCheckUtils]: 59: Hoare triple {64717#(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; {64717#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,662 INFO L273 TraceCheckUtils]: 60: Hoare triple {64717#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {64718#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,662 INFO L273 TraceCheckUtils]: 61: Hoare triple {64718#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {64718#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,663 INFO L273 TraceCheckUtils]: 62: Hoare triple {64718#(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; {64718#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,664 INFO L273 TraceCheckUtils]: 63: Hoare triple {64718#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {64719#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,665 INFO L273 TraceCheckUtils]: 64: Hoare triple {64719#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {64719#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,665 INFO L273 TraceCheckUtils]: 65: Hoare triple {64719#(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; {64719#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,666 INFO L273 TraceCheckUtils]: 66: Hoare triple {64719#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {64720#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,667 INFO L273 TraceCheckUtils]: 67: Hoare triple {64720#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {64720#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,668 INFO L273 TraceCheckUtils]: 68: Hoare triple {64720#(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; {64720#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,669 INFO L273 TraceCheckUtils]: 69: Hoare triple {64720#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {64721#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,669 INFO L273 TraceCheckUtils]: 70: Hoare triple {64721#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {64721#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,670 INFO L273 TraceCheckUtils]: 71: Hoare triple {64721#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {64721#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,673 INFO L273 TraceCheckUtils]: 72: Hoare triple {64721#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {64722#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,673 INFO L273 TraceCheckUtils]: 73: Hoare triple {64722#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {64722#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,674 INFO L273 TraceCheckUtils]: 74: Hoare triple {64722#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {64722#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,674 INFO L273 TraceCheckUtils]: 75: Hoare triple {64722#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {64723#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,675 INFO L273 TraceCheckUtils]: 76: Hoare triple {64723#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {64723#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,676 INFO L273 TraceCheckUtils]: 77: Hoare triple {64723#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {64723#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,676 INFO L273 TraceCheckUtils]: 78: Hoare triple {64723#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {64724#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,677 INFO L273 TraceCheckUtils]: 79: Hoare triple {64724#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {64724#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,678 INFO L273 TraceCheckUtils]: 80: Hoare triple {64724#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {64724#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,679 INFO L273 TraceCheckUtils]: 81: Hoare triple {64724#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {64725#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,680 INFO L273 TraceCheckUtils]: 82: Hoare triple {64725#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {64725#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,681 INFO L273 TraceCheckUtils]: 83: Hoare triple {64725#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {64725#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,681 INFO L273 TraceCheckUtils]: 84: Hoare triple {64725#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {64726#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,682 INFO L273 TraceCheckUtils]: 85: Hoare triple {64726#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {64726#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,683 INFO L273 TraceCheckUtils]: 86: Hoare triple {64726#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {64726#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,684 INFO L273 TraceCheckUtils]: 87: Hoare triple {64726#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {64727#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,685 INFO L273 TraceCheckUtils]: 88: Hoare triple {64727#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {64727#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,686 INFO L273 TraceCheckUtils]: 89: Hoare triple {64727#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {64727#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,686 INFO L273 TraceCheckUtils]: 90: Hoare triple {64727#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {64728#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,687 INFO L273 TraceCheckUtils]: 91: Hoare triple {64728#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {64728#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,688 INFO L273 TraceCheckUtils]: 92: Hoare triple {64728#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {64728#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,689 INFO L273 TraceCheckUtils]: 93: Hoare triple {64728#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {64729#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,690 INFO L273 TraceCheckUtils]: 94: Hoare triple {64729#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {64729#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,691 INFO L273 TraceCheckUtils]: 95: Hoare triple {64729#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {64729#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,692 INFO L273 TraceCheckUtils]: 96: Hoare triple {64729#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {64730#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,692 INFO L273 TraceCheckUtils]: 97: Hoare triple {64730#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {64730#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,693 INFO L273 TraceCheckUtils]: 98: Hoare triple {64730#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {64730#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,694 INFO L273 TraceCheckUtils]: 99: Hoare triple {64730#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {64731#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,695 INFO L273 TraceCheckUtils]: 100: Hoare triple {64731#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {64731#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,696 INFO L273 TraceCheckUtils]: 101: Hoare triple {64731#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {64731#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,696 INFO L273 TraceCheckUtils]: 102: Hoare triple {64731#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {64732#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,697 INFO L273 TraceCheckUtils]: 103: Hoare triple {64732#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {64732#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,698 INFO L273 TraceCheckUtils]: 104: Hoare triple {64732#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {64732#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,699 INFO L273 TraceCheckUtils]: 105: Hoare triple {64732#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {64733#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,700 INFO L273 TraceCheckUtils]: 106: Hoare triple {64733#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {64733#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,701 INFO L273 TraceCheckUtils]: 107: Hoare triple {64733#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {64733#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,702 INFO L273 TraceCheckUtils]: 108: Hoare triple {64733#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {64734#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,702 INFO L273 TraceCheckUtils]: 109: Hoare triple {64734#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {64734#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,703 INFO L273 TraceCheckUtils]: 110: Hoare triple {64734#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {64734#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,704 INFO L273 TraceCheckUtils]: 111: Hoare triple {64734#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {64735#(and (<= main_~k~0 (+ main_~i~0 36)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:34,705 INFO L273 TraceCheckUtils]: 112: Hoare triple {64735#(and (<= main_~k~0 (+ main_~i~0 36)) (= main_~i~0 0))} assume !(~k~0 < 100000); {64698#false} is VALID [2018-11-23 11:54:34,705 INFO L273 TraceCheckUtils]: 113: Hoare triple {64698#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {64698#false} is VALID [2018-11-23 11:54:34,705 INFO L273 TraceCheckUtils]: 114: Hoare triple {64698#false} ~x~0 := 0; {64698#false} is VALID [2018-11-23 11:54:34,705 INFO L273 TraceCheckUtils]: 115: Hoare triple {64698#false} assume !(~x~0 < ~i~0); {64698#false} is VALID [2018-11-23 11:54:34,706 INFO L273 TraceCheckUtils]: 116: Hoare triple {64698#false} ~x~0 := 0; {64698#false} is VALID [2018-11-23 11:54:34,706 INFO L273 TraceCheckUtils]: 117: Hoare triple {64698#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {64698#false} is VALID [2018-11-23 11:54:34,706 INFO L256 TraceCheckUtils]: 118: Hoare triple {64698#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {64697#true} is VALID [2018-11-23 11:54:34,706 INFO L273 TraceCheckUtils]: 119: Hoare triple {64697#true} ~cond := #in~cond; {64697#true} is VALID [2018-11-23 11:54:34,706 INFO L273 TraceCheckUtils]: 120: Hoare triple {64697#true} assume !(0 == ~cond); {64697#true} is VALID [2018-11-23 11:54:34,706 INFO L273 TraceCheckUtils]: 121: Hoare triple {64697#true} assume true; {64697#true} is VALID [2018-11-23 11:54:34,707 INFO L268 TraceCheckUtils]: 122: Hoare quadruple {64697#true} {64698#false} #136#return; {64698#false} is VALID [2018-11-23 11:54:34,707 INFO L273 TraceCheckUtils]: 123: Hoare triple {64698#false} havoc #t~mem9;havoc #t~mem10; {64698#false} is VALID [2018-11-23 11:54:34,707 INFO L273 TraceCheckUtils]: 124: Hoare triple {64698#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {64698#false} is VALID [2018-11-23 11:54:34,707 INFO L273 TraceCheckUtils]: 125: Hoare triple {64698#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {64698#false} is VALID [2018-11-23 11:54:34,707 INFO L256 TraceCheckUtils]: 126: Hoare triple {64698#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {64698#false} is VALID [2018-11-23 11:54:34,708 INFO L273 TraceCheckUtils]: 127: Hoare triple {64698#false} ~cond := #in~cond; {64698#false} is VALID [2018-11-23 11:54:34,708 INFO L273 TraceCheckUtils]: 128: Hoare triple {64698#false} assume 0 == ~cond; {64698#false} is VALID [2018-11-23 11:54:34,708 INFO L273 TraceCheckUtils]: 129: Hoare triple {64698#false} assume !false; {64698#false} is VALID [2018-11-23 11:54:34,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1824 backedges. 2 proven. 1820 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:54:34,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:34,737 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:54:34,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:54:34,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:34,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:34,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:35,967 INFO L256 TraceCheckUtils]: 0: Hoare triple {64697#true} call ULTIMATE.init(); {64697#true} is VALID [2018-11-23 11:54:35,967 INFO L273 TraceCheckUtils]: 1: Hoare triple {64697#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {64697#true} is VALID [2018-11-23 11:54:35,968 INFO L273 TraceCheckUtils]: 2: Hoare triple {64697#true} assume true; {64697#true} is VALID [2018-11-23 11:54:35,968 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {64697#true} {64697#true} #130#return; {64697#true} is VALID [2018-11-23 11:54:35,968 INFO L256 TraceCheckUtils]: 4: Hoare triple {64697#true} call #t~ret15 := main(); {64697#true} is VALID [2018-11-23 11:54:35,969 INFO L273 TraceCheckUtils]: 5: Hoare triple {64697#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {64754#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:35,970 INFO L273 TraceCheckUtils]: 6: Hoare triple {64754#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {64758#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:35,970 INFO L273 TraceCheckUtils]: 7: Hoare triple {64758#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {64758#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:35,970 INFO L273 TraceCheckUtils]: 8: Hoare triple {64758#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {64758#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:35,971 INFO L273 TraceCheckUtils]: 9: Hoare triple {64758#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {64768#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:35,971 INFO L273 TraceCheckUtils]: 10: Hoare triple {64768#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {64768#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:35,971 INFO L273 TraceCheckUtils]: 11: Hoare triple {64768#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {64768#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:35,972 INFO L273 TraceCheckUtils]: 12: Hoare triple {64768#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {64778#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:35,972 INFO L273 TraceCheckUtils]: 13: Hoare triple {64778#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {64778#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:35,973 INFO L273 TraceCheckUtils]: 14: Hoare triple {64778#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {64778#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:35,974 INFO L273 TraceCheckUtils]: 15: Hoare triple {64778#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {64788#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:35,974 INFO L273 TraceCheckUtils]: 16: Hoare triple {64788#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {64788#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:35,975 INFO L273 TraceCheckUtils]: 17: Hoare triple {64788#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {64788#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:35,975 INFO L273 TraceCheckUtils]: 18: Hoare triple {64788#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {64798#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:35,976 INFO L273 TraceCheckUtils]: 19: Hoare triple {64798#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {64798#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:35,976 INFO L273 TraceCheckUtils]: 20: Hoare triple {64798#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {64798#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:35,977 INFO L273 TraceCheckUtils]: 21: Hoare triple {64798#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {64808#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:35,978 INFO L273 TraceCheckUtils]: 22: Hoare triple {64808#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {64808#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:35,978 INFO L273 TraceCheckUtils]: 23: Hoare triple {64808#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {64808#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:35,979 INFO L273 TraceCheckUtils]: 24: Hoare triple {64808#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {64818#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:35,979 INFO L273 TraceCheckUtils]: 25: Hoare triple {64818#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {64818#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:35,980 INFO L273 TraceCheckUtils]: 26: Hoare triple {64818#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {64818#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:35,981 INFO L273 TraceCheckUtils]: 27: Hoare triple {64818#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {64828#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:35,981 INFO L273 TraceCheckUtils]: 28: Hoare triple {64828#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {64828#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:35,982 INFO L273 TraceCheckUtils]: 29: Hoare triple {64828#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {64828#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:35,982 INFO L273 TraceCheckUtils]: 30: Hoare triple {64828#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {64838#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:35,983 INFO L273 TraceCheckUtils]: 31: Hoare triple {64838#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {64838#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:35,984 INFO L273 TraceCheckUtils]: 32: Hoare triple {64838#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {64838#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:35,984 INFO L273 TraceCheckUtils]: 33: Hoare triple {64838#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {64848#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:35,985 INFO L273 TraceCheckUtils]: 34: Hoare triple {64848#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {64848#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:35,985 INFO L273 TraceCheckUtils]: 35: Hoare triple {64848#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {64848#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:35,986 INFO L273 TraceCheckUtils]: 36: Hoare triple {64848#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {64858#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:35,987 INFO L273 TraceCheckUtils]: 37: Hoare triple {64858#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {64858#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:35,987 INFO L273 TraceCheckUtils]: 38: Hoare triple {64858#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {64858#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:35,988 INFO L273 TraceCheckUtils]: 39: Hoare triple {64858#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {64868#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:35,988 INFO L273 TraceCheckUtils]: 40: Hoare triple {64868#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {64868#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:35,989 INFO L273 TraceCheckUtils]: 41: Hoare triple {64868#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {64868#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:35,990 INFO L273 TraceCheckUtils]: 42: Hoare triple {64868#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {64878#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:35,990 INFO L273 TraceCheckUtils]: 43: Hoare triple {64878#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {64878#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:35,991 INFO L273 TraceCheckUtils]: 44: Hoare triple {64878#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {64878#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:35,991 INFO L273 TraceCheckUtils]: 45: Hoare triple {64878#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {64888#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:35,992 INFO L273 TraceCheckUtils]: 46: Hoare triple {64888#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {64888#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:35,992 INFO L273 TraceCheckUtils]: 47: Hoare triple {64888#(<= main_~k~0 14)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {64888#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:35,993 INFO L273 TraceCheckUtils]: 48: Hoare triple {64888#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {64898#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:35,994 INFO L273 TraceCheckUtils]: 49: Hoare triple {64898#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {64898#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:35,994 INFO L273 TraceCheckUtils]: 50: Hoare triple {64898#(<= main_~k~0 15)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {64898#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:35,995 INFO L273 TraceCheckUtils]: 51: Hoare triple {64898#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {64908#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:35,995 INFO L273 TraceCheckUtils]: 52: Hoare triple {64908#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {64908#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:35,996 INFO L273 TraceCheckUtils]: 53: Hoare triple {64908#(<= main_~k~0 16)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {64908#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:35,997 INFO L273 TraceCheckUtils]: 54: Hoare triple {64908#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {64918#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:35,997 INFO L273 TraceCheckUtils]: 55: Hoare triple {64918#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {64918#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:35,998 INFO L273 TraceCheckUtils]: 56: Hoare triple {64918#(<= main_~k~0 17)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {64918#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:35,998 INFO L273 TraceCheckUtils]: 57: Hoare triple {64918#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {64928#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:35,999 INFO L273 TraceCheckUtils]: 58: Hoare triple {64928#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {64928#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:35,999 INFO L273 TraceCheckUtils]: 59: Hoare triple {64928#(<= main_~k~0 18)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {64928#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:36,000 INFO L273 TraceCheckUtils]: 60: Hoare triple {64928#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {64938#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:36,001 INFO L273 TraceCheckUtils]: 61: Hoare triple {64938#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {64938#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:36,001 INFO L273 TraceCheckUtils]: 62: Hoare triple {64938#(<= main_~k~0 19)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {64938#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:36,002 INFO L273 TraceCheckUtils]: 63: Hoare triple {64938#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {64948#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:36,002 INFO L273 TraceCheckUtils]: 64: Hoare triple {64948#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {64948#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:36,003 INFO L273 TraceCheckUtils]: 65: Hoare triple {64948#(<= main_~k~0 20)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {64948#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:36,004 INFO L273 TraceCheckUtils]: 66: Hoare triple {64948#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {64958#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:36,004 INFO L273 TraceCheckUtils]: 67: Hoare triple {64958#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {64958#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:36,005 INFO L273 TraceCheckUtils]: 68: Hoare triple {64958#(<= main_~k~0 21)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {64958#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:36,005 INFO L273 TraceCheckUtils]: 69: Hoare triple {64958#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {64968#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:36,006 INFO L273 TraceCheckUtils]: 70: Hoare triple {64968#(<= main_~k~0 22)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {64968#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:36,007 INFO L273 TraceCheckUtils]: 71: Hoare triple {64968#(<= main_~k~0 22)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {64968#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:36,007 INFO L273 TraceCheckUtils]: 72: Hoare triple {64968#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {64978#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:36,008 INFO L273 TraceCheckUtils]: 73: Hoare triple {64978#(<= main_~k~0 23)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {64978#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:36,008 INFO L273 TraceCheckUtils]: 74: Hoare triple {64978#(<= main_~k~0 23)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {64978#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:36,009 INFO L273 TraceCheckUtils]: 75: Hoare triple {64978#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {64988#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:36,010 INFO L273 TraceCheckUtils]: 76: Hoare triple {64988#(<= main_~k~0 24)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {64988#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:36,010 INFO L273 TraceCheckUtils]: 77: Hoare triple {64988#(<= main_~k~0 24)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {64988#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:36,011 INFO L273 TraceCheckUtils]: 78: Hoare triple {64988#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {64998#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:36,011 INFO L273 TraceCheckUtils]: 79: Hoare triple {64998#(<= main_~k~0 25)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {64998#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:36,012 INFO L273 TraceCheckUtils]: 80: Hoare triple {64998#(<= main_~k~0 25)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {64998#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:36,013 INFO L273 TraceCheckUtils]: 81: Hoare triple {64998#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {65008#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:36,013 INFO L273 TraceCheckUtils]: 82: Hoare triple {65008#(<= main_~k~0 26)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {65008#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:36,014 INFO L273 TraceCheckUtils]: 83: Hoare triple {65008#(<= main_~k~0 26)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {65008#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:36,014 INFO L273 TraceCheckUtils]: 84: Hoare triple {65008#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {65018#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:36,015 INFO L273 TraceCheckUtils]: 85: Hoare triple {65018#(<= main_~k~0 27)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {65018#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:36,015 INFO L273 TraceCheckUtils]: 86: Hoare triple {65018#(<= main_~k~0 27)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {65018#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:36,016 INFO L273 TraceCheckUtils]: 87: Hoare triple {65018#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {65028#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:36,017 INFO L273 TraceCheckUtils]: 88: Hoare triple {65028#(<= main_~k~0 28)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {65028#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:36,017 INFO L273 TraceCheckUtils]: 89: Hoare triple {65028#(<= main_~k~0 28)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {65028#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:36,018 INFO L273 TraceCheckUtils]: 90: Hoare triple {65028#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {65038#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:36,018 INFO L273 TraceCheckUtils]: 91: Hoare triple {65038#(<= main_~k~0 29)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {65038#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:36,019 INFO L273 TraceCheckUtils]: 92: Hoare triple {65038#(<= main_~k~0 29)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {65038#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:36,020 INFO L273 TraceCheckUtils]: 93: Hoare triple {65038#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {65048#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:36,020 INFO L273 TraceCheckUtils]: 94: Hoare triple {65048#(<= main_~k~0 30)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {65048#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:36,021 INFO L273 TraceCheckUtils]: 95: Hoare triple {65048#(<= main_~k~0 30)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {65048#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:36,021 INFO L273 TraceCheckUtils]: 96: Hoare triple {65048#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {65058#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:36,022 INFO L273 TraceCheckUtils]: 97: Hoare triple {65058#(<= main_~k~0 31)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {65058#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:36,022 INFO L273 TraceCheckUtils]: 98: Hoare triple {65058#(<= main_~k~0 31)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {65058#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:36,023 INFO L273 TraceCheckUtils]: 99: Hoare triple {65058#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {65068#(<= main_~k~0 32)} is VALID [2018-11-23 11:54:36,024 INFO L273 TraceCheckUtils]: 100: Hoare triple {65068#(<= main_~k~0 32)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {65068#(<= main_~k~0 32)} is VALID [2018-11-23 11:54:36,024 INFO L273 TraceCheckUtils]: 101: Hoare triple {65068#(<= main_~k~0 32)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {65068#(<= main_~k~0 32)} is VALID [2018-11-23 11:54:36,025 INFO L273 TraceCheckUtils]: 102: Hoare triple {65068#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {65078#(<= main_~k~0 33)} is VALID [2018-11-23 11:54:36,025 INFO L273 TraceCheckUtils]: 103: Hoare triple {65078#(<= main_~k~0 33)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {65078#(<= main_~k~0 33)} is VALID [2018-11-23 11:54:36,026 INFO L273 TraceCheckUtils]: 104: Hoare triple {65078#(<= main_~k~0 33)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {65078#(<= main_~k~0 33)} is VALID [2018-11-23 11:54:36,027 INFO L273 TraceCheckUtils]: 105: Hoare triple {65078#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {65088#(<= main_~k~0 34)} is VALID [2018-11-23 11:54:36,027 INFO L273 TraceCheckUtils]: 106: Hoare triple {65088#(<= main_~k~0 34)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {65088#(<= main_~k~0 34)} is VALID [2018-11-23 11:54:36,028 INFO L273 TraceCheckUtils]: 107: Hoare triple {65088#(<= main_~k~0 34)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {65088#(<= main_~k~0 34)} is VALID [2018-11-23 11:54:36,028 INFO L273 TraceCheckUtils]: 108: Hoare triple {65088#(<= main_~k~0 34)} ~k~0 := 1 + ~k~0; {65098#(<= main_~k~0 35)} is VALID [2018-11-23 11:54:36,029 INFO L273 TraceCheckUtils]: 109: Hoare triple {65098#(<= main_~k~0 35)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {65098#(<= main_~k~0 35)} is VALID [2018-11-23 11:54:36,029 INFO L273 TraceCheckUtils]: 110: Hoare triple {65098#(<= main_~k~0 35)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {65098#(<= main_~k~0 35)} is VALID [2018-11-23 11:54:36,050 INFO L273 TraceCheckUtils]: 111: Hoare triple {65098#(<= main_~k~0 35)} ~k~0 := 1 + ~k~0; {65108#(<= main_~k~0 36)} is VALID [2018-11-23 11:54:36,059 INFO L273 TraceCheckUtils]: 112: Hoare triple {65108#(<= main_~k~0 36)} assume !(~k~0 < 100000); {64698#false} is VALID [2018-11-23 11:54:36,059 INFO L273 TraceCheckUtils]: 113: Hoare triple {64698#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {64698#false} is VALID [2018-11-23 11:54:36,059 INFO L273 TraceCheckUtils]: 114: Hoare triple {64698#false} ~x~0 := 0; {64698#false} is VALID [2018-11-23 11:54:36,059 INFO L273 TraceCheckUtils]: 115: Hoare triple {64698#false} assume !(~x~0 < ~i~0); {64698#false} is VALID [2018-11-23 11:54:36,059 INFO L273 TraceCheckUtils]: 116: Hoare triple {64698#false} ~x~0 := 0; {64698#false} is VALID [2018-11-23 11:54:36,059 INFO L273 TraceCheckUtils]: 117: Hoare triple {64698#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {64698#false} is VALID [2018-11-23 11:54:36,060 INFO L256 TraceCheckUtils]: 118: Hoare triple {64698#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {64698#false} is VALID [2018-11-23 11:54:36,060 INFO L273 TraceCheckUtils]: 119: Hoare triple {64698#false} ~cond := #in~cond; {64698#false} is VALID [2018-11-23 11:54:36,060 INFO L273 TraceCheckUtils]: 120: Hoare triple {64698#false} assume !(0 == ~cond); {64698#false} is VALID [2018-11-23 11:54:36,060 INFO L273 TraceCheckUtils]: 121: Hoare triple {64698#false} assume true; {64698#false} is VALID [2018-11-23 11:54:36,060 INFO L268 TraceCheckUtils]: 122: Hoare quadruple {64698#false} {64698#false} #136#return; {64698#false} is VALID [2018-11-23 11:54:36,060 INFO L273 TraceCheckUtils]: 123: Hoare triple {64698#false} havoc #t~mem9;havoc #t~mem10; {64698#false} is VALID [2018-11-23 11:54:36,060 INFO L273 TraceCheckUtils]: 124: Hoare triple {64698#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {64698#false} is VALID [2018-11-23 11:54:36,061 INFO L273 TraceCheckUtils]: 125: Hoare triple {64698#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {64698#false} is VALID [2018-11-23 11:54:36,061 INFO L256 TraceCheckUtils]: 126: Hoare triple {64698#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {64698#false} is VALID [2018-11-23 11:54:36,061 INFO L273 TraceCheckUtils]: 127: Hoare triple {64698#false} ~cond := #in~cond; {64698#false} is VALID [2018-11-23 11:54:36,061 INFO L273 TraceCheckUtils]: 128: Hoare triple {64698#false} assume 0 == ~cond; {64698#false} is VALID [2018-11-23 11:54:36,061 INFO L273 TraceCheckUtils]: 129: Hoare triple {64698#false} assume !false; {64698#false} is VALID [2018-11-23 11:54:36,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1824 backedges. 0 proven. 1820 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:54:36,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:36,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 76 [2018-11-23 11:54:36,106 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 130 [2018-11-23 11:54:36,106 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:36,106 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 76 states. [2018-11-23 11:54:36,436 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 240 edges. 240 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:36,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-11-23 11:54:36,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-11-23 11:54:36,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2148, Invalid=3552, Unknown=0, NotChecked=0, Total=5700 [2018-11-23 11:54:36,438 INFO L87 Difference]: Start difference. First operand 443 states and 642 transitions. Second operand 76 states. [2018-11-23 11:54:38,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:38,417 INFO L93 Difference]: Finished difference Result 684 states and 1019 transitions. [2018-11-23 11:54:38,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-23 11:54:38,417 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 130 [2018-11-23 11:54:38,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:38,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-23 11:54:38,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 251 transitions. [2018-11-23 11:54:38,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-23 11:54:38,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 251 transitions. [2018-11-23 11:54:38,422 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 251 transitions. [2018-11-23 11:54:38,658 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 251 edges. 251 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:38,670 INFO L225 Difference]: With dead ends: 684 [2018-11-23 11:54:38,670 INFO L226 Difference]: Without dead ends: 458 [2018-11-23 11:54:38,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1999 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2148, Invalid=3552, Unknown=0, NotChecked=0, Total=5700 [2018-11-23 11:54:38,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-11-23 11:54:39,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 449. [2018-11-23 11:54:39,360 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:39,360 INFO L82 GeneralOperation]: Start isEquivalent. First operand 458 states. Second operand 449 states. [2018-11-23 11:54:39,360 INFO L74 IsIncluded]: Start isIncluded. First operand 458 states. Second operand 449 states. [2018-11-23 11:54:39,360 INFO L87 Difference]: Start difference. First operand 458 states. Second operand 449 states. [2018-11-23 11:54:39,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:39,373 INFO L93 Difference]: Finished difference Result 458 states and 663 transitions. [2018-11-23 11:54:39,373 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 663 transitions. [2018-11-23 11:54:39,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:39,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:39,373 INFO L74 IsIncluded]: Start isIncluded. First operand 449 states. Second operand 458 states. [2018-11-23 11:54:39,373 INFO L87 Difference]: Start difference. First operand 449 states. Second operand 458 states. [2018-11-23 11:54:39,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:39,384 INFO L93 Difference]: Finished difference Result 458 states and 663 transitions. [2018-11-23 11:54:39,384 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 663 transitions. [2018-11-23 11:54:39,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:39,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:39,384 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:39,384 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:39,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2018-11-23 11:54:39,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 650 transitions. [2018-11-23 11:54:39,394 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 650 transitions. Word has length 130 [2018-11-23 11:54:39,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:39,394 INFO L480 AbstractCegarLoop]: Abstraction has 449 states and 650 transitions. [2018-11-23 11:54:39,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-11-23 11:54:39,394 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 650 transitions. [2018-11-23 11:54:39,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-23 11:54:39,395 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:39,395 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:39,395 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:39,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:39,395 INFO L82 PathProgramCache]: Analyzing trace with hash 106517964, now seen corresponding path program 32 times [2018-11-23 11:54:39,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:39,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:39,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:39,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:54:39,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:39,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:40,757 INFO L256 TraceCheckUtils]: 0: Hoare triple {67606#true} call ULTIMATE.init(); {67606#true} is VALID [2018-11-23 11:54:40,758 INFO L273 TraceCheckUtils]: 1: Hoare triple {67606#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {67606#true} is VALID [2018-11-23 11:54:40,758 INFO L273 TraceCheckUtils]: 2: Hoare triple {67606#true} assume true; {67606#true} is VALID [2018-11-23 11:54:40,758 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {67606#true} {67606#true} #130#return; {67606#true} is VALID [2018-11-23 11:54:40,758 INFO L256 TraceCheckUtils]: 4: Hoare triple {67606#true} call #t~ret15 := main(); {67606#true} is VALID [2018-11-23 11:54:40,759 INFO L273 TraceCheckUtils]: 5: Hoare triple {67606#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {67608#(= main_~i~0 0)} is VALID [2018-11-23 11:54:40,760 INFO L273 TraceCheckUtils]: 6: Hoare triple {67608#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {67609#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,760 INFO L273 TraceCheckUtils]: 7: Hoare triple {67609#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67609#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,760 INFO L273 TraceCheckUtils]: 8: Hoare triple {67609#(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; {67609#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,761 INFO L273 TraceCheckUtils]: 9: Hoare triple {67609#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {67610#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,761 INFO L273 TraceCheckUtils]: 10: Hoare triple {67610#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67610#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,762 INFO L273 TraceCheckUtils]: 11: Hoare triple {67610#(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; {67610#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,763 INFO L273 TraceCheckUtils]: 12: Hoare triple {67610#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {67611#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,764 INFO L273 TraceCheckUtils]: 13: Hoare triple {67611#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67611#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,764 INFO L273 TraceCheckUtils]: 14: Hoare triple {67611#(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; {67611#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,765 INFO L273 TraceCheckUtils]: 15: Hoare triple {67611#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {67612#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,766 INFO L273 TraceCheckUtils]: 16: Hoare triple {67612#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67612#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,767 INFO L273 TraceCheckUtils]: 17: Hoare triple {67612#(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; {67612#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,767 INFO L273 TraceCheckUtils]: 18: Hoare triple {67612#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {67613#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,768 INFO L273 TraceCheckUtils]: 19: Hoare triple {67613#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67613#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,769 INFO L273 TraceCheckUtils]: 20: Hoare triple {67613#(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; {67613#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,770 INFO L273 TraceCheckUtils]: 21: Hoare triple {67613#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {67614#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,771 INFO L273 TraceCheckUtils]: 22: Hoare triple {67614#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67614#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,772 INFO L273 TraceCheckUtils]: 23: Hoare triple {67614#(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; {67614#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,772 INFO L273 TraceCheckUtils]: 24: Hoare triple {67614#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {67615#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,773 INFO L273 TraceCheckUtils]: 25: Hoare triple {67615#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67615#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,774 INFO L273 TraceCheckUtils]: 26: Hoare triple {67615#(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; {67615#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,775 INFO L273 TraceCheckUtils]: 27: Hoare triple {67615#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {67616#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,775 INFO L273 TraceCheckUtils]: 28: Hoare triple {67616#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67616#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,776 INFO L273 TraceCheckUtils]: 29: Hoare triple {67616#(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; {67616#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,777 INFO L273 TraceCheckUtils]: 30: Hoare triple {67616#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {67617#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,778 INFO L273 TraceCheckUtils]: 31: Hoare triple {67617#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67617#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,778 INFO L273 TraceCheckUtils]: 32: Hoare triple {67617#(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; {67617#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,779 INFO L273 TraceCheckUtils]: 33: Hoare triple {67617#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {67618#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,780 INFO L273 TraceCheckUtils]: 34: Hoare triple {67618#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67618#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,781 INFO L273 TraceCheckUtils]: 35: Hoare triple {67618#(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; {67618#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,782 INFO L273 TraceCheckUtils]: 36: Hoare triple {67618#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {67619#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,782 INFO L273 TraceCheckUtils]: 37: Hoare triple {67619#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67619#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,783 INFO L273 TraceCheckUtils]: 38: Hoare triple {67619#(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; {67619#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,784 INFO L273 TraceCheckUtils]: 39: Hoare triple {67619#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {67620#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,785 INFO L273 TraceCheckUtils]: 40: Hoare triple {67620#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67620#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,786 INFO L273 TraceCheckUtils]: 41: Hoare triple {67620#(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; {67620#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,786 INFO L273 TraceCheckUtils]: 42: Hoare triple {67620#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {67621#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,787 INFO L273 TraceCheckUtils]: 43: Hoare triple {67621#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67621#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,788 INFO L273 TraceCheckUtils]: 44: Hoare triple {67621#(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; {67621#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,789 INFO L273 TraceCheckUtils]: 45: Hoare triple {67621#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {67622#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,789 INFO L273 TraceCheckUtils]: 46: Hoare triple {67622#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67622#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,790 INFO L273 TraceCheckUtils]: 47: Hoare triple {67622#(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; {67622#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,791 INFO L273 TraceCheckUtils]: 48: Hoare triple {67622#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {67623#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,792 INFO L273 TraceCheckUtils]: 49: Hoare triple {67623#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67623#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,792 INFO L273 TraceCheckUtils]: 50: Hoare triple {67623#(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; {67623#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,793 INFO L273 TraceCheckUtils]: 51: Hoare triple {67623#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {67624#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,794 INFO L273 TraceCheckUtils]: 52: Hoare triple {67624#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67624#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,795 INFO L273 TraceCheckUtils]: 53: Hoare triple {67624#(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; {67624#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,796 INFO L273 TraceCheckUtils]: 54: Hoare triple {67624#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {67625#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:54:40,796 INFO L273 TraceCheckUtils]: 55: Hoare triple {67625#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67625#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:54:40,797 INFO L273 TraceCheckUtils]: 56: Hoare triple {67625#(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; {67625#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:54:40,798 INFO L273 TraceCheckUtils]: 57: Hoare triple {67625#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} ~k~0 := 1 + ~k~0; {67626#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,799 INFO L273 TraceCheckUtils]: 58: Hoare triple {67626#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67626#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,799 INFO L273 TraceCheckUtils]: 59: Hoare triple {67626#(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; {67626#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,800 INFO L273 TraceCheckUtils]: 60: Hoare triple {67626#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {67627#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,801 INFO L273 TraceCheckUtils]: 61: Hoare triple {67627#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67627#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,802 INFO L273 TraceCheckUtils]: 62: Hoare triple {67627#(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; {67627#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,802 INFO L273 TraceCheckUtils]: 63: Hoare triple {67627#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {67628#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,803 INFO L273 TraceCheckUtils]: 64: Hoare triple {67628#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67628#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,804 INFO L273 TraceCheckUtils]: 65: Hoare triple {67628#(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; {67628#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,804 INFO L273 TraceCheckUtils]: 66: Hoare triple {67628#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {67629#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,805 INFO L273 TraceCheckUtils]: 67: Hoare triple {67629#(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 + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67629#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,806 INFO L273 TraceCheckUtils]: 68: Hoare triple {67629#(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; {67629#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,807 INFO L273 TraceCheckUtils]: 69: Hoare triple {67629#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {67630#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,808 INFO L273 TraceCheckUtils]: 70: Hoare triple {67630#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67630#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,808 INFO L273 TraceCheckUtils]: 71: Hoare triple {67630#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {67630#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,809 INFO L273 TraceCheckUtils]: 72: Hoare triple {67630#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {67631#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,810 INFO L273 TraceCheckUtils]: 73: Hoare triple {67631#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67631#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,811 INFO L273 TraceCheckUtils]: 74: Hoare triple {67631#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {67631#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,811 INFO L273 TraceCheckUtils]: 75: Hoare triple {67631#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {67632#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,812 INFO L273 TraceCheckUtils]: 76: Hoare triple {67632#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67632#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,813 INFO L273 TraceCheckUtils]: 77: Hoare triple {67632#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {67632#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,814 INFO L273 TraceCheckUtils]: 78: Hoare triple {67632#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {67633#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,815 INFO L273 TraceCheckUtils]: 79: Hoare triple {67633#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67633#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,815 INFO L273 TraceCheckUtils]: 80: Hoare triple {67633#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {67633#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,816 INFO L273 TraceCheckUtils]: 81: Hoare triple {67633#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {67634#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,817 INFO L273 TraceCheckUtils]: 82: Hoare triple {67634#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67634#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,818 INFO L273 TraceCheckUtils]: 83: Hoare triple {67634#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {67634#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,818 INFO L273 TraceCheckUtils]: 84: Hoare triple {67634#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {67635#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,819 INFO L273 TraceCheckUtils]: 85: Hoare triple {67635#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67635#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,820 INFO L273 TraceCheckUtils]: 86: Hoare triple {67635#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {67635#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,821 INFO L273 TraceCheckUtils]: 87: Hoare triple {67635#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {67636#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,822 INFO L273 TraceCheckUtils]: 88: Hoare triple {67636#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67636#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,822 INFO L273 TraceCheckUtils]: 89: Hoare triple {67636#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {67636#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,823 INFO L273 TraceCheckUtils]: 90: Hoare triple {67636#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {67637#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,824 INFO L273 TraceCheckUtils]: 91: Hoare triple {67637#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67637#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,825 INFO L273 TraceCheckUtils]: 92: Hoare triple {67637#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {67637#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,826 INFO L273 TraceCheckUtils]: 93: Hoare triple {67637#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {67638#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,826 INFO L273 TraceCheckUtils]: 94: Hoare triple {67638#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67638#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,827 INFO L273 TraceCheckUtils]: 95: Hoare triple {67638#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {67638#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,828 INFO L273 TraceCheckUtils]: 96: Hoare triple {67638#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {67639#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,829 INFO L273 TraceCheckUtils]: 97: Hoare triple {67639#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67639#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,830 INFO L273 TraceCheckUtils]: 98: Hoare triple {67639#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {67639#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,831 INFO L273 TraceCheckUtils]: 99: Hoare triple {67639#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {67640#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,831 INFO L273 TraceCheckUtils]: 100: Hoare triple {67640#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67640#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,832 INFO L273 TraceCheckUtils]: 101: Hoare triple {67640#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {67640#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,833 INFO L273 TraceCheckUtils]: 102: Hoare triple {67640#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {67641#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,834 INFO L273 TraceCheckUtils]: 103: Hoare triple {67641#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67641#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,834 INFO L273 TraceCheckUtils]: 104: Hoare triple {67641#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {67641#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,835 INFO L273 TraceCheckUtils]: 105: Hoare triple {67641#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {67642#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,836 INFO L273 TraceCheckUtils]: 106: Hoare triple {67642#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67642#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,837 INFO L273 TraceCheckUtils]: 107: Hoare triple {67642#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {67642#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,838 INFO L273 TraceCheckUtils]: 108: Hoare triple {67642#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {67643#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,839 INFO L273 TraceCheckUtils]: 109: Hoare triple {67643#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67643#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,841 INFO L273 TraceCheckUtils]: 110: Hoare triple {67643#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {67643#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,842 INFO L273 TraceCheckUtils]: 111: Hoare triple {67643#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {67644#(and (<= main_~k~0 (+ main_~i~0 36)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,842 INFO L273 TraceCheckUtils]: 112: Hoare triple {67644#(and (<= main_~k~0 (+ main_~i~0 36)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67644#(and (<= main_~k~0 (+ main_~i~0 36)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,843 INFO L273 TraceCheckUtils]: 113: Hoare triple {67644#(and (<= main_~k~0 (+ main_~i~0 36)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {67644#(and (<= main_~k~0 (+ main_~i~0 36)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,843 INFO L273 TraceCheckUtils]: 114: Hoare triple {67644#(and (<= main_~k~0 (+ main_~i~0 36)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {67645#(and (<= main_~k~0 (+ main_~i~0 37)) (= main_~i~0 0))} is VALID [2018-11-23 11:54:40,844 INFO L273 TraceCheckUtils]: 115: Hoare triple {67645#(and (<= main_~k~0 (+ main_~i~0 37)) (= main_~i~0 0))} assume !(~k~0 < 100000); {67607#false} is VALID [2018-11-23 11:54:40,844 INFO L273 TraceCheckUtils]: 116: Hoare triple {67607#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67607#false} is VALID [2018-11-23 11:54:40,844 INFO L273 TraceCheckUtils]: 117: Hoare triple {67607#false} ~x~0 := 0; {67607#false} is VALID [2018-11-23 11:54:40,844 INFO L273 TraceCheckUtils]: 118: Hoare triple {67607#false} assume !(~x~0 < ~i~0); {67607#false} is VALID [2018-11-23 11:54:40,844 INFO L273 TraceCheckUtils]: 119: Hoare triple {67607#false} ~x~0 := 0; {67607#false} is VALID [2018-11-23 11:54:40,844 INFO L273 TraceCheckUtils]: 120: Hoare triple {67607#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67607#false} is VALID [2018-11-23 11:54:40,844 INFO L256 TraceCheckUtils]: 121: Hoare triple {67607#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {67606#true} is VALID [2018-11-23 11:54:40,845 INFO L273 TraceCheckUtils]: 122: Hoare triple {67606#true} ~cond := #in~cond; {67606#true} is VALID [2018-11-23 11:54:40,845 INFO L273 TraceCheckUtils]: 123: Hoare triple {67606#true} assume !(0 == ~cond); {67606#true} is VALID [2018-11-23 11:54:40,845 INFO L273 TraceCheckUtils]: 124: Hoare triple {67606#true} assume true; {67606#true} is VALID [2018-11-23 11:54:40,845 INFO L268 TraceCheckUtils]: 125: Hoare quadruple {67606#true} {67607#false} #136#return; {67607#false} is VALID [2018-11-23 11:54:40,845 INFO L273 TraceCheckUtils]: 126: Hoare triple {67607#false} havoc #t~mem9;havoc #t~mem10; {67607#false} is VALID [2018-11-23 11:54:40,845 INFO L273 TraceCheckUtils]: 127: Hoare triple {67607#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {67607#false} is VALID [2018-11-23 11:54:40,845 INFO L273 TraceCheckUtils]: 128: Hoare triple {67607#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67607#false} is VALID [2018-11-23 11:54:40,846 INFO L256 TraceCheckUtils]: 129: Hoare triple {67607#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {67607#false} is VALID [2018-11-23 11:54:40,846 INFO L273 TraceCheckUtils]: 130: Hoare triple {67607#false} ~cond := #in~cond; {67607#false} is VALID [2018-11-23 11:54:40,846 INFO L273 TraceCheckUtils]: 131: Hoare triple {67607#false} assume 0 == ~cond; {67607#false} is VALID [2018-11-23 11:54:40,846 INFO L273 TraceCheckUtils]: 132: Hoare triple {67607#false} assume !false; {67607#false} is VALID [2018-11-23 11:54:40,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1930 backedges. 2 proven. 1926 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:54:40,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:40,876 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:54:40,886 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:54:40,953 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:54:40,953 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:40,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:40,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:42,433 INFO L256 TraceCheckUtils]: 0: Hoare triple {67606#true} call ULTIMATE.init(); {67606#true} is VALID [2018-11-23 11:54:42,433 INFO L273 TraceCheckUtils]: 1: Hoare triple {67606#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {67606#true} is VALID [2018-11-23 11:54:42,434 INFO L273 TraceCheckUtils]: 2: Hoare triple {67606#true} assume true; {67606#true} is VALID [2018-11-23 11:54:42,434 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {67606#true} {67606#true} #130#return; {67606#true} is VALID [2018-11-23 11:54:42,434 INFO L256 TraceCheckUtils]: 4: Hoare triple {67606#true} call #t~ret15 := main(); {67606#true} is VALID [2018-11-23 11:54:42,435 INFO L273 TraceCheckUtils]: 5: Hoare triple {67606#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {67664#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:42,435 INFO L273 TraceCheckUtils]: 6: Hoare triple {67664#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {67668#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:42,436 INFO L273 TraceCheckUtils]: 7: Hoare triple {67668#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67668#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:42,436 INFO L273 TraceCheckUtils]: 8: Hoare triple {67668#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {67668#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:42,436 INFO L273 TraceCheckUtils]: 9: Hoare triple {67668#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {67678#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:42,437 INFO L273 TraceCheckUtils]: 10: Hoare triple {67678#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67678#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:42,437 INFO L273 TraceCheckUtils]: 11: Hoare triple {67678#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {67678#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:42,438 INFO L273 TraceCheckUtils]: 12: Hoare triple {67678#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {67688#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:42,439 INFO L273 TraceCheckUtils]: 13: Hoare triple {67688#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67688#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:42,439 INFO L273 TraceCheckUtils]: 14: Hoare triple {67688#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {67688#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:42,440 INFO L273 TraceCheckUtils]: 15: Hoare triple {67688#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {67698#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:42,440 INFO L273 TraceCheckUtils]: 16: Hoare triple {67698#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67698#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:42,441 INFO L273 TraceCheckUtils]: 17: Hoare triple {67698#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {67698#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:42,441 INFO L273 TraceCheckUtils]: 18: Hoare triple {67698#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {67708#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:42,442 INFO L273 TraceCheckUtils]: 19: Hoare triple {67708#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67708#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:42,442 INFO L273 TraceCheckUtils]: 20: Hoare triple {67708#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {67708#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:42,443 INFO L273 TraceCheckUtils]: 21: Hoare triple {67708#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {67718#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:42,444 INFO L273 TraceCheckUtils]: 22: Hoare triple {67718#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67718#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:42,444 INFO L273 TraceCheckUtils]: 23: Hoare triple {67718#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {67718#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:42,445 INFO L273 TraceCheckUtils]: 24: Hoare triple {67718#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {67728#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:42,445 INFO L273 TraceCheckUtils]: 25: Hoare triple {67728#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67728#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:42,446 INFO L273 TraceCheckUtils]: 26: Hoare triple {67728#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {67728#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:42,447 INFO L273 TraceCheckUtils]: 27: Hoare triple {67728#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {67738#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:42,447 INFO L273 TraceCheckUtils]: 28: Hoare triple {67738#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67738#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:42,448 INFO L273 TraceCheckUtils]: 29: Hoare triple {67738#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {67738#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:42,448 INFO L273 TraceCheckUtils]: 30: Hoare triple {67738#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {67748#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:42,449 INFO L273 TraceCheckUtils]: 31: Hoare triple {67748#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67748#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:42,449 INFO L273 TraceCheckUtils]: 32: Hoare triple {67748#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {67748#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:42,450 INFO L273 TraceCheckUtils]: 33: Hoare triple {67748#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {67758#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:42,451 INFO L273 TraceCheckUtils]: 34: Hoare triple {67758#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67758#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:42,451 INFO L273 TraceCheckUtils]: 35: Hoare triple {67758#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {67758#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:42,452 INFO L273 TraceCheckUtils]: 36: Hoare triple {67758#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {67768#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:42,452 INFO L273 TraceCheckUtils]: 37: Hoare triple {67768#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67768#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:42,453 INFO L273 TraceCheckUtils]: 38: Hoare triple {67768#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {67768#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:42,454 INFO L273 TraceCheckUtils]: 39: Hoare triple {67768#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {67778#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:42,454 INFO L273 TraceCheckUtils]: 40: Hoare triple {67778#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67778#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:42,455 INFO L273 TraceCheckUtils]: 41: Hoare triple {67778#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {67778#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:42,455 INFO L273 TraceCheckUtils]: 42: Hoare triple {67778#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {67788#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:42,456 INFO L273 TraceCheckUtils]: 43: Hoare triple {67788#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67788#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:42,456 INFO L273 TraceCheckUtils]: 44: Hoare triple {67788#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {67788#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:42,457 INFO L273 TraceCheckUtils]: 45: Hoare triple {67788#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {67798#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:42,458 INFO L273 TraceCheckUtils]: 46: Hoare triple {67798#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67798#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:42,458 INFO L273 TraceCheckUtils]: 47: Hoare triple {67798#(<= main_~k~0 14)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {67798#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:42,459 INFO L273 TraceCheckUtils]: 48: Hoare triple {67798#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {67808#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:42,459 INFO L273 TraceCheckUtils]: 49: Hoare triple {67808#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67808#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:42,460 INFO L273 TraceCheckUtils]: 50: Hoare triple {67808#(<= main_~k~0 15)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {67808#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:42,461 INFO L273 TraceCheckUtils]: 51: Hoare triple {67808#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {67818#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:42,461 INFO L273 TraceCheckUtils]: 52: Hoare triple {67818#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67818#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:42,462 INFO L273 TraceCheckUtils]: 53: Hoare triple {67818#(<= main_~k~0 16)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {67818#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:42,462 INFO L273 TraceCheckUtils]: 54: Hoare triple {67818#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {67828#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:42,463 INFO L273 TraceCheckUtils]: 55: Hoare triple {67828#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67828#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:42,463 INFO L273 TraceCheckUtils]: 56: Hoare triple {67828#(<= main_~k~0 17)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {67828#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:42,464 INFO L273 TraceCheckUtils]: 57: Hoare triple {67828#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {67838#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:42,465 INFO L273 TraceCheckUtils]: 58: Hoare triple {67838#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67838#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:42,465 INFO L273 TraceCheckUtils]: 59: Hoare triple {67838#(<= main_~k~0 18)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {67838#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:42,466 INFO L273 TraceCheckUtils]: 60: Hoare triple {67838#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {67848#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:42,466 INFO L273 TraceCheckUtils]: 61: Hoare triple {67848#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67848#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:42,467 INFO L273 TraceCheckUtils]: 62: Hoare triple {67848#(<= main_~k~0 19)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {67848#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:42,468 INFO L273 TraceCheckUtils]: 63: Hoare triple {67848#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {67858#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:42,468 INFO L273 TraceCheckUtils]: 64: Hoare triple {67858#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67858#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:42,469 INFO L273 TraceCheckUtils]: 65: Hoare triple {67858#(<= main_~k~0 20)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {67858#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:42,469 INFO L273 TraceCheckUtils]: 66: Hoare triple {67858#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {67868#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:42,470 INFO L273 TraceCheckUtils]: 67: Hoare triple {67868#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67868#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:42,470 INFO L273 TraceCheckUtils]: 68: Hoare triple {67868#(<= main_~k~0 21)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {67868#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:42,471 INFO L273 TraceCheckUtils]: 69: Hoare triple {67868#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {67878#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:42,472 INFO L273 TraceCheckUtils]: 70: Hoare triple {67878#(<= main_~k~0 22)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67878#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:42,472 INFO L273 TraceCheckUtils]: 71: Hoare triple {67878#(<= main_~k~0 22)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {67878#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:42,473 INFO L273 TraceCheckUtils]: 72: Hoare triple {67878#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {67888#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:42,473 INFO L273 TraceCheckUtils]: 73: Hoare triple {67888#(<= main_~k~0 23)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67888#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:42,474 INFO L273 TraceCheckUtils]: 74: Hoare triple {67888#(<= main_~k~0 23)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {67888#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:42,475 INFO L273 TraceCheckUtils]: 75: Hoare triple {67888#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {67898#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:42,475 INFO L273 TraceCheckUtils]: 76: Hoare triple {67898#(<= main_~k~0 24)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67898#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:42,476 INFO L273 TraceCheckUtils]: 77: Hoare triple {67898#(<= main_~k~0 24)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {67898#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:42,476 INFO L273 TraceCheckUtils]: 78: Hoare triple {67898#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {67908#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:42,477 INFO L273 TraceCheckUtils]: 79: Hoare triple {67908#(<= main_~k~0 25)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67908#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:42,477 INFO L273 TraceCheckUtils]: 80: Hoare triple {67908#(<= main_~k~0 25)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {67908#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:42,478 INFO L273 TraceCheckUtils]: 81: Hoare triple {67908#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {67918#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:42,479 INFO L273 TraceCheckUtils]: 82: Hoare triple {67918#(<= main_~k~0 26)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67918#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:42,479 INFO L273 TraceCheckUtils]: 83: Hoare triple {67918#(<= main_~k~0 26)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {67918#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:42,480 INFO L273 TraceCheckUtils]: 84: Hoare triple {67918#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {67928#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:42,480 INFO L273 TraceCheckUtils]: 85: Hoare triple {67928#(<= main_~k~0 27)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67928#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:42,481 INFO L273 TraceCheckUtils]: 86: Hoare triple {67928#(<= main_~k~0 27)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {67928#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:42,482 INFO L273 TraceCheckUtils]: 87: Hoare triple {67928#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {67938#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:42,482 INFO L273 TraceCheckUtils]: 88: Hoare triple {67938#(<= main_~k~0 28)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67938#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:42,483 INFO L273 TraceCheckUtils]: 89: Hoare triple {67938#(<= main_~k~0 28)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {67938#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:42,483 INFO L273 TraceCheckUtils]: 90: Hoare triple {67938#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {67948#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:42,484 INFO L273 TraceCheckUtils]: 91: Hoare triple {67948#(<= main_~k~0 29)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67948#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:42,484 INFO L273 TraceCheckUtils]: 92: Hoare triple {67948#(<= main_~k~0 29)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {67948#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:42,485 INFO L273 TraceCheckUtils]: 93: Hoare triple {67948#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {67958#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:42,486 INFO L273 TraceCheckUtils]: 94: Hoare triple {67958#(<= main_~k~0 30)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67958#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:42,486 INFO L273 TraceCheckUtils]: 95: Hoare triple {67958#(<= main_~k~0 30)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {67958#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:42,487 INFO L273 TraceCheckUtils]: 96: Hoare triple {67958#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {67968#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:42,487 INFO L273 TraceCheckUtils]: 97: Hoare triple {67968#(<= main_~k~0 31)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67968#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:42,488 INFO L273 TraceCheckUtils]: 98: Hoare triple {67968#(<= main_~k~0 31)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {67968#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:42,488 INFO L273 TraceCheckUtils]: 99: Hoare triple {67968#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {67978#(<= main_~k~0 32)} is VALID [2018-11-23 11:54:42,489 INFO L273 TraceCheckUtils]: 100: Hoare triple {67978#(<= main_~k~0 32)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67978#(<= main_~k~0 32)} is VALID [2018-11-23 11:54:42,489 INFO L273 TraceCheckUtils]: 101: Hoare triple {67978#(<= main_~k~0 32)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {67978#(<= main_~k~0 32)} is VALID [2018-11-23 11:54:42,490 INFO L273 TraceCheckUtils]: 102: Hoare triple {67978#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {67988#(<= main_~k~0 33)} is VALID [2018-11-23 11:54:42,491 INFO L273 TraceCheckUtils]: 103: Hoare triple {67988#(<= main_~k~0 33)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67988#(<= main_~k~0 33)} is VALID [2018-11-23 11:54:42,491 INFO L273 TraceCheckUtils]: 104: Hoare triple {67988#(<= main_~k~0 33)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {67988#(<= main_~k~0 33)} is VALID [2018-11-23 11:54:42,492 INFO L273 TraceCheckUtils]: 105: Hoare triple {67988#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {67998#(<= main_~k~0 34)} is VALID [2018-11-23 11:54:42,492 INFO L273 TraceCheckUtils]: 106: Hoare triple {67998#(<= main_~k~0 34)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {67998#(<= main_~k~0 34)} is VALID [2018-11-23 11:54:42,493 INFO L273 TraceCheckUtils]: 107: Hoare triple {67998#(<= main_~k~0 34)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {67998#(<= main_~k~0 34)} is VALID [2018-11-23 11:54:42,494 INFO L273 TraceCheckUtils]: 108: Hoare triple {67998#(<= main_~k~0 34)} ~k~0 := 1 + ~k~0; {68008#(<= main_~k~0 35)} is VALID [2018-11-23 11:54:42,494 INFO L273 TraceCheckUtils]: 109: Hoare triple {68008#(<= main_~k~0 35)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {68008#(<= main_~k~0 35)} is VALID [2018-11-23 11:54:42,495 INFO L273 TraceCheckUtils]: 110: Hoare triple {68008#(<= main_~k~0 35)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {68008#(<= main_~k~0 35)} is VALID [2018-11-23 11:54:42,495 INFO L273 TraceCheckUtils]: 111: Hoare triple {68008#(<= main_~k~0 35)} ~k~0 := 1 + ~k~0; {68018#(<= main_~k~0 36)} is VALID [2018-11-23 11:54:42,496 INFO L273 TraceCheckUtils]: 112: Hoare triple {68018#(<= main_~k~0 36)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {68018#(<= main_~k~0 36)} is VALID [2018-11-23 11:54:42,496 INFO L273 TraceCheckUtils]: 113: Hoare triple {68018#(<= main_~k~0 36)} assume #t~mem0 < #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {68018#(<= main_~k~0 36)} is VALID [2018-11-23 11:54:42,497 INFO L273 TraceCheckUtils]: 114: Hoare triple {68018#(<= main_~k~0 36)} ~k~0 := 1 + ~k~0; {68028#(<= main_~k~0 37)} is VALID [2018-11-23 11:54:42,498 INFO L273 TraceCheckUtils]: 115: Hoare triple {68028#(<= main_~k~0 37)} assume !(~k~0 < 100000); {67607#false} is VALID [2018-11-23 11:54:42,498 INFO L273 TraceCheckUtils]: 116: Hoare triple {67607#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67607#false} is VALID [2018-11-23 11:54:42,498 INFO L273 TraceCheckUtils]: 117: Hoare triple {67607#false} ~x~0 := 0; {67607#false} is VALID [2018-11-23 11:54:42,498 INFO L273 TraceCheckUtils]: 118: Hoare triple {67607#false} assume !(~x~0 < ~i~0); {67607#false} is VALID [2018-11-23 11:54:42,499 INFO L273 TraceCheckUtils]: 119: Hoare triple {67607#false} ~x~0 := 0; {67607#false} is VALID [2018-11-23 11:54:42,499 INFO L273 TraceCheckUtils]: 120: Hoare triple {67607#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67607#false} is VALID [2018-11-23 11:54:42,499 INFO L256 TraceCheckUtils]: 121: Hoare triple {67607#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {67607#false} is VALID [2018-11-23 11:54:42,499 INFO L273 TraceCheckUtils]: 122: Hoare triple {67607#false} ~cond := #in~cond; {67607#false} is VALID [2018-11-23 11:54:42,499 INFO L273 TraceCheckUtils]: 123: Hoare triple {67607#false} assume !(0 == ~cond); {67607#false} is VALID [2018-11-23 11:54:42,500 INFO L273 TraceCheckUtils]: 124: Hoare triple {67607#false} assume true; {67607#false} is VALID [2018-11-23 11:54:42,500 INFO L268 TraceCheckUtils]: 125: Hoare quadruple {67607#false} {67607#false} #136#return; {67607#false} is VALID [2018-11-23 11:54:42,500 INFO L273 TraceCheckUtils]: 126: Hoare triple {67607#false} havoc #t~mem9;havoc #t~mem10; {67607#false} is VALID [2018-11-23 11:54:42,500 INFO L273 TraceCheckUtils]: 127: Hoare triple {67607#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {67607#false} is VALID [2018-11-23 11:54:42,500 INFO L273 TraceCheckUtils]: 128: Hoare triple {67607#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67607#false} is VALID [2018-11-23 11:54:42,501 INFO L256 TraceCheckUtils]: 129: Hoare triple {67607#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {67607#false} is VALID [2018-11-23 11:54:42,501 INFO L273 TraceCheckUtils]: 130: Hoare triple {67607#false} ~cond := #in~cond; {67607#false} is VALID [2018-11-23 11:54:42,501 INFO L273 TraceCheckUtils]: 131: Hoare triple {67607#false} assume 0 == ~cond; {67607#false} is VALID [2018-11-23 11:54:42,501 INFO L273 TraceCheckUtils]: 132: Hoare triple {67607#false} assume !false; {67607#false} is VALID [2018-11-23 11:54:42,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1930 backedges. 0 proven. 1926 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:54:42,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:42,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 78 [2018-11-23 11:54:42,534 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 133 [2018-11-23 11:54:42,535 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:42,535 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 78 states. [2018-11-23 11:54:42,789 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 246 edges. 246 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:42,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-11-23 11:54:42,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-11-23 11:54:42,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2263, Invalid=3743, Unknown=0, NotChecked=0, Total=6006 [2018-11-23 11:54:42,791 INFO L87 Difference]: Start difference. First operand 449 states and 650 transitions. Second operand 78 states.