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_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:58:30,357 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:58:30,359 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:58:30,374 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:58:30,375 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:58:30,376 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:58:30,377 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:58:30,379 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:58:30,380 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:58:30,383 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:58:30,384 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:58:30,385 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:58:30,385 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:58:30,388 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:58:30,389 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:58:30,390 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:58:30,394 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:58:30,395 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:58:30,397 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:58:30,399 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:58:30,401 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:58:30,403 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:58:30,406 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:58:30,406 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:58:30,406 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:58:30,408 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:58:30,409 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:58:30,413 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:58:30,414 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:58:30,416 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:58:30,417 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:58:30,417 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:58:30,417 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:58:30,419 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:58:30,420 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:58:30,422 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:58:30,422 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 11:58:30,451 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:58:30,451 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:58:30,454 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:58:30,455 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:58:30,455 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:58:30,455 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:58:30,456 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:58:30,456 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:58:30,456 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:58:30,456 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 11:58:30,456 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:58:30,457 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:58:30,457 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:58:30,458 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:58:30,458 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:58:30,458 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:58:30,458 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:58:30,458 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:58:30,459 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:58:30,459 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:58:30,459 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:58:30,459 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:58:30,459 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:58:30,460 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:58:30,461 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:58:30,461 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:58:30,461 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:58:30,461 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 11:58:30,462 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:58:30,462 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 11:58:30,462 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:58:30,521 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:58:30,536 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:58:30,541 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:58:30,543 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:58:30,543 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:58:30,544 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/sorting_selectionsort_true-unreach-call_ground.i [2018-11-23 11:58:30,615 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7c8269d5/ee77b4dc63f44fbdb7b6695776e740aa/FLAG5e853c513 [2018-11-23 11:58:31,097 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:58:31,097 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/sorting_selectionsort_true-unreach-call_ground.i [2018-11-23 11:58:31,104 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7c8269d5/ee77b4dc63f44fbdb7b6695776e740aa/FLAG5e853c513 [2018-11-23 11:58:31,461 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7c8269d5/ee77b4dc63f44fbdb7b6695776e740aa [2018-11-23 11:58:31,471 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:58:31,473 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:58:31,474 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:58:31,474 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:58:31,478 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:58:31,479 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:58:31" (1/1) ... [2018-11-23 11:58:31,482 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7629bdd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:31, skipping insertion in model container [2018-11-23 11:58:31,482 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:58:31" (1/1) ... [2018-11-23 11:58:31,493 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:58:31,517 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:58:31,735 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:58:31,741 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:58:31,786 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:58:31,816 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:58:31,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:31 WrapperNode [2018-11-23 11:58:31,817 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:58:31,818 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:58:31,818 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:58:31,819 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:58:31,829 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:31" (1/1) ... [2018-11-23 11:58:31,840 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:31" (1/1) ... [2018-11-23 11:58:31,848 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:58:31,849 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:58:31,849 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:58:31,849 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:58:31,860 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:31" (1/1) ... [2018-11-23 11:58:31,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:31" (1/1) ... [2018-11-23 11:58:31,863 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:31" (1/1) ... [2018-11-23 11:58:31,863 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:31" (1/1) ... [2018-11-23 11:58:31,877 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:31" (1/1) ... [2018-11-23 11:58:31,892 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:31" (1/1) ... [2018-11-23 11:58:31,896 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:31" (1/1) ... [2018-11-23 11:58:31,898 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:58:31,903 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:58:31,903 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:58:31,903 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:58:31,904 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:58:32,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 11:58:32,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:58:32,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:58:32,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:58:32,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:58:32,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:58:32,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 11:58:32,093 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:58:32,093 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:58:32,093 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:58:32,094 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:58:32,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:58:33,032 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:58:33,033 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-23 11:58:33,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:58:33 BoogieIcfgContainer [2018-11-23 11:58:33,034 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:58:33,035 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:58:33,035 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:58:33,039 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:58:33,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:58:31" (1/3) ... [2018-11-23 11:58:33,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@348c2a80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:58:33, skipping insertion in model container [2018-11-23 11:58:33,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:31" (2/3) ... [2018-11-23 11:58:33,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@348c2a80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:58:33, skipping insertion in model container [2018-11-23 11:58:33,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:58:33" (3/3) ... [2018-11-23 11:58:33,043 INFO L112 eAbstractionObserver]: Analyzing ICFG sorting_selectionsort_true-unreach-call_ground.i [2018-11-23 11:58:33,053 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:58:33,062 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:58:33,081 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:58:33,115 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:58:33,116 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:58:33,116 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:58:33,116 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:58:33,116 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:58:33,116 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:58:33,117 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:58:33,117 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:58:33,117 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:58:33,135 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-11-23 11:58:33,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:58:33,142 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:33,143 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:33,145 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:33,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:33,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1945224924, now seen corresponding path program 1 times [2018-11-23 11:58:33,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:33,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:33,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:33,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:33,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:33,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:33,337 INFO L256 TraceCheckUtils]: 0: Hoare triple {45#true} call ULTIMATE.init(); {45#true} is VALID [2018-11-23 11:58:33,341 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:58:33,341 INFO L273 TraceCheckUtils]: 2: Hoare triple {45#true} assume true; {45#true} is VALID [2018-11-23 11:58:33,342 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {45#true} {45#true} #130#return; {45#true} is VALID [2018-11-23 11:58:33,342 INFO L256 TraceCheckUtils]: 4: Hoare triple {45#true} call #t~ret15 := main(); {45#true} is VALID [2018-11-23 11:58:33,342 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:58:33,343 INFO L273 TraceCheckUtils]: 6: Hoare triple {45#true} assume !true; {46#false} is VALID [2018-11-23 11:58:33,344 INFO L273 TraceCheckUtils]: 7: Hoare triple {46#false} ~x~0 := 0; {46#false} is VALID [2018-11-23 11:58:33,344 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:58:33,344 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:58:33,345 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:58:33,345 INFO L273 TraceCheckUtils]: 11: Hoare triple {46#false} ~cond := #in~cond; {46#false} is VALID [2018-11-23 11:58:33,345 INFO L273 TraceCheckUtils]: 12: Hoare triple {46#false} assume 0 == ~cond; {46#false} is VALID [2018-11-23 11:58:33,346 INFO L273 TraceCheckUtils]: 13: Hoare triple {46#false} assume !false; {46#false} is VALID [2018-11-23 11:58:33,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:33,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:58:33,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:58:33,357 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 11:58:33,360 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:33,364 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:58:33,442 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:58:33,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:58:33,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:58:33,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:58:33,456 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 2 states. [2018-11-23 11:58:33,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:33,650 INFO L93 Difference]: Finished difference Result 78 states and 117 transitions. [2018-11-23 11:58:33,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:58:33,650 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 11:58:33,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:33,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:58:33,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 117 transitions. [2018-11-23 11:58:33,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:58:33,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 117 transitions. [2018-11-23 11:58:33,672 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 117 transitions. [2018-11-23 11:58:34,188 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:58:34,202 INFO L225 Difference]: With dead ends: 78 [2018-11-23 11:58:34,203 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 11:58:34,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:58:34,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 11:58:34,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-23 11:58:34,344 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:34,344 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2018-11-23 11:58:34,345 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-23 11:58:34,345 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-23 11:58:34,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:34,352 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2018-11-23 11:58:34,352 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2018-11-23 11:58:34,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:34,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:34,354 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-23 11:58:34,354 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-23 11:58:34,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:34,360 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2018-11-23 11:58:34,360 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2018-11-23 11:58:34,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:34,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:34,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:34,362 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:34,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 11:58:34,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2018-11-23 11:58:34,367 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 14 [2018-11-23 11:58:34,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:34,368 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2018-11-23 11:58:34,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:58:34,368 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2018-11-23 11:58:34,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:58:34,369 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:34,370 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:34,370 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:34,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:34,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1826279014, now seen corresponding path program 1 times [2018-11-23 11:58:34,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:34,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:34,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:34,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:34,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:34,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:34,447 INFO L256 TraceCheckUtils]: 0: Hoare triple {279#true} call ULTIMATE.init(); {279#true} is VALID [2018-11-23 11:58:34,447 INFO L273 TraceCheckUtils]: 1: Hoare triple {279#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {279#true} is VALID [2018-11-23 11:58:34,448 INFO L273 TraceCheckUtils]: 2: Hoare triple {279#true} assume true; {279#true} is VALID [2018-11-23 11:58:34,448 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {279#true} {279#true} #130#return; {279#true} is VALID [2018-11-23 11:58:34,448 INFO L256 TraceCheckUtils]: 4: Hoare triple {279#true} call #t~ret15 := main(); {279#true} is VALID [2018-11-23 11:58:34,449 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:58:34,453 INFO L273 TraceCheckUtils]: 6: Hoare triple {281#(= main_~i~0 0)} assume !(~i~0 < 100000); {280#false} is VALID [2018-11-23 11:58:34,453 INFO L273 TraceCheckUtils]: 7: Hoare triple {280#false} ~x~0 := 0; {280#false} is VALID [2018-11-23 11:58:34,453 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:58:34,454 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:58:34,454 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:58:34,454 INFO L273 TraceCheckUtils]: 11: Hoare triple {280#false} ~cond := #in~cond; {280#false} is VALID [2018-11-23 11:58:34,455 INFO L273 TraceCheckUtils]: 12: Hoare triple {280#false} assume 0 == ~cond; {280#false} is VALID [2018-11-23 11:58:34,455 INFO L273 TraceCheckUtils]: 13: Hoare triple {280#false} assume !false; {280#false} is VALID [2018-11-23 11:58:34,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:34,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:58:34,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:58:34,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 11:58:34,459 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:34,459 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:58:34,485 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:58:34,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:58:34,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:58:34,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:58:34,487 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand 3 states. [2018-11-23 11:58:34,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:34,884 INFO L93 Difference]: Finished difference Result 68 states and 88 transitions. [2018-11-23 11:58:34,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:58:34,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 11:58:34,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:34,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:58:34,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2018-11-23 11:58:34,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:58:34,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2018-11-23 11:58:34,894 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 88 transitions. [2018-11-23 11:58:35,101 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:58:35,104 INFO L225 Difference]: With dead ends: 68 [2018-11-23 11:58:35,105 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 11:58:35,106 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:58:35,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 11:58:35,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 38. [2018-11-23 11:58:35,135 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:35,135 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 38 states. [2018-11-23 11:58:35,135 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 38 states. [2018-11-23 11:58:35,135 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 38 states. [2018-11-23 11:58:35,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:35,146 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2018-11-23 11:58:35,146 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 73 transitions. [2018-11-23 11:58:35,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:35,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:35,148 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 55 states. [2018-11-23 11:58:35,148 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 55 states. [2018-11-23 11:58:35,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:35,158 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2018-11-23 11:58:35,158 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 73 transitions. [2018-11-23 11:58:35,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:35,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:35,161 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:35,161 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:35,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 11:58:35,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2018-11-23 11:58:35,167 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 48 transitions. Word has length 14 [2018-11-23 11:58:35,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:35,168 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 48 transitions. [2018-11-23 11:58:35,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:58:35,169 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2018-11-23 11:58:35,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:58:35,171 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:35,171 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:35,172 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:35,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:35,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1905148503, now seen corresponding path program 1 times [2018-11-23 11:58:35,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:35,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:35,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:35,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:35,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:35,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:35,264 INFO L256 TraceCheckUtils]: 0: Hoare triple {542#true} call ULTIMATE.init(); {542#true} is VALID [2018-11-23 11:58:35,264 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:58:35,265 INFO L273 TraceCheckUtils]: 2: Hoare triple {542#true} assume true; {542#true} is VALID [2018-11-23 11:58:35,265 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {542#true} {542#true} #130#return; {542#true} is VALID [2018-11-23 11:58:35,265 INFO L256 TraceCheckUtils]: 4: Hoare triple {542#true} call #t~ret15 := main(); {542#true} is VALID [2018-11-23 11:58:35,265 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:58:35,266 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:58:35,268 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:58:35,279 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:58:35,279 INFO L273 TraceCheckUtils]: 9: Hoare triple {543#false} ~x~0 := 0; {543#false} is VALID [2018-11-23 11:58:35,280 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:58:35,280 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:58:35,281 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:58:35,281 INFO L273 TraceCheckUtils]: 13: Hoare triple {543#false} ~cond := #in~cond; {543#false} is VALID [2018-11-23 11:58:35,281 INFO L273 TraceCheckUtils]: 14: Hoare triple {543#false} assume 0 == ~cond; {543#false} is VALID [2018-11-23 11:58:35,281 INFO L273 TraceCheckUtils]: 15: Hoare triple {543#false} assume !false; {543#false} is VALID [2018-11-23 11:58:35,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:35,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:58:35,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:58:35,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 11:58:35,284 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:35,284 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:58:35,315 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:35,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:58:35,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:58:35,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:58:35,316 INFO L87 Difference]: Start difference. First operand 38 states and 48 transitions. Second operand 3 states. [2018-11-23 11:58:35,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:35,564 INFO L93 Difference]: Finished difference Result 86 states and 114 transitions. [2018-11-23 11:58:35,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:58:35,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 11:58:35,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:35,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:58:35,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2018-11-23 11:58:35,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:58:35,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2018-11-23 11:58:35,572 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 113 transitions. [2018-11-23 11:58:35,762 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:58:35,767 INFO L225 Difference]: With dead ends: 86 [2018-11-23 11:58:35,767 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 11:58:35,768 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:58:35,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 11:58:35,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2018-11-23 11:58:35,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:35,807 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 42 states. [2018-11-23 11:58:35,807 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 42 states. [2018-11-23 11:58:35,807 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 42 states. [2018-11-23 11:58:35,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:35,811 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2018-11-23 11:58:35,811 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 72 transitions. [2018-11-23 11:58:35,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:35,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:35,812 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 55 states. [2018-11-23 11:58:35,813 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 55 states. [2018-11-23 11:58:35,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:35,816 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2018-11-23 11:58:35,817 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 72 transitions. [2018-11-23 11:58:35,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:35,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:35,818 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:35,818 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:35,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 11:58:35,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 54 transitions. [2018-11-23 11:58:35,821 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 54 transitions. Word has length 16 [2018-11-23 11:58:35,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:35,821 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 54 transitions. [2018-11-23 11:58:35,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:58:35,822 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 54 transitions. [2018-11-23 11:58:35,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:58:35,823 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:35,823 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:35,823 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:35,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:35,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1580472167, now seen corresponding path program 1 times [2018-11-23 11:58:35,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:35,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:35,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:35,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:35,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:35,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:35,933 INFO L256 TraceCheckUtils]: 0: Hoare triple {835#true} call ULTIMATE.init(); {835#true} is VALID [2018-11-23 11:58:35,933 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:58:35,933 INFO L273 TraceCheckUtils]: 2: Hoare triple {835#true} assume true; {835#true} is VALID [2018-11-23 11:58:35,934 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {835#true} {835#true} #130#return; {835#true} is VALID [2018-11-23 11:58:35,934 INFO L256 TraceCheckUtils]: 4: Hoare triple {835#true} call #t~ret15 := main(); {835#true} is VALID [2018-11-23 11:58:35,936 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:58:35,936 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:58:35,940 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:58:35,940 INFO L273 TraceCheckUtils]: 8: Hoare triple {836#false} assume !(~s~0 != ~i~0); {836#false} is VALID [2018-11-23 11:58:35,940 INFO L273 TraceCheckUtils]: 9: Hoare triple {836#false} ~x~0 := 0; {836#false} is VALID [2018-11-23 11:58:35,941 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:58:35,941 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:58:35,941 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:58:35,941 INFO L273 TraceCheckUtils]: 13: Hoare triple {836#false} ~cond := #in~cond; {836#false} is VALID [2018-11-23 11:58:35,942 INFO L273 TraceCheckUtils]: 14: Hoare triple {836#false} assume 0 == ~cond; {836#false} is VALID [2018-11-23 11:58:35,942 INFO L273 TraceCheckUtils]: 15: Hoare triple {836#false} assume !false; {836#false} is VALID [2018-11-23 11:58:35,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:35,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:58:35,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:58:35,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-11-23 11:58:35,944 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:35,944 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:58:35,969 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:35,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:58:35,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:58:35,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:58:35,970 INFO L87 Difference]: Start difference. First operand 42 states and 54 transitions. Second operand 4 states. [2018-11-23 11:58:36,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:36,283 INFO L93 Difference]: Finished difference Result 102 states and 138 transitions. [2018-11-23 11:58:36,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:58:36,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-11-23 11:58:36,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:36,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:58:36,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2018-11-23 11:58:36,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:58:36,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2018-11-23 11:58:36,291 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 119 transitions. [2018-11-23 11:58:36,511 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:58:36,513 INFO L225 Difference]: With dead ends: 102 [2018-11-23 11:58:36,513 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 11:58:36,514 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:58:36,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 11:58:36,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 43. [2018-11-23 11:58:36,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:36,576 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 43 states. [2018-11-23 11:58:36,576 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 43 states. [2018-11-23 11:58:36,577 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 43 states. [2018-11-23 11:58:36,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:36,581 INFO L93 Difference]: Finished difference Result 67 states and 90 transitions. [2018-11-23 11:58:36,581 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 90 transitions. [2018-11-23 11:58:36,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:36,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:36,583 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 67 states. [2018-11-23 11:58:36,583 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 67 states. [2018-11-23 11:58:36,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:36,587 INFO L93 Difference]: Finished difference Result 67 states and 90 transitions. [2018-11-23 11:58:36,587 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 90 transitions. [2018-11-23 11:58:36,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:36,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:36,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:36,588 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:36,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 11:58:36,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2018-11-23 11:58:36,591 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 16 [2018-11-23 11:58:36,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:36,592 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2018-11-23 11:58:36,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:58:36,592 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2018-11-23 11:58:36,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 11:58:36,593 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:36,593 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:58:36,593 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:36,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:36,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1505214684, now seen corresponding path program 1 times [2018-11-23 11:58:36,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:36,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:36,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:36,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:36,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:36,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:36,766 INFO L256 TraceCheckUtils]: 0: Hoare triple {1175#true} call ULTIMATE.init(); {1175#true} is VALID [2018-11-23 11:58:36,767 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:58:36,767 INFO L273 TraceCheckUtils]: 2: Hoare triple {1175#true} assume true; {1175#true} is VALID [2018-11-23 11:58:36,768 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1175#true} {1175#true} #130#return; {1175#true} is VALID [2018-11-23 11:58:36,768 INFO L256 TraceCheckUtils]: 4: Hoare triple {1175#true} call #t~ret15 := main(); {1175#true} is VALID [2018-11-23 11:58:36,770 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:58:36,771 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:58:36,772 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:58:36,772 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~mem1;havoc #t~mem0;~s~0 := ~k~0; {1178#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:36,773 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:58:36,774 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:58:36,774 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:58:36,775 INFO L273 TraceCheckUtils]: 12: Hoare triple {1176#false} ~x~0 := 0; {1176#false} is VALID [2018-11-23 11:58:36,775 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:58:36,776 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:58:36,776 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:58:36,777 INFO L273 TraceCheckUtils]: 16: Hoare triple {1176#false} ~cond := #in~cond; {1176#false} is VALID [2018-11-23 11:58:36,777 INFO L273 TraceCheckUtils]: 17: Hoare triple {1176#false} assume 0 == ~cond; {1176#false} is VALID [2018-11-23 11:58:36,778 INFO L273 TraceCheckUtils]: 18: Hoare triple {1176#false} assume !false; {1176#false} is VALID [2018-11-23 11:58:36,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:36,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:36,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 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:58:36,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:36,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:36,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:36,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:37,116 INFO L256 TraceCheckUtils]: 0: Hoare triple {1175#true} call ULTIMATE.init(); {1175#true} is VALID [2018-11-23 11:58:37,116 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:58:37,117 INFO L273 TraceCheckUtils]: 2: Hoare triple {1175#true} assume true; {1175#true} is VALID [2018-11-23 11:58:37,117 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1175#true} {1175#true} #130#return; {1175#true} is VALID [2018-11-23 11:58:37,118 INFO L256 TraceCheckUtils]: 4: Hoare triple {1175#true} call #t~ret15 := main(); {1175#true} is VALID [2018-11-23 11:58:37,127 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:58:37,129 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:58:37,131 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:58:37,131 INFO L273 TraceCheckUtils]: 8: Hoare triple {1202#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {1202#(<= main_~k~0 1)} is VALID [2018-11-23 11:58:37,132 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:58:37,132 INFO L273 TraceCheckUtils]: 10: Hoare triple {1212#(<= main_~k~0 2)} assume !(~k~0 < 100000); {1176#false} is VALID [2018-11-23 11:58:37,133 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:58:37,133 INFO L273 TraceCheckUtils]: 12: Hoare triple {1176#false} ~x~0 := 0; {1176#false} is VALID [2018-11-23 11:58:37,133 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:58:37,134 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:58:37,134 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:58:37,134 INFO L273 TraceCheckUtils]: 16: Hoare triple {1176#false} ~cond := #in~cond; {1176#false} is VALID [2018-11-23 11:58:37,134 INFO L273 TraceCheckUtils]: 17: Hoare triple {1176#false} assume 0 == ~cond; {1176#false} is VALID [2018-11-23 11:58:37,135 INFO L273 TraceCheckUtils]: 18: Hoare triple {1176#false} assume !false; {1176#false} is VALID [2018-11-23 11:58:37,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:37,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:37,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-23 11:58:37,159 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-11-23 11:58:37,159 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:37,159 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:58:37,275 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:37,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:58:37,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:58:37,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:58:37,276 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. Second operand 8 states. [2018-11-23 11:58:37,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:37,888 INFO L93 Difference]: Finished difference Result 108 states and 147 transitions. [2018-11-23 11:58:37,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:58:37,888 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-11-23 11:58:37,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:37,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:58:37,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2018-11-23 11:58:37,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:58:37,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2018-11-23 11:58:37,895 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 123 transitions. [2018-11-23 11:58:38,086 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:58:38,089 INFO L225 Difference]: With dead ends: 108 [2018-11-23 11:58:38,090 INFO L226 Difference]: Without dead ends: 73 [2018-11-23 11:58:38,090 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:58:38,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-23 11:58:38,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 48. [2018-11-23 11:58:38,122 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:38,122 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 48 states. [2018-11-23 11:58:38,123 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 48 states. [2018-11-23 11:58:38,123 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 48 states. [2018-11-23 11:58:38,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:38,127 INFO L93 Difference]: Finished difference Result 73 states and 98 transitions. [2018-11-23 11:58:38,127 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 98 transitions. [2018-11-23 11:58:38,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:38,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:38,128 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 73 states. [2018-11-23 11:58:38,128 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 73 states. [2018-11-23 11:58:38,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:38,132 INFO L93 Difference]: Finished difference Result 73 states and 98 transitions. [2018-11-23 11:58:38,132 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 98 transitions. [2018-11-23 11:58:38,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:38,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:38,133 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:38,134 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:38,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 11:58:38,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 61 transitions. [2018-11-23 11:58:38,136 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 61 transitions. Word has length 19 [2018-11-23 11:58:38,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:38,136 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 61 transitions. [2018-11-23 11:58:38,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:58:38,137 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2018-11-23 11:58:38,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 11:58:38,137 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:38,138 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:58:38,138 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:38,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:38,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1316091959, now seen corresponding path program 2 times [2018-11-23 11:58:38,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:38,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:38,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:38,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:38,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:38,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:38,312 INFO L256 TraceCheckUtils]: 0: Hoare triple {1600#true} call ULTIMATE.init(); {1600#true} is VALID [2018-11-23 11:58:38,313 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:58:38,313 INFO L273 TraceCheckUtils]: 2: Hoare triple {1600#true} assume true; {1600#true} is VALID [2018-11-23 11:58:38,313 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1600#true} {1600#true} #130#return; {1600#true} is VALID [2018-11-23 11:58:38,314 INFO L256 TraceCheckUtils]: 4: Hoare triple {1600#true} call #t~ret15 := main(); {1600#true} is VALID [2018-11-23 11:58:38,315 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:58:38,318 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:58:38,323 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:58:38,323 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~mem1;havoc #t~mem0;~s~0 := ~k~0; {1603#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:38,325 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:58:38,325 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:58:38,327 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~mem1;havoc #t~mem0;~s~0 := ~k~0; {1604#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:38,329 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:58:38,330 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:58:38,330 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:58:38,331 INFO L273 TraceCheckUtils]: 15: Hoare triple {1601#false} ~x~0 := 0; {1601#false} is VALID [2018-11-23 11:58:38,331 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:58:38,332 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:58:38,332 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:58:38,332 INFO L273 TraceCheckUtils]: 19: Hoare triple {1601#false} ~cond := #in~cond; {1601#false} is VALID [2018-11-23 11:58:38,333 INFO L273 TraceCheckUtils]: 20: Hoare triple {1601#false} assume 0 == ~cond; {1601#false} is VALID [2018-11-23 11:58:38,333 INFO L273 TraceCheckUtils]: 21: Hoare triple {1601#false} assume !false; {1601#false} is VALID [2018-11-23 11:58:38,334 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:38,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:38,334 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:58:38,343 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:58:38,361 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 11:58:38,361 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:38,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:38,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:38,461 INFO L256 TraceCheckUtils]: 0: Hoare triple {1600#true} call ULTIMATE.init(); {1600#true} is VALID [2018-11-23 11:58:38,462 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:58:38,462 INFO L273 TraceCheckUtils]: 2: Hoare triple {1600#true} assume true; {1600#true} is VALID [2018-11-23 11:58:38,463 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1600#true} {1600#true} #130#return; {1600#true} is VALID [2018-11-23 11:58:38,463 INFO L256 TraceCheckUtils]: 4: Hoare triple {1600#true} call #t~ret15 := main(); {1600#true} is VALID [2018-11-23 11:58:38,477 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:58:38,478 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:58:38,481 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:58:38,485 INFO L273 TraceCheckUtils]: 8: Hoare triple {1624#(<= main_~i~0 0)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {1624#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:38,485 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:58:38,487 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:58:38,487 INFO L273 TraceCheckUtils]: 11: Hoare triple {1624#(<= main_~i~0 0)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {1624#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:38,488 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:58:38,488 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:58:38,488 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:58:38,489 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:58:38,490 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:58:38,490 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:58:38,490 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:58:38,491 INFO L273 TraceCheckUtils]: 19: Hoare triple {1601#false} ~cond := #in~cond; {1601#false} is VALID [2018-11-23 11:58:38,491 INFO L273 TraceCheckUtils]: 20: Hoare triple {1601#false} assume 0 == ~cond; {1601#false} is VALID [2018-11-23 11:58:38,492 INFO L273 TraceCheckUtils]: 21: Hoare triple {1601#false} assume !false; {1601#false} is VALID [2018-11-23 11:58:38,493 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:58:38,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 11:58:38,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-11-23 11:58:38,513 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-11-23 11:58:38,513 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:38,514 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:58:38,614 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:38,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:58:38,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:58:38,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:58:38,615 INFO L87 Difference]: Start difference. First operand 48 states and 61 transitions. Second operand 8 states. [2018-11-23 11:58:39,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:39,158 INFO L93 Difference]: Finished difference Result 109 states and 148 transitions. [2018-11-23 11:58:39,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:58:39,158 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-11-23 11:58:39,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:39,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:58:39,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2018-11-23 11:58:39,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:58:39,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2018-11-23 11:58:39,164 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 120 transitions. [2018-11-23 11:58:39,513 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:58:39,516 INFO L225 Difference]: With dead ends: 109 [2018-11-23 11:58:39,516 INFO L226 Difference]: Without dead ends: 74 [2018-11-23 11:58:39,517 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:58:39,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-23 11:58:39,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 64. [2018-11-23 11:58:39,603 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:39,603 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 64 states. [2018-11-23 11:58:39,603 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 64 states. [2018-11-23 11:58:39,603 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 64 states. [2018-11-23 11:58:39,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:39,608 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2018-11-23 11:58:39,608 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 98 transitions. [2018-11-23 11:58:39,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:39,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:39,609 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 74 states. [2018-11-23 11:58:39,609 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 74 states. [2018-11-23 11:58:39,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:39,612 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2018-11-23 11:58:39,612 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 98 transitions. [2018-11-23 11:58:39,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:39,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:39,613 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:39,613 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:39,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 11:58:39,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 84 transitions. [2018-11-23 11:58:39,616 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 84 transitions. Word has length 22 [2018-11-23 11:58:39,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:39,617 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 84 transitions. [2018-11-23 11:58:39,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:58:39,617 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 84 transitions. [2018-11-23 11:58:39,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 11:58:39,618 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:39,618 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:58:39,618 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:39,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:39,619 INFO L82 PathProgramCache]: Analyzing trace with hash 335283198, now seen corresponding path program 1 times [2018-11-23 11:58:39,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:39,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:39,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:39,620 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:39,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:39,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:39,860 INFO L256 TraceCheckUtils]: 0: Hoare triple {2060#true} call ULTIMATE.init(); {2060#true} is VALID [2018-11-23 11:58:39,861 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:58:39,861 INFO L273 TraceCheckUtils]: 2: Hoare triple {2060#true} assume true; {2060#true} is VALID [2018-11-23 11:58:39,861 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2060#true} {2060#true} #130#return; {2060#true} is VALID [2018-11-23 11:58:39,862 INFO L256 TraceCheckUtils]: 4: Hoare triple {2060#true} call #t~ret15 := main(); {2060#true} is VALID [2018-11-23 11:58:39,862 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:58:39,863 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:58:39,864 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:58:39,864 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~mem1;havoc #t~mem0;~s~0 := ~k~0; {2063#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:39,865 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:58:39,866 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:58:39,867 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~mem1;havoc #t~mem0;~s~0 := ~k~0; {2064#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:39,869 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:58:39,890 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:58:39,904 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~mem1;havoc #t~mem0;~s~0 := ~k~0; {2065#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:39,909 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:58:39,909 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:58:39,910 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:58:39,910 INFO L273 TraceCheckUtils]: 18: Hoare triple {2061#false} ~x~0 := 0; {2061#false} is VALID [2018-11-23 11:58:39,910 INFO L273 TraceCheckUtils]: 19: Hoare triple {2061#false} assume !(~x~0 < ~i~0); {2061#false} is VALID [2018-11-23 11:58:39,910 INFO L273 TraceCheckUtils]: 20: Hoare triple {2061#false} ~x~0 := ~i~0; {2061#false} is VALID [2018-11-23 11:58:39,911 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:58:39,911 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:58:39,911 INFO L273 TraceCheckUtils]: 23: Hoare triple {2061#false} ~cond := #in~cond; {2061#false} is VALID [2018-11-23 11:58:39,911 INFO L273 TraceCheckUtils]: 24: Hoare triple {2061#false} assume 0 == ~cond; {2061#false} is VALID [2018-11-23 11:58:39,911 INFO L273 TraceCheckUtils]: 25: Hoare triple {2061#false} assume !false; {2061#false} is VALID [2018-11-23 11:58:39,913 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:39,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:39,913 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:58:39,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:39,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:39,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:39,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:40,109 INFO L256 TraceCheckUtils]: 0: Hoare triple {2060#true} call ULTIMATE.init(); {2060#true} is VALID [2018-11-23 11:58:40,109 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:58:40,110 INFO L273 TraceCheckUtils]: 2: Hoare triple {2060#true} assume true; {2060#true} is VALID [2018-11-23 11:58:40,110 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2060#true} {2060#true} #130#return; {2060#true} is VALID [2018-11-23 11:58:40,110 INFO L256 TraceCheckUtils]: 4: Hoare triple {2060#true} call #t~ret15 := main(); {2060#true} is VALID [2018-11-23 11:58:40,111 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:58:40,112 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:58:40,113 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:58:40,113 INFO L273 TraceCheckUtils]: 8: Hoare triple {2089#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {2089#(<= main_~k~0 1)} is VALID [2018-11-23 11:58:40,114 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:58:40,114 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:58:40,115 INFO L273 TraceCheckUtils]: 11: Hoare triple {2099#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {2099#(<= main_~k~0 2)} is VALID [2018-11-23 11:58:40,116 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:58:40,117 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:58:40,121 INFO L273 TraceCheckUtils]: 14: Hoare triple {2109#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {2109#(<= main_~k~0 3)} is VALID [2018-11-23 11:58:40,122 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:58:40,122 INFO L273 TraceCheckUtils]: 16: Hoare triple {2119#(<= main_~k~0 4)} assume !(~k~0 < 100000); {2061#false} is VALID [2018-11-23 11:58:40,123 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:58:40,123 INFO L273 TraceCheckUtils]: 18: Hoare triple {2061#false} ~x~0 := 0; {2061#false} is VALID [2018-11-23 11:58:40,123 INFO L273 TraceCheckUtils]: 19: Hoare triple {2061#false} assume !(~x~0 < ~i~0); {2061#false} is VALID [2018-11-23 11:58:40,124 INFO L273 TraceCheckUtils]: 20: Hoare triple {2061#false} ~x~0 := ~i~0; {2061#false} is VALID [2018-11-23 11:58:40,124 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:58:40,124 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:58:40,124 INFO L273 TraceCheckUtils]: 23: Hoare triple {2061#false} ~cond := #in~cond; {2061#false} is VALID [2018-11-23 11:58:40,125 INFO L273 TraceCheckUtils]: 24: Hoare triple {2061#false} assume 0 == ~cond; {2061#false} is VALID [2018-11-23 11:58:40,125 INFO L273 TraceCheckUtils]: 25: Hoare triple {2061#false} assume !false; {2061#false} is VALID [2018-11-23 11:58:40,126 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:40,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:40,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 11:58:40,149 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-11-23 11:58:40,149 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:40,149 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:58:40,192 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:40,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:58:40,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:58:40,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:58:40,194 INFO L87 Difference]: Start difference. First operand 64 states and 84 transitions. Second operand 12 states. [2018-11-23 11:58:41,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:41,132 INFO L93 Difference]: Finished difference Result 119 states and 160 transitions. [2018-11-23 11:58:41,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:58:41,132 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-11-23 11:58:41,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:41,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:58:41,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2018-11-23 11:58:41,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:58:41,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2018-11-23 11:58:41,137 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 123 transitions. [2018-11-23 11:58:41,429 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:58:41,431 INFO L225 Difference]: With dead ends: 119 [2018-11-23 11:58:41,431 INFO L226 Difference]: Without dead ends: 80 [2018-11-23 11:58:41,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:58:41,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-23 11:58:41,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 70. [2018-11-23 11:58:41,480 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:41,480 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 70 states. [2018-11-23 11:58:41,480 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 70 states. [2018-11-23 11:58:41,480 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 70 states. [2018-11-23 11:58:41,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:41,483 INFO L93 Difference]: Finished difference Result 80 states and 106 transitions. [2018-11-23 11:58:41,483 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 106 transitions. [2018-11-23 11:58:41,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:41,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:41,484 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 80 states. [2018-11-23 11:58:41,484 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 80 states. [2018-11-23 11:58:41,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:41,488 INFO L93 Difference]: Finished difference Result 80 states and 106 transitions. [2018-11-23 11:58:41,488 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 106 transitions. [2018-11-23 11:58:41,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:41,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:41,489 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:41,489 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:41,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 11:58:41,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 92 transitions. [2018-11-23 11:58:41,492 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 92 transitions. Word has length 26 [2018-11-23 11:58:41,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:41,492 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 92 transitions. [2018-11-23 11:58:41,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:58:41,492 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 92 transitions. [2018-11-23 11:58:41,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 11:58:41,493 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:41,493 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:58:41,494 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:41,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:41,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1605949511, now seen corresponding path program 2 times [2018-11-23 11:58:41,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:41,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:41,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:41,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:41,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:41,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:41,733 INFO L256 TraceCheckUtils]: 0: Hoare triple {2567#true} call ULTIMATE.init(); {2567#true} is VALID [2018-11-23 11:58:41,733 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:58:41,733 INFO L273 TraceCheckUtils]: 2: Hoare triple {2567#true} assume true; {2567#true} is VALID [2018-11-23 11:58:41,734 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2567#true} {2567#true} #130#return; {2567#true} is VALID [2018-11-23 11:58:41,734 INFO L256 TraceCheckUtils]: 4: Hoare triple {2567#true} call #t~ret15 := main(); {2567#true} is VALID [2018-11-23 11:58:41,735 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:58:41,736 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:58:41,736 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:58:41,737 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~mem1;havoc #t~mem0;~s~0 := ~k~0; {2570#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:41,756 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:58:41,772 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:58:41,788 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~mem1;havoc #t~mem0;~s~0 := ~k~0; {2571#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:41,803 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:58:41,819 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:58:41,828 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~mem1;havoc #t~mem0;~s~0 := ~k~0; {2572#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:41,842 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:58:41,852 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:58:41,868 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~mem1;havoc #t~mem0;~s~0 := ~k~0; {2573#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:41,883 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:58:41,892 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:58:41,892 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:58:41,893 INFO L273 TraceCheckUtils]: 21: Hoare triple {2568#false} ~x~0 := 0; {2568#false} is VALID [2018-11-23 11:58:41,893 INFO L273 TraceCheckUtils]: 22: Hoare triple {2568#false} assume !(~x~0 < ~i~0); {2568#false} is VALID [2018-11-23 11:58:41,893 INFO L273 TraceCheckUtils]: 23: Hoare triple {2568#false} ~x~0 := ~i~0; {2568#false} is VALID [2018-11-23 11:58:41,893 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:58:41,894 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:58:41,894 INFO L273 TraceCheckUtils]: 26: Hoare triple {2568#false} ~cond := #in~cond; {2568#false} is VALID [2018-11-23 11:58:41,894 INFO L273 TraceCheckUtils]: 27: Hoare triple {2568#false} assume 0 == ~cond; {2568#false} is VALID [2018-11-23 11:58:41,894 INFO L273 TraceCheckUtils]: 28: Hoare triple {2568#false} assume !false; {2568#false} is VALID [2018-11-23 11:58:41,897 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:41,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:41,898 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:58:41,914 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:58:41,950 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 11:58:41,950 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:41,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:41,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:42,041 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:58:42,049 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:58:42,080 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:58:42,086 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-23 11:58:42,095 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:58:42,097 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:58:42,100 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:58:42,100 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:30, output treesize:1 [2018-11-23 11:58:42,104 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:58:42,104 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_10|, main_~s~0, main_~tmp~0]. (= |#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)))) [2018-11-23 11:58:42,104 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. true [2018-11-23 11:58:42,147 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 23 treesize of output 19 [2018-11-23 11:58:42,222 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 19 treesize of output 7 [2018-11-23 11:58:42,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:58:42,302 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:58:42,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:58:42,306 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:23, output treesize:3 [2018-11-23 11:58:42,308 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:58:42,308 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|, main_~i~0, |main_~#a~0.offset|]. (let ((.cse0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|)))) (and (<= .cse0 |main_#t~mem9|) (<= |main_#t~mem10| .cse0))) [2018-11-23 11:58:42,308 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (<= |main_#t~mem10| |main_#t~mem9|) [2018-11-23 11:58:42,403 INFO L256 TraceCheckUtils]: 0: Hoare triple {2567#true} call ULTIMATE.init(); {2567#true} is VALID [2018-11-23 11:58:42,403 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:58:42,404 INFO L273 TraceCheckUtils]: 2: Hoare triple {2567#true} assume true; {2567#true} is VALID [2018-11-23 11:58:42,404 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2567#true} {2567#true} #130#return; {2567#true} is VALID [2018-11-23 11:58:42,404 INFO L256 TraceCheckUtils]: 4: Hoare triple {2567#true} call #t~ret15 := main(); {2567#true} is VALID [2018-11-23 11:58:42,404 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; {2567#true} is VALID [2018-11-23 11:58:42,404 INFO L273 TraceCheckUtils]: 6: Hoare triple {2567#true} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {2567#true} is VALID [2018-11-23 11:58:42,404 INFO L273 TraceCheckUtils]: 7: Hoare triple {2567#true} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {2567#true} is VALID [2018-11-23 11:58:42,405 INFO L273 TraceCheckUtils]: 8: Hoare triple {2567#true} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {2567#true} is VALID [2018-11-23 11:58:42,405 INFO L273 TraceCheckUtils]: 9: Hoare triple {2567#true} ~k~0 := 1 + ~k~0; {2567#true} is VALID [2018-11-23 11:58:42,405 INFO L273 TraceCheckUtils]: 10: Hoare triple {2567#true} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {2567#true} is VALID [2018-11-23 11:58:42,405 INFO L273 TraceCheckUtils]: 11: Hoare triple {2567#true} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {2567#true} is VALID [2018-11-23 11:58:42,405 INFO L273 TraceCheckUtils]: 12: Hoare triple {2567#true} ~k~0 := 1 + ~k~0; {2567#true} is VALID [2018-11-23 11:58:42,405 INFO L273 TraceCheckUtils]: 13: Hoare triple {2567#true} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {2567#true} is VALID [2018-11-23 11:58:42,406 INFO L273 TraceCheckUtils]: 14: Hoare triple {2567#true} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {2567#true} is VALID [2018-11-23 11:58:42,406 INFO L273 TraceCheckUtils]: 15: Hoare triple {2567#true} ~k~0 := 1 + ~k~0; {2567#true} is VALID [2018-11-23 11:58:42,406 INFO L273 TraceCheckUtils]: 16: Hoare triple {2567#true} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {2567#true} is VALID [2018-11-23 11:58:42,406 INFO L273 TraceCheckUtils]: 17: Hoare triple {2567#true} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {2567#true} is VALID [2018-11-23 11:58:42,406 INFO L273 TraceCheckUtils]: 18: Hoare triple {2567#true} ~k~0 := 1 + ~k~0; {2567#true} is VALID [2018-11-23 11:58:42,406 INFO L273 TraceCheckUtils]: 19: Hoare triple {2567#true} assume !(~k~0 < 100000); {2567#true} is VALID [2018-11-23 11:58:42,407 INFO L273 TraceCheckUtils]: 20: Hoare triple {2567#true} 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); {2567#true} is VALID [2018-11-23 11:58:42,407 INFO L273 TraceCheckUtils]: 21: Hoare triple {2567#true} ~x~0 := 0; {2567#true} is VALID [2018-11-23 11:58:42,407 INFO L273 TraceCheckUtils]: 22: Hoare triple {2567#true} assume !(~x~0 < ~i~0); {2567#true} is VALID [2018-11-23 11:58:42,407 INFO L273 TraceCheckUtils]: 23: Hoare triple {2567#true} ~x~0 := ~i~0; {2647#(= main_~i~0 main_~x~0)} is VALID [2018-11-23 11:58:42,412 INFO L273 TraceCheckUtils]: 24: Hoare triple {2647#(= main_~i~0 main_~x~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); {2651#(<= |main_#t~mem10| |main_#t~mem9|)} is VALID [2018-11-23 11:58:42,414 INFO L256 TraceCheckUtils]: 25: Hoare triple {2651#(<= |main_#t~mem10| |main_#t~mem9|)} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {2655#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 11:58:42,414 INFO L273 TraceCheckUtils]: 26: Hoare triple {2655#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {2659#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 11:58:42,416 INFO L273 TraceCheckUtils]: 27: Hoare triple {2659#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2568#false} is VALID [2018-11-23 11:58:42,416 INFO L273 TraceCheckUtils]: 28: Hoare triple {2568#false} assume !false; {2568#false} is VALID [2018-11-23 11:58:42,417 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:58:42,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 11:58:42,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2018-11-23 11:58:42,435 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-11-23 11:58:42,436 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:42,436 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:58:42,549 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:42,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:58:42,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:58:42,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:58:42,550 INFO L87 Difference]: Start difference. First operand 70 states and 92 transitions. Second operand 12 states. [2018-11-23 11:58:43,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:43,506 INFO L93 Difference]: Finished difference Result 138 states and 185 transitions. [2018-11-23 11:58:43,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 11:58:43,506 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-11-23 11:58:43,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:43,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:58:43,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 144 transitions. [2018-11-23 11:58:43,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:58:43,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 144 transitions. [2018-11-23 11:58:43,512 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 144 transitions. [2018-11-23 11:58:43,714 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:58:43,717 INFO L225 Difference]: With dead ends: 138 [2018-11-23 11:58:43,717 INFO L226 Difference]: Without dead ends: 99 [2018-11-23 11:58:43,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:58:43,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-23 11:58:43,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 84. [2018-11-23 11:58:43,784 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:43,784 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand 84 states. [2018-11-23 11:58:43,784 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 84 states. [2018-11-23 11:58:43,785 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 84 states. [2018-11-23 11:58:43,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:43,788 INFO L93 Difference]: Finished difference Result 99 states and 129 transitions. [2018-11-23 11:58:43,789 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 129 transitions. [2018-11-23 11:58:43,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:43,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:43,789 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 99 states. [2018-11-23 11:58:43,789 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 99 states. [2018-11-23 11:58:43,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:43,793 INFO L93 Difference]: Finished difference Result 99 states and 129 transitions. [2018-11-23 11:58:43,793 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 129 transitions. [2018-11-23 11:58:43,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:43,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:43,794 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:43,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:43,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-23 11:58:43,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 109 transitions. [2018-11-23 11:58:43,797 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 109 transitions. Word has length 29 [2018-11-23 11:58:43,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:43,797 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 109 transitions. [2018-11-23 11:58:43,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:58:43,798 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 109 transitions. [2018-11-23 11:58:43,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 11:58:43,799 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:43,799 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:58:43,799 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:43,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:43,799 INFO L82 PathProgramCache]: Analyzing trace with hash -799653583, now seen corresponding path program 1 times [2018-11-23 11:58:43,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:43,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:43,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:43,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:43,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:43,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:44,093 INFO L256 TraceCheckUtils]: 0: Hoare triple {3176#true} call ULTIMATE.init(); {3176#true} is VALID [2018-11-23 11:58:44,094 INFO L273 TraceCheckUtils]: 1: Hoare triple {3176#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3176#true} is VALID [2018-11-23 11:58:44,094 INFO L273 TraceCheckUtils]: 2: Hoare triple {3176#true} assume true; {3176#true} is VALID [2018-11-23 11:58:44,094 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3176#true} {3176#true} #130#return; {3176#true} is VALID [2018-11-23 11:58:44,095 INFO L256 TraceCheckUtils]: 4: Hoare triple {3176#true} call #t~ret15 := main(); {3176#true} is VALID [2018-11-23 11:58:44,097 INFO L273 TraceCheckUtils]: 5: Hoare triple {3176#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {3178#(= main_~i~0 0)} is VALID [2018-11-23 11:58:44,098 INFO L273 TraceCheckUtils]: 6: Hoare triple {3178#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {3179#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:44,101 INFO L273 TraceCheckUtils]: 7: Hoare triple {3179#(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); {3179#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:44,101 INFO L273 TraceCheckUtils]: 8: Hoare triple {3179#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {3179#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:44,102 INFO L273 TraceCheckUtils]: 9: Hoare triple {3179#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {3180#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:44,103 INFO L273 TraceCheckUtils]: 10: Hoare triple {3180#(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); {3180#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:44,104 INFO L273 TraceCheckUtils]: 11: Hoare triple {3180#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {3180#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:44,105 INFO L273 TraceCheckUtils]: 12: Hoare triple {3180#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {3181#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:44,106 INFO L273 TraceCheckUtils]: 13: Hoare triple {3181#(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); {3181#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:44,107 INFO L273 TraceCheckUtils]: 14: Hoare triple {3181#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {3181#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:44,108 INFO L273 TraceCheckUtils]: 15: Hoare triple {3181#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {3182#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:44,109 INFO L273 TraceCheckUtils]: 16: Hoare triple {3182#(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); {3182#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:44,110 INFO L273 TraceCheckUtils]: 17: Hoare triple {3182#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {3182#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:44,111 INFO L273 TraceCheckUtils]: 18: Hoare triple {3182#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {3183#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:44,112 INFO L273 TraceCheckUtils]: 19: Hoare triple {3183#(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); {3183#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:44,113 INFO L273 TraceCheckUtils]: 20: Hoare triple {3183#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {3183#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:44,114 INFO L273 TraceCheckUtils]: 21: Hoare triple {3183#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {3184#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:44,115 INFO L273 TraceCheckUtils]: 22: Hoare triple {3184#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume !(~k~0 < 100000); {3177#false} is VALID [2018-11-23 11:58:44,115 INFO L273 TraceCheckUtils]: 23: Hoare triple {3177#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); {3177#false} is VALID [2018-11-23 11:58:44,115 INFO L273 TraceCheckUtils]: 24: Hoare triple {3177#false} ~x~0 := 0; {3177#false} is VALID [2018-11-23 11:58:44,115 INFO L273 TraceCheckUtils]: 25: Hoare triple {3177#false} assume !(~x~0 < ~i~0); {3177#false} is VALID [2018-11-23 11:58:44,116 INFO L273 TraceCheckUtils]: 26: Hoare triple {3177#false} ~x~0 := ~i~0; {3177#false} is VALID [2018-11-23 11:58:44,116 INFO L273 TraceCheckUtils]: 27: Hoare triple {3177#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); {3177#false} is VALID [2018-11-23 11:58:44,116 INFO L256 TraceCheckUtils]: 28: Hoare triple {3177#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {3176#true} is VALID [2018-11-23 11:58:44,117 INFO L273 TraceCheckUtils]: 29: Hoare triple {3176#true} ~cond := #in~cond; {3176#true} is VALID [2018-11-23 11:58:44,117 INFO L273 TraceCheckUtils]: 30: Hoare triple {3176#true} assume !(0 == ~cond); {3176#true} is VALID [2018-11-23 11:58:44,117 INFO L273 TraceCheckUtils]: 31: Hoare triple {3176#true} assume true; {3176#true} is VALID [2018-11-23 11:58:44,117 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {3176#true} {3177#false} #136#return; {3177#false} is VALID [2018-11-23 11:58:44,118 INFO L273 TraceCheckUtils]: 33: Hoare triple {3177#false} havoc #t~mem9;havoc #t~mem10; {3177#false} is VALID [2018-11-23 11:58:44,118 INFO L273 TraceCheckUtils]: 34: Hoare triple {3177#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {3177#false} is VALID [2018-11-23 11:58:44,118 INFO L273 TraceCheckUtils]: 35: Hoare triple {3177#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); {3177#false} is VALID [2018-11-23 11:58:44,118 INFO L256 TraceCheckUtils]: 36: Hoare triple {3177#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {3177#false} is VALID [2018-11-23 11:58:44,118 INFO L273 TraceCheckUtils]: 37: Hoare triple {3177#false} ~cond := #in~cond; {3177#false} is VALID [2018-11-23 11:58:44,118 INFO L273 TraceCheckUtils]: 38: Hoare triple {3177#false} assume 0 == ~cond; {3177#false} is VALID [2018-11-23 11:58:44,118 INFO L273 TraceCheckUtils]: 39: Hoare triple {3177#false} assume !false; {3177#false} is VALID [2018-11-23 11:58:44,121 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:58:44,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:44,121 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:58:44,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:44,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:44,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:44,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:44,320 INFO L256 TraceCheckUtils]: 0: Hoare triple {3176#true} call ULTIMATE.init(); {3176#true} is VALID [2018-11-23 11:58:44,321 INFO L273 TraceCheckUtils]: 1: Hoare triple {3176#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3176#true} is VALID [2018-11-23 11:58:44,321 INFO L273 TraceCheckUtils]: 2: Hoare triple {3176#true} assume true; {3176#true} is VALID [2018-11-23 11:58:44,321 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3176#true} {3176#true} #130#return; {3176#true} is VALID [2018-11-23 11:58:44,321 INFO L256 TraceCheckUtils]: 4: Hoare triple {3176#true} call #t~ret15 := main(); {3176#true} is VALID [2018-11-23 11:58:44,322 INFO L273 TraceCheckUtils]: 5: Hoare triple {3176#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {3203#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:44,322 INFO L273 TraceCheckUtils]: 6: Hoare triple {3203#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {3207#(<= main_~k~0 1)} is VALID [2018-11-23 11:58:44,323 INFO L273 TraceCheckUtils]: 7: Hoare triple {3207#(<= 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); {3207#(<= main_~k~0 1)} is VALID [2018-11-23 11:58:44,323 INFO L273 TraceCheckUtils]: 8: Hoare triple {3207#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {3207#(<= main_~k~0 1)} is VALID [2018-11-23 11:58:44,323 INFO L273 TraceCheckUtils]: 9: Hoare triple {3207#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {3217#(<= main_~k~0 2)} is VALID [2018-11-23 11:58:44,324 INFO L273 TraceCheckUtils]: 10: Hoare triple {3217#(<= 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); {3217#(<= main_~k~0 2)} is VALID [2018-11-23 11:58:44,324 INFO L273 TraceCheckUtils]: 11: Hoare triple {3217#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {3217#(<= main_~k~0 2)} is VALID [2018-11-23 11:58:44,325 INFO L273 TraceCheckUtils]: 12: Hoare triple {3217#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {3227#(<= main_~k~0 3)} is VALID [2018-11-23 11:58:44,325 INFO L273 TraceCheckUtils]: 13: Hoare triple {3227#(<= 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); {3227#(<= main_~k~0 3)} is VALID [2018-11-23 11:58:44,326 INFO L273 TraceCheckUtils]: 14: Hoare triple {3227#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {3227#(<= main_~k~0 3)} is VALID [2018-11-23 11:58:44,328 INFO L273 TraceCheckUtils]: 15: Hoare triple {3227#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {3237#(<= main_~k~0 4)} is VALID [2018-11-23 11:58:44,328 INFO L273 TraceCheckUtils]: 16: Hoare triple {3237#(<= 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); {3237#(<= main_~k~0 4)} is VALID [2018-11-23 11:58:44,329 INFO L273 TraceCheckUtils]: 17: Hoare triple {3237#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {3237#(<= main_~k~0 4)} is VALID [2018-11-23 11:58:44,330 INFO L273 TraceCheckUtils]: 18: Hoare triple {3237#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {3247#(<= main_~k~0 5)} is VALID [2018-11-23 11:58:44,330 INFO L273 TraceCheckUtils]: 19: Hoare triple {3247#(<= 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); {3247#(<= main_~k~0 5)} is VALID [2018-11-23 11:58:44,331 INFO L273 TraceCheckUtils]: 20: Hoare triple {3247#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {3247#(<= main_~k~0 5)} is VALID [2018-11-23 11:58:44,332 INFO L273 TraceCheckUtils]: 21: Hoare triple {3247#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {3257#(<= main_~k~0 6)} is VALID [2018-11-23 11:58:44,333 INFO L273 TraceCheckUtils]: 22: Hoare triple {3257#(<= main_~k~0 6)} assume !(~k~0 < 100000); {3177#false} is VALID [2018-11-23 11:58:44,333 INFO L273 TraceCheckUtils]: 23: Hoare triple {3177#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); {3177#false} is VALID [2018-11-23 11:58:44,333 INFO L273 TraceCheckUtils]: 24: Hoare triple {3177#false} ~x~0 := 0; {3177#false} is VALID [2018-11-23 11:58:44,333 INFO L273 TraceCheckUtils]: 25: Hoare triple {3177#false} assume !(~x~0 < ~i~0); {3177#false} is VALID [2018-11-23 11:58:44,334 INFO L273 TraceCheckUtils]: 26: Hoare triple {3177#false} ~x~0 := ~i~0; {3177#false} is VALID [2018-11-23 11:58:44,334 INFO L273 TraceCheckUtils]: 27: Hoare triple {3177#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); {3177#false} is VALID [2018-11-23 11:58:44,334 INFO L256 TraceCheckUtils]: 28: Hoare triple {3177#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {3177#false} is VALID [2018-11-23 11:58:44,334 INFO L273 TraceCheckUtils]: 29: Hoare triple {3177#false} ~cond := #in~cond; {3177#false} is VALID [2018-11-23 11:58:44,335 INFO L273 TraceCheckUtils]: 30: Hoare triple {3177#false} assume !(0 == ~cond); {3177#false} is VALID [2018-11-23 11:58:44,335 INFO L273 TraceCheckUtils]: 31: Hoare triple {3177#false} assume true; {3177#false} is VALID [2018-11-23 11:58:44,335 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {3177#false} {3177#false} #136#return; {3177#false} is VALID [2018-11-23 11:58:44,335 INFO L273 TraceCheckUtils]: 33: Hoare triple {3177#false} havoc #t~mem9;havoc #t~mem10; {3177#false} is VALID [2018-11-23 11:58:44,336 INFO L273 TraceCheckUtils]: 34: Hoare triple {3177#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {3177#false} is VALID [2018-11-23 11:58:44,336 INFO L273 TraceCheckUtils]: 35: Hoare triple {3177#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); {3177#false} is VALID [2018-11-23 11:58:44,336 INFO L256 TraceCheckUtils]: 36: Hoare triple {3177#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {3177#false} is VALID [2018-11-23 11:58:44,336 INFO L273 TraceCheckUtils]: 37: Hoare triple {3177#false} ~cond := #in~cond; {3177#false} is VALID [2018-11-23 11:58:44,337 INFO L273 TraceCheckUtils]: 38: Hoare triple {3177#false} assume 0 == ~cond; {3177#false} is VALID [2018-11-23 11:58:44,337 INFO L273 TraceCheckUtils]: 39: Hoare triple {3177#false} assume !false; {3177#false} is VALID [2018-11-23 11:58:44,338 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:58:44,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:44,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-23 11:58:44,359 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 [2018-11-23 11:58:44,359 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:44,359 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 11:58:44,418 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:58:44,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 11:58:44,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 11:58:44,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:58:44,419 INFO L87 Difference]: Start difference. First operand 84 states and 109 transitions. Second operand 16 states. [2018-11-23 11:58:45,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:45,024 INFO L93 Difference]: Finished difference Result 147 states and 195 transitions. [2018-11-23 11:58:45,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:58:45,024 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 [2018-11-23 11:58:45,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:45,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:58:45,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 131 transitions. [2018-11-23 11:58:45,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:58:45,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 131 transitions. [2018-11-23 11:58:45,031 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 131 transitions. [2018-11-23 11:58:45,273 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:58:45,276 INFO L225 Difference]: With dead ends: 147 [2018-11-23 11:58:45,276 INFO L226 Difference]: Without dead ends: 100 [2018-11-23 11:58:45,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:58:45,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-23 11:58:45,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 90. [2018-11-23 11:58:45,899 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:45,899 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand 90 states. [2018-11-23 11:58:45,899 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 90 states. [2018-11-23 11:58:45,900 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 90 states. [2018-11-23 11:58:45,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:45,904 INFO L93 Difference]: Finished difference Result 100 states and 132 transitions. [2018-11-23 11:58:45,904 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 132 transitions. [2018-11-23 11:58:45,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:45,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:45,905 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 100 states. [2018-11-23 11:58:45,905 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 100 states. [2018-11-23 11:58:45,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:45,908 INFO L93 Difference]: Finished difference Result 100 states and 132 transitions. [2018-11-23 11:58:45,908 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 132 transitions. [2018-11-23 11:58:45,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:45,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:45,910 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:45,910 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:45,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-23 11:58:45,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 117 transitions. [2018-11-23 11:58:45,913 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 117 transitions. Word has length 40 [2018-11-23 11:58:45,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:45,913 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 117 transitions. [2018-11-23 11:58:45,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 11:58:45,913 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 117 transitions. [2018-11-23 11:58:45,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 11:58:45,914 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:45,914 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:58:45,914 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:45,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:45,917 INFO L82 PathProgramCache]: Analyzing trace with hash 539935148, now seen corresponding path program 2 times [2018-11-23 11:58:45,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:45,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:45,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:45,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:45,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:45,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:46,367 INFO L256 TraceCheckUtils]: 0: Hoare triple {3838#true} call ULTIMATE.init(); {3838#true} is VALID [2018-11-23 11:58:46,367 INFO L273 TraceCheckUtils]: 1: Hoare triple {3838#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3838#true} is VALID [2018-11-23 11:58:46,368 INFO L273 TraceCheckUtils]: 2: Hoare triple {3838#true} assume true; {3838#true} is VALID [2018-11-23 11:58:46,368 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3838#true} {3838#true} #130#return; {3838#true} is VALID [2018-11-23 11:58:46,368 INFO L256 TraceCheckUtils]: 4: Hoare triple {3838#true} call #t~ret15 := main(); {3838#true} is VALID [2018-11-23 11:58:46,368 INFO L273 TraceCheckUtils]: 5: Hoare triple {3838#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {3840#(= main_~i~0 0)} is VALID [2018-11-23 11:58:46,369 INFO L273 TraceCheckUtils]: 6: Hoare triple {3840#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {3841#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:46,369 INFO L273 TraceCheckUtils]: 7: Hoare triple {3841#(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); {3841#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:46,370 INFO L273 TraceCheckUtils]: 8: Hoare triple {3841#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {3841#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:46,371 INFO L273 TraceCheckUtils]: 9: Hoare triple {3841#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {3842#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:46,372 INFO L273 TraceCheckUtils]: 10: Hoare triple {3842#(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); {3842#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:46,372 INFO L273 TraceCheckUtils]: 11: Hoare triple {3842#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {3842#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:46,373 INFO L273 TraceCheckUtils]: 12: Hoare triple {3842#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {3843#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:46,374 INFO L273 TraceCheckUtils]: 13: Hoare triple {3843#(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); {3843#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:46,375 INFO L273 TraceCheckUtils]: 14: Hoare triple {3843#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {3843#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:46,376 INFO L273 TraceCheckUtils]: 15: Hoare triple {3843#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {3844#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:46,377 INFO L273 TraceCheckUtils]: 16: Hoare triple {3844#(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); {3844#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:46,377 INFO L273 TraceCheckUtils]: 17: Hoare triple {3844#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {3844#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:46,378 INFO L273 TraceCheckUtils]: 18: Hoare triple {3844#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {3845#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:46,379 INFO L273 TraceCheckUtils]: 19: Hoare triple {3845#(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); {3845#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:46,380 INFO L273 TraceCheckUtils]: 20: Hoare triple {3845#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {3845#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:46,381 INFO L273 TraceCheckUtils]: 21: Hoare triple {3845#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {3846#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:46,382 INFO L273 TraceCheckUtils]: 22: Hoare triple {3846#(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); {3846#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:46,383 INFO L273 TraceCheckUtils]: 23: Hoare triple {3846#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {3846#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:46,384 INFO L273 TraceCheckUtils]: 24: Hoare triple {3846#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {3847#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:46,385 INFO L273 TraceCheckUtils]: 25: Hoare triple {3847#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume !(~k~0 < 100000); {3839#false} is VALID [2018-11-23 11:58:46,385 INFO L273 TraceCheckUtils]: 26: Hoare triple {3839#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); {3839#false} is VALID [2018-11-23 11:58:46,385 INFO L273 TraceCheckUtils]: 27: Hoare triple {3839#false} ~x~0 := 0; {3839#false} is VALID [2018-11-23 11:58:46,385 INFO L273 TraceCheckUtils]: 28: Hoare triple {3839#false} assume !(~x~0 < ~i~0); {3839#false} is VALID [2018-11-23 11:58:46,386 INFO L273 TraceCheckUtils]: 29: Hoare triple {3839#false} ~x~0 := ~i~0; {3839#false} is VALID [2018-11-23 11:58:46,386 INFO L273 TraceCheckUtils]: 30: Hoare triple {3839#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); {3839#false} is VALID [2018-11-23 11:58:46,386 INFO L256 TraceCheckUtils]: 31: Hoare triple {3839#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {3838#true} is VALID [2018-11-23 11:58:46,386 INFO L273 TraceCheckUtils]: 32: Hoare triple {3838#true} ~cond := #in~cond; {3838#true} is VALID [2018-11-23 11:58:46,386 INFO L273 TraceCheckUtils]: 33: Hoare triple {3838#true} assume !(0 == ~cond); {3838#true} is VALID [2018-11-23 11:58:46,387 INFO L273 TraceCheckUtils]: 34: Hoare triple {3838#true} assume true; {3838#true} is VALID [2018-11-23 11:58:46,387 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {3838#true} {3839#false} #136#return; {3839#false} is VALID [2018-11-23 11:58:46,387 INFO L273 TraceCheckUtils]: 36: Hoare triple {3839#false} havoc #t~mem9;havoc #t~mem10; {3839#false} is VALID [2018-11-23 11:58:46,387 INFO L273 TraceCheckUtils]: 37: Hoare triple {3839#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {3839#false} is VALID [2018-11-23 11:58:46,388 INFO L273 TraceCheckUtils]: 38: Hoare triple {3839#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); {3839#false} is VALID [2018-11-23 11:58:46,388 INFO L256 TraceCheckUtils]: 39: Hoare triple {3839#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {3839#false} is VALID [2018-11-23 11:58:46,388 INFO L273 TraceCheckUtils]: 40: Hoare triple {3839#false} ~cond := #in~cond; {3839#false} is VALID [2018-11-23 11:58:46,388 INFO L273 TraceCheckUtils]: 41: Hoare triple {3839#false} assume 0 == ~cond; {3839#false} is VALID [2018-11-23 11:58:46,389 INFO L273 TraceCheckUtils]: 42: Hoare triple {3839#false} assume !false; {3839#false} is VALID [2018-11-23 11:58:46,391 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:58:46,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:46,391 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:58:46,401 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:58:46,432 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:58:46,433 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:46,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:46,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:46,635 INFO L256 TraceCheckUtils]: 0: Hoare triple {3838#true} call ULTIMATE.init(); {3838#true} is VALID [2018-11-23 11:58:46,635 INFO L273 TraceCheckUtils]: 1: Hoare triple {3838#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3838#true} is VALID [2018-11-23 11:58:46,635 INFO L273 TraceCheckUtils]: 2: Hoare triple {3838#true} assume true; {3838#true} is VALID [2018-11-23 11:58:46,635 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3838#true} {3838#true} #130#return; {3838#true} is VALID [2018-11-23 11:58:46,636 INFO L256 TraceCheckUtils]: 4: Hoare triple {3838#true} call #t~ret15 := main(); {3838#true} is VALID [2018-11-23 11:58:46,636 INFO L273 TraceCheckUtils]: 5: Hoare triple {3838#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {3866#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:46,639 INFO L273 TraceCheckUtils]: 6: Hoare triple {3866#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {3870#(<= main_~k~0 1)} is VALID [2018-11-23 11:58:46,641 INFO L273 TraceCheckUtils]: 7: Hoare triple {3870#(<= 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); {3870#(<= main_~k~0 1)} is VALID [2018-11-23 11:58:46,645 INFO L273 TraceCheckUtils]: 8: Hoare triple {3870#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {3870#(<= main_~k~0 1)} is VALID [2018-11-23 11:58:46,648 INFO L273 TraceCheckUtils]: 9: Hoare triple {3870#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {3880#(<= main_~k~0 2)} is VALID [2018-11-23 11:58:46,648 INFO L273 TraceCheckUtils]: 10: Hoare triple {3880#(<= 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); {3880#(<= main_~k~0 2)} is VALID [2018-11-23 11:58:46,649 INFO L273 TraceCheckUtils]: 11: Hoare triple {3880#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {3880#(<= main_~k~0 2)} is VALID [2018-11-23 11:58:46,657 INFO L273 TraceCheckUtils]: 12: Hoare triple {3880#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {3890#(<= main_~k~0 3)} is VALID [2018-11-23 11:58:46,657 INFO L273 TraceCheckUtils]: 13: Hoare triple {3890#(<= 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); {3890#(<= main_~k~0 3)} is VALID [2018-11-23 11:58:46,658 INFO L273 TraceCheckUtils]: 14: Hoare triple {3890#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {3890#(<= main_~k~0 3)} is VALID [2018-11-23 11:58:46,658 INFO L273 TraceCheckUtils]: 15: Hoare triple {3890#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {3900#(<= main_~k~0 4)} is VALID [2018-11-23 11:58:46,659 INFO L273 TraceCheckUtils]: 16: Hoare triple {3900#(<= 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); {3900#(<= main_~k~0 4)} is VALID [2018-11-23 11:58:46,659 INFO L273 TraceCheckUtils]: 17: Hoare triple {3900#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {3900#(<= main_~k~0 4)} is VALID [2018-11-23 11:58:46,659 INFO L273 TraceCheckUtils]: 18: Hoare triple {3900#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {3910#(<= main_~k~0 5)} is VALID [2018-11-23 11:58:46,660 INFO L273 TraceCheckUtils]: 19: Hoare triple {3910#(<= 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); {3910#(<= main_~k~0 5)} is VALID [2018-11-23 11:58:46,660 INFO L273 TraceCheckUtils]: 20: Hoare triple {3910#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {3910#(<= main_~k~0 5)} is VALID [2018-11-23 11:58:46,661 INFO L273 TraceCheckUtils]: 21: Hoare triple {3910#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {3920#(<= main_~k~0 6)} is VALID [2018-11-23 11:58:46,662 INFO L273 TraceCheckUtils]: 22: Hoare triple {3920#(<= 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); {3920#(<= main_~k~0 6)} is VALID [2018-11-23 11:58:46,662 INFO L273 TraceCheckUtils]: 23: Hoare triple {3920#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {3920#(<= main_~k~0 6)} is VALID [2018-11-23 11:58:46,663 INFO L273 TraceCheckUtils]: 24: Hoare triple {3920#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {3930#(<= main_~k~0 7)} is VALID [2018-11-23 11:58:46,664 INFO L273 TraceCheckUtils]: 25: Hoare triple {3930#(<= main_~k~0 7)} assume !(~k~0 < 100000); {3839#false} is VALID [2018-11-23 11:58:46,664 INFO L273 TraceCheckUtils]: 26: Hoare triple {3839#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); {3839#false} is VALID [2018-11-23 11:58:46,664 INFO L273 TraceCheckUtils]: 27: Hoare triple {3839#false} ~x~0 := 0; {3839#false} is VALID [2018-11-23 11:58:46,664 INFO L273 TraceCheckUtils]: 28: Hoare triple {3839#false} assume !(~x~0 < ~i~0); {3839#false} is VALID [2018-11-23 11:58:46,665 INFO L273 TraceCheckUtils]: 29: Hoare triple {3839#false} ~x~0 := ~i~0; {3839#false} is VALID [2018-11-23 11:58:46,665 INFO L273 TraceCheckUtils]: 30: Hoare triple {3839#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); {3839#false} is VALID [2018-11-23 11:58:46,665 INFO L256 TraceCheckUtils]: 31: Hoare triple {3839#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {3839#false} is VALID [2018-11-23 11:58:46,665 INFO L273 TraceCheckUtils]: 32: Hoare triple {3839#false} ~cond := #in~cond; {3839#false} is VALID [2018-11-23 11:58:46,666 INFO L273 TraceCheckUtils]: 33: Hoare triple {3839#false} assume !(0 == ~cond); {3839#false} is VALID [2018-11-23 11:58:46,666 INFO L273 TraceCheckUtils]: 34: Hoare triple {3839#false} assume true; {3839#false} is VALID [2018-11-23 11:58:46,666 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {3839#false} {3839#false} #136#return; {3839#false} is VALID [2018-11-23 11:58:46,666 INFO L273 TraceCheckUtils]: 36: Hoare triple {3839#false} havoc #t~mem9;havoc #t~mem10; {3839#false} is VALID [2018-11-23 11:58:46,667 INFO L273 TraceCheckUtils]: 37: Hoare triple {3839#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {3839#false} is VALID [2018-11-23 11:58:46,667 INFO L273 TraceCheckUtils]: 38: Hoare triple {3839#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); {3839#false} is VALID [2018-11-23 11:58:46,667 INFO L256 TraceCheckUtils]: 39: Hoare triple {3839#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {3839#false} is VALID [2018-11-23 11:58:46,667 INFO L273 TraceCheckUtils]: 40: Hoare triple {3839#false} ~cond := #in~cond; {3839#false} is VALID [2018-11-23 11:58:46,667 INFO L273 TraceCheckUtils]: 41: Hoare triple {3839#false} assume 0 == ~cond; {3839#false} is VALID [2018-11-23 11:58:46,667 INFO L273 TraceCheckUtils]: 42: Hoare triple {3839#false} assume !false; {3839#false} is VALID [2018-11-23 11:58:46,669 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:58:46,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:46,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-11-23 11:58:46,689 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 43 [2018-11-23 11:58:46,689 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:46,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 11:58:46,755 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:46,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 11:58:46,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 11:58:46,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=188, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:58:46,757 INFO L87 Difference]: Start difference. First operand 90 states and 117 transitions. Second operand 18 states. [2018-11-23 11:58:47,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:47,501 INFO L93 Difference]: Finished difference Result 153 states and 203 transitions. [2018-11-23 11:58:47,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:58:47,502 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 43 [2018-11-23 11:58:47,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:47,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:58:47,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 135 transitions. [2018-11-23 11:58:47,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:58:47,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 135 transitions. [2018-11-23 11:58:47,507 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 135 transitions. [2018-11-23 11:58:47,807 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:58:47,809 INFO L225 Difference]: With dead ends: 153 [2018-11-23 11:58:47,810 INFO L226 Difference]: Without dead ends: 106 [2018-11-23 11:58:47,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=188, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:58:47,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-23 11:58:47,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 96. [2018-11-23 11:58:47,913 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:47,914 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand 96 states. [2018-11-23 11:58:47,914 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 96 states. [2018-11-23 11:58:47,914 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 96 states. [2018-11-23 11:58:47,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:47,918 INFO L93 Difference]: Finished difference Result 106 states and 140 transitions. [2018-11-23 11:58:47,918 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 140 transitions. [2018-11-23 11:58:47,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:47,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:47,918 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 106 states. [2018-11-23 11:58:47,919 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 106 states. [2018-11-23 11:58:47,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:47,921 INFO L93 Difference]: Finished difference Result 106 states and 140 transitions. [2018-11-23 11:58:47,922 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 140 transitions. [2018-11-23 11:58:47,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:47,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:47,923 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:47,923 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:47,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-23 11:58:47,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 125 transitions. [2018-11-23 11:58:47,925 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 125 transitions. Word has length 43 [2018-11-23 11:58:47,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:47,926 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 125 transitions. [2018-11-23 11:58:47,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 11:58:47,926 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 125 transitions. [2018-11-23 11:58:47,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 11:58:47,927 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:47,927 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:58:47,927 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:47,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:47,928 INFO L82 PathProgramCache]: Analyzing trace with hash -608294063, now seen corresponding path program 3 times [2018-11-23 11:58:47,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:47,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:47,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:47,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:47,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:47,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:49,212 INFO L256 TraceCheckUtils]: 0: Hoare triple {4539#true} call ULTIMATE.init(); {4539#true} is VALID [2018-11-23 11:58:49,213 INFO L273 TraceCheckUtils]: 1: Hoare triple {4539#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4539#true} is VALID [2018-11-23 11:58:49,213 INFO L273 TraceCheckUtils]: 2: Hoare triple {4539#true} assume true; {4539#true} is VALID [2018-11-23 11:58:49,214 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4539#true} {4539#true} #130#return; {4539#true} is VALID [2018-11-23 11:58:49,214 INFO L256 TraceCheckUtils]: 4: Hoare triple {4539#true} call #t~ret15 := main(); {4539#true} is VALID [2018-11-23 11:58:49,215 INFO L273 TraceCheckUtils]: 5: Hoare triple {4539#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {4541#(= main_~i~0 0)} is VALID [2018-11-23 11:58:49,215 INFO L273 TraceCheckUtils]: 6: Hoare triple {4541#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {4542#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:49,216 INFO L273 TraceCheckUtils]: 7: Hoare triple {4542#(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); {4542#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:49,216 INFO L273 TraceCheckUtils]: 8: Hoare triple {4542#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {4542#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:49,217 INFO L273 TraceCheckUtils]: 9: Hoare triple {4542#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {4543#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:49,218 INFO L273 TraceCheckUtils]: 10: Hoare triple {4543#(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); {4543#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:49,219 INFO L273 TraceCheckUtils]: 11: Hoare triple {4543#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {4543#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:49,220 INFO L273 TraceCheckUtils]: 12: Hoare triple {4543#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {4544#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:49,221 INFO L273 TraceCheckUtils]: 13: Hoare triple {4544#(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); {4544#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:49,222 INFO L273 TraceCheckUtils]: 14: Hoare triple {4544#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {4544#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:49,223 INFO L273 TraceCheckUtils]: 15: Hoare triple {4544#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {4545#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:49,224 INFO L273 TraceCheckUtils]: 16: Hoare triple {4545#(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); {4545#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:49,225 INFO L273 TraceCheckUtils]: 17: Hoare triple {4545#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {4545#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:49,230 INFO L273 TraceCheckUtils]: 18: Hoare triple {4545#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {4546#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:49,231 INFO L273 TraceCheckUtils]: 19: Hoare triple {4546#(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); {4546#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:49,232 INFO L273 TraceCheckUtils]: 20: Hoare triple {4546#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {4546#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:49,232 INFO L273 TraceCheckUtils]: 21: Hoare triple {4546#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {4547#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:49,233 INFO L273 TraceCheckUtils]: 22: Hoare triple {4547#(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); {4547#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:49,233 INFO L273 TraceCheckUtils]: 23: Hoare triple {4547#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {4547#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:49,234 INFO L273 TraceCheckUtils]: 24: Hoare triple {4547#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {4548#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:49,235 INFO L273 TraceCheckUtils]: 25: Hoare triple {4548#(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); {4548#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:49,236 INFO L273 TraceCheckUtils]: 26: Hoare triple {4548#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {4548#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:49,237 INFO L273 TraceCheckUtils]: 27: Hoare triple {4548#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {4549#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:49,238 INFO L273 TraceCheckUtils]: 28: Hoare triple {4549#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume !(~k~0 < 100000); {4540#false} is VALID [2018-11-23 11:58:49,238 INFO L273 TraceCheckUtils]: 29: Hoare triple {4540#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); {4540#false} is VALID [2018-11-23 11:58:49,239 INFO L273 TraceCheckUtils]: 30: Hoare triple {4540#false} ~x~0 := 0; {4540#false} is VALID [2018-11-23 11:58:49,239 INFO L273 TraceCheckUtils]: 31: Hoare triple {4540#false} assume !(~x~0 < ~i~0); {4540#false} is VALID [2018-11-23 11:58:49,239 INFO L273 TraceCheckUtils]: 32: Hoare triple {4540#false} ~x~0 := ~i~0; {4540#false} is VALID [2018-11-23 11:58:49,239 INFO L273 TraceCheckUtils]: 33: Hoare triple {4540#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); {4540#false} is VALID [2018-11-23 11:58:49,240 INFO L256 TraceCheckUtils]: 34: Hoare triple {4540#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {4539#true} is VALID [2018-11-23 11:58:49,240 INFO L273 TraceCheckUtils]: 35: Hoare triple {4539#true} ~cond := #in~cond; {4539#true} is VALID [2018-11-23 11:58:49,240 INFO L273 TraceCheckUtils]: 36: Hoare triple {4539#true} assume !(0 == ~cond); {4539#true} is VALID [2018-11-23 11:58:49,240 INFO L273 TraceCheckUtils]: 37: Hoare triple {4539#true} assume true; {4539#true} is VALID [2018-11-23 11:58:49,241 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {4539#true} {4540#false} #136#return; {4540#false} is VALID [2018-11-23 11:58:49,241 INFO L273 TraceCheckUtils]: 39: Hoare triple {4540#false} havoc #t~mem9;havoc #t~mem10; {4540#false} is VALID [2018-11-23 11:58:49,241 INFO L273 TraceCheckUtils]: 40: Hoare triple {4540#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {4540#false} is VALID [2018-11-23 11:58:49,241 INFO L273 TraceCheckUtils]: 41: Hoare triple {4540#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); {4540#false} is VALID [2018-11-23 11:58:49,242 INFO L256 TraceCheckUtils]: 42: Hoare triple {4540#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {4540#false} is VALID [2018-11-23 11:58:49,242 INFO L273 TraceCheckUtils]: 43: Hoare triple {4540#false} ~cond := #in~cond; {4540#false} is VALID [2018-11-23 11:58:49,242 INFO L273 TraceCheckUtils]: 44: Hoare triple {4540#false} assume 0 == ~cond; {4540#false} is VALID [2018-11-23 11:58:49,242 INFO L273 TraceCheckUtils]: 45: Hoare triple {4540#false} assume !false; {4540#false} is VALID [2018-11-23 11:58:49,247 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:58:49,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:49,248 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:58:49,261 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:58:49,342 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-23 11:58:49,342 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:49,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:49,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:49,577 INFO L256 TraceCheckUtils]: 0: Hoare triple {4539#true} call ULTIMATE.init(); {4539#true} is VALID [2018-11-23 11:58:49,577 INFO L273 TraceCheckUtils]: 1: Hoare triple {4539#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4539#true} is VALID [2018-11-23 11:58:49,578 INFO L273 TraceCheckUtils]: 2: Hoare triple {4539#true} assume true; {4539#true} is VALID [2018-11-23 11:58:49,578 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4539#true} {4539#true} #130#return; {4539#true} is VALID [2018-11-23 11:58:49,578 INFO L256 TraceCheckUtils]: 4: Hoare triple {4539#true} call #t~ret15 := main(); {4539#true} is VALID [2018-11-23 11:58:49,597 INFO L273 TraceCheckUtils]: 5: Hoare triple {4539#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {4568#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:49,598 INFO L273 TraceCheckUtils]: 6: Hoare triple {4568#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {4572#(<= main_~k~0 1)} is VALID [2018-11-23 11:58:49,599 INFO L273 TraceCheckUtils]: 7: Hoare triple {4572#(<= 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); {4572#(<= main_~k~0 1)} is VALID [2018-11-23 11:58:49,599 INFO L273 TraceCheckUtils]: 8: Hoare triple {4572#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {4572#(<= main_~k~0 1)} is VALID [2018-11-23 11:58:49,600 INFO L273 TraceCheckUtils]: 9: Hoare triple {4572#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {4582#(<= main_~k~0 2)} is VALID [2018-11-23 11:58:49,600 INFO L273 TraceCheckUtils]: 10: Hoare triple {4582#(<= 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); {4582#(<= main_~k~0 2)} is VALID [2018-11-23 11:58:49,601 INFO L273 TraceCheckUtils]: 11: Hoare triple {4582#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {4582#(<= main_~k~0 2)} is VALID [2018-11-23 11:58:49,601 INFO L273 TraceCheckUtils]: 12: Hoare triple {4582#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {4592#(<= main_~k~0 3)} is VALID [2018-11-23 11:58:49,602 INFO L273 TraceCheckUtils]: 13: Hoare triple {4592#(<= 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); {4592#(<= main_~k~0 3)} is VALID [2018-11-23 11:58:49,603 INFO L273 TraceCheckUtils]: 14: Hoare triple {4592#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {4592#(<= main_~k~0 3)} is VALID [2018-11-23 11:58:49,603 INFO L273 TraceCheckUtils]: 15: Hoare triple {4592#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {4602#(<= main_~k~0 4)} is VALID [2018-11-23 11:58:49,604 INFO L273 TraceCheckUtils]: 16: Hoare triple {4602#(<= 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); {4602#(<= main_~k~0 4)} is VALID [2018-11-23 11:58:49,604 INFO L273 TraceCheckUtils]: 17: Hoare triple {4602#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {4602#(<= main_~k~0 4)} is VALID [2018-11-23 11:58:49,605 INFO L273 TraceCheckUtils]: 18: Hoare triple {4602#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {4612#(<= main_~k~0 5)} is VALID [2018-11-23 11:58:49,606 INFO L273 TraceCheckUtils]: 19: Hoare triple {4612#(<= 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); {4612#(<= main_~k~0 5)} is VALID [2018-11-23 11:58:49,606 INFO L273 TraceCheckUtils]: 20: Hoare triple {4612#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {4612#(<= main_~k~0 5)} is VALID [2018-11-23 11:58:49,607 INFO L273 TraceCheckUtils]: 21: Hoare triple {4612#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {4622#(<= main_~k~0 6)} is VALID [2018-11-23 11:58:49,608 INFO L273 TraceCheckUtils]: 22: Hoare triple {4622#(<= 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); {4622#(<= main_~k~0 6)} is VALID [2018-11-23 11:58:49,608 INFO L273 TraceCheckUtils]: 23: Hoare triple {4622#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {4622#(<= main_~k~0 6)} is VALID [2018-11-23 11:58:49,609 INFO L273 TraceCheckUtils]: 24: Hoare triple {4622#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {4632#(<= main_~k~0 7)} is VALID [2018-11-23 11:58:49,610 INFO L273 TraceCheckUtils]: 25: Hoare triple {4632#(<= 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); {4632#(<= main_~k~0 7)} is VALID [2018-11-23 11:58:49,610 INFO L273 TraceCheckUtils]: 26: Hoare triple {4632#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {4632#(<= main_~k~0 7)} is VALID [2018-11-23 11:58:49,611 INFO L273 TraceCheckUtils]: 27: Hoare triple {4632#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {4642#(<= main_~k~0 8)} is VALID [2018-11-23 11:58:49,612 INFO L273 TraceCheckUtils]: 28: Hoare triple {4642#(<= main_~k~0 8)} assume !(~k~0 < 100000); {4540#false} is VALID [2018-11-23 11:58:49,612 INFO L273 TraceCheckUtils]: 29: Hoare triple {4540#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); {4540#false} is VALID [2018-11-23 11:58:49,612 INFO L273 TraceCheckUtils]: 30: Hoare triple {4540#false} ~x~0 := 0; {4540#false} is VALID [2018-11-23 11:58:49,612 INFO L273 TraceCheckUtils]: 31: Hoare triple {4540#false} assume !(~x~0 < ~i~0); {4540#false} is VALID [2018-11-23 11:58:49,613 INFO L273 TraceCheckUtils]: 32: Hoare triple {4540#false} ~x~0 := ~i~0; {4540#false} is VALID [2018-11-23 11:58:49,613 INFO L273 TraceCheckUtils]: 33: Hoare triple {4540#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); {4540#false} is VALID [2018-11-23 11:58:49,613 INFO L256 TraceCheckUtils]: 34: Hoare triple {4540#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {4540#false} is VALID [2018-11-23 11:58:49,613 INFO L273 TraceCheckUtils]: 35: Hoare triple {4540#false} ~cond := #in~cond; {4540#false} is VALID [2018-11-23 11:58:49,614 INFO L273 TraceCheckUtils]: 36: Hoare triple {4540#false} assume !(0 == ~cond); {4540#false} is VALID [2018-11-23 11:58:49,614 INFO L273 TraceCheckUtils]: 37: Hoare triple {4540#false} assume true; {4540#false} is VALID [2018-11-23 11:58:49,614 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {4540#false} {4540#false} #136#return; {4540#false} is VALID [2018-11-23 11:58:49,614 INFO L273 TraceCheckUtils]: 39: Hoare triple {4540#false} havoc #t~mem9;havoc #t~mem10; {4540#false} is VALID [2018-11-23 11:58:49,614 INFO L273 TraceCheckUtils]: 40: Hoare triple {4540#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {4540#false} is VALID [2018-11-23 11:58:49,615 INFO L273 TraceCheckUtils]: 41: Hoare triple {4540#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); {4540#false} is VALID [2018-11-23 11:58:49,615 INFO L256 TraceCheckUtils]: 42: Hoare triple {4540#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {4540#false} is VALID [2018-11-23 11:58:49,615 INFO L273 TraceCheckUtils]: 43: Hoare triple {4540#false} ~cond := #in~cond; {4540#false} is VALID [2018-11-23 11:58:49,615 INFO L273 TraceCheckUtils]: 44: Hoare triple {4540#false} assume 0 == ~cond; {4540#false} is VALID [2018-11-23 11:58:49,615 INFO L273 TraceCheckUtils]: 45: Hoare triple {4540#false} assume !false; {4540#false} is VALID [2018-11-23 11:58:49,617 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:58:49,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:49,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-11-23 11:58:49,638 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 46 [2018-11-23 11:58:49,638 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:49,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 11:58:49,723 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:58:49,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 11:58:49,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 11:58:49,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=234, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:58:49,724 INFO L87 Difference]: Start difference. First operand 96 states and 125 transitions. Second operand 20 states. [2018-11-23 11:58:50,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:50,449 INFO L93 Difference]: Finished difference Result 159 states and 211 transitions. [2018-11-23 11:58:50,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:58:50,449 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 46 [2018-11-23 11:58:50,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:50,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:58:50,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 139 transitions. [2018-11-23 11:58:50,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:58:50,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 139 transitions. [2018-11-23 11:58:50,452 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 139 transitions. [2018-11-23 11:58:50,576 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:58:50,579 INFO L225 Difference]: With dead ends: 159 [2018-11-23 11:58:50,579 INFO L226 Difference]: Without dead ends: 112 [2018-11-23 11:58:50,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=146, Invalid=234, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:58:50,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-23 11:58:50,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 102. [2018-11-23 11:58:50,630 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:50,631 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand 102 states. [2018-11-23 11:58:50,631 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 102 states. [2018-11-23 11:58:50,631 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 102 states. [2018-11-23 11:58:50,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:50,635 INFO L93 Difference]: Finished difference Result 112 states and 148 transitions. [2018-11-23 11:58:50,635 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 148 transitions. [2018-11-23 11:58:50,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:50,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:50,636 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 112 states. [2018-11-23 11:58:50,636 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 112 states. [2018-11-23 11:58:50,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:50,639 INFO L93 Difference]: Finished difference Result 112 states and 148 transitions. [2018-11-23 11:58:50,640 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 148 transitions. [2018-11-23 11:58:50,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:50,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:50,640 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:50,641 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:50,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-23 11:58:50,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 133 transitions. [2018-11-23 11:58:50,643 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 133 transitions. Word has length 46 [2018-11-23 11:58:50,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:50,644 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 133 transitions. [2018-11-23 11:58:50,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 11:58:50,644 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 133 transitions. [2018-11-23 11:58:50,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 11:58:50,644 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:50,645 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:58:50,645 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:50,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:50,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1909793676, now seen corresponding path program 4 times [2018-11-23 11:58:50,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:50,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:50,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:50,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:50,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:50,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:51,519 INFO L256 TraceCheckUtils]: 0: Hoare triple {5279#true} call ULTIMATE.init(); {5279#true} is VALID [2018-11-23 11:58:51,519 INFO L273 TraceCheckUtils]: 1: Hoare triple {5279#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5279#true} is VALID [2018-11-23 11:58:51,519 INFO L273 TraceCheckUtils]: 2: Hoare triple {5279#true} assume true; {5279#true} is VALID [2018-11-23 11:58:51,520 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5279#true} {5279#true} #130#return; {5279#true} is VALID [2018-11-23 11:58:51,520 INFO L256 TraceCheckUtils]: 4: Hoare triple {5279#true} call #t~ret15 := main(); {5279#true} is VALID [2018-11-23 11:58:51,534 INFO L273 TraceCheckUtils]: 5: Hoare triple {5279#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {5281#(= main_~i~0 0)} is VALID [2018-11-23 11:58:51,535 INFO L273 TraceCheckUtils]: 6: Hoare triple {5281#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {5282#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:51,535 INFO L273 TraceCheckUtils]: 7: Hoare triple {5282#(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); {5282#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:51,536 INFO L273 TraceCheckUtils]: 8: Hoare triple {5282#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {5282#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:51,536 INFO L273 TraceCheckUtils]: 9: Hoare triple {5282#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {5283#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:51,537 INFO L273 TraceCheckUtils]: 10: Hoare triple {5283#(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); {5283#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:51,537 INFO L273 TraceCheckUtils]: 11: Hoare triple {5283#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {5283#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:51,538 INFO L273 TraceCheckUtils]: 12: Hoare triple {5283#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {5284#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:51,539 INFO L273 TraceCheckUtils]: 13: Hoare triple {5284#(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); {5284#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:51,540 INFO L273 TraceCheckUtils]: 14: Hoare triple {5284#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {5284#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:51,541 INFO L273 TraceCheckUtils]: 15: Hoare triple {5284#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {5285#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:51,541 INFO L273 TraceCheckUtils]: 16: Hoare triple {5285#(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); {5285#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:51,542 INFO L273 TraceCheckUtils]: 17: Hoare triple {5285#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {5285#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:51,543 INFO L273 TraceCheckUtils]: 18: Hoare triple {5285#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {5286#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:51,544 INFO L273 TraceCheckUtils]: 19: Hoare triple {5286#(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); {5286#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:51,545 INFO L273 TraceCheckUtils]: 20: Hoare triple {5286#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {5286#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:51,545 INFO L273 TraceCheckUtils]: 21: Hoare triple {5286#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {5287#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:51,546 INFO L273 TraceCheckUtils]: 22: Hoare triple {5287#(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); {5287#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:51,547 INFO L273 TraceCheckUtils]: 23: Hoare triple {5287#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {5287#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:51,548 INFO L273 TraceCheckUtils]: 24: Hoare triple {5287#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {5288#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:51,549 INFO L273 TraceCheckUtils]: 25: Hoare triple {5288#(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); {5288#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:51,549 INFO L273 TraceCheckUtils]: 26: Hoare triple {5288#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {5288#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:51,550 INFO L273 TraceCheckUtils]: 27: Hoare triple {5288#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {5289#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:51,551 INFO L273 TraceCheckUtils]: 28: Hoare triple {5289#(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); {5289#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:51,552 INFO L273 TraceCheckUtils]: 29: Hoare triple {5289#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {5289#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:51,553 INFO L273 TraceCheckUtils]: 30: Hoare triple {5289#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {5290#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:51,553 INFO L273 TraceCheckUtils]: 31: Hoare triple {5290#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume !(~k~0 < 100000); {5280#false} is VALID [2018-11-23 11:58:51,554 INFO L273 TraceCheckUtils]: 32: Hoare triple {5280#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); {5280#false} is VALID [2018-11-23 11:58:51,554 INFO L273 TraceCheckUtils]: 33: Hoare triple {5280#false} ~x~0 := 0; {5280#false} is VALID [2018-11-23 11:58:51,554 INFO L273 TraceCheckUtils]: 34: Hoare triple {5280#false} assume !(~x~0 < ~i~0); {5280#false} is VALID [2018-11-23 11:58:51,554 INFO L273 TraceCheckUtils]: 35: Hoare triple {5280#false} ~x~0 := ~i~0; {5280#false} is VALID [2018-11-23 11:58:51,554 INFO L273 TraceCheckUtils]: 36: Hoare triple {5280#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); {5280#false} is VALID [2018-11-23 11:58:51,555 INFO L256 TraceCheckUtils]: 37: Hoare triple {5280#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {5279#true} is VALID [2018-11-23 11:58:51,555 INFO L273 TraceCheckUtils]: 38: Hoare triple {5279#true} ~cond := #in~cond; {5279#true} is VALID [2018-11-23 11:58:51,555 INFO L273 TraceCheckUtils]: 39: Hoare triple {5279#true} assume !(0 == ~cond); {5279#true} is VALID [2018-11-23 11:58:51,556 INFO L273 TraceCheckUtils]: 40: Hoare triple {5279#true} assume true; {5279#true} is VALID [2018-11-23 11:58:51,556 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {5279#true} {5280#false} #136#return; {5280#false} is VALID [2018-11-23 11:58:51,556 INFO L273 TraceCheckUtils]: 42: Hoare triple {5280#false} havoc #t~mem9;havoc #t~mem10; {5280#false} is VALID [2018-11-23 11:58:51,556 INFO L273 TraceCheckUtils]: 43: Hoare triple {5280#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {5280#false} is VALID [2018-11-23 11:58:51,556 INFO L273 TraceCheckUtils]: 44: Hoare triple {5280#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); {5280#false} is VALID [2018-11-23 11:58:51,557 INFO L256 TraceCheckUtils]: 45: Hoare triple {5280#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {5280#false} is VALID [2018-11-23 11:58:51,557 INFO L273 TraceCheckUtils]: 46: Hoare triple {5280#false} ~cond := #in~cond; {5280#false} is VALID [2018-11-23 11:58:51,557 INFO L273 TraceCheckUtils]: 47: Hoare triple {5280#false} assume 0 == ~cond; {5280#false} is VALID [2018-11-23 11:58:51,557 INFO L273 TraceCheckUtils]: 48: Hoare triple {5280#false} assume !false; {5280#false} is VALID [2018-11-23 11:58:51,561 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:58:51,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:51,561 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:58:51,579 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:58:51,623 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:58:51,624 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:51,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:51,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:51,869 INFO L256 TraceCheckUtils]: 0: Hoare triple {5279#true} call ULTIMATE.init(); {5279#true} is VALID [2018-11-23 11:58:51,870 INFO L273 TraceCheckUtils]: 1: Hoare triple {5279#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5279#true} is VALID [2018-11-23 11:58:51,870 INFO L273 TraceCheckUtils]: 2: Hoare triple {5279#true} assume true; {5279#true} is VALID [2018-11-23 11:58:51,870 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5279#true} {5279#true} #130#return; {5279#true} is VALID [2018-11-23 11:58:51,870 INFO L256 TraceCheckUtils]: 4: Hoare triple {5279#true} call #t~ret15 := main(); {5279#true} is VALID [2018-11-23 11:58:51,871 INFO L273 TraceCheckUtils]: 5: Hoare triple {5279#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {5309#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:51,872 INFO L273 TraceCheckUtils]: 6: Hoare triple {5309#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {5313#(<= main_~k~0 1)} is VALID [2018-11-23 11:58:51,872 INFO L273 TraceCheckUtils]: 7: Hoare triple {5313#(<= 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); {5313#(<= main_~k~0 1)} is VALID [2018-11-23 11:58:51,873 INFO L273 TraceCheckUtils]: 8: Hoare triple {5313#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {5313#(<= main_~k~0 1)} is VALID [2018-11-23 11:58:51,873 INFO L273 TraceCheckUtils]: 9: Hoare triple {5313#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {5323#(<= main_~k~0 2)} is VALID [2018-11-23 11:58:51,873 INFO L273 TraceCheckUtils]: 10: Hoare triple {5323#(<= 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); {5323#(<= main_~k~0 2)} is VALID [2018-11-23 11:58:51,874 INFO L273 TraceCheckUtils]: 11: Hoare triple {5323#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {5323#(<= main_~k~0 2)} is VALID [2018-11-23 11:58:51,874 INFO L273 TraceCheckUtils]: 12: Hoare triple {5323#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {5333#(<= main_~k~0 3)} is VALID [2018-11-23 11:58:51,875 INFO L273 TraceCheckUtils]: 13: Hoare triple {5333#(<= 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); {5333#(<= main_~k~0 3)} is VALID [2018-11-23 11:58:51,875 INFO L273 TraceCheckUtils]: 14: Hoare triple {5333#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {5333#(<= main_~k~0 3)} is VALID [2018-11-23 11:58:51,876 INFO L273 TraceCheckUtils]: 15: Hoare triple {5333#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {5343#(<= main_~k~0 4)} is VALID [2018-11-23 11:58:51,876 INFO L273 TraceCheckUtils]: 16: Hoare triple {5343#(<= 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); {5343#(<= main_~k~0 4)} is VALID [2018-11-23 11:58:51,877 INFO L273 TraceCheckUtils]: 17: Hoare triple {5343#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {5343#(<= main_~k~0 4)} is VALID [2018-11-23 11:58:51,878 INFO L273 TraceCheckUtils]: 18: Hoare triple {5343#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {5353#(<= main_~k~0 5)} is VALID [2018-11-23 11:58:51,878 INFO L273 TraceCheckUtils]: 19: Hoare triple {5353#(<= 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); {5353#(<= main_~k~0 5)} is VALID [2018-11-23 11:58:51,879 INFO L273 TraceCheckUtils]: 20: Hoare triple {5353#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {5353#(<= main_~k~0 5)} is VALID [2018-11-23 11:58:51,880 INFO L273 TraceCheckUtils]: 21: Hoare triple {5353#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {5363#(<= main_~k~0 6)} is VALID [2018-11-23 11:58:51,880 INFO L273 TraceCheckUtils]: 22: Hoare triple {5363#(<= 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); {5363#(<= main_~k~0 6)} is VALID [2018-11-23 11:58:51,881 INFO L273 TraceCheckUtils]: 23: Hoare triple {5363#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {5363#(<= main_~k~0 6)} is VALID [2018-11-23 11:58:51,881 INFO L273 TraceCheckUtils]: 24: Hoare triple {5363#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {5373#(<= main_~k~0 7)} is VALID [2018-11-23 11:58:51,882 INFO L273 TraceCheckUtils]: 25: Hoare triple {5373#(<= 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); {5373#(<= main_~k~0 7)} is VALID [2018-11-23 11:58:51,882 INFO L273 TraceCheckUtils]: 26: Hoare triple {5373#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {5373#(<= main_~k~0 7)} is VALID [2018-11-23 11:58:51,883 INFO L273 TraceCheckUtils]: 27: Hoare triple {5373#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {5383#(<= main_~k~0 8)} is VALID [2018-11-23 11:58:51,884 INFO L273 TraceCheckUtils]: 28: Hoare triple {5383#(<= 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); {5383#(<= main_~k~0 8)} is VALID [2018-11-23 11:58:51,884 INFO L273 TraceCheckUtils]: 29: Hoare triple {5383#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {5383#(<= main_~k~0 8)} is VALID [2018-11-23 11:58:51,885 INFO L273 TraceCheckUtils]: 30: Hoare triple {5383#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {5393#(<= main_~k~0 9)} is VALID [2018-11-23 11:58:51,886 INFO L273 TraceCheckUtils]: 31: Hoare triple {5393#(<= main_~k~0 9)} assume !(~k~0 < 100000); {5280#false} is VALID [2018-11-23 11:58:51,886 INFO L273 TraceCheckUtils]: 32: Hoare triple {5280#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); {5280#false} is VALID [2018-11-23 11:58:51,886 INFO L273 TraceCheckUtils]: 33: Hoare triple {5280#false} ~x~0 := 0; {5280#false} is VALID [2018-11-23 11:58:51,886 INFO L273 TraceCheckUtils]: 34: Hoare triple {5280#false} assume !(~x~0 < ~i~0); {5280#false} is VALID [2018-11-23 11:58:51,886 INFO L273 TraceCheckUtils]: 35: Hoare triple {5280#false} ~x~0 := ~i~0; {5280#false} is VALID [2018-11-23 11:58:51,887 INFO L273 TraceCheckUtils]: 36: Hoare triple {5280#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); {5280#false} is VALID [2018-11-23 11:58:51,887 INFO L256 TraceCheckUtils]: 37: Hoare triple {5280#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {5280#false} is VALID [2018-11-23 11:58:51,887 INFO L273 TraceCheckUtils]: 38: Hoare triple {5280#false} ~cond := #in~cond; {5280#false} is VALID [2018-11-23 11:58:51,887 INFO L273 TraceCheckUtils]: 39: Hoare triple {5280#false} assume !(0 == ~cond); {5280#false} is VALID [2018-11-23 11:58:51,887 INFO L273 TraceCheckUtils]: 40: Hoare triple {5280#false} assume true; {5280#false} is VALID [2018-11-23 11:58:51,888 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {5280#false} {5280#false} #136#return; {5280#false} is VALID [2018-11-23 11:58:51,888 INFO L273 TraceCheckUtils]: 42: Hoare triple {5280#false} havoc #t~mem9;havoc #t~mem10; {5280#false} is VALID [2018-11-23 11:58:51,888 INFO L273 TraceCheckUtils]: 43: Hoare triple {5280#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {5280#false} is VALID [2018-11-23 11:58:51,888 INFO L273 TraceCheckUtils]: 44: Hoare triple {5280#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); {5280#false} is VALID [2018-11-23 11:58:51,888 INFO L256 TraceCheckUtils]: 45: Hoare triple {5280#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {5280#false} is VALID [2018-11-23 11:58:51,889 INFO L273 TraceCheckUtils]: 46: Hoare triple {5280#false} ~cond := #in~cond; {5280#false} is VALID [2018-11-23 11:58:51,889 INFO L273 TraceCheckUtils]: 47: Hoare triple {5280#false} assume 0 == ~cond; {5280#false} is VALID [2018-11-23 11:58:51,889 INFO L273 TraceCheckUtils]: 48: Hoare triple {5280#false} assume !false; {5280#false} is VALID [2018-11-23 11:58:51,891 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:58:51,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:51,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-11-23 11:58:51,910 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 49 [2018-11-23 11:58:51,911 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:51,911 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 11:58:51,983 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:51,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 11:58:51,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 11:58:51,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=285, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:58:51,985 INFO L87 Difference]: Start difference. First operand 102 states and 133 transitions. Second operand 22 states. [2018-11-23 11:58:52,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:52,635 INFO L93 Difference]: Finished difference Result 165 states and 219 transitions. [2018-11-23 11:58:52,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:58:52,635 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 49 [2018-11-23 11:58:52,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:52,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:58:52,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 143 transitions. [2018-11-23 11:58:52,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:58:52,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 143 transitions. [2018-11-23 11:58:52,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 143 transitions. [2018-11-23 11:58:53,071 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:53,074 INFO L225 Difference]: With dead ends: 165 [2018-11-23 11:58:53,074 INFO L226 Difference]: Without dead ends: 118 [2018-11-23 11:58:53,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=177, Invalid=285, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:58:53,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-23 11:58:53,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 108. [2018-11-23 11:58:53,131 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:53,131 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand 108 states. [2018-11-23 11:58:53,131 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 108 states. [2018-11-23 11:58:53,131 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 108 states. [2018-11-23 11:58:53,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:53,134 INFO L93 Difference]: Finished difference Result 118 states and 156 transitions. [2018-11-23 11:58:53,135 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 156 transitions. [2018-11-23 11:58:53,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:53,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:53,135 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 118 states. [2018-11-23 11:58:53,135 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 118 states. [2018-11-23 11:58:53,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:53,139 INFO L93 Difference]: Finished difference Result 118 states and 156 transitions. [2018-11-23 11:58:53,139 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 156 transitions. [2018-11-23 11:58:53,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:53,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:53,140 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:53,140 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:53,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-23 11:58:53,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 141 transitions. [2018-11-23 11:58:53,143 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 141 transitions. Word has length 49 [2018-11-23 11:58:53,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:53,143 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 141 transitions. [2018-11-23 11:58:53,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 11:58:53,143 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 141 transitions. [2018-11-23 11:58:53,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 11:58:53,144 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:53,144 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:58:53,144 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:53,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:53,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1932133007, now seen corresponding path program 5 times [2018-11-23 11:58:53,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:53,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:53,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:53,146 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:53,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:53,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:54,041 INFO L256 TraceCheckUtils]: 0: Hoare triple {6058#true} call ULTIMATE.init(); {6058#true} is VALID [2018-11-23 11:58:54,041 INFO L273 TraceCheckUtils]: 1: Hoare triple {6058#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6058#true} is VALID [2018-11-23 11:58:54,041 INFO L273 TraceCheckUtils]: 2: Hoare triple {6058#true} assume true; {6058#true} is VALID [2018-11-23 11:58:54,042 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6058#true} {6058#true} #130#return; {6058#true} is VALID [2018-11-23 11:58:54,042 INFO L256 TraceCheckUtils]: 4: Hoare triple {6058#true} call #t~ret15 := main(); {6058#true} is VALID [2018-11-23 11:58:54,042 INFO L273 TraceCheckUtils]: 5: Hoare triple {6058#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {6060#(= main_~i~0 0)} is VALID [2018-11-23 11:58:54,043 INFO L273 TraceCheckUtils]: 6: Hoare triple {6060#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {6061#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:54,044 INFO L273 TraceCheckUtils]: 7: Hoare triple {6061#(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); {6061#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:54,044 INFO L273 TraceCheckUtils]: 8: Hoare triple {6061#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6061#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:54,045 INFO L273 TraceCheckUtils]: 9: Hoare triple {6061#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {6062#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:54,045 INFO L273 TraceCheckUtils]: 10: Hoare triple {6062#(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); {6062#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:54,046 INFO L273 TraceCheckUtils]: 11: Hoare triple {6062#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6062#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:54,047 INFO L273 TraceCheckUtils]: 12: Hoare triple {6062#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {6063#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:54,048 INFO L273 TraceCheckUtils]: 13: Hoare triple {6063#(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); {6063#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:54,048 INFO L273 TraceCheckUtils]: 14: Hoare triple {6063#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6063#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:54,049 INFO L273 TraceCheckUtils]: 15: Hoare triple {6063#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {6064#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:54,050 INFO L273 TraceCheckUtils]: 16: Hoare triple {6064#(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); {6064#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:54,051 INFO L273 TraceCheckUtils]: 17: Hoare triple {6064#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6064#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:54,051 INFO L273 TraceCheckUtils]: 18: Hoare triple {6064#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {6065#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:54,052 INFO L273 TraceCheckUtils]: 19: Hoare triple {6065#(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); {6065#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:54,053 INFO L273 TraceCheckUtils]: 20: Hoare triple {6065#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6065#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:54,054 INFO L273 TraceCheckUtils]: 21: Hoare triple {6065#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {6066#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:54,055 INFO L273 TraceCheckUtils]: 22: Hoare triple {6066#(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); {6066#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:54,055 INFO L273 TraceCheckUtils]: 23: Hoare triple {6066#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6066#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:54,056 INFO L273 TraceCheckUtils]: 24: Hoare triple {6066#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {6067#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:54,057 INFO L273 TraceCheckUtils]: 25: Hoare triple {6067#(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); {6067#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:54,058 INFO L273 TraceCheckUtils]: 26: Hoare triple {6067#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6067#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:54,059 INFO L273 TraceCheckUtils]: 27: Hoare triple {6067#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {6068#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:54,059 INFO L273 TraceCheckUtils]: 28: Hoare triple {6068#(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); {6068#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:54,060 INFO L273 TraceCheckUtils]: 29: Hoare triple {6068#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6068#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:54,061 INFO L273 TraceCheckUtils]: 30: Hoare triple {6068#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {6069#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:54,062 INFO L273 TraceCheckUtils]: 31: Hoare triple {6069#(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); {6069#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:54,062 INFO L273 TraceCheckUtils]: 32: Hoare triple {6069#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6069#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:54,063 INFO L273 TraceCheckUtils]: 33: Hoare triple {6069#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {6070#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:54,064 INFO L273 TraceCheckUtils]: 34: Hoare triple {6070#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume !(~k~0 < 100000); {6059#false} is VALID [2018-11-23 11:58:54,064 INFO L273 TraceCheckUtils]: 35: Hoare triple {6059#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); {6059#false} is VALID [2018-11-23 11:58:54,064 INFO L273 TraceCheckUtils]: 36: Hoare triple {6059#false} ~x~0 := 0; {6059#false} is VALID [2018-11-23 11:58:54,065 INFO L273 TraceCheckUtils]: 37: Hoare triple {6059#false} assume !(~x~0 < ~i~0); {6059#false} is VALID [2018-11-23 11:58:54,065 INFO L273 TraceCheckUtils]: 38: Hoare triple {6059#false} ~x~0 := ~i~0; {6059#false} is VALID [2018-11-23 11:58:54,065 INFO L273 TraceCheckUtils]: 39: Hoare triple {6059#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); {6059#false} is VALID [2018-11-23 11:58:54,065 INFO L256 TraceCheckUtils]: 40: Hoare triple {6059#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {6058#true} is VALID [2018-11-23 11:58:54,066 INFO L273 TraceCheckUtils]: 41: Hoare triple {6058#true} ~cond := #in~cond; {6058#true} is VALID [2018-11-23 11:58:54,066 INFO L273 TraceCheckUtils]: 42: Hoare triple {6058#true} assume !(0 == ~cond); {6058#true} is VALID [2018-11-23 11:58:54,066 INFO L273 TraceCheckUtils]: 43: Hoare triple {6058#true} assume true; {6058#true} is VALID [2018-11-23 11:58:54,066 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {6058#true} {6059#false} #136#return; {6059#false} is VALID [2018-11-23 11:58:54,066 INFO L273 TraceCheckUtils]: 45: Hoare triple {6059#false} havoc #t~mem9;havoc #t~mem10; {6059#false} is VALID [2018-11-23 11:58:54,067 INFO L273 TraceCheckUtils]: 46: Hoare triple {6059#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {6059#false} is VALID [2018-11-23 11:58:54,067 INFO L273 TraceCheckUtils]: 47: Hoare triple {6059#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); {6059#false} is VALID [2018-11-23 11:58:54,067 INFO L256 TraceCheckUtils]: 48: Hoare triple {6059#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {6059#false} is VALID [2018-11-23 11:58:54,067 INFO L273 TraceCheckUtils]: 49: Hoare triple {6059#false} ~cond := #in~cond; {6059#false} is VALID [2018-11-23 11:58:54,068 INFO L273 TraceCheckUtils]: 50: Hoare triple {6059#false} assume 0 == ~cond; {6059#false} is VALID [2018-11-23 11:58:54,068 INFO L273 TraceCheckUtils]: 51: Hoare triple {6059#false} assume !false; {6059#false} is VALID [2018-11-23 11:58:54,072 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:58:54,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:54,072 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:58:54,086 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:58:54,115 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-11-23 11:58:54,116 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:54,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:54,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:54,398 INFO L256 TraceCheckUtils]: 0: Hoare triple {6058#true} call ULTIMATE.init(); {6058#true} is VALID [2018-11-23 11:58:54,399 INFO L273 TraceCheckUtils]: 1: Hoare triple {6058#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6058#true} is VALID [2018-11-23 11:58:54,399 INFO L273 TraceCheckUtils]: 2: Hoare triple {6058#true} assume true; {6058#true} is VALID [2018-11-23 11:58:54,399 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6058#true} {6058#true} #130#return; {6058#true} is VALID [2018-11-23 11:58:54,400 INFO L256 TraceCheckUtils]: 4: Hoare triple {6058#true} call #t~ret15 := main(); {6058#true} is VALID [2018-11-23 11:58:54,420 INFO L273 TraceCheckUtils]: 5: Hoare triple {6058#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {6089#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:54,421 INFO L273 TraceCheckUtils]: 6: Hoare triple {6089#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {6093#(<= main_~k~0 1)} is VALID [2018-11-23 11:58:54,422 INFO L273 TraceCheckUtils]: 7: Hoare triple {6093#(<= 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); {6093#(<= main_~k~0 1)} is VALID [2018-11-23 11:58:54,422 INFO L273 TraceCheckUtils]: 8: Hoare triple {6093#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6093#(<= main_~k~0 1)} is VALID [2018-11-23 11:58:54,423 INFO L273 TraceCheckUtils]: 9: Hoare triple {6093#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {6103#(<= main_~k~0 2)} is VALID [2018-11-23 11:58:54,423 INFO L273 TraceCheckUtils]: 10: Hoare triple {6103#(<= 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); {6103#(<= main_~k~0 2)} is VALID [2018-11-23 11:58:54,423 INFO L273 TraceCheckUtils]: 11: Hoare triple {6103#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6103#(<= main_~k~0 2)} is VALID [2018-11-23 11:58:54,424 INFO L273 TraceCheckUtils]: 12: Hoare triple {6103#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {6113#(<= main_~k~0 3)} is VALID [2018-11-23 11:58:54,424 INFO L273 TraceCheckUtils]: 13: Hoare triple {6113#(<= 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); {6113#(<= main_~k~0 3)} is VALID [2018-11-23 11:58:54,424 INFO L273 TraceCheckUtils]: 14: Hoare triple {6113#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6113#(<= main_~k~0 3)} is VALID [2018-11-23 11:58:54,425 INFO L273 TraceCheckUtils]: 15: Hoare triple {6113#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {6123#(<= main_~k~0 4)} is VALID [2018-11-23 11:58:54,426 INFO L273 TraceCheckUtils]: 16: Hoare triple {6123#(<= 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); {6123#(<= main_~k~0 4)} is VALID [2018-11-23 11:58:54,426 INFO L273 TraceCheckUtils]: 17: Hoare triple {6123#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6123#(<= main_~k~0 4)} is VALID [2018-11-23 11:58:54,427 INFO L273 TraceCheckUtils]: 18: Hoare triple {6123#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {6133#(<= main_~k~0 5)} is VALID [2018-11-23 11:58:54,427 INFO L273 TraceCheckUtils]: 19: Hoare triple {6133#(<= 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); {6133#(<= main_~k~0 5)} is VALID [2018-11-23 11:58:54,428 INFO L273 TraceCheckUtils]: 20: Hoare triple {6133#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6133#(<= main_~k~0 5)} is VALID [2018-11-23 11:58:54,428 INFO L273 TraceCheckUtils]: 21: Hoare triple {6133#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {6143#(<= main_~k~0 6)} is VALID [2018-11-23 11:58:54,429 INFO L273 TraceCheckUtils]: 22: Hoare triple {6143#(<= 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); {6143#(<= main_~k~0 6)} is VALID [2018-11-23 11:58:54,429 INFO L273 TraceCheckUtils]: 23: Hoare triple {6143#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6143#(<= main_~k~0 6)} is VALID [2018-11-23 11:58:54,430 INFO L273 TraceCheckUtils]: 24: Hoare triple {6143#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {6153#(<= main_~k~0 7)} is VALID [2018-11-23 11:58:54,431 INFO L273 TraceCheckUtils]: 25: Hoare triple {6153#(<= 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); {6153#(<= main_~k~0 7)} is VALID [2018-11-23 11:58:54,431 INFO L273 TraceCheckUtils]: 26: Hoare triple {6153#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6153#(<= main_~k~0 7)} is VALID [2018-11-23 11:58:54,432 INFO L273 TraceCheckUtils]: 27: Hoare triple {6153#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {6163#(<= main_~k~0 8)} is VALID [2018-11-23 11:58:54,432 INFO L273 TraceCheckUtils]: 28: Hoare triple {6163#(<= 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); {6163#(<= main_~k~0 8)} is VALID [2018-11-23 11:58:54,433 INFO L273 TraceCheckUtils]: 29: Hoare triple {6163#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6163#(<= main_~k~0 8)} is VALID [2018-11-23 11:58:54,434 INFO L273 TraceCheckUtils]: 30: Hoare triple {6163#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {6173#(<= main_~k~0 9)} is VALID [2018-11-23 11:58:54,434 INFO L273 TraceCheckUtils]: 31: Hoare triple {6173#(<= 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); {6173#(<= main_~k~0 9)} is VALID [2018-11-23 11:58:54,435 INFO L273 TraceCheckUtils]: 32: Hoare triple {6173#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6173#(<= main_~k~0 9)} is VALID [2018-11-23 11:58:54,435 INFO L273 TraceCheckUtils]: 33: Hoare triple {6173#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {6183#(<= main_~k~0 10)} is VALID [2018-11-23 11:58:54,436 INFO L273 TraceCheckUtils]: 34: Hoare triple {6183#(<= main_~k~0 10)} assume !(~k~0 < 100000); {6059#false} is VALID [2018-11-23 11:58:54,436 INFO L273 TraceCheckUtils]: 35: Hoare triple {6059#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); {6059#false} is VALID [2018-11-23 11:58:54,436 INFO L273 TraceCheckUtils]: 36: Hoare triple {6059#false} ~x~0 := 0; {6059#false} is VALID [2018-11-23 11:58:54,437 INFO L273 TraceCheckUtils]: 37: Hoare triple {6059#false} assume !(~x~0 < ~i~0); {6059#false} is VALID [2018-11-23 11:58:54,437 INFO L273 TraceCheckUtils]: 38: Hoare triple {6059#false} ~x~0 := ~i~0; {6059#false} is VALID [2018-11-23 11:58:54,437 INFO L273 TraceCheckUtils]: 39: Hoare triple {6059#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); {6059#false} is VALID [2018-11-23 11:58:54,437 INFO L256 TraceCheckUtils]: 40: Hoare triple {6059#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {6059#false} is VALID [2018-11-23 11:58:54,437 INFO L273 TraceCheckUtils]: 41: Hoare triple {6059#false} ~cond := #in~cond; {6059#false} is VALID [2018-11-23 11:58:54,438 INFO L273 TraceCheckUtils]: 42: Hoare triple {6059#false} assume !(0 == ~cond); {6059#false} is VALID [2018-11-23 11:58:54,438 INFO L273 TraceCheckUtils]: 43: Hoare triple {6059#false} assume true; {6059#false} is VALID [2018-11-23 11:58:54,438 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {6059#false} {6059#false} #136#return; {6059#false} is VALID [2018-11-23 11:58:54,438 INFO L273 TraceCheckUtils]: 45: Hoare triple {6059#false} havoc #t~mem9;havoc #t~mem10; {6059#false} is VALID [2018-11-23 11:58:54,439 INFO L273 TraceCheckUtils]: 46: Hoare triple {6059#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {6059#false} is VALID [2018-11-23 11:58:54,439 INFO L273 TraceCheckUtils]: 47: Hoare triple {6059#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); {6059#false} is VALID [2018-11-23 11:58:54,439 INFO L256 TraceCheckUtils]: 48: Hoare triple {6059#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {6059#false} is VALID [2018-11-23 11:58:54,439 INFO L273 TraceCheckUtils]: 49: Hoare triple {6059#false} ~cond := #in~cond; {6059#false} is VALID [2018-11-23 11:58:54,439 INFO L273 TraceCheckUtils]: 50: Hoare triple {6059#false} assume 0 == ~cond; {6059#false} is VALID [2018-11-23 11:58:54,439 INFO L273 TraceCheckUtils]: 51: Hoare triple {6059#false} assume !false; {6059#false} is VALID [2018-11-23 11:58:54,441 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:58:54,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:54,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-23 11:58:54,460 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 52 [2018-11-23 11:58:54,461 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:54,461 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 11:58:54,540 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:58:54,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 11:58:54,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 11:58:54,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=341, Unknown=0, NotChecked=0, Total=552 [2018-11-23 11:58:54,542 INFO L87 Difference]: Start difference. First operand 108 states and 141 transitions. Second operand 24 states. [2018-11-23 11:58:55,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:55,515 INFO L93 Difference]: Finished difference Result 171 states and 227 transitions. [2018-11-23 11:58:55,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 11:58:55,515 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 52 [2018-11-23 11:58:55,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:55,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:58:55,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 147 transitions. [2018-11-23 11:58:55,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:58:55,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 147 transitions. [2018-11-23 11:58:55,519 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 147 transitions. [2018-11-23 11:58:56,229 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:58:56,232 INFO L225 Difference]: With dead ends: 171 [2018-11-23 11:58:56,232 INFO L226 Difference]: Without dead ends: 124 [2018-11-23 11:58:56,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=211, Invalid=341, Unknown=0, NotChecked=0, Total=552 [2018-11-23 11:58:56,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-11-23 11:58:56,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 114. [2018-11-23 11:58:56,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:56,320 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand 114 states. [2018-11-23 11:58:56,320 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand 114 states. [2018-11-23 11:58:56,320 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 114 states. [2018-11-23 11:58:56,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:56,324 INFO L93 Difference]: Finished difference Result 124 states and 164 transitions. [2018-11-23 11:58:56,324 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 164 transitions. [2018-11-23 11:58:56,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:56,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:56,325 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 124 states. [2018-11-23 11:58:56,325 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 124 states. [2018-11-23 11:58:56,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:56,329 INFO L93 Difference]: Finished difference Result 124 states and 164 transitions. [2018-11-23 11:58:56,329 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 164 transitions. [2018-11-23 11:58:56,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:56,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:56,330 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:56,330 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:56,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-23 11:58:56,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 149 transitions. [2018-11-23 11:58:56,334 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 149 transitions. Word has length 52 [2018-11-23 11:58:56,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:56,334 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 149 transitions. [2018-11-23 11:58:56,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 11:58:56,334 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 149 transitions. [2018-11-23 11:58:56,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 11:58:56,335 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:56,335 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:58:56,335 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:56,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:56,336 INFO L82 PathProgramCache]: Analyzing trace with hash -186475156, now seen corresponding path program 6 times [2018-11-23 11:58:56,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:56,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:56,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:56,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:56,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:56,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:57,244 INFO L256 TraceCheckUtils]: 0: Hoare triple {6876#true} call ULTIMATE.init(); {6876#true} is VALID [2018-11-23 11:58:57,245 INFO L273 TraceCheckUtils]: 1: Hoare triple {6876#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6876#true} is VALID [2018-11-23 11:58:57,245 INFO L273 TraceCheckUtils]: 2: Hoare triple {6876#true} assume true; {6876#true} is VALID [2018-11-23 11:58:57,245 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6876#true} {6876#true} #130#return; {6876#true} is VALID [2018-11-23 11:58:57,245 INFO L256 TraceCheckUtils]: 4: Hoare triple {6876#true} call #t~ret15 := main(); {6876#true} is VALID [2018-11-23 11:58:57,245 INFO L273 TraceCheckUtils]: 5: Hoare triple {6876#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {6878#(= main_~i~0 0)} is VALID [2018-11-23 11:58:57,246 INFO L273 TraceCheckUtils]: 6: Hoare triple {6878#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {6879#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:57,247 INFO L273 TraceCheckUtils]: 7: Hoare triple {6879#(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); {6879#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:57,248 INFO L273 TraceCheckUtils]: 8: Hoare triple {6879#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6879#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:57,249 INFO L273 TraceCheckUtils]: 9: Hoare triple {6879#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {6880#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:57,250 INFO L273 TraceCheckUtils]: 10: Hoare triple {6880#(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); {6880#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:57,251 INFO L273 TraceCheckUtils]: 11: Hoare triple {6880#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6880#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:57,251 INFO L273 TraceCheckUtils]: 12: Hoare triple {6880#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {6881#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:57,252 INFO L273 TraceCheckUtils]: 13: Hoare triple {6881#(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); {6881#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:57,253 INFO L273 TraceCheckUtils]: 14: Hoare triple {6881#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6881#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:57,254 INFO L273 TraceCheckUtils]: 15: Hoare triple {6881#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {6882#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:57,255 INFO L273 TraceCheckUtils]: 16: Hoare triple {6882#(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); {6882#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:57,256 INFO L273 TraceCheckUtils]: 17: Hoare triple {6882#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6882#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:57,257 INFO L273 TraceCheckUtils]: 18: Hoare triple {6882#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {6883#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:57,258 INFO L273 TraceCheckUtils]: 19: Hoare triple {6883#(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); {6883#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:57,259 INFO L273 TraceCheckUtils]: 20: Hoare triple {6883#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6883#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:57,259 INFO L273 TraceCheckUtils]: 21: Hoare triple {6883#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {6884#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:57,260 INFO L273 TraceCheckUtils]: 22: Hoare triple {6884#(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); {6884#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:57,261 INFO L273 TraceCheckUtils]: 23: Hoare triple {6884#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6884#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:57,262 INFO L273 TraceCheckUtils]: 24: Hoare triple {6884#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {6885#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:57,263 INFO L273 TraceCheckUtils]: 25: Hoare triple {6885#(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); {6885#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:57,264 INFO L273 TraceCheckUtils]: 26: Hoare triple {6885#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6885#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:57,265 INFO L273 TraceCheckUtils]: 27: Hoare triple {6885#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {6886#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:57,266 INFO L273 TraceCheckUtils]: 28: Hoare triple {6886#(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); {6886#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:57,266 INFO L273 TraceCheckUtils]: 29: Hoare triple {6886#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6886#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:57,267 INFO L273 TraceCheckUtils]: 30: Hoare triple {6886#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {6887#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:57,268 INFO L273 TraceCheckUtils]: 31: Hoare triple {6887#(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); {6887#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:57,269 INFO L273 TraceCheckUtils]: 32: Hoare triple {6887#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6887#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:57,270 INFO L273 TraceCheckUtils]: 33: Hoare triple {6887#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {6888#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:57,271 INFO L273 TraceCheckUtils]: 34: Hoare triple {6888#(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); {6888#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:57,272 INFO L273 TraceCheckUtils]: 35: Hoare triple {6888#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6888#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:57,272 INFO L273 TraceCheckUtils]: 36: Hoare triple {6888#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {6889#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:58:57,273 INFO L273 TraceCheckUtils]: 37: Hoare triple {6889#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume !(~k~0 < 100000); {6877#false} is VALID [2018-11-23 11:58:57,274 INFO L273 TraceCheckUtils]: 38: Hoare triple {6877#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); {6877#false} is VALID [2018-11-23 11:58:57,274 INFO L273 TraceCheckUtils]: 39: Hoare triple {6877#false} ~x~0 := 0; {6877#false} is VALID [2018-11-23 11:58:57,274 INFO L273 TraceCheckUtils]: 40: Hoare triple {6877#false} assume !(~x~0 < ~i~0); {6877#false} is VALID [2018-11-23 11:58:57,274 INFO L273 TraceCheckUtils]: 41: Hoare triple {6877#false} ~x~0 := ~i~0; {6877#false} is VALID [2018-11-23 11:58:57,274 INFO L273 TraceCheckUtils]: 42: Hoare triple {6877#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); {6877#false} is VALID [2018-11-23 11:58:57,275 INFO L256 TraceCheckUtils]: 43: Hoare triple {6877#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {6876#true} is VALID [2018-11-23 11:58:57,275 INFO L273 TraceCheckUtils]: 44: Hoare triple {6876#true} ~cond := #in~cond; {6876#true} is VALID [2018-11-23 11:58:57,275 INFO L273 TraceCheckUtils]: 45: Hoare triple {6876#true} assume !(0 == ~cond); {6876#true} is VALID [2018-11-23 11:58:57,275 INFO L273 TraceCheckUtils]: 46: Hoare triple {6876#true} assume true; {6876#true} is VALID [2018-11-23 11:58:57,275 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {6876#true} {6877#false} #136#return; {6877#false} is VALID [2018-11-23 11:58:57,275 INFO L273 TraceCheckUtils]: 48: Hoare triple {6877#false} havoc #t~mem9;havoc #t~mem10; {6877#false} is VALID [2018-11-23 11:58:57,276 INFO L273 TraceCheckUtils]: 49: Hoare triple {6877#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {6877#false} is VALID [2018-11-23 11:58:57,276 INFO L273 TraceCheckUtils]: 50: Hoare triple {6877#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); {6877#false} is VALID [2018-11-23 11:58:57,276 INFO L256 TraceCheckUtils]: 51: Hoare triple {6877#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {6877#false} is VALID [2018-11-23 11:58:57,276 INFO L273 TraceCheckUtils]: 52: Hoare triple {6877#false} ~cond := #in~cond; {6877#false} is VALID [2018-11-23 11:58:57,276 INFO L273 TraceCheckUtils]: 53: Hoare triple {6877#false} assume 0 == ~cond; {6877#false} is VALID [2018-11-23 11:58:57,276 INFO L273 TraceCheckUtils]: 54: Hoare triple {6877#false} assume !false; {6877#false} is VALID [2018-11-23 11:58:57,280 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:58:57,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:57,280 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:58:57,290 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:58:57,336 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-11-23 11:58:57,336 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:57,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:57,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:57,770 INFO L256 TraceCheckUtils]: 0: Hoare triple {6876#true} call ULTIMATE.init(); {6876#true} is VALID [2018-11-23 11:58:57,770 INFO L273 TraceCheckUtils]: 1: Hoare triple {6876#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6876#true} is VALID [2018-11-23 11:58:57,770 INFO L273 TraceCheckUtils]: 2: Hoare triple {6876#true} assume true; {6876#true} is VALID [2018-11-23 11:58:57,771 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6876#true} {6876#true} #130#return; {6876#true} is VALID [2018-11-23 11:58:57,771 INFO L256 TraceCheckUtils]: 4: Hoare triple {6876#true} call #t~ret15 := main(); {6876#true} is VALID [2018-11-23 11:58:57,772 INFO L273 TraceCheckUtils]: 5: Hoare triple {6876#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {6908#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:57,774 INFO L273 TraceCheckUtils]: 6: Hoare triple {6908#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {6912#(<= main_~k~0 1)} is VALID [2018-11-23 11:58:57,774 INFO L273 TraceCheckUtils]: 7: Hoare triple {6912#(<= 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); {6912#(<= main_~k~0 1)} is VALID [2018-11-23 11:58:57,776 INFO L273 TraceCheckUtils]: 8: Hoare triple {6912#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6912#(<= main_~k~0 1)} is VALID [2018-11-23 11:58:57,776 INFO L273 TraceCheckUtils]: 9: Hoare triple {6912#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {6922#(<= main_~k~0 2)} is VALID [2018-11-23 11:58:57,794 INFO L273 TraceCheckUtils]: 10: Hoare triple {6922#(<= 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); {6922#(<= main_~k~0 2)} is VALID [2018-11-23 11:58:57,807 INFO L273 TraceCheckUtils]: 11: Hoare triple {6922#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6922#(<= main_~k~0 2)} is VALID [2018-11-23 11:58:57,821 INFO L273 TraceCheckUtils]: 12: Hoare triple {6922#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {6932#(<= main_~k~0 3)} is VALID [2018-11-23 11:58:57,834 INFO L273 TraceCheckUtils]: 13: Hoare triple {6932#(<= 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); {6932#(<= main_~k~0 3)} is VALID [2018-11-23 11:58:57,842 INFO L273 TraceCheckUtils]: 14: Hoare triple {6932#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6932#(<= main_~k~0 3)} is VALID [2018-11-23 11:58:57,858 INFO L273 TraceCheckUtils]: 15: Hoare triple {6932#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {6942#(<= main_~k~0 4)} is VALID [2018-11-23 11:58:57,872 INFO L273 TraceCheckUtils]: 16: Hoare triple {6942#(<= 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); {6942#(<= main_~k~0 4)} is VALID [2018-11-23 11:58:57,886 INFO L273 TraceCheckUtils]: 17: Hoare triple {6942#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6942#(<= main_~k~0 4)} is VALID [2018-11-23 11:58:57,887 INFO L273 TraceCheckUtils]: 18: Hoare triple {6942#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {6952#(<= main_~k~0 5)} is VALID [2018-11-23 11:58:57,888 INFO L273 TraceCheckUtils]: 19: Hoare triple {6952#(<= 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); {6952#(<= main_~k~0 5)} is VALID [2018-11-23 11:58:57,888 INFO L273 TraceCheckUtils]: 20: Hoare triple {6952#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6952#(<= main_~k~0 5)} is VALID [2018-11-23 11:58:57,888 INFO L273 TraceCheckUtils]: 21: Hoare triple {6952#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {6962#(<= main_~k~0 6)} is VALID [2018-11-23 11:58:57,889 INFO L273 TraceCheckUtils]: 22: Hoare triple {6962#(<= 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); {6962#(<= main_~k~0 6)} is VALID [2018-11-23 11:58:57,889 INFO L273 TraceCheckUtils]: 23: Hoare triple {6962#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6962#(<= main_~k~0 6)} is VALID [2018-11-23 11:58:57,890 INFO L273 TraceCheckUtils]: 24: Hoare triple {6962#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {6972#(<= main_~k~0 7)} is VALID [2018-11-23 11:58:57,890 INFO L273 TraceCheckUtils]: 25: Hoare triple {6972#(<= 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); {6972#(<= main_~k~0 7)} is VALID [2018-11-23 11:58:57,890 INFO L273 TraceCheckUtils]: 26: Hoare triple {6972#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6972#(<= main_~k~0 7)} is VALID [2018-11-23 11:58:57,891 INFO L273 TraceCheckUtils]: 27: Hoare triple {6972#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {6982#(<= main_~k~0 8)} is VALID [2018-11-23 11:58:57,891 INFO L273 TraceCheckUtils]: 28: Hoare triple {6982#(<= 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); {6982#(<= main_~k~0 8)} is VALID [2018-11-23 11:58:57,892 INFO L273 TraceCheckUtils]: 29: Hoare triple {6982#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6982#(<= main_~k~0 8)} is VALID [2018-11-23 11:58:57,892 INFO L273 TraceCheckUtils]: 30: Hoare triple {6982#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {6992#(<= main_~k~0 9)} is VALID [2018-11-23 11:58:57,895 INFO L273 TraceCheckUtils]: 31: Hoare triple {6992#(<= 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); {6992#(<= main_~k~0 9)} is VALID [2018-11-23 11:58:57,895 INFO L273 TraceCheckUtils]: 32: Hoare triple {6992#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6992#(<= main_~k~0 9)} is VALID [2018-11-23 11:58:57,896 INFO L273 TraceCheckUtils]: 33: Hoare triple {6992#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {7002#(<= main_~k~0 10)} is VALID [2018-11-23 11:58:57,896 INFO L273 TraceCheckUtils]: 34: Hoare triple {7002#(<= 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); {7002#(<= main_~k~0 10)} is VALID [2018-11-23 11:58:57,897 INFO L273 TraceCheckUtils]: 35: Hoare triple {7002#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {7002#(<= main_~k~0 10)} is VALID [2018-11-23 11:58:57,899 INFO L273 TraceCheckUtils]: 36: Hoare triple {7002#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {7012#(<= main_~k~0 11)} is VALID [2018-11-23 11:58:57,900 INFO L273 TraceCheckUtils]: 37: Hoare triple {7012#(<= main_~k~0 11)} assume !(~k~0 < 100000); {6877#false} is VALID [2018-11-23 11:58:57,900 INFO L273 TraceCheckUtils]: 38: Hoare triple {6877#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); {6877#false} is VALID [2018-11-23 11:58:57,900 INFO L273 TraceCheckUtils]: 39: Hoare triple {6877#false} ~x~0 := 0; {6877#false} is VALID [2018-11-23 11:58:57,900 INFO L273 TraceCheckUtils]: 40: Hoare triple {6877#false} assume !(~x~0 < ~i~0); {6877#false} is VALID [2018-11-23 11:58:57,901 INFO L273 TraceCheckUtils]: 41: Hoare triple {6877#false} ~x~0 := ~i~0; {6877#false} is VALID [2018-11-23 11:58:57,901 INFO L273 TraceCheckUtils]: 42: Hoare triple {6877#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); {6877#false} is VALID [2018-11-23 11:58:57,901 INFO L256 TraceCheckUtils]: 43: Hoare triple {6877#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {6877#false} is VALID [2018-11-23 11:58:57,902 INFO L273 TraceCheckUtils]: 44: Hoare triple {6877#false} ~cond := #in~cond; {6877#false} is VALID [2018-11-23 11:58:57,902 INFO L273 TraceCheckUtils]: 45: Hoare triple {6877#false} assume !(0 == ~cond); {6877#false} is VALID [2018-11-23 11:58:57,902 INFO L273 TraceCheckUtils]: 46: Hoare triple {6877#false} assume true; {6877#false} is VALID [2018-11-23 11:58:57,902 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {6877#false} {6877#false} #136#return; {6877#false} is VALID [2018-11-23 11:58:57,903 INFO L273 TraceCheckUtils]: 48: Hoare triple {6877#false} havoc #t~mem9;havoc #t~mem10; {6877#false} is VALID [2018-11-23 11:58:57,903 INFO L273 TraceCheckUtils]: 49: Hoare triple {6877#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {6877#false} is VALID [2018-11-23 11:58:57,903 INFO L273 TraceCheckUtils]: 50: Hoare triple {6877#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); {6877#false} is VALID [2018-11-23 11:58:57,903 INFO L256 TraceCheckUtils]: 51: Hoare triple {6877#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {6877#false} is VALID [2018-11-23 11:58:57,903 INFO L273 TraceCheckUtils]: 52: Hoare triple {6877#false} ~cond := #in~cond; {6877#false} is VALID [2018-11-23 11:58:57,903 INFO L273 TraceCheckUtils]: 53: Hoare triple {6877#false} assume 0 == ~cond; {6877#false} is VALID [2018-11-23 11:58:57,903 INFO L273 TraceCheckUtils]: 54: Hoare triple {6877#false} assume !false; {6877#false} is VALID [2018-11-23 11:58:57,905 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:58:57,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:57,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-11-23 11:58:57,925 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2018-11-23 11:58:57,926 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:57,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 11:58:58,035 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:58,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 11:58:58,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 11:58:58,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=402, Unknown=0, NotChecked=0, Total=650 [2018-11-23 11:58:58,036 INFO L87 Difference]: Start difference. First operand 114 states and 149 transitions. Second operand 26 states. [2018-11-23 11:58:59,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:59,481 INFO L93 Difference]: Finished difference Result 177 states and 235 transitions. [2018-11-23 11:58:59,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 11:58:59,482 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2018-11-23 11:58:59,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:59,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 11:58:59,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 151 transitions. [2018-11-23 11:58:59,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 11:58:59,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 151 transitions. [2018-11-23 11:58:59,487 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 151 transitions. [2018-11-23 11:59:00,143 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:59:00,146 INFO L225 Difference]: With dead ends: 177 [2018-11-23 11:59:00,147 INFO L226 Difference]: Without dead ends: 130 [2018-11-23 11:59:00,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=248, Invalid=402, Unknown=0, NotChecked=0, Total=650 [2018-11-23 11:59:00,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-11-23 11:59:00,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 120. [2018-11-23 11:59:00,276 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:00,277 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand 120 states. [2018-11-23 11:59:00,277 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand 120 states. [2018-11-23 11:59:00,277 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 120 states. [2018-11-23 11:59:00,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:00,283 INFO L93 Difference]: Finished difference Result 130 states and 172 transitions. [2018-11-23 11:59:00,283 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 172 transitions. [2018-11-23 11:59:00,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:00,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:00,284 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 130 states. [2018-11-23 11:59:00,284 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 130 states. [2018-11-23 11:59:00,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:00,287 INFO L93 Difference]: Finished difference Result 130 states and 172 transitions. [2018-11-23 11:59:00,287 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 172 transitions. [2018-11-23 11:59:00,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:00,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:00,288 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:00,288 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:00,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-23 11:59:00,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 157 transitions. [2018-11-23 11:59:00,291 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 157 transitions. Word has length 55 [2018-11-23 11:59:00,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:00,292 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 157 transitions. [2018-11-23 11:59:00,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 11:59:00,292 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 157 transitions. [2018-11-23 11:59:00,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-23 11:59:00,293 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:00,293 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:59:00,293 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:00,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:00,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1242544017, now seen corresponding path program 7 times [2018-11-23 11:59:00,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:00,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:00,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:00,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:00,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:00,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:00,898 INFO L256 TraceCheckUtils]: 0: Hoare triple {7733#true} call ULTIMATE.init(); {7733#true} is VALID [2018-11-23 11:59:00,899 INFO L273 TraceCheckUtils]: 1: Hoare triple {7733#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7733#true} is VALID [2018-11-23 11:59:00,899 INFO L273 TraceCheckUtils]: 2: Hoare triple {7733#true} assume true; {7733#true} is VALID [2018-11-23 11:59:00,899 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7733#true} {7733#true} #130#return; {7733#true} is VALID [2018-11-23 11:59:00,899 INFO L256 TraceCheckUtils]: 4: Hoare triple {7733#true} call #t~ret15 := main(); {7733#true} is VALID [2018-11-23 11:59:00,900 INFO L273 TraceCheckUtils]: 5: Hoare triple {7733#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {7735#(= main_~i~0 0)} is VALID [2018-11-23 11:59:00,901 INFO L273 TraceCheckUtils]: 6: Hoare triple {7735#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {7736#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:00,901 INFO L273 TraceCheckUtils]: 7: Hoare triple {7736#(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); {7736#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:00,902 INFO L273 TraceCheckUtils]: 8: Hoare triple {7736#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {7736#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:00,902 INFO L273 TraceCheckUtils]: 9: Hoare triple {7736#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {7737#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:00,903 INFO L273 TraceCheckUtils]: 10: Hoare triple {7737#(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); {7737#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:00,903 INFO L273 TraceCheckUtils]: 11: Hoare triple {7737#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {7737#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:00,904 INFO L273 TraceCheckUtils]: 12: Hoare triple {7737#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {7738#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:00,905 INFO L273 TraceCheckUtils]: 13: Hoare triple {7738#(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); {7738#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:00,906 INFO L273 TraceCheckUtils]: 14: Hoare triple {7738#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {7738#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:00,907 INFO L273 TraceCheckUtils]: 15: Hoare triple {7738#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {7739#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:00,908 INFO L273 TraceCheckUtils]: 16: Hoare triple {7739#(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); {7739#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:00,908 INFO L273 TraceCheckUtils]: 17: Hoare triple {7739#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {7739#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:00,909 INFO L273 TraceCheckUtils]: 18: Hoare triple {7739#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {7740#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:00,910 INFO L273 TraceCheckUtils]: 19: Hoare triple {7740#(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); {7740#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:00,911 INFO L273 TraceCheckUtils]: 20: Hoare triple {7740#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {7740#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:00,912 INFO L273 TraceCheckUtils]: 21: Hoare triple {7740#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {7741#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:00,913 INFO L273 TraceCheckUtils]: 22: Hoare triple {7741#(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); {7741#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:00,913 INFO L273 TraceCheckUtils]: 23: Hoare triple {7741#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {7741#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:00,914 INFO L273 TraceCheckUtils]: 24: Hoare triple {7741#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {7742#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:00,915 INFO L273 TraceCheckUtils]: 25: Hoare triple {7742#(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); {7742#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:00,916 INFO L273 TraceCheckUtils]: 26: Hoare triple {7742#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {7742#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:00,917 INFO L273 TraceCheckUtils]: 27: Hoare triple {7742#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {7743#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:00,918 INFO L273 TraceCheckUtils]: 28: Hoare triple {7743#(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); {7743#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:00,918 INFO L273 TraceCheckUtils]: 29: Hoare triple {7743#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {7743#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:00,919 INFO L273 TraceCheckUtils]: 30: Hoare triple {7743#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {7744#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:00,920 INFO L273 TraceCheckUtils]: 31: Hoare triple {7744#(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); {7744#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:00,921 INFO L273 TraceCheckUtils]: 32: Hoare triple {7744#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {7744#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:00,922 INFO L273 TraceCheckUtils]: 33: Hoare triple {7744#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {7745#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:00,923 INFO L273 TraceCheckUtils]: 34: Hoare triple {7745#(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); {7745#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:00,923 INFO L273 TraceCheckUtils]: 35: Hoare triple {7745#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {7745#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:00,924 INFO L273 TraceCheckUtils]: 36: Hoare triple {7745#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {7746#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:00,925 INFO L273 TraceCheckUtils]: 37: Hoare triple {7746#(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); {7746#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:00,926 INFO L273 TraceCheckUtils]: 38: Hoare triple {7746#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {7746#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:00,927 INFO L273 TraceCheckUtils]: 39: Hoare triple {7746#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {7747#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:00,928 INFO L273 TraceCheckUtils]: 40: Hoare triple {7747#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume !(~k~0 < 100000); {7734#false} is VALID [2018-11-23 11:59:00,928 INFO L273 TraceCheckUtils]: 41: Hoare triple {7734#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); {7734#false} is VALID [2018-11-23 11:59:00,928 INFO L273 TraceCheckUtils]: 42: Hoare triple {7734#false} ~x~0 := 0; {7734#false} is VALID [2018-11-23 11:59:00,928 INFO L273 TraceCheckUtils]: 43: Hoare triple {7734#false} assume !(~x~0 < ~i~0); {7734#false} is VALID [2018-11-23 11:59:00,928 INFO L273 TraceCheckUtils]: 44: Hoare triple {7734#false} ~x~0 := ~i~0; {7734#false} is VALID [2018-11-23 11:59:00,929 INFO L273 TraceCheckUtils]: 45: Hoare triple {7734#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); {7734#false} is VALID [2018-11-23 11:59:00,929 INFO L256 TraceCheckUtils]: 46: Hoare triple {7734#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {7733#true} is VALID [2018-11-23 11:59:00,929 INFO L273 TraceCheckUtils]: 47: Hoare triple {7733#true} ~cond := #in~cond; {7733#true} is VALID [2018-11-23 11:59:00,929 INFO L273 TraceCheckUtils]: 48: Hoare triple {7733#true} assume !(0 == ~cond); {7733#true} is VALID [2018-11-23 11:59:00,929 INFO L273 TraceCheckUtils]: 49: Hoare triple {7733#true} assume true; {7733#true} is VALID [2018-11-23 11:59:00,930 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {7733#true} {7734#false} #136#return; {7734#false} is VALID [2018-11-23 11:59:00,930 INFO L273 TraceCheckUtils]: 51: Hoare triple {7734#false} havoc #t~mem9;havoc #t~mem10; {7734#false} is VALID [2018-11-23 11:59:00,930 INFO L273 TraceCheckUtils]: 52: Hoare triple {7734#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {7734#false} is VALID [2018-11-23 11:59:00,930 INFO L273 TraceCheckUtils]: 53: Hoare triple {7734#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); {7734#false} is VALID [2018-11-23 11:59:00,930 INFO L256 TraceCheckUtils]: 54: Hoare triple {7734#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {7734#false} is VALID [2018-11-23 11:59:00,930 INFO L273 TraceCheckUtils]: 55: Hoare triple {7734#false} ~cond := #in~cond; {7734#false} is VALID [2018-11-23 11:59:00,931 INFO L273 TraceCheckUtils]: 56: Hoare triple {7734#false} assume 0 == ~cond; {7734#false} is VALID [2018-11-23 11:59:00,931 INFO L273 TraceCheckUtils]: 57: Hoare triple {7734#false} assume !false; {7734#false} is VALID [2018-11-23 11:59:00,935 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:59:00,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:00,935 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:59:00,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:00,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:01,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:01,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:01,367 INFO L256 TraceCheckUtils]: 0: Hoare triple {7733#true} call ULTIMATE.init(); {7733#true} is VALID [2018-11-23 11:59:01,367 INFO L273 TraceCheckUtils]: 1: Hoare triple {7733#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7733#true} is VALID [2018-11-23 11:59:01,367 INFO L273 TraceCheckUtils]: 2: Hoare triple {7733#true} assume true; {7733#true} is VALID [2018-11-23 11:59:01,367 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7733#true} {7733#true} #130#return; {7733#true} is VALID [2018-11-23 11:59:01,367 INFO L256 TraceCheckUtils]: 4: Hoare triple {7733#true} call #t~ret15 := main(); {7733#true} is VALID [2018-11-23 11:59:01,368 INFO L273 TraceCheckUtils]: 5: Hoare triple {7733#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {7766#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:01,368 INFO L273 TraceCheckUtils]: 6: Hoare triple {7766#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {7770#(<= main_~k~0 1)} is VALID [2018-11-23 11:59:01,369 INFO L273 TraceCheckUtils]: 7: Hoare triple {7770#(<= 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); {7770#(<= main_~k~0 1)} is VALID [2018-11-23 11:59:01,369 INFO L273 TraceCheckUtils]: 8: Hoare triple {7770#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {7770#(<= main_~k~0 1)} is VALID [2018-11-23 11:59:01,369 INFO L273 TraceCheckUtils]: 9: Hoare triple {7770#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {7780#(<= main_~k~0 2)} is VALID [2018-11-23 11:59:01,370 INFO L273 TraceCheckUtils]: 10: Hoare triple {7780#(<= 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); {7780#(<= main_~k~0 2)} is VALID [2018-11-23 11:59:01,370 INFO L273 TraceCheckUtils]: 11: Hoare triple {7780#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {7780#(<= main_~k~0 2)} is VALID [2018-11-23 11:59:01,370 INFO L273 TraceCheckUtils]: 12: Hoare triple {7780#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {7790#(<= main_~k~0 3)} is VALID [2018-11-23 11:59:01,371 INFO L273 TraceCheckUtils]: 13: Hoare triple {7790#(<= 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); {7790#(<= main_~k~0 3)} is VALID [2018-11-23 11:59:01,371 INFO L273 TraceCheckUtils]: 14: Hoare triple {7790#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {7790#(<= main_~k~0 3)} is VALID [2018-11-23 11:59:01,372 INFO L273 TraceCheckUtils]: 15: Hoare triple {7790#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {7800#(<= main_~k~0 4)} is VALID [2018-11-23 11:59:01,373 INFO L273 TraceCheckUtils]: 16: Hoare triple {7800#(<= 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); {7800#(<= main_~k~0 4)} is VALID [2018-11-23 11:59:01,373 INFO L273 TraceCheckUtils]: 17: Hoare triple {7800#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {7800#(<= main_~k~0 4)} is VALID [2018-11-23 11:59:01,374 INFO L273 TraceCheckUtils]: 18: Hoare triple {7800#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {7810#(<= main_~k~0 5)} is VALID [2018-11-23 11:59:01,374 INFO L273 TraceCheckUtils]: 19: Hoare triple {7810#(<= 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); {7810#(<= main_~k~0 5)} is VALID [2018-11-23 11:59:01,375 INFO L273 TraceCheckUtils]: 20: Hoare triple {7810#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {7810#(<= main_~k~0 5)} is VALID [2018-11-23 11:59:01,376 INFO L273 TraceCheckUtils]: 21: Hoare triple {7810#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {7820#(<= main_~k~0 6)} is VALID [2018-11-23 11:59:01,376 INFO L273 TraceCheckUtils]: 22: Hoare triple {7820#(<= 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); {7820#(<= main_~k~0 6)} is VALID [2018-11-23 11:59:01,377 INFO L273 TraceCheckUtils]: 23: Hoare triple {7820#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {7820#(<= main_~k~0 6)} is VALID [2018-11-23 11:59:01,377 INFO L273 TraceCheckUtils]: 24: Hoare triple {7820#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {7830#(<= main_~k~0 7)} is VALID [2018-11-23 11:59:01,378 INFO L273 TraceCheckUtils]: 25: Hoare triple {7830#(<= 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); {7830#(<= main_~k~0 7)} is VALID [2018-11-23 11:59:01,378 INFO L273 TraceCheckUtils]: 26: Hoare triple {7830#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {7830#(<= main_~k~0 7)} is VALID [2018-11-23 11:59:01,379 INFO L273 TraceCheckUtils]: 27: Hoare triple {7830#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {7840#(<= main_~k~0 8)} is VALID [2018-11-23 11:59:01,380 INFO L273 TraceCheckUtils]: 28: Hoare triple {7840#(<= 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); {7840#(<= main_~k~0 8)} is VALID [2018-11-23 11:59:01,380 INFO L273 TraceCheckUtils]: 29: Hoare triple {7840#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {7840#(<= main_~k~0 8)} is VALID [2018-11-23 11:59:01,381 INFO L273 TraceCheckUtils]: 30: Hoare triple {7840#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {7850#(<= main_~k~0 9)} is VALID [2018-11-23 11:59:01,382 INFO L273 TraceCheckUtils]: 31: Hoare triple {7850#(<= 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); {7850#(<= main_~k~0 9)} is VALID [2018-11-23 11:59:01,382 INFO L273 TraceCheckUtils]: 32: Hoare triple {7850#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {7850#(<= main_~k~0 9)} is VALID [2018-11-23 11:59:01,383 INFO L273 TraceCheckUtils]: 33: Hoare triple {7850#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {7860#(<= main_~k~0 10)} is VALID [2018-11-23 11:59:01,383 INFO L273 TraceCheckUtils]: 34: Hoare triple {7860#(<= 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); {7860#(<= main_~k~0 10)} is VALID [2018-11-23 11:59:01,384 INFO L273 TraceCheckUtils]: 35: Hoare triple {7860#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {7860#(<= main_~k~0 10)} is VALID [2018-11-23 11:59:01,385 INFO L273 TraceCheckUtils]: 36: Hoare triple {7860#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {7870#(<= main_~k~0 11)} is VALID [2018-11-23 11:59:01,385 INFO L273 TraceCheckUtils]: 37: Hoare triple {7870#(<= 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); {7870#(<= main_~k~0 11)} is VALID [2018-11-23 11:59:01,386 INFO L273 TraceCheckUtils]: 38: Hoare triple {7870#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {7870#(<= main_~k~0 11)} is VALID [2018-11-23 11:59:01,386 INFO L273 TraceCheckUtils]: 39: Hoare triple {7870#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {7880#(<= main_~k~0 12)} is VALID [2018-11-23 11:59:01,387 INFO L273 TraceCheckUtils]: 40: Hoare triple {7880#(<= main_~k~0 12)} assume !(~k~0 < 100000); {7734#false} is VALID [2018-11-23 11:59:01,387 INFO L273 TraceCheckUtils]: 41: Hoare triple {7734#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); {7734#false} is VALID [2018-11-23 11:59:01,388 INFO L273 TraceCheckUtils]: 42: Hoare triple {7734#false} ~x~0 := 0; {7734#false} is VALID [2018-11-23 11:59:01,388 INFO L273 TraceCheckUtils]: 43: Hoare triple {7734#false} assume !(~x~0 < ~i~0); {7734#false} is VALID [2018-11-23 11:59:01,388 INFO L273 TraceCheckUtils]: 44: Hoare triple {7734#false} ~x~0 := ~i~0; {7734#false} is VALID [2018-11-23 11:59:01,388 INFO L273 TraceCheckUtils]: 45: Hoare triple {7734#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); {7734#false} is VALID [2018-11-23 11:59:01,388 INFO L256 TraceCheckUtils]: 46: Hoare triple {7734#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {7734#false} is VALID [2018-11-23 11:59:01,389 INFO L273 TraceCheckUtils]: 47: Hoare triple {7734#false} ~cond := #in~cond; {7734#false} is VALID [2018-11-23 11:59:01,389 INFO L273 TraceCheckUtils]: 48: Hoare triple {7734#false} assume !(0 == ~cond); {7734#false} is VALID [2018-11-23 11:59:01,389 INFO L273 TraceCheckUtils]: 49: Hoare triple {7734#false} assume true; {7734#false} is VALID [2018-11-23 11:59:01,389 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {7734#false} {7734#false} #136#return; {7734#false} is VALID [2018-11-23 11:59:01,389 INFO L273 TraceCheckUtils]: 51: Hoare triple {7734#false} havoc #t~mem9;havoc #t~mem10; {7734#false} is VALID [2018-11-23 11:59:01,390 INFO L273 TraceCheckUtils]: 52: Hoare triple {7734#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {7734#false} is VALID [2018-11-23 11:59:01,390 INFO L273 TraceCheckUtils]: 53: Hoare triple {7734#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); {7734#false} is VALID [2018-11-23 11:59:01,390 INFO L256 TraceCheckUtils]: 54: Hoare triple {7734#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {7734#false} is VALID [2018-11-23 11:59:01,390 INFO L273 TraceCheckUtils]: 55: Hoare triple {7734#false} ~cond := #in~cond; {7734#false} is VALID [2018-11-23 11:59:01,390 INFO L273 TraceCheckUtils]: 56: Hoare triple {7734#false} assume 0 == ~cond; {7734#false} is VALID [2018-11-23 11:59:01,391 INFO L273 TraceCheckUtils]: 57: Hoare triple {7734#false} assume !false; {7734#false} is VALID [2018-11-23 11:59:01,394 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:59:01,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:01,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2018-11-23 11:59:01,416 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 58 [2018-11-23 11:59:01,416 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:01,416 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-23 11:59:01,509 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:59:01,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 11:59:01,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 11:59:01,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=468, Unknown=0, NotChecked=0, Total=756 [2018-11-23 11:59:01,511 INFO L87 Difference]: Start difference. First operand 120 states and 157 transitions. Second operand 28 states. [2018-11-23 11:59:02,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:02,953 INFO L93 Difference]: Finished difference Result 183 states and 243 transitions. [2018-11-23 11:59:02,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 11:59:02,953 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 58 [2018-11-23 11:59:02,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:02,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:59:02,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 155 transitions. [2018-11-23 11:59:02,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:59:02,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 155 transitions. [2018-11-23 11:59:02,958 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 155 transitions. [2018-11-23 11:59:03,972 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:59:03,975 INFO L225 Difference]: With dead ends: 183 [2018-11-23 11:59:03,975 INFO L226 Difference]: Without dead ends: 136 [2018-11-23 11:59:03,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=288, Invalid=468, Unknown=0, NotChecked=0, Total=756 [2018-11-23 11:59:03,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-11-23 11:59:04,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 126. [2018-11-23 11:59:04,050 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:04,050 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states. Second operand 126 states. [2018-11-23 11:59:04,050 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 126 states. [2018-11-23 11:59:04,051 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 126 states. [2018-11-23 11:59:04,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:04,056 INFO L93 Difference]: Finished difference Result 136 states and 180 transitions. [2018-11-23 11:59:04,056 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 180 transitions. [2018-11-23 11:59:04,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:04,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:04,057 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 136 states. [2018-11-23 11:59:04,057 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 136 states. [2018-11-23 11:59:04,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:04,060 INFO L93 Difference]: Finished difference Result 136 states and 180 transitions. [2018-11-23 11:59:04,060 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 180 transitions. [2018-11-23 11:59:04,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:04,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:04,061 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:04,061 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:04,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-23 11:59:04,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 165 transitions. [2018-11-23 11:59:04,063 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 165 transitions. Word has length 58 [2018-11-23 11:59:04,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:04,064 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 165 transitions. [2018-11-23 11:59:04,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-23 11:59:04,064 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 165 transitions. [2018-11-23 11:59:04,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 11:59:04,065 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:04,065 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:59:04,065 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:04,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:04,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1436888908, now seen corresponding path program 8 times [2018-11-23 11:59:04,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:04,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:04,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:04,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:04,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:04,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:04,435 INFO L256 TraceCheckUtils]: 0: Hoare triple {8629#true} call ULTIMATE.init(); {8629#true} is VALID [2018-11-23 11:59:04,435 INFO L273 TraceCheckUtils]: 1: Hoare triple {8629#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8629#true} is VALID [2018-11-23 11:59:04,435 INFO L273 TraceCheckUtils]: 2: Hoare triple {8629#true} assume true; {8629#true} is VALID [2018-11-23 11:59:04,436 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8629#true} {8629#true} #130#return; {8629#true} is VALID [2018-11-23 11:59:04,436 INFO L256 TraceCheckUtils]: 4: Hoare triple {8629#true} call #t~ret15 := main(); {8629#true} is VALID [2018-11-23 11:59:04,436 INFO L273 TraceCheckUtils]: 5: Hoare triple {8629#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {8631#(= main_~i~0 0)} is VALID [2018-11-23 11:59:04,437 INFO L273 TraceCheckUtils]: 6: Hoare triple {8631#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {8632#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:04,437 INFO L273 TraceCheckUtils]: 7: Hoare triple {8632#(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); {8632#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:04,438 INFO L273 TraceCheckUtils]: 8: Hoare triple {8632#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {8632#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:04,438 INFO L273 TraceCheckUtils]: 9: Hoare triple {8632#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {8633#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:04,439 INFO L273 TraceCheckUtils]: 10: Hoare triple {8633#(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); {8633#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:04,440 INFO L273 TraceCheckUtils]: 11: Hoare triple {8633#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {8633#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:04,441 INFO L273 TraceCheckUtils]: 12: Hoare triple {8633#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {8634#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:04,442 INFO L273 TraceCheckUtils]: 13: Hoare triple {8634#(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); {8634#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:04,443 INFO L273 TraceCheckUtils]: 14: Hoare triple {8634#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {8634#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:04,443 INFO L273 TraceCheckUtils]: 15: Hoare triple {8634#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {8635#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:04,444 INFO L273 TraceCheckUtils]: 16: Hoare triple {8635#(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); {8635#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:04,445 INFO L273 TraceCheckUtils]: 17: Hoare triple {8635#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {8635#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:04,446 INFO L273 TraceCheckUtils]: 18: Hoare triple {8635#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {8636#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:04,447 INFO L273 TraceCheckUtils]: 19: Hoare triple {8636#(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); {8636#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:04,448 INFO L273 TraceCheckUtils]: 20: Hoare triple {8636#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {8636#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:04,449 INFO L273 TraceCheckUtils]: 21: Hoare triple {8636#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {8637#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:04,450 INFO L273 TraceCheckUtils]: 22: Hoare triple {8637#(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); {8637#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:04,451 INFO L273 TraceCheckUtils]: 23: Hoare triple {8637#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {8637#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:04,451 INFO L273 TraceCheckUtils]: 24: Hoare triple {8637#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {8638#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:04,452 INFO L273 TraceCheckUtils]: 25: Hoare triple {8638#(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); {8638#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:04,453 INFO L273 TraceCheckUtils]: 26: Hoare triple {8638#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {8638#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:04,454 INFO L273 TraceCheckUtils]: 27: Hoare triple {8638#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {8639#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:04,455 INFO L273 TraceCheckUtils]: 28: Hoare triple {8639#(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); {8639#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:04,456 INFO L273 TraceCheckUtils]: 29: Hoare triple {8639#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {8639#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:04,457 INFO L273 TraceCheckUtils]: 30: Hoare triple {8639#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {8640#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:04,457 INFO L273 TraceCheckUtils]: 31: Hoare triple {8640#(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); {8640#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:04,458 INFO L273 TraceCheckUtils]: 32: Hoare triple {8640#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {8640#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:04,459 INFO L273 TraceCheckUtils]: 33: Hoare triple {8640#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {8641#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:04,460 INFO L273 TraceCheckUtils]: 34: Hoare triple {8641#(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); {8641#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:04,461 INFO L273 TraceCheckUtils]: 35: Hoare triple {8641#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {8641#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:04,462 INFO L273 TraceCheckUtils]: 36: Hoare triple {8641#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {8642#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:04,463 INFO L273 TraceCheckUtils]: 37: Hoare triple {8642#(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); {8642#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:04,463 INFO L273 TraceCheckUtils]: 38: Hoare triple {8642#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {8642#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:04,464 INFO L273 TraceCheckUtils]: 39: Hoare triple {8642#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {8643#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:04,465 INFO L273 TraceCheckUtils]: 40: Hoare triple {8643#(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); {8643#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:04,466 INFO L273 TraceCheckUtils]: 41: Hoare triple {8643#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {8643#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:04,467 INFO L273 TraceCheckUtils]: 42: Hoare triple {8643#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {8644#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:04,468 INFO L273 TraceCheckUtils]: 43: Hoare triple {8644#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume !(~k~0 < 100000); {8630#false} is VALID [2018-11-23 11:59:04,468 INFO L273 TraceCheckUtils]: 44: Hoare triple {8630#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); {8630#false} is VALID [2018-11-23 11:59:04,468 INFO L273 TraceCheckUtils]: 45: Hoare triple {8630#false} ~x~0 := 0; {8630#false} is VALID [2018-11-23 11:59:04,468 INFO L273 TraceCheckUtils]: 46: Hoare triple {8630#false} assume !(~x~0 < ~i~0); {8630#false} is VALID [2018-11-23 11:59:04,468 INFO L273 TraceCheckUtils]: 47: Hoare triple {8630#false} ~x~0 := ~i~0; {8630#false} is VALID [2018-11-23 11:59:04,469 INFO L273 TraceCheckUtils]: 48: Hoare triple {8630#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); {8630#false} is VALID [2018-11-23 11:59:04,469 INFO L256 TraceCheckUtils]: 49: Hoare triple {8630#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {8629#true} is VALID [2018-11-23 11:59:04,469 INFO L273 TraceCheckUtils]: 50: Hoare triple {8629#true} ~cond := #in~cond; {8629#true} is VALID [2018-11-23 11:59:04,470 INFO L273 TraceCheckUtils]: 51: Hoare triple {8629#true} assume !(0 == ~cond); {8629#true} is VALID [2018-11-23 11:59:04,470 INFO L273 TraceCheckUtils]: 52: Hoare triple {8629#true} assume true; {8629#true} is VALID [2018-11-23 11:59:04,470 INFO L268 TraceCheckUtils]: 53: Hoare quadruple {8629#true} {8630#false} #136#return; {8630#false} is VALID [2018-11-23 11:59:04,470 INFO L273 TraceCheckUtils]: 54: Hoare triple {8630#false} havoc #t~mem9;havoc #t~mem10; {8630#false} is VALID [2018-11-23 11:59:04,470 INFO L273 TraceCheckUtils]: 55: Hoare triple {8630#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {8630#false} is VALID [2018-11-23 11:59:04,470 INFO L273 TraceCheckUtils]: 56: Hoare triple {8630#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); {8630#false} is VALID [2018-11-23 11:59:04,470 INFO L256 TraceCheckUtils]: 57: Hoare triple {8630#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {8630#false} is VALID [2018-11-23 11:59:04,471 INFO L273 TraceCheckUtils]: 58: Hoare triple {8630#false} ~cond := #in~cond; {8630#false} is VALID [2018-11-23 11:59:04,471 INFO L273 TraceCheckUtils]: 59: Hoare triple {8630#false} assume 0 == ~cond; {8630#false} is VALID [2018-11-23 11:59:04,471 INFO L273 TraceCheckUtils]: 60: Hoare triple {8630#false} assume !false; {8630#false} is VALID [2018-11-23 11:59:04,475 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:59:04,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:04,475 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:59:04,484 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:59:04,516 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:59:04,516 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:04,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:04,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:04,834 INFO L256 TraceCheckUtils]: 0: Hoare triple {8629#true} call ULTIMATE.init(); {8629#true} is VALID [2018-11-23 11:59:04,835 INFO L273 TraceCheckUtils]: 1: Hoare triple {8629#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8629#true} is VALID [2018-11-23 11:59:04,835 INFO L273 TraceCheckUtils]: 2: Hoare triple {8629#true} assume true; {8629#true} is VALID [2018-11-23 11:59:04,835 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8629#true} {8629#true} #130#return; {8629#true} is VALID [2018-11-23 11:59:04,835 INFO L256 TraceCheckUtils]: 4: Hoare triple {8629#true} call #t~ret15 := main(); {8629#true} is VALID [2018-11-23 11:59:04,836 INFO L273 TraceCheckUtils]: 5: Hoare triple {8629#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {8663#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:04,836 INFO L273 TraceCheckUtils]: 6: Hoare triple {8663#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {8667#(<= main_~k~0 1)} is VALID [2018-11-23 11:59:04,837 INFO L273 TraceCheckUtils]: 7: Hoare triple {8667#(<= 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); {8667#(<= main_~k~0 1)} is VALID [2018-11-23 11:59:04,837 INFO L273 TraceCheckUtils]: 8: Hoare triple {8667#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {8667#(<= main_~k~0 1)} is VALID [2018-11-23 11:59:04,837 INFO L273 TraceCheckUtils]: 9: Hoare triple {8667#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {8677#(<= main_~k~0 2)} is VALID [2018-11-23 11:59:04,838 INFO L273 TraceCheckUtils]: 10: Hoare triple {8677#(<= 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); {8677#(<= main_~k~0 2)} is VALID [2018-11-23 11:59:04,838 INFO L273 TraceCheckUtils]: 11: Hoare triple {8677#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {8677#(<= main_~k~0 2)} is VALID [2018-11-23 11:59:04,838 INFO L273 TraceCheckUtils]: 12: Hoare triple {8677#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {8687#(<= main_~k~0 3)} is VALID [2018-11-23 11:59:04,839 INFO L273 TraceCheckUtils]: 13: Hoare triple {8687#(<= 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); {8687#(<= main_~k~0 3)} is VALID [2018-11-23 11:59:04,839 INFO L273 TraceCheckUtils]: 14: Hoare triple {8687#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {8687#(<= main_~k~0 3)} is VALID [2018-11-23 11:59:04,840 INFO L273 TraceCheckUtils]: 15: Hoare triple {8687#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {8697#(<= main_~k~0 4)} is VALID [2018-11-23 11:59:04,841 INFO L273 TraceCheckUtils]: 16: Hoare triple {8697#(<= 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); {8697#(<= main_~k~0 4)} is VALID [2018-11-23 11:59:04,841 INFO L273 TraceCheckUtils]: 17: Hoare triple {8697#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {8697#(<= main_~k~0 4)} is VALID [2018-11-23 11:59:04,842 INFO L273 TraceCheckUtils]: 18: Hoare triple {8697#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {8707#(<= main_~k~0 5)} is VALID [2018-11-23 11:59:04,842 INFO L273 TraceCheckUtils]: 19: Hoare triple {8707#(<= 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); {8707#(<= main_~k~0 5)} is VALID [2018-11-23 11:59:04,843 INFO L273 TraceCheckUtils]: 20: Hoare triple {8707#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {8707#(<= main_~k~0 5)} is VALID [2018-11-23 11:59:04,844 INFO L273 TraceCheckUtils]: 21: Hoare triple {8707#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {8717#(<= main_~k~0 6)} is VALID [2018-11-23 11:59:04,844 INFO L273 TraceCheckUtils]: 22: Hoare triple {8717#(<= 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); {8717#(<= main_~k~0 6)} is VALID [2018-11-23 11:59:04,845 INFO L273 TraceCheckUtils]: 23: Hoare triple {8717#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {8717#(<= main_~k~0 6)} is VALID [2018-11-23 11:59:04,846 INFO L273 TraceCheckUtils]: 24: Hoare triple {8717#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {8727#(<= main_~k~0 7)} is VALID [2018-11-23 11:59:04,846 INFO L273 TraceCheckUtils]: 25: Hoare triple {8727#(<= 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); {8727#(<= main_~k~0 7)} is VALID [2018-11-23 11:59:04,847 INFO L273 TraceCheckUtils]: 26: Hoare triple {8727#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {8727#(<= main_~k~0 7)} is VALID [2018-11-23 11:59:04,847 INFO L273 TraceCheckUtils]: 27: Hoare triple {8727#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {8737#(<= main_~k~0 8)} is VALID [2018-11-23 11:59:04,848 INFO L273 TraceCheckUtils]: 28: Hoare triple {8737#(<= 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); {8737#(<= main_~k~0 8)} is VALID [2018-11-23 11:59:04,848 INFO L273 TraceCheckUtils]: 29: Hoare triple {8737#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {8737#(<= main_~k~0 8)} is VALID [2018-11-23 11:59:04,849 INFO L273 TraceCheckUtils]: 30: Hoare triple {8737#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {8747#(<= main_~k~0 9)} is VALID [2018-11-23 11:59:04,850 INFO L273 TraceCheckUtils]: 31: Hoare triple {8747#(<= 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); {8747#(<= main_~k~0 9)} is VALID [2018-11-23 11:59:04,850 INFO L273 TraceCheckUtils]: 32: Hoare triple {8747#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {8747#(<= main_~k~0 9)} is VALID [2018-11-23 11:59:04,851 INFO L273 TraceCheckUtils]: 33: Hoare triple {8747#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {8757#(<= main_~k~0 10)} is VALID [2018-11-23 11:59:04,851 INFO L273 TraceCheckUtils]: 34: Hoare triple {8757#(<= 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); {8757#(<= main_~k~0 10)} is VALID [2018-11-23 11:59:04,852 INFO L273 TraceCheckUtils]: 35: Hoare triple {8757#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {8757#(<= main_~k~0 10)} is VALID [2018-11-23 11:59:04,852 INFO L273 TraceCheckUtils]: 36: Hoare triple {8757#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {8767#(<= main_~k~0 11)} is VALID [2018-11-23 11:59:04,853 INFO L273 TraceCheckUtils]: 37: Hoare triple {8767#(<= 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); {8767#(<= main_~k~0 11)} is VALID [2018-11-23 11:59:04,854 INFO L273 TraceCheckUtils]: 38: Hoare triple {8767#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {8767#(<= main_~k~0 11)} is VALID [2018-11-23 11:59:04,854 INFO L273 TraceCheckUtils]: 39: Hoare triple {8767#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {8777#(<= main_~k~0 12)} is VALID [2018-11-23 11:59:04,855 INFO L273 TraceCheckUtils]: 40: Hoare triple {8777#(<= 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); {8777#(<= main_~k~0 12)} is VALID [2018-11-23 11:59:04,855 INFO L273 TraceCheckUtils]: 41: Hoare triple {8777#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {8777#(<= main_~k~0 12)} is VALID [2018-11-23 11:59:04,856 INFO L273 TraceCheckUtils]: 42: Hoare triple {8777#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {8787#(<= main_~k~0 13)} is VALID [2018-11-23 11:59:04,857 INFO L273 TraceCheckUtils]: 43: Hoare triple {8787#(<= main_~k~0 13)} assume !(~k~0 < 100000); {8630#false} is VALID [2018-11-23 11:59:04,857 INFO L273 TraceCheckUtils]: 44: Hoare triple {8630#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); {8630#false} is VALID [2018-11-23 11:59:04,857 INFO L273 TraceCheckUtils]: 45: Hoare triple {8630#false} ~x~0 := 0; {8630#false} is VALID [2018-11-23 11:59:04,857 INFO L273 TraceCheckUtils]: 46: Hoare triple {8630#false} assume !(~x~0 < ~i~0); {8630#false} is VALID [2018-11-23 11:59:04,858 INFO L273 TraceCheckUtils]: 47: Hoare triple {8630#false} ~x~0 := ~i~0; {8630#false} is VALID [2018-11-23 11:59:04,858 INFO L273 TraceCheckUtils]: 48: Hoare triple {8630#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); {8630#false} is VALID [2018-11-23 11:59:04,858 INFO L256 TraceCheckUtils]: 49: Hoare triple {8630#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {8630#false} is VALID [2018-11-23 11:59:04,858 INFO L273 TraceCheckUtils]: 50: Hoare triple {8630#false} ~cond := #in~cond; {8630#false} is VALID [2018-11-23 11:59:04,858 INFO L273 TraceCheckUtils]: 51: Hoare triple {8630#false} assume !(0 == ~cond); {8630#false} is VALID [2018-11-23 11:59:04,858 INFO L273 TraceCheckUtils]: 52: Hoare triple {8630#false} assume true; {8630#false} is VALID [2018-11-23 11:59:04,859 INFO L268 TraceCheckUtils]: 53: Hoare quadruple {8630#false} {8630#false} #136#return; {8630#false} is VALID [2018-11-23 11:59:04,859 INFO L273 TraceCheckUtils]: 54: Hoare triple {8630#false} havoc #t~mem9;havoc #t~mem10; {8630#false} is VALID [2018-11-23 11:59:04,859 INFO L273 TraceCheckUtils]: 55: Hoare triple {8630#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {8630#false} is VALID [2018-11-23 11:59:04,859 INFO L273 TraceCheckUtils]: 56: Hoare triple {8630#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); {8630#false} is VALID [2018-11-23 11:59:04,859 INFO L256 TraceCheckUtils]: 57: Hoare triple {8630#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {8630#false} is VALID [2018-11-23 11:59:04,860 INFO L273 TraceCheckUtils]: 58: Hoare triple {8630#false} ~cond := #in~cond; {8630#false} is VALID [2018-11-23 11:59:04,860 INFO L273 TraceCheckUtils]: 59: Hoare triple {8630#false} assume 0 == ~cond; {8630#false} is VALID [2018-11-23 11:59:04,860 INFO L273 TraceCheckUtils]: 60: Hoare triple {8630#false} assume !false; {8630#false} is VALID [2018-11-23 11:59:04,863 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:59:04,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:04,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2018-11-23 11:59:04,882 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 61 [2018-11-23 11:59:04,883 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:04,883 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 11:59:04,987 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:59:04,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 11:59:04,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 11:59:04,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=539, Unknown=0, NotChecked=0, Total=870 [2018-11-23 11:59:04,989 INFO L87 Difference]: Start difference. First operand 126 states and 165 transitions. Second operand 30 states. [2018-11-23 11:59:05,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:05,887 INFO L93 Difference]: Finished difference Result 189 states and 251 transitions. [2018-11-23 11:59:05,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 11:59:05,888 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 61 [2018-11-23 11:59:05,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:05,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:59:05,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 159 transitions. [2018-11-23 11:59:05,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:59:05,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 159 transitions. [2018-11-23 11:59:05,891 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 159 transitions. [2018-11-23 11:59:06,204 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:59:06,208 INFO L225 Difference]: With dead ends: 189 [2018-11-23 11:59:06,208 INFO L226 Difference]: Without dead ends: 142 [2018-11-23 11:59:06,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=331, Invalid=539, Unknown=0, NotChecked=0, Total=870 [2018-11-23 11:59:06,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-11-23 11:59:06,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 132. [2018-11-23 11:59:06,308 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:06,308 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand 132 states. [2018-11-23 11:59:06,308 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 132 states. [2018-11-23 11:59:06,308 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 132 states. [2018-11-23 11:59:06,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:06,312 INFO L93 Difference]: Finished difference Result 142 states and 188 transitions. [2018-11-23 11:59:06,312 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 188 transitions. [2018-11-23 11:59:06,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:06,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:06,313 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand 142 states. [2018-11-23 11:59:06,314 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 142 states. [2018-11-23 11:59:06,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:06,317 INFO L93 Difference]: Finished difference Result 142 states and 188 transitions. [2018-11-23 11:59:06,317 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 188 transitions. [2018-11-23 11:59:06,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:06,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:06,318 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:06,318 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:06,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-23 11:59:06,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 173 transitions. [2018-11-23 11:59:06,321 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 173 transitions. Word has length 61 [2018-11-23 11:59:06,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:06,321 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 173 transitions. [2018-11-23 11:59:06,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 11:59:06,322 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 173 transitions. [2018-11-23 11:59:06,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-23 11:59:06,322 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:06,323 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:59:06,323 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:06,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:06,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1549621681, now seen corresponding path program 9 times [2018-11-23 11:59:06,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:06,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:06,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:06,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:06,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:06,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:06,817 INFO L256 TraceCheckUtils]: 0: Hoare triple {9564#true} call ULTIMATE.init(); {9564#true} is VALID [2018-11-23 11:59:06,817 INFO L273 TraceCheckUtils]: 1: Hoare triple {9564#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9564#true} is VALID [2018-11-23 11:59:06,817 INFO L273 TraceCheckUtils]: 2: Hoare triple {9564#true} assume true; {9564#true} is VALID [2018-11-23 11:59:06,817 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9564#true} {9564#true} #130#return; {9564#true} is VALID [2018-11-23 11:59:06,818 INFO L256 TraceCheckUtils]: 4: Hoare triple {9564#true} call #t~ret15 := main(); {9564#true} is VALID [2018-11-23 11:59:06,818 INFO L273 TraceCheckUtils]: 5: Hoare triple {9564#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {9566#(= main_~i~0 0)} is VALID [2018-11-23 11:59:06,818 INFO L273 TraceCheckUtils]: 6: Hoare triple {9566#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {9567#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:06,819 INFO L273 TraceCheckUtils]: 7: Hoare triple {9567#(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); {9567#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:06,820 INFO L273 TraceCheckUtils]: 8: Hoare triple {9567#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {9567#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:06,821 INFO L273 TraceCheckUtils]: 9: Hoare triple {9567#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {9568#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:06,821 INFO L273 TraceCheckUtils]: 10: Hoare triple {9568#(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); {9568#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:06,822 INFO L273 TraceCheckUtils]: 11: Hoare triple {9568#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {9568#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:06,823 INFO L273 TraceCheckUtils]: 12: Hoare triple {9568#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {9569#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:06,824 INFO L273 TraceCheckUtils]: 13: Hoare triple {9569#(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); {9569#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:06,824 INFO L273 TraceCheckUtils]: 14: Hoare triple {9569#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {9569#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:06,825 INFO L273 TraceCheckUtils]: 15: Hoare triple {9569#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {9570#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:06,826 INFO L273 TraceCheckUtils]: 16: Hoare triple {9570#(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); {9570#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:06,827 INFO L273 TraceCheckUtils]: 17: Hoare triple {9570#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {9570#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:06,828 INFO L273 TraceCheckUtils]: 18: Hoare triple {9570#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {9571#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:06,829 INFO L273 TraceCheckUtils]: 19: Hoare triple {9571#(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); {9571#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:06,830 INFO L273 TraceCheckUtils]: 20: Hoare triple {9571#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {9571#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:06,831 INFO L273 TraceCheckUtils]: 21: Hoare triple {9571#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {9572#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:06,831 INFO L273 TraceCheckUtils]: 22: Hoare triple {9572#(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); {9572#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:06,832 INFO L273 TraceCheckUtils]: 23: Hoare triple {9572#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {9572#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:06,833 INFO L273 TraceCheckUtils]: 24: Hoare triple {9572#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {9573#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:06,834 INFO L273 TraceCheckUtils]: 25: Hoare triple {9573#(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); {9573#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:06,835 INFO L273 TraceCheckUtils]: 26: Hoare triple {9573#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {9573#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:06,835 INFO L273 TraceCheckUtils]: 27: Hoare triple {9573#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {9574#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:06,836 INFO L273 TraceCheckUtils]: 28: Hoare triple {9574#(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); {9574#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:06,837 INFO L273 TraceCheckUtils]: 29: Hoare triple {9574#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {9574#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:06,838 INFO L273 TraceCheckUtils]: 30: Hoare triple {9574#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {9575#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:06,839 INFO L273 TraceCheckUtils]: 31: Hoare triple {9575#(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); {9575#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:06,840 INFO L273 TraceCheckUtils]: 32: Hoare triple {9575#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {9575#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:06,840 INFO L273 TraceCheckUtils]: 33: Hoare triple {9575#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {9576#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:06,841 INFO L273 TraceCheckUtils]: 34: Hoare triple {9576#(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); {9576#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:06,842 INFO L273 TraceCheckUtils]: 35: Hoare triple {9576#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {9576#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:06,843 INFO L273 TraceCheckUtils]: 36: Hoare triple {9576#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {9577#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:06,844 INFO L273 TraceCheckUtils]: 37: Hoare triple {9577#(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); {9577#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:06,845 INFO L273 TraceCheckUtils]: 38: Hoare triple {9577#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {9577#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:06,845 INFO L273 TraceCheckUtils]: 39: Hoare triple {9577#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {9578#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:06,846 INFO L273 TraceCheckUtils]: 40: Hoare triple {9578#(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); {9578#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:06,847 INFO L273 TraceCheckUtils]: 41: Hoare triple {9578#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {9578#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:06,848 INFO L273 TraceCheckUtils]: 42: Hoare triple {9578#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {9579#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:06,848 INFO L273 TraceCheckUtils]: 43: Hoare triple {9579#(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); {9579#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:06,849 INFO L273 TraceCheckUtils]: 44: Hoare triple {9579#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {9579#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:06,850 INFO L273 TraceCheckUtils]: 45: Hoare triple {9579#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {9580#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:06,851 INFO L273 TraceCheckUtils]: 46: Hoare triple {9580#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} assume !(~k~0 < 100000); {9565#false} is VALID [2018-11-23 11:59:06,851 INFO L273 TraceCheckUtils]: 47: Hoare triple {9565#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); {9565#false} is VALID [2018-11-23 11:59:06,851 INFO L273 TraceCheckUtils]: 48: Hoare triple {9565#false} ~x~0 := 0; {9565#false} is VALID [2018-11-23 11:59:06,851 INFO L273 TraceCheckUtils]: 49: Hoare triple {9565#false} assume !(~x~0 < ~i~0); {9565#false} is VALID [2018-11-23 11:59:06,851 INFO L273 TraceCheckUtils]: 50: Hoare triple {9565#false} ~x~0 := ~i~0; {9565#false} is VALID [2018-11-23 11:59:06,852 INFO L273 TraceCheckUtils]: 51: Hoare triple {9565#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); {9565#false} is VALID [2018-11-23 11:59:06,852 INFO L256 TraceCheckUtils]: 52: Hoare triple {9565#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {9564#true} is VALID [2018-11-23 11:59:06,852 INFO L273 TraceCheckUtils]: 53: Hoare triple {9564#true} ~cond := #in~cond; {9564#true} is VALID [2018-11-23 11:59:06,852 INFO L273 TraceCheckUtils]: 54: Hoare triple {9564#true} assume !(0 == ~cond); {9564#true} is VALID [2018-11-23 11:59:06,852 INFO L273 TraceCheckUtils]: 55: Hoare triple {9564#true} assume true; {9564#true} is VALID [2018-11-23 11:59:06,853 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {9564#true} {9565#false} #136#return; {9565#false} is VALID [2018-11-23 11:59:06,853 INFO L273 TraceCheckUtils]: 57: Hoare triple {9565#false} havoc #t~mem9;havoc #t~mem10; {9565#false} is VALID [2018-11-23 11:59:06,853 INFO L273 TraceCheckUtils]: 58: Hoare triple {9565#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {9565#false} is VALID [2018-11-23 11:59:06,853 INFO L273 TraceCheckUtils]: 59: Hoare triple {9565#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); {9565#false} is VALID [2018-11-23 11:59:06,853 INFO L256 TraceCheckUtils]: 60: Hoare triple {9565#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {9565#false} is VALID [2018-11-23 11:59:06,854 INFO L273 TraceCheckUtils]: 61: Hoare triple {9565#false} ~cond := #in~cond; {9565#false} is VALID [2018-11-23 11:59:06,854 INFO L273 TraceCheckUtils]: 62: Hoare triple {9565#false} assume 0 == ~cond; {9565#false} is VALID [2018-11-23 11:59:06,854 INFO L273 TraceCheckUtils]: 63: Hoare triple {9565#false} assume !false; {9565#false} is VALID [2018-11-23 11:59:06,859 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:59:06,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:06,860 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:59:06,868 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:59:06,920 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-11-23 11:59:06,920 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:06,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:06,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:07,246 INFO L256 TraceCheckUtils]: 0: Hoare triple {9564#true} call ULTIMATE.init(); {9564#true} is VALID [2018-11-23 11:59:07,247 INFO L273 TraceCheckUtils]: 1: Hoare triple {9564#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9564#true} is VALID [2018-11-23 11:59:07,247 INFO L273 TraceCheckUtils]: 2: Hoare triple {9564#true} assume true; {9564#true} is VALID [2018-11-23 11:59:07,247 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9564#true} {9564#true} #130#return; {9564#true} is VALID [2018-11-23 11:59:07,247 INFO L256 TraceCheckUtils]: 4: Hoare triple {9564#true} call #t~ret15 := main(); {9564#true} is VALID [2018-11-23 11:59:07,248 INFO L273 TraceCheckUtils]: 5: Hoare triple {9564#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {9599#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:07,249 INFO L273 TraceCheckUtils]: 6: Hoare triple {9599#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {9603#(<= main_~k~0 1)} is VALID [2018-11-23 11:59:07,249 INFO L273 TraceCheckUtils]: 7: Hoare triple {9603#(<= 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); {9603#(<= main_~k~0 1)} is VALID [2018-11-23 11:59:07,249 INFO L273 TraceCheckUtils]: 8: Hoare triple {9603#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {9603#(<= main_~k~0 1)} is VALID [2018-11-23 11:59:07,250 INFO L273 TraceCheckUtils]: 9: Hoare triple {9603#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {9613#(<= main_~k~0 2)} is VALID [2018-11-23 11:59:07,250 INFO L273 TraceCheckUtils]: 10: Hoare triple {9613#(<= 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); {9613#(<= main_~k~0 2)} is VALID [2018-11-23 11:59:07,250 INFO L273 TraceCheckUtils]: 11: Hoare triple {9613#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {9613#(<= main_~k~0 2)} is VALID [2018-11-23 11:59:07,251 INFO L273 TraceCheckUtils]: 12: Hoare triple {9613#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {9623#(<= main_~k~0 3)} is VALID [2018-11-23 11:59:07,251 INFO L273 TraceCheckUtils]: 13: Hoare triple {9623#(<= 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); {9623#(<= main_~k~0 3)} is VALID [2018-11-23 11:59:07,252 INFO L273 TraceCheckUtils]: 14: Hoare triple {9623#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {9623#(<= main_~k~0 3)} is VALID [2018-11-23 11:59:07,253 INFO L273 TraceCheckUtils]: 15: Hoare triple {9623#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {9633#(<= main_~k~0 4)} is VALID [2018-11-23 11:59:07,253 INFO L273 TraceCheckUtils]: 16: Hoare triple {9633#(<= 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); {9633#(<= main_~k~0 4)} is VALID [2018-11-23 11:59:07,254 INFO L273 TraceCheckUtils]: 17: Hoare triple {9633#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {9633#(<= main_~k~0 4)} is VALID [2018-11-23 11:59:07,254 INFO L273 TraceCheckUtils]: 18: Hoare triple {9633#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {9643#(<= main_~k~0 5)} is VALID [2018-11-23 11:59:07,255 INFO L273 TraceCheckUtils]: 19: Hoare triple {9643#(<= 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); {9643#(<= main_~k~0 5)} is VALID [2018-11-23 11:59:07,255 INFO L273 TraceCheckUtils]: 20: Hoare triple {9643#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {9643#(<= main_~k~0 5)} is VALID [2018-11-23 11:59:07,256 INFO L273 TraceCheckUtils]: 21: Hoare triple {9643#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {9653#(<= main_~k~0 6)} is VALID [2018-11-23 11:59:07,257 INFO L273 TraceCheckUtils]: 22: Hoare triple {9653#(<= 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); {9653#(<= main_~k~0 6)} is VALID [2018-11-23 11:59:07,257 INFO L273 TraceCheckUtils]: 23: Hoare triple {9653#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {9653#(<= main_~k~0 6)} is VALID [2018-11-23 11:59:07,258 INFO L273 TraceCheckUtils]: 24: Hoare triple {9653#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {9663#(<= main_~k~0 7)} is VALID [2018-11-23 11:59:07,259 INFO L273 TraceCheckUtils]: 25: Hoare triple {9663#(<= 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); {9663#(<= main_~k~0 7)} is VALID [2018-11-23 11:59:07,259 INFO L273 TraceCheckUtils]: 26: Hoare triple {9663#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {9663#(<= main_~k~0 7)} is VALID [2018-11-23 11:59:07,260 INFO L273 TraceCheckUtils]: 27: Hoare triple {9663#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {9673#(<= main_~k~0 8)} is VALID [2018-11-23 11:59:07,260 INFO L273 TraceCheckUtils]: 28: Hoare triple {9673#(<= 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); {9673#(<= main_~k~0 8)} is VALID [2018-11-23 11:59:07,261 INFO L273 TraceCheckUtils]: 29: Hoare triple {9673#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {9673#(<= main_~k~0 8)} is VALID [2018-11-23 11:59:07,262 INFO L273 TraceCheckUtils]: 30: Hoare triple {9673#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {9683#(<= main_~k~0 9)} is VALID [2018-11-23 11:59:07,262 INFO L273 TraceCheckUtils]: 31: Hoare triple {9683#(<= 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); {9683#(<= main_~k~0 9)} is VALID [2018-11-23 11:59:07,263 INFO L273 TraceCheckUtils]: 32: Hoare triple {9683#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {9683#(<= main_~k~0 9)} is VALID [2018-11-23 11:59:07,263 INFO L273 TraceCheckUtils]: 33: Hoare triple {9683#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {9693#(<= main_~k~0 10)} is VALID [2018-11-23 11:59:07,264 INFO L273 TraceCheckUtils]: 34: Hoare triple {9693#(<= 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); {9693#(<= main_~k~0 10)} is VALID [2018-11-23 11:59:07,264 INFO L273 TraceCheckUtils]: 35: Hoare triple {9693#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {9693#(<= main_~k~0 10)} is VALID [2018-11-23 11:59:07,265 INFO L273 TraceCheckUtils]: 36: Hoare triple {9693#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {9703#(<= main_~k~0 11)} is VALID [2018-11-23 11:59:07,266 INFO L273 TraceCheckUtils]: 37: Hoare triple {9703#(<= 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); {9703#(<= main_~k~0 11)} is VALID [2018-11-23 11:59:07,266 INFO L273 TraceCheckUtils]: 38: Hoare triple {9703#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {9703#(<= main_~k~0 11)} is VALID [2018-11-23 11:59:07,267 INFO L273 TraceCheckUtils]: 39: Hoare triple {9703#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {9713#(<= main_~k~0 12)} is VALID [2018-11-23 11:59:07,268 INFO L273 TraceCheckUtils]: 40: Hoare triple {9713#(<= 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); {9713#(<= main_~k~0 12)} is VALID [2018-11-23 11:59:07,268 INFO L273 TraceCheckUtils]: 41: Hoare triple {9713#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {9713#(<= main_~k~0 12)} is VALID [2018-11-23 11:59:07,269 INFO L273 TraceCheckUtils]: 42: Hoare triple {9713#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {9723#(<= main_~k~0 13)} is VALID [2018-11-23 11:59:07,269 INFO L273 TraceCheckUtils]: 43: Hoare triple {9723#(<= 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); {9723#(<= main_~k~0 13)} is VALID [2018-11-23 11:59:07,270 INFO L273 TraceCheckUtils]: 44: Hoare triple {9723#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {9723#(<= main_~k~0 13)} is VALID [2018-11-23 11:59:07,271 INFO L273 TraceCheckUtils]: 45: Hoare triple {9723#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {9733#(<= main_~k~0 14)} is VALID [2018-11-23 11:59:07,271 INFO L273 TraceCheckUtils]: 46: Hoare triple {9733#(<= main_~k~0 14)} assume !(~k~0 < 100000); {9565#false} is VALID [2018-11-23 11:59:07,271 INFO L273 TraceCheckUtils]: 47: Hoare triple {9565#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); {9565#false} is VALID [2018-11-23 11:59:07,272 INFO L273 TraceCheckUtils]: 48: Hoare triple {9565#false} ~x~0 := 0; {9565#false} is VALID [2018-11-23 11:59:07,272 INFO L273 TraceCheckUtils]: 49: Hoare triple {9565#false} assume !(~x~0 < ~i~0); {9565#false} is VALID [2018-11-23 11:59:07,272 INFO L273 TraceCheckUtils]: 50: Hoare triple {9565#false} ~x~0 := ~i~0; {9565#false} is VALID [2018-11-23 11:59:07,272 INFO L273 TraceCheckUtils]: 51: Hoare triple {9565#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); {9565#false} is VALID [2018-11-23 11:59:07,273 INFO L256 TraceCheckUtils]: 52: Hoare triple {9565#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {9565#false} is VALID [2018-11-23 11:59:07,273 INFO L273 TraceCheckUtils]: 53: Hoare triple {9565#false} ~cond := #in~cond; {9565#false} is VALID [2018-11-23 11:59:07,273 INFO L273 TraceCheckUtils]: 54: Hoare triple {9565#false} assume !(0 == ~cond); {9565#false} is VALID [2018-11-23 11:59:07,273 INFO L273 TraceCheckUtils]: 55: Hoare triple {9565#false} assume true; {9565#false} is VALID [2018-11-23 11:59:07,273 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {9565#false} {9565#false} #136#return; {9565#false} is VALID [2018-11-23 11:59:07,274 INFO L273 TraceCheckUtils]: 57: Hoare triple {9565#false} havoc #t~mem9;havoc #t~mem10; {9565#false} is VALID [2018-11-23 11:59:07,274 INFO L273 TraceCheckUtils]: 58: Hoare triple {9565#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {9565#false} is VALID [2018-11-23 11:59:07,274 INFO L273 TraceCheckUtils]: 59: Hoare triple {9565#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); {9565#false} is VALID [2018-11-23 11:59:07,274 INFO L256 TraceCheckUtils]: 60: Hoare triple {9565#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {9565#false} is VALID [2018-11-23 11:59:07,274 INFO L273 TraceCheckUtils]: 61: Hoare triple {9565#false} ~cond := #in~cond; {9565#false} is VALID [2018-11-23 11:59:07,274 INFO L273 TraceCheckUtils]: 62: Hoare triple {9565#false} assume 0 == ~cond; {9565#false} is VALID [2018-11-23 11:59:07,274 INFO L273 TraceCheckUtils]: 63: Hoare triple {9565#false} assume !false; {9565#false} is VALID [2018-11-23 11:59:07,277 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:59:07,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:07,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2018-11-23 11:59:07,296 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 64 [2018-11-23 11:59:07,297 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:07,297 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-23 11:59:07,404 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:59:07,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-23 11:59:07,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-23 11:59:07,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=377, Invalid=615, Unknown=0, NotChecked=0, Total=992 [2018-11-23 11:59:07,406 INFO L87 Difference]: Start difference. First operand 132 states and 173 transitions. Second operand 32 states. [2018-11-23 11:59:08,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:08,320 INFO L93 Difference]: Finished difference Result 195 states and 259 transitions. [2018-11-23 11:59:08,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 11:59:08,320 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 64 [2018-11-23 11:59:08,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:08,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 11:59:08,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 163 transitions. [2018-11-23 11:59:08,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 11:59:08,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 163 transitions. [2018-11-23 11:59:08,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 163 transitions. [2018-11-23 11:59:08,498 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:59:08,500 INFO L225 Difference]: With dead ends: 195 [2018-11-23 11:59:08,500 INFO L226 Difference]: Without dead ends: 148 [2018-11-23 11:59:08,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=377, Invalid=615, Unknown=0, NotChecked=0, Total=992 [2018-11-23 11:59:08,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-23 11:59:08,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 138. [2018-11-23 11:59:08,579 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:08,579 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand 138 states. [2018-11-23 11:59:08,579 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand 138 states. [2018-11-23 11:59:08,579 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 138 states. [2018-11-23 11:59:08,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:08,582 INFO L93 Difference]: Finished difference Result 148 states and 196 transitions. [2018-11-23 11:59:08,582 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 196 transitions. [2018-11-23 11:59:08,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:08,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:08,583 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 148 states. [2018-11-23 11:59:08,583 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 148 states. [2018-11-23 11:59:08,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:08,587 INFO L93 Difference]: Finished difference Result 148 states and 196 transitions. [2018-11-23 11:59:08,587 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 196 transitions. [2018-11-23 11:59:08,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:08,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:08,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:08,588 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:08,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-11-23 11:59:08,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 181 transitions. [2018-11-23 11:59:08,591 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 181 transitions. Word has length 64 [2018-11-23 11:59:08,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:08,591 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 181 transitions. [2018-11-23 11:59:08,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-23 11:59:08,591 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 181 transitions. [2018-11-23 11:59:08,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 11:59:08,592 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:08,592 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:59:08,592 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:08,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:08,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1307236652, now seen corresponding path program 10 times [2018-11-23 11:59:08,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:08,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:08,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:08,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:08,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:08,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:09,462 INFO L256 TraceCheckUtils]: 0: Hoare triple {10538#true} call ULTIMATE.init(); {10538#true} is VALID [2018-11-23 11:59:09,463 INFO L273 TraceCheckUtils]: 1: Hoare triple {10538#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10538#true} is VALID [2018-11-23 11:59:09,463 INFO L273 TraceCheckUtils]: 2: Hoare triple {10538#true} assume true; {10538#true} is VALID [2018-11-23 11:59:09,463 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10538#true} {10538#true} #130#return; {10538#true} is VALID [2018-11-23 11:59:09,463 INFO L256 TraceCheckUtils]: 4: Hoare triple {10538#true} call #t~ret15 := main(); {10538#true} is VALID [2018-11-23 11:59:09,464 INFO L273 TraceCheckUtils]: 5: Hoare triple {10538#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {10540#(= main_~i~0 0)} is VALID [2018-11-23 11:59:09,465 INFO L273 TraceCheckUtils]: 6: Hoare triple {10540#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {10541#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:09,465 INFO L273 TraceCheckUtils]: 7: Hoare triple {10541#(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); {10541#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:09,465 INFO L273 TraceCheckUtils]: 8: Hoare triple {10541#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {10541#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:09,466 INFO L273 TraceCheckUtils]: 9: Hoare triple {10541#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {10542#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:09,466 INFO L273 TraceCheckUtils]: 10: Hoare triple {10542#(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); {10542#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:09,467 INFO L273 TraceCheckUtils]: 11: Hoare triple {10542#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {10542#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:09,467 INFO L273 TraceCheckUtils]: 12: Hoare triple {10542#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {10543#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:09,468 INFO L273 TraceCheckUtils]: 13: Hoare triple {10543#(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); {10543#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:09,469 INFO L273 TraceCheckUtils]: 14: Hoare triple {10543#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {10543#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:09,470 INFO L273 TraceCheckUtils]: 15: Hoare triple {10543#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {10544#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:09,471 INFO L273 TraceCheckUtils]: 16: Hoare triple {10544#(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); {10544#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:09,471 INFO L273 TraceCheckUtils]: 17: Hoare triple {10544#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {10544#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:09,472 INFO L273 TraceCheckUtils]: 18: Hoare triple {10544#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {10545#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:09,473 INFO L273 TraceCheckUtils]: 19: Hoare triple {10545#(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); {10545#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:09,474 INFO L273 TraceCheckUtils]: 20: Hoare triple {10545#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {10545#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:09,475 INFO L273 TraceCheckUtils]: 21: Hoare triple {10545#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {10546#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:09,475 INFO L273 TraceCheckUtils]: 22: Hoare triple {10546#(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); {10546#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:09,476 INFO L273 TraceCheckUtils]: 23: Hoare triple {10546#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {10546#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:09,477 INFO L273 TraceCheckUtils]: 24: Hoare triple {10546#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {10547#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:09,478 INFO L273 TraceCheckUtils]: 25: Hoare triple {10547#(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); {10547#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:09,478 INFO L273 TraceCheckUtils]: 26: Hoare triple {10547#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {10547#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:09,479 INFO L273 TraceCheckUtils]: 27: Hoare triple {10547#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {10548#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:09,480 INFO L273 TraceCheckUtils]: 28: Hoare triple {10548#(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); {10548#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:09,481 INFO L273 TraceCheckUtils]: 29: Hoare triple {10548#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {10548#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:09,481 INFO L273 TraceCheckUtils]: 30: Hoare triple {10548#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {10549#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:09,482 INFO L273 TraceCheckUtils]: 31: Hoare triple {10549#(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); {10549#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:09,483 INFO L273 TraceCheckUtils]: 32: Hoare triple {10549#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {10549#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:09,484 INFO L273 TraceCheckUtils]: 33: Hoare triple {10549#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {10550#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:09,485 INFO L273 TraceCheckUtils]: 34: Hoare triple {10550#(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); {10550#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:09,485 INFO L273 TraceCheckUtils]: 35: Hoare triple {10550#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {10550#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:09,486 INFO L273 TraceCheckUtils]: 36: Hoare triple {10550#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {10551#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:09,487 INFO L273 TraceCheckUtils]: 37: Hoare triple {10551#(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); {10551#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:09,488 INFO L273 TraceCheckUtils]: 38: Hoare triple {10551#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {10551#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:09,489 INFO L273 TraceCheckUtils]: 39: Hoare triple {10551#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {10552#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:09,490 INFO L273 TraceCheckUtils]: 40: Hoare triple {10552#(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); {10552#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:09,490 INFO L273 TraceCheckUtils]: 41: Hoare triple {10552#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {10552#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:09,491 INFO L273 TraceCheckUtils]: 42: Hoare triple {10552#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {10553#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:09,492 INFO L273 TraceCheckUtils]: 43: Hoare triple {10553#(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); {10553#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:09,493 INFO L273 TraceCheckUtils]: 44: Hoare triple {10553#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {10553#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:09,494 INFO L273 TraceCheckUtils]: 45: Hoare triple {10553#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {10554#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:09,494 INFO L273 TraceCheckUtils]: 46: Hoare triple {10554#(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); {10554#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:09,495 INFO L273 TraceCheckUtils]: 47: Hoare triple {10554#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {10554#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:09,496 INFO L273 TraceCheckUtils]: 48: Hoare triple {10554#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {10555#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:09,496 INFO L273 TraceCheckUtils]: 49: Hoare triple {10555#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} assume !(~k~0 < 100000); {10539#false} is VALID [2018-11-23 11:59:09,497 INFO L273 TraceCheckUtils]: 50: Hoare triple {10539#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); {10539#false} is VALID [2018-11-23 11:59:09,497 INFO L273 TraceCheckUtils]: 51: Hoare triple {10539#false} ~x~0 := 0; {10539#false} is VALID [2018-11-23 11:59:09,497 INFO L273 TraceCheckUtils]: 52: Hoare triple {10539#false} assume !(~x~0 < ~i~0); {10539#false} is VALID [2018-11-23 11:59:09,497 INFO L273 TraceCheckUtils]: 53: Hoare triple {10539#false} ~x~0 := ~i~0; {10539#false} is VALID [2018-11-23 11:59:09,497 INFO L273 TraceCheckUtils]: 54: Hoare triple {10539#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); {10539#false} is VALID [2018-11-23 11:59:09,498 INFO L256 TraceCheckUtils]: 55: Hoare triple {10539#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {10538#true} is VALID [2018-11-23 11:59:09,498 INFO L273 TraceCheckUtils]: 56: Hoare triple {10538#true} ~cond := #in~cond; {10538#true} is VALID [2018-11-23 11:59:09,498 INFO L273 TraceCheckUtils]: 57: Hoare triple {10538#true} assume !(0 == ~cond); {10538#true} is VALID [2018-11-23 11:59:09,498 INFO L273 TraceCheckUtils]: 58: Hoare triple {10538#true} assume true; {10538#true} is VALID [2018-11-23 11:59:09,498 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {10538#true} {10539#false} #136#return; {10539#false} is VALID [2018-11-23 11:59:09,499 INFO L273 TraceCheckUtils]: 60: Hoare triple {10539#false} havoc #t~mem9;havoc #t~mem10; {10539#false} is VALID [2018-11-23 11:59:09,499 INFO L273 TraceCheckUtils]: 61: Hoare triple {10539#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {10539#false} is VALID [2018-11-23 11:59:09,499 INFO L273 TraceCheckUtils]: 62: Hoare triple {10539#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); {10539#false} is VALID [2018-11-23 11:59:09,499 INFO L256 TraceCheckUtils]: 63: Hoare triple {10539#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {10539#false} is VALID [2018-11-23 11:59:09,499 INFO L273 TraceCheckUtils]: 64: Hoare triple {10539#false} ~cond := #in~cond; {10539#false} is VALID [2018-11-23 11:59:09,499 INFO L273 TraceCheckUtils]: 65: Hoare triple {10539#false} assume 0 == ~cond; {10539#false} is VALID [2018-11-23 11:59:09,499 INFO L273 TraceCheckUtils]: 66: Hoare triple {10539#false} assume !false; {10539#false} is VALID [2018-11-23 11:59:09,505 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:59:09,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:09,505 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:59:09,514 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:59:09,549 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:59:09,549 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:09,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:09,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:09,978 INFO L256 TraceCheckUtils]: 0: Hoare triple {10538#true} call ULTIMATE.init(); {10538#true} is VALID [2018-11-23 11:59:09,978 INFO L273 TraceCheckUtils]: 1: Hoare triple {10538#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10538#true} is VALID [2018-11-23 11:59:09,979 INFO L273 TraceCheckUtils]: 2: Hoare triple {10538#true} assume true; {10538#true} is VALID [2018-11-23 11:59:09,979 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10538#true} {10538#true} #130#return; {10538#true} is VALID [2018-11-23 11:59:09,979 INFO L256 TraceCheckUtils]: 4: Hoare triple {10538#true} call #t~ret15 := main(); {10538#true} is VALID [2018-11-23 11:59:09,980 INFO L273 TraceCheckUtils]: 5: Hoare triple {10538#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {10574#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:09,980 INFO L273 TraceCheckUtils]: 6: Hoare triple {10574#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {10578#(<= main_~k~0 1)} is VALID [2018-11-23 11:59:09,981 INFO L273 TraceCheckUtils]: 7: Hoare triple {10578#(<= 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); {10578#(<= main_~k~0 1)} is VALID [2018-11-23 11:59:09,981 INFO L273 TraceCheckUtils]: 8: Hoare triple {10578#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {10578#(<= main_~k~0 1)} is VALID [2018-11-23 11:59:09,981 INFO L273 TraceCheckUtils]: 9: Hoare triple {10578#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {10588#(<= main_~k~0 2)} is VALID [2018-11-23 11:59:09,982 INFO L273 TraceCheckUtils]: 10: Hoare triple {10588#(<= 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); {10588#(<= main_~k~0 2)} is VALID [2018-11-23 11:59:09,982 INFO L273 TraceCheckUtils]: 11: Hoare triple {10588#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {10588#(<= main_~k~0 2)} is VALID [2018-11-23 11:59:09,983 INFO L273 TraceCheckUtils]: 12: Hoare triple {10588#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {10598#(<= main_~k~0 3)} is VALID [2018-11-23 11:59:09,983 INFO L273 TraceCheckUtils]: 13: Hoare triple {10598#(<= 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); {10598#(<= main_~k~0 3)} is VALID [2018-11-23 11:59:09,984 INFO L273 TraceCheckUtils]: 14: Hoare triple {10598#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {10598#(<= main_~k~0 3)} is VALID [2018-11-23 11:59:09,984 INFO L273 TraceCheckUtils]: 15: Hoare triple {10598#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {10608#(<= main_~k~0 4)} is VALID [2018-11-23 11:59:09,985 INFO L273 TraceCheckUtils]: 16: Hoare triple {10608#(<= 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); {10608#(<= main_~k~0 4)} is VALID [2018-11-23 11:59:09,985 INFO L273 TraceCheckUtils]: 17: Hoare triple {10608#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {10608#(<= main_~k~0 4)} is VALID [2018-11-23 11:59:09,986 INFO L273 TraceCheckUtils]: 18: Hoare triple {10608#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {10618#(<= main_~k~0 5)} is VALID [2018-11-23 11:59:09,987 INFO L273 TraceCheckUtils]: 19: Hoare triple {10618#(<= 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); {10618#(<= main_~k~0 5)} is VALID [2018-11-23 11:59:09,987 INFO L273 TraceCheckUtils]: 20: Hoare triple {10618#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {10618#(<= main_~k~0 5)} is VALID [2018-11-23 11:59:09,988 INFO L273 TraceCheckUtils]: 21: Hoare triple {10618#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {10628#(<= main_~k~0 6)} is VALID [2018-11-23 11:59:09,988 INFO L273 TraceCheckUtils]: 22: Hoare triple {10628#(<= 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); {10628#(<= main_~k~0 6)} is VALID [2018-11-23 11:59:09,989 INFO L273 TraceCheckUtils]: 23: Hoare triple {10628#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {10628#(<= main_~k~0 6)} is VALID [2018-11-23 11:59:09,990 INFO L273 TraceCheckUtils]: 24: Hoare triple {10628#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {10638#(<= main_~k~0 7)} is VALID [2018-11-23 11:59:09,990 INFO L273 TraceCheckUtils]: 25: Hoare triple {10638#(<= 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); {10638#(<= main_~k~0 7)} is VALID [2018-11-23 11:59:09,991 INFO L273 TraceCheckUtils]: 26: Hoare triple {10638#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {10638#(<= main_~k~0 7)} is VALID [2018-11-23 11:59:09,991 INFO L273 TraceCheckUtils]: 27: Hoare triple {10638#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {10648#(<= main_~k~0 8)} is VALID [2018-11-23 11:59:09,992 INFO L273 TraceCheckUtils]: 28: Hoare triple {10648#(<= 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); {10648#(<= main_~k~0 8)} is VALID [2018-11-23 11:59:09,992 INFO L273 TraceCheckUtils]: 29: Hoare triple {10648#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {10648#(<= main_~k~0 8)} is VALID [2018-11-23 11:59:10,011 INFO L273 TraceCheckUtils]: 30: Hoare triple {10648#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {10658#(<= main_~k~0 9)} is VALID [2018-11-23 11:59:10,020 INFO L273 TraceCheckUtils]: 31: Hoare triple {10658#(<= 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); {10658#(<= main_~k~0 9)} is VALID [2018-11-23 11:59:10,035 INFO L273 TraceCheckUtils]: 32: Hoare triple {10658#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {10658#(<= main_~k~0 9)} is VALID [2018-11-23 11:59:10,044 INFO L273 TraceCheckUtils]: 33: Hoare triple {10658#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {10668#(<= main_~k~0 10)} is VALID [2018-11-23 11:59:10,045 INFO L273 TraceCheckUtils]: 34: Hoare triple {10668#(<= 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); {10668#(<= main_~k~0 10)} is VALID [2018-11-23 11:59:10,045 INFO L273 TraceCheckUtils]: 35: Hoare triple {10668#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {10668#(<= main_~k~0 10)} is VALID [2018-11-23 11:59:10,046 INFO L273 TraceCheckUtils]: 36: Hoare triple {10668#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {10678#(<= main_~k~0 11)} is VALID [2018-11-23 11:59:10,046 INFO L273 TraceCheckUtils]: 37: Hoare triple {10678#(<= 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); {10678#(<= main_~k~0 11)} is VALID [2018-11-23 11:59:10,046 INFO L273 TraceCheckUtils]: 38: Hoare triple {10678#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {10678#(<= main_~k~0 11)} is VALID [2018-11-23 11:59:10,047 INFO L273 TraceCheckUtils]: 39: Hoare triple {10678#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {10688#(<= main_~k~0 12)} is VALID [2018-11-23 11:59:10,047 INFO L273 TraceCheckUtils]: 40: Hoare triple {10688#(<= 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); {10688#(<= main_~k~0 12)} is VALID [2018-11-23 11:59:10,048 INFO L273 TraceCheckUtils]: 41: Hoare triple {10688#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {10688#(<= main_~k~0 12)} is VALID [2018-11-23 11:59:10,048 INFO L273 TraceCheckUtils]: 42: Hoare triple {10688#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {10698#(<= main_~k~0 13)} is VALID [2018-11-23 11:59:10,048 INFO L273 TraceCheckUtils]: 43: Hoare triple {10698#(<= 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); {10698#(<= main_~k~0 13)} is VALID [2018-11-23 11:59:10,049 INFO L273 TraceCheckUtils]: 44: Hoare triple {10698#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {10698#(<= main_~k~0 13)} is VALID [2018-11-23 11:59:10,049 INFO L273 TraceCheckUtils]: 45: Hoare triple {10698#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {10708#(<= main_~k~0 14)} is VALID [2018-11-23 11:59:10,049 INFO L273 TraceCheckUtils]: 46: Hoare triple {10708#(<= 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); {10708#(<= main_~k~0 14)} is VALID [2018-11-23 11:59:10,050 INFO L273 TraceCheckUtils]: 47: Hoare triple {10708#(<= main_~k~0 14)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {10708#(<= main_~k~0 14)} is VALID [2018-11-23 11:59:10,051 INFO L273 TraceCheckUtils]: 48: Hoare triple {10708#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {10718#(<= main_~k~0 15)} is VALID [2018-11-23 11:59:10,051 INFO L273 TraceCheckUtils]: 49: Hoare triple {10718#(<= main_~k~0 15)} assume !(~k~0 < 100000); {10539#false} is VALID [2018-11-23 11:59:10,051 INFO L273 TraceCheckUtils]: 50: Hoare triple {10539#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); {10539#false} is VALID [2018-11-23 11:59:10,052 INFO L273 TraceCheckUtils]: 51: Hoare triple {10539#false} ~x~0 := 0; {10539#false} is VALID [2018-11-23 11:59:10,052 INFO L273 TraceCheckUtils]: 52: Hoare triple {10539#false} assume !(~x~0 < ~i~0); {10539#false} is VALID [2018-11-23 11:59:10,052 INFO L273 TraceCheckUtils]: 53: Hoare triple {10539#false} ~x~0 := ~i~0; {10539#false} is VALID [2018-11-23 11:59:10,052 INFO L273 TraceCheckUtils]: 54: Hoare triple {10539#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); {10539#false} is VALID [2018-11-23 11:59:10,052 INFO L256 TraceCheckUtils]: 55: Hoare triple {10539#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {10539#false} is VALID [2018-11-23 11:59:10,053 INFO L273 TraceCheckUtils]: 56: Hoare triple {10539#false} ~cond := #in~cond; {10539#false} is VALID [2018-11-23 11:59:10,053 INFO L273 TraceCheckUtils]: 57: Hoare triple {10539#false} assume !(0 == ~cond); {10539#false} is VALID [2018-11-23 11:59:10,053 INFO L273 TraceCheckUtils]: 58: Hoare triple {10539#false} assume true; {10539#false} is VALID [2018-11-23 11:59:10,053 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {10539#false} {10539#false} #136#return; {10539#false} is VALID [2018-11-23 11:59:10,053 INFO L273 TraceCheckUtils]: 60: Hoare triple {10539#false} havoc #t~mem9;havoc #t~mem10; {10539#false} is VALID [2018-11-23 11:59:10,053 INFO L273 TraceCheckUtils]: 61: Hoare triple {10539#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {10539#false} is VALID [2018-11-23 11:59:10,054 INFO L273 TraceCheckUtils]: 62: Hoare triple {10539#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); {10539#false} is VALID [2018-11-23 11:59:10,054 INFO L256 TraceCheckUtils]: 63: Hoare triple {10539#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {10539#false} is VALID [2018-11-23 11:59:10,054 INFO L273 TraceCheckUtils]: 64: Hoare triple {10539#false} ~cond := #in~cond; {10539#false} is VALID [2018-11-23 11:59:10,054 INFO L273 TraceCheckUtils]: 65: Hoare triple {10539#false} assume 0 == ~cond; {10539#false} is VALID [2018-11-23 11:59:10,054 INFO L273 TraceCheckUtils]: 66: Hoare triple {10539#false} assume !false; {10539#false} is VALID [2018-11-23 11:59:10,057 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:59:10,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:10,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2018-11-23 11:59:10,076 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 67 [2018-11-23 11:59:10,077 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:10,077 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-23 11:59:10,191 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:59:10,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-23 11:59:10,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-23 11:59:10,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=426, Invalid=696, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 11:59:10,193 INFO L87 Difference]: Start difference. First operand 138 states and 181 transitions. Second operand 34 states. [2018-11-23 11:59:10,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:10,935 INFO L93 Difference]: Finished difference Result 201 states and 267 transitions. [2018-11-23 11:59:10,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 11:59:10,935 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 67 [2018-11-23 11:59:10,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:10,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 11:59:10,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 167 transitions. [2018-11-23 11:59:10,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 11:59:10,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 167 transitions. [2018-11-23 11:59:10,939 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 167 transitions. [2018-11-23 11:59:11,558 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:59:11,561 INFO L225 Difference]: With dead ends: 201 [2018-11-23 11:59:11,562 INFO L226 Difference]: Without dead ends: 154 [2018-11-23 11:59:11,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=426, Invalid=696, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 11:59:11,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-11-23 11:59:11,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 144. [2018-11-23 11:59:11,666 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:11,666 INFO L82 GeneralOperation]: Start isEquivalent. First operand 154 states. Second operand 144 states. [2018-11-23 11:59:11,666 INFO L74 IsIncluded]: Start isIncluded. First operand 154 states. Second operand 144 states. [2018-11-23 11:59:11,667 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 144 states. [2018-11-23 11:59:11,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:11,671 INFO L93 Difference]: Finished difference Result 154 states and 204 transitions. [2018-11-23 11:59:11,671 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 204 transitions. [2018-11-23 11:59:11,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:11,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:11,672 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand 154 states. [2018-11-23 11:59:11,672 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 154 states. [2018-11-23 11:59:11,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:11,675 INFO L93 Difference]: Finished difference Result 154 states and 204 transitions. [2018-11-23 11:59:11,675 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 204 transitions. [2018-11-23 11:59:11,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:11,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:11,676 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:11,676 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:11,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-23 11:59:11,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 189 transitions. [2018-11-23 11:59:11,679 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 189 transitions. Word has length 67 [2018-11-23 11:59:11,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:11,679 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 189 transitions. [2018-11-23 11:59:11,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-23 11:59:11,680 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 189 transitions. [2018-11-23 11:59:11,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 11:59:11,680 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:11,680 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:59:11,681 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:11,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:11,681 INFO L82 PathProgramCache]: Analyzing trace with hash 254862289, now seen corresponding path program 11 times [2018-11-23 11:59:11,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:11,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:11,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:11,682 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:11,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:11,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:12,645 INFO L256 TraceCheckUtils]: 0: Hoare triple {11551#true} call ULTIMATE.init(); {11551#true} is VALID [2018-11-23 11:59:12,645 INFO L273 TraceCheckUtils]: 1: Hoare triple {11551#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11551#true} is VALID [2018-11-23 11:59:12,645 INFO L273 TraceCheckUtils]: 2: Hoare triple {11551#true} assume true; {11551#true} is VALID [2018-11-23 11:59:12,645 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11551#true} {11551#true} #130#return; {11551#true} is VALID [2018-11-23 11:59:12,645 INFO L256 TraceCheckUtils]: 4: Hoare triple {11551#true} call #t~ret15 := main(); {11551#true} is VALID [2018-11-23 11:59:12,646 INFO L273 TraceCheckUtils]: 5: Hoare triple {11551#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {11553#(= main_~i~0 0)} is VALID [2018-11-23 11:59:12,646 INFO L273 TraceCheckUtils]: 6: Hoare triple {11553#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {11554#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:12,647 INFO L273 TraceCheckUtils]: 7: Hoare triple {11554#(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); {11554#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:12,647 INFO L273 TraceCheckUtils]: 8: Hoare triple {11554#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {11554#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:12,648 INFO L273 TraceCheckUtils]: 9: Hoare triple {11554#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {11555#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:12,648 INFO L273 TraceCheckUtils]: 10: Hoare triple {11555#(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); {11555#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:12,649 INFO L273 TraceCheckUtils]: 11: Hoare triple {11555#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {11555#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:12,649 INFO L273 TraceCheckUtils]: 12: Hoare triple {11555#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {11556#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:12,650 INFO L273 TraceCheckUtils]: 13: Hoare triple {11556#(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); {11556#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:12,650 INFO L273 TraceCheckUtils]: 14: Hoare triple {11556#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {11556#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:12,651 INFO L273 TraceCheckUtils]: 15: Hoare triple {11556#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {11557#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:12,652 INFO L273 TraceCheckUtils]: 16: Hoare triple {11557#(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); {11557#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:12,653 INFO L273 TraceCheckUtils]: 17: Hoare triple {11557#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {11557#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:12,654 INFO L273 TraceCheckUtils]: 18: Hoare triple {11557#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {11558#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:12,654 INFO L273 TraceCheckUtils]: 19: Hoare triple {11558#(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); {11558#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:12,655 INFO L273 TraceCheckUtils]: 20: Hoare triple {11558#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {11558#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:12,674 INFO L273 TraceCheckUtils]: 21: Hoare triple {11558#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {11559#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:12,675 INFO L273 TraceCheckUtils]: 22: Hoare triple {11559#(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); {11559#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:12,676 INFO L273 TraceCheckUtils]: 23: Hoare triple {11559#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {11559#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:12,676 INFO L273 TraceCheckUtils]: 24: Hoare triple {11559#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {11560#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:12,677 INFO L273 TraceCheckUtils]: 25: Hoare triple {11560#(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); {11560#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:12,677 INFO L273 TraceCheckUtils]: 26: Hoare triple {11560#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {11560#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:12,678 INFO L273 TraceCheckUtils]: 27: Hoare triple {11560#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {11561#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:12,679 INFO L273 TraceCheckUtils]: 28: Hoare triple {11561#(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); {11561#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:12,680 INFO L273 TraceCheckUtils]: 29: Hoare triple {11561#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {11561#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:12,680 INFO L273 TraceCheckUtils]: 30: Hoare triple {11561#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {11562#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:12,681 INFO L273 TraceCheckUtils]: 31: Hoare triple {11562#(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); {11562#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:12,682 INFO L273 TraceCheckUtils]: 32: Hoare triple {11562#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {11562#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:12,683 INFO L273 TraceCheckUtils]: 33: Hoare triple {11562#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {11563#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:12,684 INFO L273 TraceCheckUtils]: 34: Hoare triple {11563#(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); {11563#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:12,685 INFO L273 TraceCheckUtils]: 35: Hoare triple {11563#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {11563#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:12,686 INFO L273 TraceCheckUtils]: 36: Hoare triple {11563#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {11564#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:12,687 INFO L273 TraceCheckUtils]: 37: Hoare triple {11564#(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); {11564#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:12,687 INFO L273 TraceCheckUtils]: 38: Hoare triple {11564#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {11564#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:12,688 INFO L273 TraceCheckUtils]: 39: Hoare triple {11564#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {11565#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:12,689 INFO L273 TraceCheckUtils]: 40: Hoare triple {11565#(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); {11565#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:12,690 INFO L273 TraceCheckUtils]: 41: Hoare triple {11565#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {11565#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:12,691 INFO L273 TraceCheckUtils]: 42: Hoare triple {11565#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {11566#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:12,692 INFO L273 TraceCheckUtils]: 43: Hoare triple {11566#(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); {11566#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:12,692 INFO L273 TraceCheckUtils]: 44: Hoare triple {11566#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {11566#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:12,693 INFO L273 TraceCheckUtils]: 45: Hoare triple {11566#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {11567#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:12,694 INFO L273 TraceCheckUtils]: 46: Hoare triple {11567#(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); {11567#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:12,695 INFO L273 TraceCheckUtils]: 47: Hoare triple {11567#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {11567#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:12,696 INFO L273 TraceCheckUtils]: 48: Hoare triple {11567#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {11568#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:12,697 INFO L273 TraceCheckUtils]: 49: Hoare triple {11568#(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); {11568#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:12,697 INFO L273 TraceCheckUtils]: 50: Hoare triple {11568#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {11568#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:12,698 INFO L273 TraceCheckUtils]: 51: Hoare triple {11568#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {11569#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:12,699 INFO L273 TraceCheckUtils]: 52: Hoare triple {11569#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} assume !(~k~0 < 100000); {11552#false} is VALID [2018-11-23 11:59:12,699 INFO L273 TraceCheckUtils]: 53: Hoare triple {11552#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); {11552#false} is VALID [2018-11-23 11:59:12,700 INFO L273 TraceCheckUtils]: 54: Hoare triple {11552#false} ~x~0 := 0; {11552#false} is VALID [2018-11-23 11:59:12,700 INFO L273 TraceCheckUtils]: 55: Hoare triple {11552#false} assume !(~x~0 < ~i~0); {11552#false} is VALID [2018-11-23 11:59:12,700 INFO L273 TraceCheckUtils]: 56: Hoare triple {11552#false} ~x~0 := ~i~0; {11552#false} is VALID [2018-11-23 11:59:12,700 INFO L273 TraceCheckUtils]: 57: Hoare triple {11552#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); {11552#false} is VALID [2018-11-23 11:59:12,700 INFO L256 TraceCheckUtils]: 58: Hoare triple {11552#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {11551#true} is VALID [2018-11-23 11:59:12,701 INFO L273 TraceCheckUtils]: 59: Hoare triple {11551#true} ~cond := #in~cond; {11551#true} is VALID [2018-11-23 11:59:12,701 INFO L273 TraceCheckUtils]: 60: Hoare triple {11551#true} assume !(0 == ~cond); {11551#true} is VALID [2018-11-23 11:59:12,701 INFO L273 TraceCheckUtils]: 61: Hoare triple {11551#true} assume true; {11551#true} is VALID [2018-11-23 11:59:12,701 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {11551#true} {11552#false} #136#return; {11552#false} is VALID [2018-11-23 11:59:12,701 INFO L273 TraceCheckUtils]: 63: Hoare triple {11552#false} havoc #t~mem9;havoc #t~mem10; {11552#false} is VALID [2018-11-23 11:59:12,702 INFO L273 TraceCheckUtils]: 64: Hoare triple {11552#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {11552#false} is VALID [2018-11-23 11:59:12,702 INFO L273 TraceCheckUtils]: 65: Hoare triple {11552#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); {11552#false} is VALID [2018-11-23 11:59:12,702 INFO L256 TraceCheckUtils]: 66: Hoare triple {11552#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {11552#false} is VALID [2018-11-23 11:59:12,702 INFO L273 TraceCheckUtils]: 67: Hoare triple {11552#false} ~cond := #in~cond; {11552#false} is VALID [2018-11-23 11:59:12,702 INFO L273 TraceCheckUtils]: 68: Hoare triple {11552#false} assume 0 == ~cond; {11552#false} is VALID [2018-11-23 11:59:12,703 INFO L273 TraceCheckUtils]: 69: Hoare triple {11552#false} assume !false; {11552#false} is VALID [2018-11-23 11:59:12,709 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:59:12,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:12,710 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:59:12,720 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:59:12,769 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2018-11-23 11:59:12,769 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:12,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:12,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:13,378 INFO L256 TraceCheckUtils]: 0: Hoare triple {11551#true} call ULTIMATE.init(); {11551#true} is VALID [2018-11-23 11:59:13,379 INFO L273 TraceCheckUtils]: 1: Hoare triple {11551#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11551#true} is VALID [2018-11-23 11:59:13,379 INFO L273 TraceCheckUtils]: 2: Hoare triple {11551#true} assume true; {11551#true} is VALID [2018-11-23 11:59:13,379 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11551#true} {11551#true} #130#return; {11551#true} is VALID [2018-11-23 11:59:13,379 INFO L256 TraceCheckUtils]: 4: Hoare triple {11551#true} call #t~ret15 := main(); {11551#true} is VALID [2018-11-23 11:59:13,380 INFO L273 TraceCheckUtils]: 5: Hoare triple {11551#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {11588#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:13,381 INFO L273 TraceCheckUtils]: 6: Hoare triple {11588#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {11592#(<= main_~k~0 1)} is VALID [2018-11-23 11:59:13,381 INFO L273 TraceCheckUtils]: 7: Hoare triple {11592#(<= 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); {11592#(<= main_~k~0 1)} is VALID [2018-11-23 11:59:13,382 INFO L273 TraceCheckUtils]: 8: Hoare triple {11592#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {11592#(<= main_~k~0 1)} is VALID [2018-11-23 11:59:13,382 INFO L273 TraceCheckUtils]: 9: Hoare triple {11592#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {11602#(<= main_~k~0 2)} is VALID [2018-11-23 11:59:13,382 INFO L273 TraceCheckUtils]: 10: Hoare triple {11602#(<= 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); {11602#(<= main_~k~0 2)} is VALID [2018-11-23 11:59:13,383 INFO L273 TraceCheckUtils]: 11: Hoare triple {11602#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {11602#(<= main_~k~0 2)} is VALID [2018-11-23 11:59:13,383 INFO L273 TraceCheckUtils]: 12: Hoare triple {11602#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {11612#(<= main_~k~0 3)} is VALID [2018-11-23 11:59:13,384 INFO L273 TraceCheckUtils]: 13: Hoare triple {11612#(<= 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); {11612#(<= main_~k~0 3)} is VALID [2018-11-23 11:59:13,384 INFO L273 TraceCheckUtils]: 14: Hoare triple {11612#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {11612#(<= main_~k~0 3)} is VALID [2018-11-23 11:59:13,385 INFO L273 TraceCheckUtils]: 15: Hoare triple {11612#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {11622#(<= main_~k~0 4)} is VALID [2018-11-23 11:59:13,386 INFO L273 TraceCheckUtils]: 16: Hoare triple {11622#(<= 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); {11622#(<= main_~k~0 4)} is VALID [2018-11-23 11:59:13,386 INFO L273 TraceCheckUtils]: 17: Hoare triple {11622#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {11622#(<= main_~k~0 4)} is VALID [2018-11-23 11:59:13,387 INFO L273 TraceCheckUtils]: 18: Hoare triple {11622#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {11632#(<= main_~k~0 5)} is VALID [2018-11-23 11:59:13,388 INFO L273 TraceCheckUtils]: 19: Hoare triple {11632#(<= 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); {11632#(<= main_~k~0 5)} is VALID [2018-11-23 11:59:13,388 INFO L273 TraceCheckUtils]: 20: Hoare triple {11632#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {11632#(<= main_~k~0 5)} is VALID [2018-11-23 11:59:13,389 INFO L273 TraceCheckUtils]: 21: Hoare triple {11632#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {11642#(<= main_~k~0 6)} is VALID [2018-11-23 11:59:13,389 INFO L273 TraceCheckUtils]: 22: Hoare triple {11642#(<= 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); {11642#(<= main_~k~0 6)} is VALID [2018-11-23 11:59:13,390 INFO L273 TraceCheckUtils]: 23: Hoare triple {11642#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {11642#(<= main_~k~0 6)} is VALID [2018-11-23 11:59:13,391 INFO L273 TraceCheckUtils]: 24: Hoare triple {11642#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {11652#(<= main_~k~0 7)} is VALID [2018-11-23 11:59:13,391 INFO L273 TraceCheckUtils]: 25: Hoare triple {11652#(<= 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); {11652#(<= main_~k~0 7)} is VALID [2018-11-23 11:59:13,392 INFO L273 TraceCheckUtils]: 26: Hoare triple {11652#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {11652#(<= main_~k~0 7)} is VALID [2018-11-23 11:59:13,392 INFO L273 TraceCheckUtils]: 27: Hoare triple {11652#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {11662#(<= main_~k~0 8)} is VALID [2018-11-23 11:59:13,393 INFO L273 TraceCheckUtils]: 28: Hoare triple {11662#(<= 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); {11662#(<= main_~k~0 8)} is VALID [2018-11-23 11:59:13,394 INFO L273 TraceCheckUtils]: 29: Hoare triple {11662#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {11662#(<= main_~k~0 8)} is VALID [2018-11-23 11:59:13,394 INFO L273 TraceCheckUtils]: 30: Hoare triple {11662#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {11672#(<= main_~k~0 9)} is VALID [2018-11-23 11:59:13,395 INFO L273 TraceCheckUtils]: 31: Hoare triple {11672#(<= 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); {11672#(<= main_~k~0 9)} is VALID [2018-11-23 11:59:13,395 INFO L273 TraceCheckUtils]: 32: Hoare triple {11672#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {11672#(<= main_~k~0 9)} is VALID [2018-11-23 11:59:13,396 INFO L273 TraceCheckUtils]: 33: Hoare triple {11672#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {11682#(<= main_~k~0 10)} is VALID [2018-11-23 11:59:13,397 INFO L273 TraceCheckUtils]: 34: Hoare triple {11682#(<= 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); {11682#(<= main_~k~0 10)} is VALID [2018-11-23 11:59:13,397 INFO L273 TraceCheckUtils]: 35: Hoare triple {11682#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {11682#(<= main_~k~0 10)} is VALID [2018-11-23 11:59:13,398 INFO L273 TraceCheckUtils]: 36: Hoare triple {11682#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {11692#(<= main_~k~0 11)} is VALID [2018-11-23 11:59:13,398 INFO L273 TraceCheckUtils]: 37: Hoare triple {11692#(<= 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); {11692#(<= main_~k~0 11)} is VALID [2018-11-23 11:59:13,399 INFO L273 TraceCheckUtils]: 38: Hoare triple {11692#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {11692#(<= main_~k~0 11)} is VALID [2018-11-23 11:59:13,400 INFO L273 TraceCheckUtils]: 39: Hoare triple {11692#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {11702#(<= main_~k~0 12)} is VALID [2018-11-23 11:59:13,400 INFO L273 TraceCheckUtils]: 40: Hoare triple {11702#(<= 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); {11702#(<= main_~k~0 12)} is VALID [2018-11-23 11:59:13,401 INFO L273 TraceCheckUtils]: 41: Hoare triple {11702#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {11702#(<= main_~k~0 12)} is VALID [2018-11-23 11:59:13,401 INFO L273 TraceCheckUtils]: 42: Hoare triple {11702#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {11712#(<= main_~k~0 13)} is VALID [2018-11-23 11:59:13,402 INFO L273 TraceCheckUtils]: 43: Hoare triple {11712#(<= 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); {11712#(<= main_~k~0 13)} is VALID [2018-11-23 11:59:13,402 INFO L273 TraceCheckUtils]: 44: Hoare triple {11712#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {11712#(<= main_~k~0 13)} is VALID [2018-11-23 11:59:13,403 INFO L273 TraceCheckUtils]: 45: Hoare triple {11712#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {11722#(<= main_~k~0 14)} is VALID [2018-11-23 11:59:13,404 INFO L273 TraceCheckUtils]: 46: Hoare triple {11722#(<= 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); {11722#(<= main_~k~0 14)} is VALID [2018-11-23 11:59:13,404 INFO L273 TraceCheckUtils]: 47: Hoare triple {11722#(<= main_~k~0 14)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {11722#(<= main_~k~0 14)} is VALID [2018-11-23 11:59:13,405 INFO L273 TraceCheckUtils]: 48: Hoare triple {11722#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {11732#(<= main_~k~0 15)} is VALID [2018-11-23 11:59:13,405 INFO L273 TraceCheckUtils]: 49: Hoare triple {11732#(<= 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); {11732#(<= main_~k~0 15)} is VALID [2018-11-23 11:59:13,406 INFO L273 TraceCheckUtils]: 50: Hoare triple {11732#(<= main_~k~0 15)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {11732#(<= main_~k~0 15)} is VALID [2018-11-23 11:59:13,407 INFO L273 TraceCheckUtils]: 51: Hoare triple {11732#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {11742#(<= main_~k~0 16)} is VALID [2018-11-23 11:59:13,407 INFO L273 TraceCheckUtils]: 52: Hoare triple {11742#(<= main_~k~0 16)} assume !(~k~0 < 100000); {11552#false} is VALID [2018-11-23 11:59:13,408 INFO L273 TraceCheckUtils]: 53: Hoare triple {11552#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); {11552#false} is VALID [2018-11-23 11:59:13,408 INFO L273 TraceCheckUtils]: 54: Hoare triple {11552#false} ~x~0 := 0; {11552#false} is VALID [2018-11-23 11:59:13,408 INFO L273 TraceCheckUtils]: 55: Hoare triple {11552#false} assume !(~x~0 < ~i~0); {11552#false} is VALID [2018-11-23 11:59:13,408 INFO L273 TraceCheckUtils]: 56: Hoare triple {11552#false} ~x~0 := ~i~0; {11552#false} is VALID [2018-11-23 11:59:13,408 INFO L273 TraceCheckUtils]: 57: Hoare triple {11552#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); {11552#false} is VALID [2018-11-23 11:59:13,409 INFO L256 TraceCheckUtils]: 58: Hoare triple {11552#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {11552#false} is VALID [2018-11-23 11:59:13,409 INFO L273 TraceCheckUtils]: 59: Hoare triple {11552#false} ~cond := #in~cond; {11552#false} is VALID [2018-11-23 11:59:13,409 INFO L273 TraceCheckUtils]: 60: Hoare triple {11552#false} assume !(0 == ~cond); {11552#false} is VALID [2018-11-23 11:59:13,409 INFO L273 TraceCheckUtils]: 61: Hoare triple {11552#false} assume true; {11552#false} is VALID [2018-11-23 11:59:13,409 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {11552#false} {11552#false} #136#return; {11552#false} is VALID [2018-11-23 11:59:13,410 INFO L273 TraceCheckUtils]: 63: Hoare triple {11552#false} havoc #t~mem9;havoc #t~mem10; {11552#false} is VALID [2018-11-23 11:59:13,410 INFO L273 TraceCheckUtils]: 64: Hoare triple {11552#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {11552#false} is VALID [2018-11-23 11:59:13,410 INFO L273 TraceCheckUtils]: 65: Hoare triple {11552#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); {11552#false} is VALID [2018-11-23 11:59:13,410 INFO L256 TraceCheckUtils]: 66: Hoare triple {11552#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {11552#false} is VALID [2018-11-23 11:59:13,410 INFO L273 TraceCheckUtils]: 67: Hoare triple {11552#false} ~cond := #in~cond; {11552#false} is VALID [2018-11-23 11:59:13,411 INFO L273 TraceCheckUtils]: 68: Hoare triple {11552#false} assume 0 == ~cond; {11552#false} is VALID [2018-11-23 11:59:13,411 INFO L273 TraceCheckUtils]: 69: Hoare triple {11552#false} assume !false; {11552#false} is VALID [2018-11-23 11:59:13,414 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:59:13,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:13,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2018-11-23 11:59:13,433 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2018-11-23 11:59:13,434 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:13,434 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-23 11:59:13,550 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:59:13,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-23 11:59:13,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-23 11:59:13,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=478, Invalid=782, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 11:59:13,552 INFO L87 Difference]: Start difference. First operand 144 states and 189 transitions. Second operand 36 states. [2018-11-23 11:59:14,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:14,452 INFO L93 Difference]: Finished difference Result 207 states and 275 transitions. [2018-11-23 11:59:14,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 11:59:14,452 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2018-11-23 11:59:14,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:14,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 11:59:14,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 171 transitions. [2018-11-23 11:59:14,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 11:59:14,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 171 transitions. [2018-11-23 11:59:14,456 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 171 transitions. [2018-11-23 11:59:15,554 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:59:15,557 INFO L225 Difference]: With dead ends: 207 [2018-11-23 11:59:15,557 INFO L226 Difference]: Without dead ends: 160 [2018-11-23 11:59:15,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=478, Invalid=782, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 11:59:15,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-11-23 11:59:15,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 150. [2018-11-23 11:59:15,844 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:15,844 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand 150 states. [2018-11-23 11:59:15,844 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand 150 states. [2018-11-23 11:59:15,845 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 150 states. [2018-11-23 11:59:15,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:15,849 INFO L93 Difference]: Finished difference Result 160 states and 212 transitions. [2018-11-23 11:59:15,849 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 212 transitions. [2018-11-23 11:59:15,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:15,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:15,850 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand 160 states. [2018-11-23 11:59:15,850 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 160 states. [2018-11-23 11:59:15,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:15,853 INFO L93 Difference]: Finished difference Result 160 states and 212 transitions. [2018-11-23 11:59:15,853 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 212 transitions. [2018-11-23 11:59:15,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:15,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:15,854 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:15,854 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:15,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-23 11:59:15,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 197 transitions. [2018-11-23 11:59:15,857 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 197 transitions. Word has length 70 [2018-11-23 11:59:15,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:15,857 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 197 transitions. [2018-11-23 11:59:15,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-23 11:59:15,858 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 197 transitions. [2018-11-23 11:59:15,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 11:59:15,858 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:15,859 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:59:15,859 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:15,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:15,859 INFO L82 PathProgramCache]: Analyzing trace with hash -2063492340, now seen corresponding path program 12 times [2018-11-23 11:59:15,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:15,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:15,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:15,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:15,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:15,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:16,485 INFO L256 TraceCheckUtils]: 0: Hoare triple {12603#true} call ULTIMATE.init(); {12603#true} is VALID [2018-11-23 11:59:16,486 INFO L273 TraceCheckUtils]: 1: Hoare triple {12603#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12603#true} is VALID [2018-11-23 11:59:16,486 INFO L273 TraceCheckUtils]: 2: Hoare triple {12603#true} assume true; {12603#true} is VALID [2018-11-23 11:59:16,486 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12603#true} {12603#true} #130#return; {12603#true} is VALID [2018-11-23 11:59:16,486 INFO L256 TraceCheckUtils]: 4: Hoare triple {12603#true} call #t~ret15 := main(); {12603#true} is VALID [2018-11-23 11:59:16,486 INFO L273 TraceCheckUtils]: 5: Hoare triple {12603#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {12605#(= main_~i~0 0)} is VALID [2018-11-23 11:59:16,487 INFO L273 TraceCheckUtils]: 6: Hoare triple {12605#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {12606#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:16,487 INFO L273 TraceCheckUtils]: 7: Hoare triple {12606#(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); {12606#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:16,488 INFO L273 TraceCheckUtils]: 8: Hoare triple {12606#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {12606#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:16,489 INFO L273 TraceCheckUtils]: 9: Hoare triple {12606#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {12607#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:16,489 INFO L273 TraceCheckUtils]: 10: Hoare triple {12607#(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); {12607#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:16,490 INFO L273 TraceCheckUtils]: 11: Hoare triple {12607#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {12607#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:16,491 INFO L273 TraceCheckUtils]: 12: Hoare triple {12607#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {12608#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:16,492 INFO L273 TraceCheckUtils]: 13: Hoare triple {12608#(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); {12608#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:16,493 INFO L273 TraceCheckUtils]: 14: Hoare triple {12608#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {12608#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:16,493 INFO L273 TraceCheckUtils]: 15: Hoare triple {12608#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {12609#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:16,494 INFO L273 TraceCheckUtils]: 16: Hoare triple {12609#(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); {12609#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:16,495 INFO L273 TraceCheckUtils]: 17: Hoare triple {12609#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {12609#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:16,496 INFO L273 TraceCheckUtils]: 18: Hoare triple {12609#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {12610#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:16,497 INFO L273 TraceCheckUtils]: 19: Hoare triple {12610#(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); {12610#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:16,498 INFO L273 TraceCheckUtils]: 20: Hoare triple {12610#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {12610#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:16,499 INFO L273 TraceCheckUtils]: 21: Hoare triple {12610#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {12611#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:16,499 INFO L273 TraceCheckUtils]: 22: Hoare triple {12611#(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); {12611#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:16,500 INFO L273 TraceCheckUtils]: 23: Hoare triple {12611#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {12611#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:16,501 INFO L273 TraceCheckUtils]: 24: Hoare triple {12611#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {12612#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:16,502 INFO L273 TraceCheckUtils]: 25: Hoare triple {12612#(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); {12612#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:16,502 INFO L273 TraceCheckUtils]: 26: Hoare triple {12612#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {12612#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:16,503 INFO L273 TraceCheckUtils]: 27: Hoare triple {12612#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {12613#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:16,504 INFO L273 TraceCheckUtils]: 28: Hoare triple {12613#(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); {12613#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:16,505 INFO L273 TraceCheckUtils]: 29: Hoare triple {12613#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {12613#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:16,506 INFO L273 TraceCheckUtils]: 30: Hoare triple {12613#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {12614#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:16,507 INFO L273 TraceCheckUtils]: 31: Hoare triple {12614#(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); {12614#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:16,507 INFO L273 TraceCheckUtils]: 32: Hoare triple {12614#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {12614#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:16,508 INFO L273 TraceCheckUtils]: 33: Hoare triple {12614#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {12615#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:16,509 INFO L273 TraceCheckUtils]: 34: Hoare triple {12615#(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); {12615#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:16,510 INFO L273 TraceCheckUtils]: 35: Hoare triple {12615#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {12615#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:16,511 INFO L273 TraceCheckUtils]: 36: Hoare triple {12615#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {12616#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:16,512 INFO L273 TraceCheckUtils]: 37: Hoare triple {12616#(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); {12616#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:16,513 INFO L273 TraceCheckUtils]: 38: Hoare triple {12616#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {12616#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:16,514 INFO L273 TraceCheckUtils]: 39: Hoare triple {12616#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {12617#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:16,515 INFO L273 TraceCheckUtils]: 40: Hoare triple {12617#(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); {12617#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:16,516 INFO L273 TraceCheckUtils]: 41: Hoare triple {12617#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {12617#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:16,517 INFO L273 TraceCheckUtils]: 42: Hoare triple {12617#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {12618#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:16,518 INFO L273 TraceCheckUtils]: 43: Hoare triple {12618#(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); {12618#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:16,519 INFO L273 TraceCheckUtils]: 44: Hoare triple {12618#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {12618#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:16,520 INFO L273 TraceCheckUtils]: 45: Hoare triple {12618#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {12619#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:16,521 INFO L273 TraceCheckUtils]: 46: Hoare triple {12619#(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); {12619#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:16,521 INFO L273 TraceCheckUtils]: 47: Hoare triple {12619#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {12619#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:16,522 INFO L273 TraceCheckUtils]: 48: Hoare triple {12619#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {12620#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:16,523 INFO L273 TraceCheckUtils]: 49: Hoare triple {12620#(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); {12620#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:16,524 INFO L273 TraceCheckUtils]: 50: Hoare triple {12620#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {12620#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:16,525 INFO L273 TraceCheckUtils]: 51: Hoare triple {12620#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {12621#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:16,526 INFO L273 TraceCheckUtils]: 52: Hoare triple {12621#(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); {12621#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:16,527 INFO L273 TraceCheckUtils]: 53: Hoare triple {12621#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {12621#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:16,528 INFO L273 TraceCheckUtils]: 54: Hoare triple {12621#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {12622#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:59:16,529 INFO L273 TraceCheckUtils]: 55: Hoare triple {12622#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} assume !(~k~0 < 100000); {12604#false} is VALID [2018-11-23 11:59:16,529 INFO L273 TraceCheckUtils]: 56: Hoare triple {12604#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); {12604#false} is VALID [2018-11-23 11:59:16,530 INFO L273 TraceCheckUtils]: 57: Hoare triple {12604#false} ~x~0 := 0; {12604#false} is VALID [2018-11-23 11:59:16,530 INFO L273 TraceCheckUtils]: 58: Hoare triple {12604#false} assume !(~x~0 < ~i~0); {12604#false} is VALID [2018-11-23 11:59:16,530 INFO L273 TraceCheckUtils]: 59: Hoare triple {12604#false} ~x~0 := ~i~0; {12604#false} is VALID [2018-11-23 11:59:16,530 INFO L273 TraceCheckUtils]: 60: Hoare triple {12604#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); {12604#false} is VALID [2018-11-23 11:59:16,531 INFO L256 TraceCheckUtils]: 61: Hoare triple {12604#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {12603#true} is VALID [2018-11-23 11:59:16,531 INFO L273 TraceCheckUtils]: 62: Hoare triple {12603#true} ~cond := #in~cond; {12603#true} is VALID [2018-11-23 11:59:16,531 INFO L273 TraceCheckUtils]: 63: Hoare triple {12603#true} assume !(0 == ~cond); {12603#true} is VALID [2018-11-23 11:59:16,531 INFO L273 TraceCheckUtils]: 64: Hoare triple {12603#true} assume true; {12603#true} is VALID [2018-11-23 11:59:16,532 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {12603#true} {12604#false} #136#return; {12604#false} is VALID [2018-11-23 11:59:16,532 INFO L273 TraceCheckUtils]: 66: Hoare triple {12604#false} havoc #t~mem9;havoc #t~mem10; {12604#false} is VALID [2018-11-23 11:59:16,532 INFO L273 TraceCheckUtils]: 67: Hoare triple {12604#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {12604#false} is VALID [2018-11-23 11:59:16,532 INFO L273 TraceCheckUtils]: 68: Hoare triple {12604#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); {12604#false} is VALID [2018-11-23 11:59:16,533 INFO L256 TraceCheckUtils]: 69: Hoare triple {12604#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {12604#false} is VALID [2018-11-23 11:59:16,533 INFO L273 TraceCheckUtils]: 70: Hoare triple {12604#false} ~cond := #in~cond; {12604#false} is VALID [2018-11-23 11:59:16,533 INFO L273 TraceCheckUtils]: 71: Hoare triple {12604#false} assume 0 == ~cond; {12604#false} is VALID [2018-11-23 11:59:16,534 INFO L273 TraceCheckUtils]: 72: Hoare triple {12604#false} assume !false; {12604#false} is VALID [2018-11-23 11:59:16,544 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:59:16,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:16,545 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:59:16,554 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:59:16,629 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2018-11-23 11:59:16,629 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:16,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:16,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:17,357 INFO L256 TraceCheckUtils]: 0: Hoare triple {12603#true} call ULTIMATE.init(); {12603#true} is VALID [2018-11-23 11:59:17,358 INFO L273 TraceCheckUtils]: 1: Hoare triple {12603#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12603#true} is VALID [2018-11-23 11:59:17,358 INFO L273 TraceCheckUtils]: 2: Hoare triple {12603#true} assume true; {12603#true} is VALID [2018-11-23 11:59:17,358 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12603#true} {12603#true} #130#return; {12603#true} is VALID [2018-11-23 11:59:17,358 INFO L256 TraceCheckUtils]: 4: Hoare triple {12603#true} call #t~ret15 := main(); {12603#true} is VALID [2018-11-23 11:59:17,359 INFO L273 TraceCheckUtils]: 5: Hoare triple {12603#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {12641#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:17,360 INFO L273 TraceCheckUtils]: 6: Hoare triple {12641#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {12645#(<= main_~k~0 1)} is VALID [2018-11-23 11:59:17,361 INFO L273 TraceCheckUtils]: 7: Hoare triple {12645#(<= 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); {12645#(<= main_~k~0 1)} is VALID [2018-11-23 11:59:17,361 INFO L273 TraceCheckUtils]: 8: Hoare triple {12645#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {12645#(<= main_~k~0 1)} is VALID [2018-11-23 11:59:17,362 INFO L273 TraceCheckUtils]: 9: Hoare triple {12645#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {12655#(<= main_~k~0 2)} is VALID [2018-11-23 11:59:17,363 INFO L273 TraceCheckUtils]: 10: Hoare triple {12655#(<= 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); {12655#(<= main_~k~0 2)} is VALID [2018-11-23 11:59:17,363 INFO L273 TraceCheckUtils]: 11: Hoare triple {12655#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {12655#(<= main_~k~0 2)} is VALID [2018-11-23 11:59:17,364 INFO L273 TraceCheckUtils]: 12: Hoare triple {12655#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {12665#(<= main_~k~0 3)} is VALID [2018-11-23 11:59:17,365 INFO L273 TraceCheckUtils]: 13: Hoare triple {12665#(<= 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); {12665#(<= main_~k~0 3)} is VALID [2018-11-23 11:59:17,365 INFO L273 TraceCheckUtils]: 14: Hoare triple {12665#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {12665#(<= main_~k~0 3)} is VALID [2018-11-23 11:59:17,366 INFO L273 TraceCheckUtils]: 15: Hoare triple {12665#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {12675#(<= main_~k~0 4)} is VALID [2018-11-23 11:59:17,366 INFO L273 TraceCheckUtils]: 16: Hoare triple {12675#(<= 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); {12675#(<= main_~k~0 4)} is VALID [2018-11-23 11:59:17,367 INFO L273 TraceCheckUtils]: 17: Hoare triple {12675#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {12675#(<= main_~k~0 4)} is VALID [2018-11-23 11:59:17,368 INFO L273 TraceCheckUtils]: 18: Hoare triple {12675#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {12685#(<= main_~k~0 5)} is VALID [2018-11-23 11:59:17,368 INFO L273 TraceCheckUtils]: 19: Hoare triple {12685#(<= 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); {12685#(<= main_~k~0 5)} is VALID [2018-11-23 11:59:17,369 INFO L273 TraceCheckUtils]: 20: Hoare triple {12685#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {12685#(<= main_~k~0 5)} is VALID [2018-11-23 11:59:17,369 INFO L273 TraceCheckUtils]: 21: Hoare triple {12685#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {12695#(<= main_~k~0 6)} is VALID [2018-11-23 11:59:17,370 INFO L273 TraceCheckUtils]: 22: Hoare triple {12695#(<= 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); {12695#(<= main_~k~0 6)} is VALID [2018-11-23 11:59:17,371 INFO L273 TraceCheckUtils]: 23: Hoare triple {12695#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {12695#(<= main_~k~0 6)} is VALID [2018-11-23 11:59:17,371 INFO L273 TraceCheckUtils]: 24: Hoare triple {12695#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {12705#(<= main_~k~0 7)} is VALID [2018-11-23 11:59:17,372 INFO L273 TraceCheckUtils]: 25: Hoare triple {12705#(<= 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); {12705#(<= main_~k~0 7)} is VALID [2018-11-23 11:59:17,372 INFO L273 TraceCheckUtils]: 26: Hoare triple {12705#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {12705#(<= main_~k~0 7)} is VALID [2018-11-23 11:59:17,373 INFO L273 TraceCheckUtils]: 27: Hoare triple {12705#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {12715#(<= main_~k~0 8)} is VALID [2018-11-23 11:59:17,374 INFO L273 TraceCheckUtils]: 28: Hoare triple {12715#(<= 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); {12715#(<= main_~k~0 8)} is VALID [2018-11-23 11:59:17,374 INFO L273 TraceCheckUtils]: 29: Hoare triple {12715#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {12715#(<= main_~k~0 8)} is VALID [2018-11-23 11:59:17,375 INFO L273 TraceCheckUtils]: 30: Hoare triple {12715#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {12725#(<= main_~k~0 9)} is VALID [2018-11-23 11:59:17,375 INFO L273 TraceCheckUtils]: 31: Hoare triple {12725#(<= 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); {12725#(<= main_~k~0 9)} is VALID [2018-11-23 11:59:17,376 INFO L273 TraceCheckUtils]: 32: Hoare triple {12725#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {12725#(<= main_~k~0 9)} is VALID [2018-11-23 11:59:17,377 INFO L273 TraceCheckUtils]: 33: Hoare triple {12725#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {12735#(<= main_~k~0 10)} is VALID [2018-11-23 11:59:17,377 INFO L273 TraceCheckUtils]: 34: Hoare triple {12735#(<= 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); {12735#(<= main_~k~0 10)} is VALID [2018-11-23 11:59:17,378 INFO L273 TraceCheckUtils]: 35: Hoare triple {12735#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {12735#(<= main_~k~0 10)} is VALID [2018-11-23 11:59:17,379 INFO L273 TraceCheckUtils]: 36: Hoare triple {12735#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {12745#(<= main_~k~0 11)} is VALID [2018-11-23 11:59:17,379 INFO L273 TraceCheckUtils]: 37: Hoare triple {12745#(<= 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); {12745#(<= main_~k~0 11)} is VALID [2018-11-23 11:59:17,380 INFO L273 TraceCheckUtils]: 38: Hoare triple {12745#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {12745#(<= main_~k~0 11)} is VALID [2018-11-23 11:59:17,380 INFO L273 TraceCheckUtils]: 39: Hoare triple {12745#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {12755#(<= main_~k~0 12)} is VALID [2018-11-23 11:59:17,381 INFO L273 TraceCheckUtils]: 40: Hoare triple {12755#(<= 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); {12755#(<= main_~k~0 12)} is VALID [2018-11-23 11:59:17,381 INFO L273 TraceCheckUtils]: 41: Hoare triple {12755#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {12755#(<= main_~k~0 12)} is VALID [2018-11-23 11:59:17,382 INFO L273 TraceCheckUtils]: 42: Hoare triple {12755#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {12765#(<= main_~k~0 13)} is VALID [2018-11-23 11:59:17,383 INFO L273 TraceCheckUtils]: 43: Hoare triple {12765#(<= 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); {12765#(<= main_~k~0 13)} is VALID [2018-11-23 11:59:17,383 INFO L273 TraceCheckUtils]: 44: Hoare triple {12765#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {12765#(<= main_~k~0 13)} is VALID [2018-11-23 11:59:17,384 INFO L273 TraceCheckUtils]: 45: Hoare triple {12765#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {12775#(<= main_~k~0 14)} is VALID [2018-11-23 11:59:17,385 INFO L273 TraceCheckUtils]: 46: Hoare triple {12775#(<= 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); {12775#(<= main_~k~0 14)} is VALID [2018-11-23 11:59:17,385 INFO L273 TraceCheckUtils]: 47: Hoare triple {12775#(<= main_~k~0 14)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {12775#(<= main_~k~0 14)} is VALID [2018-11-23 11:59:17,386 INFO L273 TraceCheckUtils]: 48: Hoare triple {12775#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {12785#(<= main_~k~0 15)} is VALID [2018-11-23 11:59:17,386 INFO L273 TraceCheckUtils]: 49: Hoare triple {12785#(<= 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); {12785#(<= main_~k~0 15)} is VALID [2018-11-23 11:59:17,387 INFO L273 TraceCheckUtils]: 50: Hoare triple {12785#(<= main_~k~0 15)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {12785#(<= main_~k~0 15)} is VALID [2018-11-23 11:59:17,388 INFO L273 TraceCheckUtils]: 51: Hoare triple {12785#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {12795#(<= main_~k~0 16)} is VALID [2018-11-23 11:59:17,388 INFO L273 TraceCheckUtils]: 52: Hoare triple {12795#(<= 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); {12795#(<= main_~k~0 16)} is VALID [2018-11-23 11:59:17,389 INFO L273 TraceCheckUtils]: 53: Hoare triple {12795#(<= main_~k~0 16)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {12795#(<= main_~k~0 16)} is VALID [2018-11-23 11:59:17,389 INFO L273 TraceCheckUtils]: 54: Hoare triple {12795#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {12805#(<= main_~k~0 17)} is VALID [2018-11-23 11:59:17,390 INFO L273 TraceCheckUtils]: 55: Hoare triple {12805#(<= main_~k~0 17)} assume !(~k~0 < 100000); {12604#false} is VALID [2018-11-23 11:59:17,390 INFO L273 TraceCheckUtils]: 56: Hoare triple {12604#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); {12604#false} is VALID [2018-11-23 11:59:17,391 INFO L273 TraceCheckUtils]: 57: Hoare triple {12604#false} ~x~0 := 0; {12604#false} is VALID [2018-11-23 11:59:17,391 INFO L273 TraceCheckUtils]: 58: Hoare triple {12604#false} assume !(~x~0 < ~i~0); {12604#false} is VALID [2018-11-23 11:59:17,391 INFO L273 TraceCheckUtils]: 59: Hoare triple {12604#false} ~x~0 := ~i~0; {12604#false} is VALID [2018-11-23 11:59:17,391 INFO L273 TraceCheckUtils]: 60: Hoare triple {12604#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); {12604#false} is VALID [2018-11-23 11:59:17,391 INFO L256 TraceCheckUtils]: 61: Hoare triple {12604#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {12604#false} is VALID [2018-11-23 11:59:17,392 INFO L273 TraceCheckUtils]: 62: Hoare triple {12604#false} ~cond := #in~cond; {12604#false} is VALID [2018-11-23 11:59:17,392 INFO L273 TraceCheckUtils]: 63: Hoare triple {12604#false} assume !(0 == ~cond); {12604#false} is VALID [2018-11-23 11:59:17,392 INFO L273 TraceCheckUtils]: 64: Hoare triple {12604#false} assume true; {12604#false} is VALID [2018-11-23 11:59:17,392 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {12604#false} {12604#false} #136#return; {12604#false} is VALID [2018-11-23 11:59:17,392 INFO L273 TraceCheckUtils]: 66: Hoare triple {12604#false} havoc #t~mem9;havoc #t~mem10; {12604#false} is VALID [2018-11-23 11:59:17,392 INFO L273 TraceCheckUtils]: 67: Hoare triple {12604#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {12604#false} is VALID [2018-11-23 11:59:17,393 INFO L273 TraceCheckUtils]: 68: Hoare triple {12604#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); {12604#false} is VALID [2018-11-23 11:59:17,393 INFO L256 TraceCheckUtils]: 69: Hoare triple {12604#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {12604#false} is VALID [2018-11-23 11:59:17,393 INFO L273 TraceCheckUtils]: 70: Hoare triple {12604#false} ~cond := #in~cond; {12604#false} is VALID [2018-11-23 11:59:17,393 INFO L273 TraceCheckUtils]: 71: Hoare triple {12604#false} assume 0 == ~cond; {12604#false} is VALID [2018-11-23 11:59:17,393 INFO L273 TraceCheckUtils]: 72: Hoare triple {12604#false} assume !false; {12604#false} is VALID [2018-11-23 11:59:17,396 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:59:17,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:17,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2018-11-23 11:59:17,416 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 73 [2018-11-23 11:59:17,416 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:17,416 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2018-11-23 11:59:17,542 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:17,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-23 11:59:17,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-23 11:59:17,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=533, Invalid=873, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 11:59:17,544 INFO L87 Difference]: Start difference. First operand 150 states and 197 transitions. Second operand 38 states. [2018-11-23 11:59:18,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:18,604 INFO L93 Difference]: Finished difference Result 213 states and 283 transitions. [2018-11-23 11:59:18,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 11:59:18,604 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 73 [2018-11-23 11:59:18,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:18,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 11:59:18,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 175 transitions. [2018-11-23 11:59:18,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 11:59:18,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 175 transitions. [2018-11-23 11:59:18,607 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 175 transitions. [2018-11-23 11:59:18,872 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:59:18,876 INFO L225 Difference]: With dead ends: 213 [2018-11-23 11:59:18,876 INFO L226 Difference]: Without dead ends: 166 [2018-11-23 11:59:18,877 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:59:18,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-11-23 11:59:18,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 156. [2018-11-23 11:59:18,954 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:18,954 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand 156 states. [2018-11-23 11:59:18,954 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand 156 states. [2018-11-23 11:59:18,954 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 156 states. [2018-11-23 11:59:18,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:18,958 INFO L93 Difference]: Finished difference Result 166 states and 220 transitions. [2018-11-23 11:59:18,958 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 220 transitions. [2018-11-23 11:59:18,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:18,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:18,959 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand 166 states. [2018-11-23 11:59:18,959 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 166 states. [2018-11-23 11:59:18,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:18,962 INFO L93 Difference]: Finished difference Result 166 states and 220 transitions. [2018-11-23 11:59:18,962 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 220 transitions. [2018-11-23 11:59:18,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:18,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:18,962 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:18,962 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:18,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-11-23 11:59:18,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 205 transitions. [2018-11-23 11:59:18,965 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 205 transitions. Word has length 73 [2018-11-23 11:59:18,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:18,965 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 205 transitions. [2018-11-23 11:59:18,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-23 11:59:18,965 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 205 transitions. [2018-11-23 11:59:18,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 11:59:18,966 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:18,966 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:59:18,966 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:18,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:18,966 INFO L82 PathProgramCache]: Analyzing trace with hash -797157903, now seen corresponding path program 13 times [2018-11-23 11:59:18,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:18,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:18,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:18,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:18,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:18,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:19,425 INFO L256 TraceCheckUtils]: 0: Hoare triple {13694#true} call ULTIMATE.init(); {13694#true} is VALID [2018-11-23 11:59:19,425 INFO L273 TraceCheckUtils]: 1: Hoare triple {13694#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13694#true} is VALID [2018-11-23 11:59:19,426 INFO L273 TraceCheckUtils]: 2: Hoare triple {13694#true} assume true; {13694#true} is VALID [2018-11-23 11:59:19,426 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13694#true} {13694#true} #130#return; {13694#true} is VALID [2018-11-23 11:59:19,426 INFO L256 TraceCheckUtils]: 4: Hoare triple {13694#true} call #t~ret15 := main(); {13694#true} is VALID [2018-11-23 11:59:19,427 INFO L273 TraceCheckUtils]: 5: Hoare triple {13694#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {13696#(= main_~i~0 0)} is VALID [2018-11-23 11:59:19,427 INFO L273 TraceCheckUtils]: 6: Hoare triple {13696#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {13697#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:19,428 INFO L273 TraceCheckUtils]: 7: Hoare triple {13697#(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); {13697#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:19,429 INFO L273 TraceCheckUtils]: 8: Hoare triple {13697#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {13697#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:19,430 INFO L273 TraceCheckUtils]: 9: Hoare triple {13697#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {13698#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:19,431 INFO L273 TraceCheckUtils]: 10: Hoare triple {13698#(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); {13698#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:19,431 INFO L273 TraceCheckUtils]: 11: Hoare triple {13698#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {13698#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:19,432 INFO L273 TraceCheckUtils]: 12: Hoare triple {13698#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {13699#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:19,433 INFO L273 TraceCheckUtils]: 13: Hoare triple {13699#(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); {13699#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:19,434 INFO L273 TraceCheckUtils]: 14: Hoare triple {13699#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {13699#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:19,435 INFO L273 TraceCheckUtils]: 15: Hoare triple {13699#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {13700#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:19,435 INFO L273 TraceCheckUtils]: 16: Hoare triple {13700#(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); {13700#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:19,436 INFO L273 TraceCheckUtils]: 17: Hoare triple {13700#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {13700#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:19,437 INFO L273 TraceCheckUtils]: 18: Hoare triple {13700#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {13701#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:19,438 INFO L273 TraceCheckUtils]: 19: Hoare triple {13701#(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); {13701#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:19,439 INFO L273 TraceCheckUtils]: 20: Hoare triple {13701#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {13701#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:19,440 INFO L273 TraceCheckUtils]: 21: Hoare triple {13701#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {13702#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:19,441 INFO L273 TraceCheckUtils]: 22: Hoare triple {13702#(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); {13702#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:19,441 INFO L273 TraceCheckUtils]: 23: Hoare triple {13702#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {13702#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:19,442 INFO L273 TraceCheckUtils]: 24: Hoare triple {13702#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {13703#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:19,443 INFO L273 TraceCheckUtils]: 25: Hoare triple {13703#(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); {13703#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:19,444 INFO L273 TraceCheckUtils]: 26: Hoare triple {13703#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {13703#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:19,445 INFO L273 TraceCheckUtils]: 27: Hoare triple {13703#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {13704#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:19,445 INFO L273 TraceCheckUtils]: 28: Hoare triple {13704#(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); {13704#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:19,446 INFO L273 TraceCheckUtils]: 29: Hoare triple {13704#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {13704#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:19,447 INFO L273 TraceCheckUtils]: 30: Hoare triple {13704#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {13705#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:19,448 INFO L273 TraceCheckUtils]: 31: Hoare triple {13705#(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); {13705#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:19,448 INFO L273 TraceCheckUtils]: 32: Hoare triple {13705#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {13705#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:19,449 INFO L273 TraceCheckUtils]: 33: Hoare triple {13705#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {13706#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:19,450 INFO L273 TraceCheckUtils]: 34: Hoare triple {13706#(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); {13706#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:19,451 INFO L273 TraceCheckUtils]: 35: Hoare triple {13706#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {13706#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:19,452 INFO L273 TraceCheckUtils]: 36: Hoare triple {13706#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {13707#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:19,453 INFO L273 TraceCheckUtils]: 37: Hoare triple {13707#(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); {13707#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:19,454 INFO L273 TraceCheckUtils]: 38: Hoare triple {13707#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {13707#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:19,454 INFO L273 TraceCheckUtils]: 39: Hoare triple {13707#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {13708#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:19,455 INFO L273 TraceCheckUtils]: 40: Hoare triple {13708#(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); {13708#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:19,456 INFO L273 TraceCheckUtils]: 41: Hoare triple {13708#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {13708#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:19,457 INFO L273 TraceCheckUtils]: 42: Hoare triple {13708#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {13709#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:19,458 INFO L273 TraceCheckUtils]: 43: Hoare triple {13709#(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); {13709#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:19,458 INFO L273 TraceCheckUtils]: 44: Hoare triple {13709#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {13709#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:19,459 INFO L273 TraceCheckUtils]: 45: Hoare triple {13709#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {13710#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:19,460 INFO L273 TraceCheckUtils]: 46: Hoare triple {13710#(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); {13710#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:19,461 INFO L273 TraceCheckUtils]: 47: Hoare triple {13710#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {13710#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:19,462 INFO L273 TraceCheckUtils]: 48: Hoare triple {13710#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {13711#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:19,462 INFO L273 TraceCheckUtils]: 49: Hoare triple {13711#(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); {13711#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:19,463 INFO L273 TraceCheckUtils]: 50: Hoare triple {13711#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {13711#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:19,464 INFO L273 TraceCheckUtils]: 51: Hoare triple {13711#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {13712#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:19,465 INFO L273 TraceCheckUtils]: 52: Hoare triple {13712#(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); {13712#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:19,466 INFO L273 TraceCheckUtils]: 53: Hoare triple {13712#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {13712#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:19,478 INFO L273 TraceCheckUtils]: 54: Hoare triple {13712#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {13713#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:59:19,478 INFO L273 TraceCheckUtils]: 55: Hoare triple {13713#(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); {13713#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:59:19,479 INFO L273 TraceCheckUtils]: 56: Hoare triple {13713#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {13713#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:59:19,479 INFO L273 TraceCheckUtils]: 57: Hoare triple {13713#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} ~k~0 := 1 + ~k~0; {13714#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:19,480 INFO L273 TraceCheckUtils]: 58: Hoare triple {13714#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} assume !(~k~0 < 100000); {13695#false} is VALID [2018-11-23 11:59:19,480 INFO L273 TraceCheckUtils]: 59: Hoare triple {13695#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); {13695#false} is VALID [2018-11-23 11:59:19,480 INFO L273 TraceCheckUtils]: 60: Hoare triple {13695#false} ~x~0 := 0; {13695#false} is VALID [2018-11-23 11:59:19,480 INFO L273 TraceCheckUtils]: 61: Hoare triple {13695#false} assume !(~x~0 < ~i~0); {13695#false} is VALID [2018-11-23 11:59:19,480 INFO L273 TraceCheckUtils]: 62: Hoare triple {13695#false} ~x~0 := ~i~0; {13695#false} is VALID [2018-11-23 11:59:19,480 INFO L273 TraceCheckUtils]: 63: Hoare triple {13695#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); {13695#false} is VALID [2018-11-23 11:59:19,481 INFO L256 TraceCheckUtils]: 64: Hoare triple {13695#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {13694#true} is VALID [2018-11-23 11:59:19,481 INFO L273 TraceCheckUtils]: 65: Hoare triple {13694#true} ~cond := #in~cond; {13694#true} is VALID [2018-11-23 11:59:19,481 INFO L273 TraceCheckUtils]: 66: Hoare triple {13694#true} assume !(0 == ~cond); {13694#true} is VALID [2018-11-23 11:59:19,481 INFO L273 TraceCheckUtils]: 67: Hoare triple {13694#true} assume true; {13694#true} is VALID [2018-11-23 11:59:19,481 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {13694#true} {13695#false} #136#return; {13695#false} is VALID [2018-11-23 11:59:19,481 INFO L273 TraceCheckUtils]: 69: Hoare triple {13695#false} havoc #t~mem9;havoc #t~mem10; {13695#false} is VALID [2018-11-23 11:59:19,481 INFO L273 TraceCheckUtils]: 70: Hoare triple {13695#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {13695#false} is VALID [2018-11-23 11:59:19,482 INFO L273 TraceCheckUtils]: 71: Hoare triple {13695#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); {13695#false} is VALID [2018-11-23 11:59:19,482 INFO L256 TraceCheckUtils]: 72: Hoare triple {13695#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {13695#false} is VALID [2018-11-23 11:59:19,482 INFO L273 TraceCheckUtils]: 73: Hoare triple {13695#false} ~cond := #in~cond; {13695#false} is VALID [2018-11-23 11:59:19,482 INFO L273 TraceCheckUtils]: 74: Hoare triple {13695#false} assume 0 == ~cond; {13695#false} is VALID [2018-11-23 11:59:19,482 INFO L273 TraceCheckUtils]: 75: Hoare triple {13695#false} assume !false; {13695#false} is VALID [2018-11-23 11:59:19,490 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:59:19,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:19,490 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:59:19,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:19,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:19,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:19,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:20,305 INFO L256 TraceCheckUtils]: 0: Hoare triple {13694#true} call ULTIMATE.init(); {13694#true} is VALID [2018-11-23 11:59:20,306 INFO L273 TraceCheckUtils]: 1: Hoare triple {13694#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13694#true} is VALID [2018-11-23 11:59:20,306 INFO L273 TraceCheckUtils]: 2: Hoare triple {13694#true} assume true; {13694#true} is VALID [2018-11-23 11:59:20,306 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13694#true} {13694#true} #130#return; {13694#true} is VALID [2018-11-23 11:59:20,307 INFO L256 TraceCheckUtils]: 4: Hoare triple {13694#true} call #t~ret15 := main(); {13694#true} is VALID [2018-11-23 11:59:20,307 INFO L273 TraceCheckUtils]: 5: Hoare triple {13694#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {13733#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:20,308 INFO L273 TraceCheckUtils]: 6: Hoare triple {13733#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {13737#(<= main_~k~0 1)} is VALID [2018-11-23 11:59:20,308 INFO L273 TraceCheckUtils]: 7: Hoare triple {13737#(<= 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); {13737#(<= main_~k~0 1)} is VALID [2018-11-23 11:59:20,309 INFO L273 TraceCheckUtils]: 8: Hoare triple {13737#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {13737#(<= main_~k~0 1)} is VALID [2018-11-23 11:59:20,309 INFO L273 TraceCheckUtils]: 9: Hoare triple {13737#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {13747#(<= main_~k~0 2)} is VALID [2018-11-23 11:59:20,309 INFO L273 TraceCheckUtils]: 10: Hoare triple {13747#(<= 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); {13747#(<= main_~k~0 2)} is VALID [2018-11-23 11:59:20,310 INFO L273 TraceCheckUtils]: 11: Hoare triple {13747#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {13747#(<= main_~k~0 2)} is VALID [2018-11-23 11:59:20,310 INFO L273 TraceCheckUtils]: 12: Hoare triple {13747#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {13757#(<= main_~k~0 3)} is VALID [2018-11-23 11:59:20,310 INFO L273 TraceCheckUtils]: 13: Hoare triple {13757#(<= 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); {13757#(<= main_~k~0 3)} is VALID [2018-11-23 11:59:20,311 INFO L273 TraceCheckUtils]: 14: Hoare triple {13757#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {13757#(<= main_~k~0 3)} is VALID [2018-11-23 11:59:20,312 INFO L273 TraceCheckUtils]: 15: Hoare triple {13757#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {13767#(<= main_~k~0 4)} is VALID [2018-11-23 11:59:20,312 INFO L273 TraceCheckUtils]: 16: Hoare triple {13767#(<= 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); {13767#(<= main_~k~0 4)} is VALID [2018-11-23 11:59:20,313 INFO L273 TraceCheckUtils]: 17: Hoare triple {13767#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {13767#(<= main_~k~0 4)} is VALID [2018-11-23 11:59:20,313 INFO L273 TraceCheckUtils]: 18: Hoare triple {13767#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {13777#(<= main_~k~0 5)} is VALID [2018-11-23 11:59:20,314 INFO L273 TraceCheckUtils]: 19: Hoare triple {13777#(<= 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); {13777#(<= main_~k~0 5)} is VALID [2018-11-23 11:59:20,314 INFO L273 TraceCheckUtils]: 20: Hoare triple {13777#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {13777#(<= main_~k~0 5)} is VALID [2018-11-23 11:59:20,315 INFO L273 TraceCheckUtils]: 21: Hoare triple {13777#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {13787#(<= main_~k~0 6)} is VALID [2018-11-23 11:59:20,316 INFO L273 TraceCheckUtils]: 22: Hoare triple {13787#(<= 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); {13787#(<= main_~k~0 6)} is VALID [2018-11-23 11:59:20,316 INFO L273 TraceCheckUtils]: 23: Hoare triple {13787#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {13787#(<= main_~k~0 6)} is VALID [2018-11-23 11:59:20,317 INFO L273 TraceCheckUtils]: 24: Hoare triple {13787#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {13797#(<= main_~k~0 7)} is VALID [2018-11-23 11:59:20,317 INFO L273 TraceCheckUtils]: 25: Hoare triple {13797#(<= 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); {13797#(<= main_~k~0 7)} is VALID [2018-11-23 11:59:20,318 INFO L273 TraceCheckUtils]: 26: Hoare triple {13797#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {13797#(<= main_~k~0 7)} is VALID [2018-11-23 11:59:20,319 INFO L273 TraceCheckUtils]: 27: Hoare triple {13797#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {13807#(<= main_~k~0 8)} is VALID [2018-11-23 11:59:20,319 INFO L273 TraceCheckUtils]: 28: Hoare triple {13807#(<= 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); {13807#(<= main_~k~0 8)} is VALID [2018-11-23 11:59:20,320 INFO L273 TraceCheckUtils]: 29: Hoare triple {13807#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {13807#(<= main_~k~0 8)} is VALID [2018-11-23 11:59:20,321 INFO L273 TraceCheckUtils]: 30: Hoare triple {13807#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {13817#(<= main_~k~0 9)} is VALID [2018-11-23 11:59:20,321 INFO L273 TraceCheckUtils]: 31: Hoare triple {13817#(<= 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); {13817#(<= main_~k~0 9)} is VALID [2018-11-23 11:59:20,322 INFO L273 TraceCheckUtils]: 32: Hoare triple {13817#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {13817#(<= main_~k~0 9)} is VALID [2018-11-23 11:59:20,322 INFO L273 TraceCheckUtils]: 33: Hoare triple {13817#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {13827#(<= main_~k~0 10)} is VALID [2018-11-23 11:59:20,323 INFO L273 TraceCheckUtils]: 34: Hoare triple {13827#(<= 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); {13827#(<= main_~k~0 10)} is VALID [2018-11-23 11:59:20,323 INFO L273 TraceCheckUtils]: 35: Hoare triple {13827#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {13827#(<= main_~k~0 10)} is VALID [2018-11-23 11:59:20,324 INFO L273 TraceCheckUtils]: 36: Hoare triple {13827#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {13837#(<= main_~k~0 11)} is VALID [2018-11-23 11:59:20,325 INFO L273 TraceCheckUtils]: 37: Hoare triple {13837#(<= 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); {13837#(<= main_~k~0 11)} is VALID [2018-11-23 11:59:20,325 INFO L273 TraceCheckUtils]: 38: Hoare triple {13837#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {13837#(<= main_~k~0 11)} is VALID [2018-11-23 11:59:20,326 INFO L273 TraceCheckUtils]: 39: Hoare triple {13837#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {13847#(<= main_~k~0 12)} is VALID [2018-11-23 11:59:20,326 INFO L273 TraceCheckUtils]: 40: Hoare triple {13847#(<= 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); {13847#(<= main_~k~0 12)} is VALID [2018-11-23 11:59:20,327 INFO L273 TraceCheckUtils]: 41: Hoare triple {13847#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {13847#(<= main_~k~0 12)} is VALID [2018-11-23 11:59:20,328 INFO L273 TraceCheckUtils]: 42: Hoare triple {13847#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {13857#(<= main_~k~0 13)} is VALID [2018-11-23 11:59:20,328 INFO L273 TraceCheckUtils]: 43: Hoare triple {13857#(<= 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); {13857#(<= main_~k~0 13)} is VALID [2018-11-23 11:59:20,329 INFO L273 TraceCheckUtils]: 44: Hoare triple {13857#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {13857#(<= main_~k~0 13)} is VALID [2018-11-23 11:59:20,329 INFO L273 TraceCheckUtils]: 45: Hoare triple {13857#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {13867#(<= main_~k~0 14)} is VALID [2018-11-23 11:59:20,330 INFO L273 TraceCheckUtils]: 46: Hoare triple {13867#(<= 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); {13867#(<= main_~k~0 14)} is VALID [2018-11-23 11:59:20,331 INFO L273 TraceCheckUtils]: 47: Hoare triple {13867#(<= main_~k~0 14)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {13867#(<= main_~k~0 14)} is VALID [2018-11-23 11:59:20,331 INFO L273 TraceCheckUtils]: 48: Hoare triple {13867#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {13877#(<= main_~k~0 15)} is VALID [2018-11-23 11:59:20,332 INFO L273 TraceCheckUtils]: 49: Hoare triple {13877#(<= 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); {13877#(<= main_~k~0 15)} is VALID [2018-11-23 11:59:20,332 INFO L273 TraceCheckUtils]: 50: Hoare triple {13877#(<= main_~k~0 15)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {13877#(<= main_~k~0 15)} is VALID [2018-11-23 11:59:20,333 INFO L273 TraceCheckUtils]: 51: Hoare triple {13877#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {13887#(<= main_~k~0 16)} is VALID [2018-11-23 11:59:20,334 INFO L273 TraceCheckUtils]: 52: Hoare triple {13887#(<= 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); {13887#(<= main_~k~0 16)} is VALID [2018-11-23 11:59:20,334 INFO L273 TraceCheckUtils]: 53: Hoare triple {13887#(<= main_~k~0 16)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {13887#(<= main_~k~0 16)} is VALID [2018-11-23 11:59:20,335 INFO L273 TraceCheckUtils]: 54: Hoare triple {13887#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {13897#(<= main_~k~0 17)} is VALID [2018-11-23 11:59:20,335 INFO L273 TraceCheckUtils]: 55: Hoare triple {13897#(<= 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); {13897#(<= main_~k~0 17)} is VALID [2018-11-23 11:59:20,336 INFO L273 TraceCheckUtils]: 56: Hoare triple {13897#(<= main_~k~0 17)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {13897#(<= main_~k~0 17)} is VALID [2018-11-23 11:59:20,337 INFO L273 TraceCheckUtils]: 57: Hoare triple {13897#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {13907#(<= main_~k~0 18)} is VALID [2018-11-23 11:59:20,337 INFO L273 TraceCheckUtils]: 58: Hoare triple {13907#(<= main_~k~0 18)} assume !(~k~0 < 100000); {13695#false} is VALID [2018-11-23 11:59:20,338 INFO L273 TraceCheckUtils]: 59: Hoare triple {13695#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); {13695#false} is VALID [2018-11-23 11:59:20,338 INFO L273 TraceCheckUtils]: 60: Hoare triple {13695#false} ~x~0 := 0; {13695#false} is VALID [2018-11-23 11:59:20,338 INFO L273 TraceCheckUtils]: 61: Hoare triple {13695#false} assume !(~x~0 < ~i~0); {13695#false} is VALID [2018-11-23 11:59:20,338 INFO L273 TraceCheckUtils]: 62: Hoare triple {13695#false} ~x~0 := ~i~0; {13695#false} is VALID [2018-11-23 11:59:20,338 INFO L273 TraceCheckUtils]: 63: Hoare triple {13695#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); {13695#false} is VALID [2018-11-23 11:59:20,339 INFO L256 TraceCheckUtils]: 64: Hoare triple {13695#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {13695#false} is VALID [2018-11-23 11:59:20,339 INFO L273 TraceCheckUtils]: 65: Hoare triple {13695#false} ~cond := #in~cond; {13695#false} is VALID [2018-11-23 11:59:20,339 INFO L273 TraceCheckUtils]: 66: Hoare triple {13695#false} assume !(0 == ~cond); {13695#false} is VALID [2018-11-23 11:59:20,339 INFO L273 TraceCheckUtils]: 67: Hoare triple {13695#false} assume true; {13695#false} is VALID [2018-11-23 11:59:20,339 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {13695#false} {13695#false} #136#return; {13695#false} is VALID [2018-11-23 11:59:20,340 INFO L273 TraceCheckUtils]: 69: Hoare triple {13695#false} havoc #t~mem9;havoc #t~mem10; {13695#false} is VALID [2018-11-23 11:59:20,340 INFO L273 TraceCheckUtils]: 70: Hoare triple {13695#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {13695#false} is VALID [2018-11-23 11:59:20,340 INFO L273 TraceCheckUtils]: 71: Hoare triple {13695#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); {13695#false} is VALID [2018-11-23 11:59:20,340 INFO L256 TraceCheckUtils]: 72: Hoare triple {13695#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {13695#false} is VALID [2018-11-23 11:59:20,340 INFO L273 TraceCheckUtils]: 73: Hoare triple {13695#false} ~cond := #in~cond; {13695#false} is VALID [2018-11-23 11:59:20,341 INFO L273 TraceCheckUtils]: 74: Hoare triple {13695#false} assume 0 == ~cond; {13695#false} is VALID [2018-11-23 11:59:20,341 INFO L273 TraceCheckUtils]: 75: Hoare triple {13695#false} assume !false; {13695#false} is VALID [2018-11-23 11:59:20,345 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:59:20,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:20,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2018-11-23 11:59:20,364 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 76 [2018-11-23 11:59:20,365 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:20,365 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states. [2018-11-23 11:59:20,499 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:59:20,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-23 11:59:20,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-23 11:59:20,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=591, Invalid=969, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 11:59:20,501 INFO L87 Difference]: Start difference. First operand 156 states and 205 transitions. Second operand 40 states. [2018-11-23 11:59:21,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:21,314 INFO L93 Difference]: Finished difference Result 219 states and 291 transitions. [2018-11-23 11:59:21,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 11:59:21,314 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 76 [2018-11-23 11:59:21,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:21,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 11:59:21,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 179 transitions. [2018-11-23 11:59:21,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 11:59:21,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 179 transitions. [2018-11-23 11:59:21,318 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 179 transitions. [2018-11-23 11:59:21,489 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:59:21,493 INFO L225 Difference]: With dead ends: 219 [2018-11-23 11:59:21,493 INFO L226 Difference]: Without dead ends: 172 [2018-11-23 11:59:21,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=591, Invalid=969, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 11:59:21,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-11-23 11:59:21,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 162. [2018-11-23 11:59:21,591 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:21,591 INFO L82 GeneralOperation]: Start isEquivalent. First operand 172 states. Second operand 162 states. [2018-11-23 11:59:21,592 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand 162 states. [2018-11-23 11:59:21,592 INFO L87 Difference]: Start difference. First operand 172 states. Second operand 162 states. [2018-11-23 11:59:21,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:21,596 INFO L93 Difference]: Finished difference Result 172 states and 228 transitions. [2018-11-23 11:59:21,596 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 228 transitions. [2018-11-23 11:59:21,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:21,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:21,597 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand 172 states. [2018-11-23 11:59:21,597 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 172 states. [2018-11-23 11:59:21,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:21,600 INFO L93 Difference]: Finished difference Result 172 states and 228 transitions. [2018-11-23 11:59:21,600 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 228 transitions. [2018-11-23 11:59:21,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:21,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:21,601 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:21,601 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:21,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-11-23 11:59:21,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 213 transitions. [2018-11-23 11:59:21,604 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 213 transitions. Word has length 76 [2018-11-23 11:59:21,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:21,605 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 213 transitions. [2018-11-23 11:59:21,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-23 11:59:21,605 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 213 transitions. [2018-11-23 11:59:21,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 11:59:21,606 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:21,606 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:59:21,606 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:21,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:21,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1874293996, now seen corresponding path program 14 times [2018-11-23 11:59:21,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:21,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:21,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:21,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:21,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:21,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:22,434 INFO L256 TraceCheckUtils]: 0: Hoare triple {14824#true} call ULTIMATE.init(); {14824#true} is VALID [2018-11-23 11:59:22,434 INFO L273 TraceCheckUtils]: 1: Hoare triple {14824#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14824#true} is VALID [2018-11-23 11:59:22,435 INFO L273 TraceCheckUtils]: 2: Hoare triple {14824#true} assume true; {14824#true} is VALID [2018-11-23 11:59:22,435 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14824#true} {14824#true} #130#return; {14824#true} is VALID [2018-11-23 11:59:22,435 INFO L256 TraceCheckUtils]: 4: Hoare triple {14824#true} call #t~ret15 := main(); {14824#true} is VALID [2018-11-23 11:59:22,436 INFO L273 TraceCheckUtils]: 5: Hoare triple {14824#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {14826#(= main_~i~0 0)} is VALID [2018-11-23 11:59:22,436 INFO L273 TraceCheckUtils]: 6: Hoare triple {14826#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {14827#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:22,437 INFO L273 TraceCheckUtils]: 7: Hoare triple {14827#(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); {14827#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:22,438 INFO L273 TraceCheckUtils]: 8: Hoare triple {14827#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {14827#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:22,439 INFO L273 TraceCheckUtils]: 9: Hoare triple {14827#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {14828#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:22,440 INFO L273 TraceCheckUtils]: 10: Hoare triple {14828#(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); {14828#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:22,440 INFO L273 TraceCheckUtils]: 11: Hoare triple {14828#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {14828#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:22,441 INFO L273 TraceCheckUtils]: 12: Hoare triple {14828#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {14829#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:22,442 INFO L273 TraceCheckUtils]: 13: Hoare triple {14829#(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); {14829#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:22,443 INFO L273 TraceCheckUtils]: 14: Hoare triple {14829#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {14829#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:22,444 INFO L273 TraceCheckUtils]: 15: Hoare triple {14829#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {14830#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:22,445 INFO L273 TraceCheckUtils]: 16: Hoare triple {14830#(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); {14830#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:22,445 INFO L273 TraceCheckUtils]: 17: Hoare triple {14830#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {14830#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:22,446 INFO L273 TraceCheckUtils]: 18: Hoare triple {14830#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {14831#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:22,447 INFO L273 TraceCheckUtils]: 19: Hoare triple {14831#(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); {14831#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:22,448 INFO L273 TraceCheckUtils]: 20: Hoare triple {14831#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {14831#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:22,449 INFO L273 TraceCheckUtils]: 21: Hoare triple {14831#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {14832#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:22,450 INFO L273 TraceCheckUtils]: 22: Hoare triple {14832#(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); {14832#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:22,450 INFO L273 TraceCheckUtils]: 23: Hoare triple {14832#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {14832#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:22,451 INFO L273 TraceCheckUtils]: 24: Hoare triple {14832#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {14833#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:22,452 INFO L273 TraceCheckUtils]: 25: Hoare triple {14833#(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); {14833#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:22,453 INFO L273 TraceCheckUtils]: 26: Hoare triple {14833#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {14833#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:22,454 INFO L273 TraceCheckUtils]: 27: Hoare triple {14833#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {14834#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:22,455 INFO L273 TraceCheckUtils]: 28: Hoare triple {14834#(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); {14834#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:22,455 INFO L273 TraceCheckUtils]: 29: Hoare triple {14834#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {14834#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:22,456 INFO L273 TraceCheckUtils]: 30: Hoare triple {14834#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {14835#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:22,457 INFO L273 TraceCheckUtils]: 31: Hoare triple {14835#(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); {14835#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:22,458 INFO L273 TraceCheckUtils]: 32: Hoare triple {14835#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {14835#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:22,459 INFO L273 TraceCheckUtils]: 33: Hoare triple {14835#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {14836#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:22,459 INFO L273 TraceCheckUtils]: 34: Hoare triple {14836#(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); {14836#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:22,460 INFO L273 TraceCheckUtils]: 35: Hoare triple {14836#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {14836#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:22,461 INFO L273 TraceCheckUtils]: 36: Hoare triple {14836#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {14837#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:22,462 INFO L273 TraceCheckUtils]: 37: Hoare triple {14837#(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); {14837#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:22,463 INFO L273 TraceCheckUtils]: 38: Hoare triple {14837#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {14837#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:22,464 INFO L273 TraceCheckUtils]: 39: Hoare triple {14837#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {14838#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:22,464 INFO L273 TraceCheckUtils]: 40: Hoare triple {14838#(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); {14838#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:22,465 INFO L273 TraceCheckUtils]: 41: Hoare triple {14838#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {14838#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:22,466 INFO L273 TraceCheckUtils]: 42: Hoare triple {14838#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {14839#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:22,467 INFO L273 TraceCheckUtils]: 43: Hoare triple {14839#(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); {14839#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:22,468 INFO L273 TraceCheckUtils]: 44: Hoare triple {14839#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {14839#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:22,468 INFO L273 TraceCheckUtils]: 45: Hoare triple {14839#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {14840#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:22,469 INFO L273 TraceCheckUtils]: 46: Hoare triple {14840#(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); {14840#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:22,470 INFO L273 TraceCheckUtils]: 47: Hoare triple {14840#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {14840#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:22,471 INFO L273 TraceCheckUtils]: 48: Hoare triple {14840#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {14841#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:22,472 INFO L273 TraceCheckUtils]: 49: Hoare triple {14841#(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); {14841#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:22,472 INFO L273 TraceCheckUtils]: 50: Hoare triple {14841#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {14841#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:22,473 INFO L273 TraceCheckUtils]: 51: Hoare triple {14841#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {14842#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:22,474 INFO L273 TraceCheckUtils]: 52: Hoare triple {14842#(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); {14842#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:22,475 INFO L273 TraceCheckUtils]: 53: Hoare triple {14842#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {14842#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:22,476 INFO L273 TraceCheckUtils]: 54: Hoare triple {14842#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {14843#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:59:22,477 INFO L273 TraceCheckUtils]: 55: Hoare triple {14843#(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); {14843#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:59:22,478 INFO L273 TraceCheckUtils]: 56: Hoare triple {14843#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {14843#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:59:22,478 INFO L273 TraceCheckUtils]: 57: Hoare triple {14843#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} ~k~0 := 1 + ~k~0; {14844#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:22,479 INFO L273 TraceCheckUtils]: 58: Hoare triple {14844#(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); {14844#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:22,480 INFO L273 TraceCheckUtils]: 59: Hoare triple {14844#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {14844#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:22,481 INFO L273 TraceCheckUtils]: 60: Hoare triple {14844#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {14845#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:22,482 INFO L273 TraceCheckUtils]: 61: Hoare triple {14845#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} assume !(~k~0 < 100000); {14825#false} is VALID [2018-11-23 11:59:22,482 INFO L273 TraceCheckUtils]: 62: Hoare triple {14825#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); {14825#false} is VALID [2018-11-23 11:59:22,482 INFO L273 TraceCheckUtils]: 63: Hoare triple {14825#false} ~x~0 := 0; {14825#false} is VALID [2018-11-23 11:59:22,482 INFO L273 TraceCheckUtils]: 64: Hoare triple {14825#false} assume !(~x~0 < ~i~0); {14825#false} is VALID [2018-11-23 11:59:22,482 INFO L273 TraceCheckUtils]: 65: Hoare triple {14825#false} ~x~0 := ~i~0; {14825#false} is VALID [2018-11-23 11:59:22,483 INFO L273 TraceCheckUtils]: 66: Hoare triple {14825#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); {14825#false} is VALID [2018-11-23 11:59:22,483 INFO L256 TraceCheckUtils]: 67: Hoare triple {14825#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {14824#true} is VALID [2018-11-23 11:59:22,483 INFO L273 TraceCheckUtils]: 68: Hoare triple {14824#true} ~cond := #in~cond; {14824#true} is VALID [2018-11-23 11:59:22,483 INFO L273 TraceCheckUtils]: 69: Hoare triple {14824#true} assume !(0 == ~cond); {14824#true} is VALID [2018-11-23 11:59:22,483 INFO L273 TraceCheckUtils]: 70: Hoare triple {14824#true} assume true; {14824#true} is VALID [2018-11-23 11:59:22,484 INFO L268 TraceCheckUtils]: 71: Hoare quadruple {14824#true} {14825#false} #136#return; {14825#false} is VALID [2018-11-23 11:59:22,484 INFO L273 TraceCheckUtils]: 72: Hoare triple {14825#false} havoc #t~mem9;havoc #t~mem10; {14825#false} is VALID [2018-11-23 11:59:22,484 INFO L273 TraceCheckUtils]: 73: Hoare triple {14825#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {14825#false} is VALID [2018-11-23 11:59:22,484 INFO L273 TraceCheckUtils]: 74: Hoare triple {14825#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); {14825#false} is VALID [2018-11-23 11:59:22,484 INFO L256 TraceCheckUtils]: 75: Hoare triple {14825#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {14825#false} is VALID [2018-11-23 11:59:22,485 INFO L273 TraceCheckUtils]: 76: Hoare triple {14825#false} ~cond := #in~cond; {14825#false} is VALID [2018-11-23 11:59:22,485 INFO L273 TraceCheckUtils]: 77: Hoare triple {14825#false} assume 0 == ~cond; {14825#false} is VALID [2018-11-23 11:59:22,485 INFO L273 TraceCheckUtils]: 78: Hoare triple {14825#false} assume !false; {14825#false} is VALID [2018-11-23 11:59:22,494 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:59:22,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:22,494 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:59:22,503 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:59:22,545 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:59:22,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:22,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:22,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:23,639 INFO L256 TraceCheckUtils]: 0: Hoare triple {14824#true} call ULTIMATE.init(); {14824#true} is VALID [2018-11-23 11:59:23,639 INFO L273 TraceCheckUtils]: 1: Hoare triple {14824#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14824#true} is VALID [2018-11-23 11:59:23,639 INFO L273 TraceCheckUtils]: 2: Hoare triple {14824#true} assume true; {14824#true} is VALID [2018-11-23 11:59:23,640 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14824#true} {14824#true} #130#return; {14824#true} is VALID [2018-11-23 11:59:23,640 INFO L256 TraceCheckUtils]: 4: Hoare triple {14824#true} call #t~ret15 := main(); {14824#true} is VALID [2018-11-23 11:59:23,641 INFO L273 TraceCheckUtils]: 5: Hoare triple {14824#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {14864#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:23,641 INFO L273 TraceCheckUtils]: 6: Hoare triple {14864#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {14868#(<= main_~k~0 1)} is VALID [2018-11-23 11:59:23,642 INFO L273 TraceCheckUtils]: 7: Hoare triple {14868#(<= 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); {14868#(<= main_~k~0 1)} is VALID [2018-11-23 11:59:23,642 INFO L273 TraceCheckUtils]: 8: Hoare triple {14868#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {14868#(<= main_~k~0 1)} is VALID [2018-11-23 11:59:23,642 INFO L273 TraceCheckUtils]: 9: Hoare triple {14868#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {14878#(<= main_~k~0 2)} is VALID [2018-11-23 11:59:23,643 INFO L273 TraceCheckUtils]: 10: Hoare triple {14878#(<= 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); {14878#(<= main_~k~0 2)} is VALID [2018-11-23 11:59:23,643 INFO L273 TraceCheckUtils]: 11: Hoare triple {14878#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {14878#(<= main_~k~0 2)} is VALID [2018-11-23 11:59:23,644 INFO L273 TraceCheckUtils]: 12: Hoare triple {14878#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {14888#(<= main_~k~0 3)} is VALID [2018-11-23 11:59:23,644 INFO L273 TraceCheckUtils]: 13: Hoare triple {14888#(<= 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); {14888#(<= main_~k~0 3)} is VALID [2018-11-23 11:59:23,645 INFO L273 TraceCheckUtils]: 14: Hoare triple {14888#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {14888#(<= main_~k~0 3)} is VALID [2018-11-23 11:59:23,646 INFO L273 TraceCheckUtils]: 15: Hoare triple {14888#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {14898#(<= main_~k~0 4)} is VALID [2018-11-23 11:59:23,646 INFO L273 TraceCheckUtils]: 16: Hoare triple {14898#(<= 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); {14898#(<= main_~k~0 4)} is VALID [2018-11-23 11:59:23,647 INFO L273 TraceCheckUtils]: 17: Hoare triple {14898#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {14898#(<= main_~k~0 4)} is VALID [2018-11-23 11:59:23,647 INFO L273 TraceCheckUtils]: 18: Hoare triple {14898#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {14908#(<= main_~k~0 5)} is VALID [2018-11-23 11:59:23,648 INFO L273 TraceCheckUtils]: 19: Hoare triple {14908#(<= 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); {14908#(<= main_~k~0 5)} is VALID [2018-11-23 11:59:23,649 INFO L273 TraceCheckUtils]: 20: Hoare triple {14908#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {14908#(<= main_~k~0 5)} is VALID [2018-11-23 11:59:23,649 INFO L273 TraceCheckUtils]: 21: Hoare triple {14908#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {14918#(<= main_~k~0 6)} is VALID [2018-11-23 11:59:23,650 INFO L273 TraceCheckUtils]: 22: Hoare triple {14918#(<= 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); {14918#(<= main_~k~0 6)} is VALID [2018-11-23 11:59:23,650 INFO L273 TraceCheckUtils]: 23: Hoare triple {14918#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {14918#(<= main_~k~0 6)} is VALID [2018-11-23 11:59:23,651 INFO L273 TraceCheckUtils]: 24: Hoare triple {14918#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {14928#(<= main_~k~0 7)} is VALID [2018-11-23 11:59:23,652 INFO L273 TraceCheckUtils]: 25: Hoare triple {14928#(<= 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); {14928#(<= main_~k~0 7)} is VALID [2018-11-23 11:59:23,652 INFO L273 TraceCheckUtils]: 26: Hoare triple {14928#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {14928#(<= main_~k~0 7)} is VALID [2018-11-23 11:59:23,653 INFO L273 TraceCheckUtils]: 27: Hoare triple {14928#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {14938#(<= main_~k~0 8)} is VALID [2018-11-23 11:59:23,653 INFO L273 TraceCheckUtils]: 28: Hoare triple {14938#(<= 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); {14938#(<= main_~k~0 8)} is VALID [2018-11-23 11:59:23,654 INFO L273 TraceCheckUtils]: 29: Hoare triple {14938#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {14938#(<= main_~k~0 8)} is VALID [2018-11-23 11:59:23,655 INFO L273 TraceCheckUtils]: 30: Hoare triple {14938#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {14948#(<= main_~k~0 9)} is VALID [2018-11-23 11:59:23,655 INFO L273 TraceCheckUtils]: 31: Hoare triple {14948#(<= 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); {14948#(<= main_~k~0 9)} is VALID [2018-11-23 11:59:23,656 INFO L273 TraceCheckUtils]: 32: Hoare triple {14948#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {14948#(<= main_~k~0 9)} is VALID [2018-11-23 11:59:23,656 INFO L273 TraceCheckUtils]: 33: Hoare triple {14948#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {14958#(<= main_~k~0 10)} is VALID [2018-11-23 11:59:23,657 INFO L273 TraceCheckUtils]: 34: Hoare triple {14958#(<= 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); {14958#(<= main_~k~0 10)} is VALID [2018-11-23 11:59:23,658 INFO L273 TraceCheckUtils]: 35: Hoare triple {14958#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {14958#(<= main_~k~0 10)} is VALID [2018-11-23 11:59:23,658 INFO L273 TraceCheckUtils]: 36: Hoare triple {14958#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {14968#(<= main_~k~0 11)} is VALID [2018-11-23 11:59:23,659 INFO L273 TraceCheckUtils]: 37: Hoare triple {14968#(<= 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); {14968#(<= main_~k~0 11)} is VALID [2018-11-23 11:59:23,659 INFO L273 TraceCheckUtils]: 38: Hoare triple {14968#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {14968#(<= main_~k~0 11)} is VALID [2018-11-23 11:59:23,660 INFO L273 TraceCheckUtils]: 39: Hoare triple {14968#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {14978#(<= main_~k~0 12)} is VALID [2018-11-23 11:59:23,661 INFO L273 TraceCheckUtils]: 40: Hoare triple {14978#(<= 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); {14978#(<= main_~k~0 12)} is VALID [2018-11-23 11:59:23,661 INFO L273 TraceCheckUtils]: 41: Hoare triple {14978#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {14978#(<= main_~k~0 12)} is VALID [2018-11-23 11:59:23,662 INFO L273 TraceCheckUtils]: 42: Hoare triple {14978#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {14988#(<= main_~k~0 13)} is VALID [2018-11-23 11:59:23,662 INFO L273 TraceCheckUtils]: 43: Hoare triple {14988#(<= 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); {14988#(<= main_~k~0 13)} is VALID [2018-11-23 11:59:23,663 INFO L273 TraceCheckUtils]: 44: Hoare triple {14988#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {14988#(<= main_~k~0 13)} is VALID [2018-11-23 11:59:23,664 INFO L273 TraceCheckUtils]: 45: Hoare triple {14988#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {14998#(<= main_~k~0 14)} is VALID [2018-11-23 11:59:23,664 INFO L273 TraceCheckUtils]: 46: Hoare triple {14998#(<= 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); {14998#(<= main_~k~0 14)} is VALID [2018-11-23 11:59:23,665 INFO L273 TraceCheckUtils]: 47: Hoare triple {14998#(<= main_~k~0 14)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {14998#(<= main_~k~0 14)} is VALID [2018-11-23 11:59:23,666 INFO L273 TraceCheckUtils]: 48: Hoare triple {14998#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {15008#(<= main_~k~0 15)} is VALID [2018-11-23 11:59:23,666 INFO L273 TraceCheckUtils]: 49: Hoare triple {15008#(<= 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); {15008#(<= main_~k~0 15)} is VALID [2018-11-23 11:59:23,667 INFO L273 TraceCheckUtils]: 50: Hoare triple {15008#(<= main_~k~0 15)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {15008#(<= main_~k~0 15)} is VALID [2018-11-23 11:59:23,667 INFO L273 TraceCheckUtils]: 51: Hoare triple {15008#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {15018#(<= main_~k~0 16)} is VALID [2018-11-23 11:59:23,668 INFO L273 TraceCheckUtils]: 52: Hoare triple {15018#(<= 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); {15018#(<= main_~k~0 16)} is VALID [2018-11-23 11:59:23,668 INFO L273 TraceCheckUtils]: 53: Hoare triple {15018#(<= main_~k~0 16)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {15018#(<= main_~k~0 16)} is VALID [2018-11-23 11:59:23,669 INFO L273 TraceCheckUtils]: 54: Hoare triple {15018#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {15028#(<= main_~k~0 17)} is VALID [2018-11-23 11:59:23,670 INFO L273 TraceCheckUtils]: 55: Hoare triple {15028#(<= 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); {15028#(<= main_~k~0 17)} is VALID [2018-11-23 11:59:23,670 INFO L273 TraceCheckUtils]: 56: Hoare triple {15028#(<= main_~k~0 17)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {15028#(<= main_~k~0 17)} is VALID [2018-11-23 11:59:23,671 INFO L273 TraceCheckUtils]: 57: Hoare triple {15028#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {15038#(<= main_~k~0 18)} is VALID [2018-11-23 11:59:23,672 INFO L273 TraceCheckUtils]: 58: Hoare triple {15038#(<= 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); {15038#(<= main_~k~0 18)} is VALID [2018-11-23 11:59:23,672 INFO L273 TraceCheckUtils]: 59: Hoare triple {15038#(<= main_~k~0 18)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {15038#(<= main_~k~0 18)} is VALID [2018-11-23 11:59:23,673 INFO L273 TraceCheckUtils]: 60: Hoare triple {15038#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {15048#(<= main_~k~0 19)} is VALID [2018-11-23 11:59:23,673 INFO L273 TraceCheckUtils]: 61: Hoare triple {15048#(<= main_~k~0 19)} assume !(~k~0 < 100000); {14825#false} is VALID [2018-11-23 11:59:23,674 INFO L273 TraceCheckUtils]: 62: Hoare triple {14825#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); {14825#false} is VALID [2018-11-23 11:59:23,674 INFO L273 TraceCheckUtils]: 63: Hoare triple {14825#false} ~x~0 := 0; {14825#false} is VALID [2018-11-23 11:59:23,674 INFO L273 TraceCheckUtils]: 64: Hoare triple {14825#false} assume !(~x~0 < ~i~0); {14825#false} is VALID [2018-11-23 11:59:23,674 INFO L273 TraceCheckUtils]: 65: Hoare triple {14825#false} ~x~0 := ~i~0; {14825#false} is VALID [2018-11-23 11:59:23,675 INFO L273 TraceCheckUtils]: 66: Hoare triple {14825#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); {14825#false} is VALID [2018-11-23 11:59:23,675 INFO L256 TraceCheckUtils]: 67: Hoare triple {14825#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {14825#false} is VALID [2018-11-23 11:59:23,675 INFO L273 TraceCheckUtils]: 68: Hoare triple {14825#false} ~cond := #in~cond; {14825#false} is VALID [2018-11-23 11:59:23,675 INFO L273 TraceCheckUtils]: 69: Hoare triple {14825#false} assume !(0 == ~cond); {14825#false} is VALID [2018-11-23 11:59:23,675 INFO L273 TraceCheckUtils]: 70: Hoare triple {14825#false} assume true; {14825#false} is VALID [2018-11-23 11:59:23,676 INFO L268 TraceCheckUtils]: 71: Hoare quadruple {14825#false} {14825#false} #136#return; {14825#false} is VALID [2018-11-23 11:59:23,676 INFO L273 TraceCheckUtils]: 72: Hoare triple {14825#false} havoc #t~mem9;havoc #t~mem10; {14825#false} is VALID [2018-11-23 11:59:23,676 INFO L273 TraceCheckUtils]: 73: Hoare triple {14825#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {14825#false} is VALID [2018-11-23 11:59:23,676 INFO L273 TraceCheckUtils]: 74: Hoare triple {14825#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); {14825#false} is VALID [2018-11-23 11:59:23,676 INFO L256 TraceCheckUtils]: 75: Hoare triple {14825#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {14825#false} is VALID [2018-11-23 11:59:23,676 INFO L273 TraceCheckUtils]: 76: Hoare triple {14825#false} ~cond := #in~cond; {14825#false} is VALID [2018-11-23 11:59:23,677 INFO L273 TraceCheckUtils]: 77: Hoare triple {14825#false} assume 0 == ~cond; {14825#false} is VALID [2018-11-23 11:59:23,677 INFO L273 TraceCheckUtils]: 78: Hoare triple {14825#false} assume !false; {14825#false} is VALID [2018-11-23 11:59:23,681 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:59:23,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:23,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 42 [2018-11-23 11:59:23,701 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 79 [2018-11-23 11:59:23,701 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:23,701 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-23 11:59:23,851 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:23,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 11:59:23,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 11:59:23,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=652, Invalid=1070, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 11:59:23,853 INFO L87 Difference]: Start difference. First operand 162 states and 213 transitions. Second operand 42 states. [2018-11-23 11:59:24,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:24,626 INFO L93 Difference]: Finished difference Result 225 states and 299 transitions. [2018-11-23 11:59:24,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 11:59:24,626 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 79 [2018-11-23 11:59:24,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:24,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 11:59:24,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 183 transitions. [2018-11-23 11:59:24,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 11:59:24,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 183 transitions. [2018-11-23 11:59:24,630 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 183 transitions. [2018-11-23 11:59:24,863 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:59:24,867 INFO L225 Difference]: With dead ends: 225 [2018-11-23 11:59:24,868 INFO L226 Difference]: Without dead ends: 178 [2018-11-23 11:59:24,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=652, Invalid=1070, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 11:59:24,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-11-23 11:59:24,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 168. [2018-11-23 11:59:24,972 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:24,973 INFO L82 GeneralOperation]: Start isEquivalent. First operand 178 states. Second operand 168 states. [2018-11-23 11:59:24,973 INFO L74 IsIncluded]: Start isIncluded. First operand 178 states. Second operand 168 states. [2018-11-23 11:59:24,973 INFO L87 Difference]: Start difference. First operand 178 states. Second operand 168 states. [2018-11-23 11:59:24,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:24,976 INFO L93 Difference]: Finished difference Result 178 states and 236 transitions. [2018-11-23 11:59:24,976 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 236 transitions. [2018-11-23 11:59:24,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:24,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:24,977 INFO L74 IsIncluded]: Start isIncluded. First operand 168 states. Second operand 178 states. [2018-11-23 11:59:24,977 INFO L87 Difference]: Start difference. First operand 168 states. Second operand 178 states. [2018-11-23 11:59:24,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:24,981 INFO L93 Difference]: Finished difference Result 178 states and 236 transitions. [2018-11-23 11:59:24,981 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 236 transitions. [2018-11-23 11:59:24,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:24,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:24,982 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:24,982 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:24,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-11-23 11:59:24,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 221 transitions. [2018-11-23 11:59:24,986 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 221 transitions. Word has length 79 [2018-11-23 11:59:24,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:24,986 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 221 transitions. [2018-11-23 11:59:24,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 11:59:24,987 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 221 transitions. [2018-11-23 11:59:24,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-23 11:59:24,988 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:24,988 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:59:24,988 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:24,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:24,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1353822225, now seen corresponding path program 15 times [2018-11-23 11:59:24,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:24,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:24,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:24,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:24,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:25,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:25,546 INFO L256 TraceCheckUtils]: 0: Hoare triple {15993#true} call ULTIMATE.init(); {15993#true} is VALID [2018-11-23 11:59:25,546 INFO L273 TraceCheckUtils]: 1: Hoare triple {15993#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15993#true} is VALID [2018-11-23 11:59:25,546 INFO L273 TraceCheckUtils]: 2: Hoare triple {15993#true} assume true; {15993#true} is VALID [2018-11-23 11:59:25,546 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15993#true} {15993#true} #130#return; {15993#true} is VALID [2018-11-23 11:59:25,546 INFO L256 TraceCheckUtils]: 4: Hoare triple {15993#true} call #t~ret15 := main(); {15993#true} is VALID [2018-11-23 11:59:25,547 INFO L273 TraceCheckUtils]: 5: Hoare triple {15993#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {15995#(= main_~i~0 0)} is VALID [2018-11-23 11:59:25,547 INFO L273 TraceCheckUtils]: 6: Hoare triple {15995#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {15996#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:25,548 INFO L273 TraceCheckUtils]: 7: Hoare triple {15996#(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); {15996#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:25,548 INFO L273 TraceCheckUtils]: 8: Hoare triple {15996#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {15996#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:25,549 INFO L273 TraceCheckUtils]: 9: Hoare triple {15996#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {15997#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:25,550 INFO L273 TraceCheckUtils]: 10: Hoare triple {15997#(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); {15997#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:25,551 INFO L273 TraceCheckUtils]: 11: Hoare triple {15997#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {15997#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:25,552 INFO L273 TraceCheckUtils]: 12: Hoare triple {15997#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {15998#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:25,552 INFO L273 TraceCheckUtils]: 13: Hoare triple {15998#(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); {15998#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:25,553 INFO L273 TraceCheckUtils]: 14: Hoare triple {15998#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {15998#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:25,554 INFO L273 TraceCheckUtils]: 15: Hoare triple {15998#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {15999#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:25,555 INFO L273 TraceCheckUtils]: 16: Hoare triple {15999#(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); {15999#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:25,556 INFO L273 TraceCheckUtils]: 17: Hoare triple {15999#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {15999#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:25,556 INFO L273 TraceCheckUtils]: 18: Hoare triple {15999#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {16000#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:25,557 INFO L273 TraceCheckUtils]: 19: Hoare triple {16000#(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); {16000#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:25,558 INFO L273 TraceCheckUtils]: 20: Hoare triple {16000#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {16000#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:25,559 INFO L273 TraceCheckUtils]: 21: Hoare triple {16000#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {16001#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:25,560 INFO L273 TraceCheckUtils]: 22: Hoare triple {16001#(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); {16001#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:25,561 INFO L273 TraceCheckUtils]: 23: Hoare triple {16001#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {16001#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:25,562 INFO L273 TraceCheckUtils]: 24: Hoare triple {16001#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {16002#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:25,562 INFO L273 TraceCheckUtils]: 25: Hoare triple {16002#(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); {16002#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:25,563 INFO L273 TraceCheckUtils]: 26: Hoare triple {16002#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {16002#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:25,564 INFO L273 TraceCheckUtils]: 27: Hoare triple {16002#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {16003#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:25,565 INFO L273 TraceCheckUtils]: 28: Hoare triple {16003#(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); {16003#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:25,566 INFO L273 TraceCheckUtils]: 29: Hoare triple {16003#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {16003#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:25,566 INFO L273 TraceCheckUtils]: 30: Hoare triple {16003#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {16004#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:25,567 INFO L273 TraceCheckUtils]: 31: Hoare triple {16004#(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); {16004#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:25,568 INFO L273 TraceCheckUtils]: 32: Hoare triple {16004#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {16004#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:25,569 INFO L273 TraceCheckUtils]: 33: Hoare triple {16004#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {16005#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:25,570 INFO L273 TraceCheckUtils]: 34: Hoare triple {16005#(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); {16005#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:25,570 INFO L273 TraceCheckUtils]: 35: Hoare triple {16005#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {16005#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:25,571 INFO L273 TraceCheckUtils]: 36: Hoare triple {16005#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {16006#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:25,572 INFO L273 TraceCheckUtils]: 37: Hoare triple {16006#(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); {16006#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:25,573 INFO L273 TraceCheckUtils]: 38: Hoare triple {16006#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {16006#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:25,574 INFO L273 TraceCheckUtils]: 39: Hoare triple {16006#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {16007#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:25,575 INFO L273 TraceCheckUtils]: 40: Hoare triple {16007#(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); {16007#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:25,576 INFO L273 TraceCheckUtils]: 41: Hoare triple {16007#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {16007#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:25,576 INFO L273 TraceCheckUtils]: 42: Hoare triple {16007#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {16008#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:25,577 INFO L273 TraceCheckUtils]: 43: Hoare triple {16008#(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); {16008#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:25,578 INFO L273 TraceCheckUtils]: 44: Hoare triple {16008#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {16008#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:25,579 INFO L273 TraceCheckUtils]: 45: Hoare triple {16008#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {16009#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:25,580 INFO L273 TraceCheckUtils]: 46: Hoare triple {16009#(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); {16009#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:25,580 INFO L273 TraceCheckUtils]: 47: Hoare triple {16009#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {16009#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:25,581 INFO L273 TraceCheckUtils]: 48: Hoare triple {16009#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {16010#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:25,582 INFO L273 TraceCheckUtils]: 49: Hoare triple {16010#(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); {16010#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:25,583 INFO L273 TraceCheckUtils]: 50: Hoare triple {16010#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {16010#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:25,584 INFO L273 TraceCheckUtils]: 51: Hoare triple {16010#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {16011#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:25,585 INFO L273 TraceCheckUtils]: 52: Hoare triple {16011#(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); {16011#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:25,585 INFO L273 TraceCheckUtils]: 53: Hoare triple {16011#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {16011#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:25,586 INFO L273 TraceCheckUtils]: 54: Hoare triple {16011#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {16012#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:59:25,587 INFO L273 TraceCheckUtils]: 55: Hoare triple {16012#(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); {16012#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:59:25,588 INFO L273 TraceCheckUtils]: 56: Hoare triple {16012#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {16012#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:59:25,589 INFO L273 TraceCheckUtils]: 57: Hoare triple {16012#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} ~k~0 := 1 + ~k~0; {16013#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:25,590 INFO L273 TraceCheckUtils]: 58: Hoare triple {16013#(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); {16013#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:25,590 INFO L273 TraceCheckUtils]: 59: Hoare triple {16013#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {16013#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:25,591 INFO L273 TraceCheckUtils]: 60: Hoare triple {16013#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {16014#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:25,592 INFO L273 TraceCheckUtils]: 61: Hoare triple {16014#(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); {16014#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:25,593 INFO L273 TraceCheckUtils]: 62: Hoare triple {16014#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {16014#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:25,594 INFO L273 TraceCheckUtils]: 63: Hoare triple {16014#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {16015#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:25,594 INFO L273 TraceCheckUtils]: 64: Hoare triple {16015#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} assume !(~k~0 < 100000); {15994#false} is VALID [2018-11-23 11:59:25,595 INFO L273 TraceCheckUtils]: 65: Hoare triple {15994#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); {15994#false} is VALID [2018-11-23 11:59:25,595 INFO L273 TraceCheckUtils]: 66: Hoare triple {15994#false} ~x~0 := 0; {15994#false} is VALID [2018-11-23 11:59:25,595 INFO L273 TraceCheckUtils]: 67: Hoare triple {15994#false} assume !(~x~0 < ~i~0); {15994#false} is VALID [2018-11-23 11:59:25,595 INFO L273 TraceCheckUtils]: 68: Hoare triple {15994#false} ~x~0 := ~i~0; {15994#false} is VALID [2018-11-23 11:59:25,596 INFO L273 TraceCheckUtils]: 69: Hoare triple {15994#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); {15994#false} is VALID [2018-11-23 11:59:25,596 INFO L256 TraceCheckUtils]: 70: Hoare triple {15994#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {15993#true} is VALID [2018-11-23 11:59:25,596 INFO L273 TraceCheckUtils]: 71: Hoare triple {15993#true} ~cond := #in~cond; {15993#true} is VALID [2018-11-23 11:59:25,596 INFO L273 TraceCheckUtils]: 72: Hoare triple {15993#true} assume !(0 == ~cond); {15993#true} is VALID [2018-11-23 11:59:25,596 INFO L273 TraceCheckUtils]: 73: Hoare triple {15993#true} assume true; {15993#true} is VALID [2018-11-23 11:59:25,597 INFO L268 TraceCheckUtils]: 74: Hoare quadruple {15993#true} {15994#false} #136#return; {15994#false} is VALID [2018-11-23 11:59:25,597 INFO L273 TraceCheckUtils]: 75: Hoare triple {15994#false} havoc #t~mem9;havoc #t~mem10; {15994#false} is VALID [2018-11-23 11:59:25,597 INFO L273 TraceCheckUtils]: 76: Hoare triple {15994#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {15994#false} is VALID [2018-11-23 11:59:25,597 INFO L273 TraceCheckUtils]: 77: Hoare triple {15994#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); {15994#false} is VALID [2018-11-23 11:59:25,597 INFO L256 TraceCheckUtils]: 78: Hoare triple {15994#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {15994#false} is VALID [2018-11-23 11:59:25,598 INFO L273 TraceCheckUtils]: 79: Hoare triple {15994#false} ~cond := #in~cond; {15994#false} is VALID [2018-11-23 11:59:25,598 INFO L273 TraceCheckUtils]: 80: Hoare triple {15994#false} assume 0 == ~cond; {15994#false} is VALID [2018-11-23 11:59:25,598 INFO L273 TraceCheckUtils]: 81: Hoare triple {15994#false} assume !false; {15994#false} is VALID [2018-11-23 11:59:25,607 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:59:25,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:25,607 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:59:25,617 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:59:25,703 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-11-23 11:59:25,703 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:25,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:25,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:26,232 INFO L256 TraceCheckUtils]: 0: Hoare triple {15993#true} call ULTIMATE.init(); {15993#true} is VALID [2018-11-23 11:59:26,232 INFO L273 TraceCheckUtils]: 1: Hoare triple {15993#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15993#true} is VALID [2018-11-23 11:59:26,233 INFO L273 TraceCheckUtils]: 2: Hoare triple {15993#true} assume true; {15993#true} is VALID [2018-11-23 11:59:26,233 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15993#true} {15993#true} #130#return; {15993#true} is VALID [2018-11-23 11:59:26,233 INFO L256 TraceCheckUtils]: 4: Hoare triple {15993#true} call #t~ret15 := main(); {15993#true} is VALID [2018-11-23 11:59:26,234 INFO L273 TraceCheckUtils]: 5: Hoare triple {15993#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {16034#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:26,235 INFO L273 TraceCheckUtils]: 6: Hoare triple {16034#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {16038#(<= main_~k~0 1)} is VALID [2018-11-23 11:59:26,235 INFO L273 TraceCheckUtils]: 7: Hoare triple {16038#(<= 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); {16038#(<= main_~k~0 1)} is VALID [2018-11-23 11:59:26,235 INFO L273 TraceCheckUtils]: 8: Hoare triple {16038#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {16038#(<= main_~k~0 1)} is VALID [2018-11-23 11:59:26,236 INFO L273 TraceCheckUtils]: 9: Hoare triple {16038#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {16048#(<= main_~k~0 2)} is VALID [2018-11-23 11:59:26,236 INFO L273 TraceCheckUtils]: 10: Hoare triple {16048#(<= 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); {16048#(<= main_~k~0 2)} is VALID [2018-11-23 11:59:26,237 INFO L273 TraceCheckUtils]: 11: Hoare triple {16048#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {16048#(<= main_~k~0 2)} is VALID [2018-11-23 11:59:26,237 INFO L273 TraceCheckUtils]: 12: Hoare triple {16048#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {16058#(<= main_~k~0 3)} is VALID [2018-11-23 11:59:26,238 INFO L273 TraceCheckUtils]: 13: Hoare triple {16058#(<= 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); {16058#(<= main_~k~0 3)} is VALID [2018-11-23 11:59:26,238 INFO L273 TraceCheckUtils]: 14: Hoare triple {16058#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {16058#(<= main_~k~0 3)} is VALID [2018-11-23 11:59:26,239 INFO L273 TraceCheckUtils]: 15: Hoare triple {16058#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {16068#(<= main_~k~0 4)} is VALID [2018-11-23 11:59:26,239 INFO L273 TraceCheckUtils]: 16: Hoare triple {16068#(<= 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); {16068#(<= main_~k~0 4)} is VALID [2018-11-23 11:59:26,240 INFO L273 TraceCheckUtils]: 17: Hoare triple {16068#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {16068#(<= main_~k~0 4)} is VALID [2018-11-23 11:59:26,241 INFO L273 TraceCheckUtils]: 18: Hoare triple {16068#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {16078#(<= main_~k~0 5)} is VALID [2018-11-23 11:59:26,241 INFO L273 TraceCheckUtils]: 19: Hoare triple {16078#(<= 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); {16078#(<= main_~k~0 5)} is VALID [2018-11-23 11:59:26,242 INFO L273 TraceCheckUtils]: 20: Hoare triple {16078#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {16078#(<= main_~k~0 5)} is VALID [2018-11-23 11:59:26,242 INFO L273 TraceCheckUtils]: 21: Hoare triple {16078#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {16088#(<= main_~k~0 6)} is VALID [2018-11-23 11:59:26,243 INFO L273 TraceCheckUtils]: 22: Hoare triple {16088#(<= 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); {16088#(<= main_~k~0 6)} is VALID [2018-11-23 11:59:26,243 INFO L273 TraceCheckUtils]: 23: Hoare triple {16088#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {16088#(<= main_~k~0 6)} is VALID [2018-11-23 11:59:26,244 INFO L273 TraceCheckUtils]: 24: Hoare triple {16088#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {16098#(<= main_~k~0 7)} is VALID [2018-11-23 11:59:26,245 INFO L273 TraceCheckUtils]: 25: Hoare triple {16098#(<= 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); {16098#(<= main_~k~0 7)} is VALID [2018-11-23 11:59:26,245 INFO L273 TraceCheckUtils]: 26: Hoare triple {16098#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {16098#(<= main_~k~0 7)} is VALID [2018-11-23 11:59:26,246 INFO L273 TraceCheckUtils]: 27: Hoare triple {16098#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {16108#(<= main_~k~0 8)} is VALID [2018-11-23 11:59:26,247 INFO L273 TraceCheckUtils]: 28: Hoare triple {16108#(<= 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); {16108#(<= main_~k~0 8)} is VALID [2018-11-23 11:59:26,247 INFO L273 TraceCheckUtils]: 29: Hoare triple {16108#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {16108#(<= main_~k~0 8)} is VALID [2018-11-23 11:59:26,248 INFO L273 TraceCheckUtils]: 30: Hoare triple {16108#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {16118#(<= main_~k~0 9)} is VALID [2018-11-23 11:59:26,248 INFO L273 TraceCheckUtils]: 31: Hoare triple {16118#(<= 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); {16118#(<= main_~k~0 9)} is VALID [2018-11-23 11:59:26,249 INFO L273 TraceCheckUtils]: 32: Hoare triple {16118#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {16118#(<= main_~k~0 9)} is VALID [2018-11-23 11:59:26,250 INFO L273 TraceCheckUtils]: 33: Hoare triple {16118#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {16128#(<= main_~k~0 10)} is VALID [2018-11-23 11:59:26,250 INFO L273 TraceCheckUtils]: 34: Hoare triple {16128#(<= 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); {16128#(<= main_~k~0 10)} is VALID [2018-11-23 11:59:26,251 INFO L273 TraceCheckUtils]: 35: Hoare triple {16128#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {16128#(<= main_~k~0 10)} is VALID [2018-11-23 11:59:26,251 INFO L273 TraceCheckUtils]: 36: Hoare triple {16128#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {16138#(<= main_~k~0 11)} is VALID [2018-11-23 11:59:26,252 INFO L273 TraceCheckUtils]: 37: Hoare triple {16138#(<= 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); {16138#(<= main_~k~0 11)} is VALID [2018-11-23 11:59:26,252 INFO L273 TraceCheckUtils]: 38: Hoare triple {16138#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {16138#(<= main_~k~0 11)} is VALID [2018-11-23 11:59:26,253 INFO L273 TraceCheckUtils]: 39: Hoare triple {16138#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {16148#(<= main_~k~0 12)} is VALID [2018-11-23 11:59:26,254 INFO L273 TraceCheckUtils]: 40: Hoare triple {16148#(<= 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); {16148#(<= main_~k~0 12)} is VALID [2018-11-23 11:59:26,254 INFO L273 TraceCheckUtils]: 41: Hoare triple {16148#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {16148#(<= main_~k~0 12)} is VALID [2018-11-23 11:59:26,255 INFO L273 TraceCheckUtils]: 42: Hoare triple {16148#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {16158#(<= main_~k~0 13)} is VALID [2018-11-23 11:59:26,256 INFO L273 TraceCheckUtils]: 43: Hoare triple {16158#(<= 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); {16158#(<= main_~k~0 13)} is VALID [2018-11-23 11:59:26,256 INFO L273 TraceCheckUtils]: 44: Hoare triple {16158#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {16158#(<= main_~k~0 13)} is VALID [2018-11-23 11:59:26,257 INFO L273 TraceCheckUtils]: 45: Hoare triple {16158#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {16168#(<= main_~k~0 14)} is VALID [2018-11-23 11:59:26,257 INFO L273 TraceCheckUtils]: 46: Hoare triple {16168#(<= 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); {16168#(<= main_~k~0 14)} is VALID [2018-11-23 11:59:26,258 INFO L273 TraceCheckUtils]: 47: Hoare triple {16168#(<= main_~k~0 14)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {16168#(<= main_~k~0 14)} is VALID [2018-11-23 11:59:26,259 INFO L273 TraceCheckUtils]: 48: Hoare triple {16168#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {16178#(<= main_~k~0 15)} is VALID [2018-11-23 11:59:26,259 INFO L273 TraceCheckUtils]: 49: Hoare triple {16178#(<= 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); {16178#(<= main_~k~0 15)} is VALID [2018-11-23 11:59:26,260 INFO L273 TraceCheckUtils]: 50: Hoare triple {16178#(<= main_~k~0 15)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {16178#(<= main_~k~0 15)} is VALID [2018-11-23 11:59:26,260 INFO L273 TraceCheckUtils]: 51: Hoare triple {16178#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {16188#(<= main_~k~0 16)} is VALID [2018-11-23 11:59:26,261 INFO L273 TraceCheckUtils]: 52: Hoare triple {16188#(<= 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); {16188#(<= main_~k~0 16)} is VALID [2018-11-23 11:59:26,262 INFO L273 TraceCheckUtils]: 53: Hoare triple {16188#(<= main_~k~0 16)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {16188#(<= main_~k~0 16)} is VALID [2018-11-23 11:59:26,262 INFO L273 TraceCheckUtils]: 54: Hoare triple {16188#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {16198#(<= main_~k~0 17)} is VALID [2018-11-23 11:59:26,263 INFO L273 TraceCheckUtils]: 55: Hoare triple {16198#(<= 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); {16198#(<= main_~k~0 17)} is VALID [2018-11-23 11:59:26,263 INFO L273 TraceCheckUtils]: 56: Hoare triple {16198#(<= main_~k~0 17)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {16198#(<= main_~k~0 17)} is VALID [2018-11-23 11:59:26,264 INFO L273 TraceCheckUtils]: 57: Hoare triple {16198#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {16208#(<= main_~k~0 18)} is VALID [2018-11-23 11:59:26,265 INFO L273 TraceCheckUtils]: 58: Hoare triple {16208#(<= 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); {16208#(<= main_~k~0 18)} is VALID [2018-11-23 11:59:26,265 INFO L273 TraceCheckUtils]: 59: Hoare triple {16208#(<= main_~k~0 18)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {16208#(<= main_~k~0 18)} is VALID [2018-11-23 11:59:26,266 INFO L273 TraceCheckUtils]: 60: Hoare triple {16208#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {16218#(<= main_~k~0 19)} is VALID [2018-11-23 11:59:26,266 INFO L273 TraceCheckUtils]: 61: Hoare triple {16218#(<= 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); {16218#(<= main_~k~0 19)} is VALID [2018-11-23 11:59:26,267 INFO L273 TraceCheckUtils]: 62: Hoare triple {16218#(<= main_~k~0 19)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {16218#(<= main_~k~0 19)} is VALID [2018-11-23 11:59:26,268 INFO L273 TraceCheckUtils]: 63: Hoare triple {16218#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {16228#(<= main_~k~0 20)} is VALID [2018-11-23 11:59:26,268 INFO L273 TraceCheckUtils]: 64: Hoare triple {16228#(<= main_~k~0 20)} assume !(~k~0 < 100000); {15994#false} is VALID [2018-11-23 11:59:26,269 INFO L273 TraceCheckUtils]: 65: Hoare triple {15994#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); {15994#false} is VALID [2018-11-23 11:59:26,269 INFO L273 TraceCheckUtils]: 66: Hoare triple {15994#false} ~x~0 := 0; {15994#false} is VALID [2018-11-23 11:59:26,269 INFO L273 TraceCheckUtils]: 67: Hoare triple {15994#false} assume !(~x~0 < ~i~0); {15994#false} is VALID [2018-11-23 11:59:26,269 INFO L273 TraceCheckUtils]: 68: Hoare triple {15994#false} ~x~0 := ~i~0; {15994#false} is VALID [2018-11-23 11:59:26,269 INFO L273 TraceCheckUtils]: 69: Hoare triple {15994#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); {15994#false} is VALID [2018-11-23 11:59:26,270 INFO L256 TraceCheckUtils]: 70: Hoare triple {15994#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {15994#false} is VALID [2018-11-23 11:59:26,270 INFO L273 TraceCheckUtils]: 71: Hoare triple {15994#false} ~cond := #in~cond; {15994#false} is VALID [2018-11-23 11:59:26,270 INFO L273 TraceCheckUtils]: 72: Hoare triple {15994#false} assume !(0 == ~cond); {15994#false} is VALID [2018-11-23 11:59:26,270 INFO L273 TraceCheckUtils]: 73: Hoare triple {15994#false} assume true; {15994#false} is VALID [2018-11-23 11:59:26,270 INFO L268 TraceCheckUtils]: 74: Hoare quadruple {15994#false} {15994#false} #136#return; {15994#false} is VALID [2018-11-23 11:59:26,271 INFO L273 TraceCheckUtils]: 75: Hoare triple {15994#false} havoc #t~mem9;havoc #t~mem10; {15994#false} is VALID [2018-11-23 11:59:26,271 INFO L273 TraceCheckUtils]: 76: Hoare triple {15994#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {15994#false} is VALID [2018-11-23 11:59:26,271 INFO L273 TraceCheckUtils]: 77: Hoare triple {15994#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); {15994#false} is VALID [2018-11-23 11:59:26,271 INFO L256 TraceCheckUtils]: 78: Hoare triple {15994#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {15994#false} is VALID [2018-11-23 11:59:26,271 INFO L273 TraceCheckUtils]: 79: Hoare triple {15994#false} ~cond := #in~cond; {15994#false} is VALID [2018-11-23 11:59:26,271 INFO L273 TraceCheckUtils]: 80: Hoare triple {15994#false} assume 0 == ~cond; {15994#false} is VALID [2018-11-23 11:59:26,271 INFO L273 TraceCheckUtils]: 81: Hoare triple {15994#false} assume !false; {15994#false} is VALID [2018-11-23 11:59:26,275 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:59:26,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:26,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 44 [2018-11-23 11:59:26,295 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 82 [2018-11-23 11:59:26,296 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:26,296 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states. [2018-11-23 11:59:26,441 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:59:26,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-23 11:59:26,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-23 11:59:26,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=716, Invalid=1176, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 11:59:26,443 INFO L87 Difference]: Start difference. First operand 168 states and 221 transitions. Second operand 44 states. [2018-11-23 11:59:27,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:27,612 INFO L93 Difference]: Finished difference Result 231 states and 307 transitions. [2018-11-23 11:59:27,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 11:59:27,612 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 82 [2018-11-23 11:59:27,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:27,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 11:59:27,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 187 transitions. [2018-11-23 11:59:27,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 11:59:27,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 187 transitions. [2018-11-23 11:59:27,615 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 187 transitions. [2018-11-23 11:59:27,795 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:59:27,799 INFO L225 Difference]: With dead ends: 231 [2018-11-23 11:59:27,799 INFO L226 Difference]: Without dead ends: 184 [2018-11-23 11:59:27,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=716, Invalid=1176, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 11:59:27,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-11-23 11:59:27,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 174. [2018-11-23 11:59:27,927 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:27,928 INFO L82 GeneralOperation]: Start isEquivalent. First operand 184 states. Second operand 174 states. [2018-11-23 11:59:27,928 INFO L74 IsIncluded]: Start isIncluded. First operand 184 states. Second operand 174 states. [2018-11-23 11:59:27,928 INFO L87 Difference]: Start difference. First operand 184 states. Second operand 174 states. [2018-11-23 11:59:27,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:27,931 INFO L93 Difference]: Finished difference Result 184 states and 244 transitions. [2018-11-23 11:59:27,931 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 244 transitions. [2018-11-23 11:59:27,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:27,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:27,932 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand 184 states. [2018-11-23 11:59:27,932 INFO L87 Difference]: Start difference. First operand 174 states. Second operand 184 states. [2018-11-23 11:59:27,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:27,935 INFO L93 Difference]: Finished difference Result 184 states and 244 transitions. [2018-11-23 11:59:27,935 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 244 transitions. [2018-11-23 11:59:27,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:27,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:27,936 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:27,936 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:27,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-11-23 11:59:27,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 229 transitions. [2018-11-23 11:59:27,939 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 229 transitions. Word has length 82 [2018-11-23 11:59:27,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:27,940 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 229 transitions. [2018-11-23 11:59:27,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-23 11:59:27,940 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 229 transitions. [2018-11-23 11:59:27,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-23 11:59:27,941 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:27,941 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:59:27,941 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:27,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:27,942 INFO L82 PathProgramCache]: Analyzing trace with hash 811230924, now seen corresponding path program 16 times [2018-11-23 11:59:27,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:27,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:27,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:27,943 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:27,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:27,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:28,993 INFO L256 TraceCheckUtils]: 0: Hoare triple {17201#true} call ULTIMATE.init(); {17201#true} is VALID [2018-11-23 11:59:28,994 INFO L273 TraceCheckUtils]: 1: Hoare triple {17201#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17201#true} is VALID [2018-11-23 11:59:28,994 INFO L273 TraceCheckUtils]: 2: Hoare triple {17201#true} assume true; {17201#true} is VALID [2018-11-23 11:59:28,994 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17201#true} {17201#true} #130#return; {17201#true} is VALID [2018-11-23 11:59:28,994 INFO L256 TraceCheckUtils]: 4: Hoare triple {17201#true} call #t~ret15 := main(); {17201#true} is VALID [2018-11-23 11:59:28,995 INFO L273 TraceCheckUtils]: 5: Hoare triple {17201#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {17203#(= main_~i~0 0)} is VALID [2018-11-23 11:59:28,995 INFO L273 TraceCheckUtils]: 6: Hoare triple {17203#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {17204#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:28,996 INFO L273 TraceCheckUtils]: 7: Hoare triple {17204#(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); {17204#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:28,997 INFO L273 TraceCheckUtils]: 8: Hoare triple {17204#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {17204#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:28,998 INFO L273 TraceCheckUtils]: 9: Hoare triple {17204#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {17205#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:28,999 INFO L273 TraceCheckUtils]: 10: Hoare triple {17205#(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); {17205#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:28,999 INFO L273 TraceCheckUtils]: 11: Hoare triple {17205#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {17205#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:29,000 INFO L273 TraceCheckUtils]: 12: Hoare triple {17205#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {17206#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:29,001 INFO L273 TraceCheckUtils]: 13: Hoare triple {17206#(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); {17206#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:29,002 INFO L273 TraceCheckUtils]: 14: Hoare triple {17206#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {17206#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:29,003 INFO L273 TraceCheckUtils]: 15: Hoare triple {17206#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {17207#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:29,004 INFO L273 TraceCheckUtils]: 16: Hoare triple {17207#(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); {17207#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:29,004 INFO L273 TraceCheckUtils]: 17: Hoare triple {17207#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {17207#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:29,005 INFO L273 TraceCheckUtils]: 18: Hoare triple {17207#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {17208#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:29,006 INFO L273 TraceCheckUtils]: 19: Hoare triple {17208#(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); {17208#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:29,007 INFO L273 TraceCheckUtils]: 20: Hoare triple {17208#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {17208#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:29,008 INFO L273 TraceCheckUtils]: 21: Hoare triple {17208#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {17209#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:29,009 INFO L273 TraceCheckUtils]: 22: Hoare triple {17209#(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); {17209#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:29,009 INFO L273 TraceCheckUtils]: 23: Hoare triple {17209#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {17209#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:29,010 INFO L273 TraceCheckUtils]: 24: Hoare triple {17209#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {17210#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:29,011 INFO L273 TraceCheckUtils]: 25: Hoare triple {17210#(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); {17210#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:29,012 INFO L273 TraceCheckUtils]: 26: Hoare triple {17210#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {17210#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:29,013 INFO L273 TraceCheckUtils]: 27: Hoare triple {17210#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {17211#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:29,014 INFO L273 TraceCheckUtils]: 28: Hoare triple {17211#(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); {17211#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:29,014 INFO L273 TraceCheckUtils]: 29: Hoare triple {17211#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {17211#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:29,015 INFO L273 TraceCheckUtils]: 30: Hoare triple {17211#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {17212#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:29,016 INFO L273 TraceCheckUtils]: 31: Hoare triple {17212#(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); {17212#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:29,017 INFO L273 TraceCheckUtils]: 32: Hoare triple {17212#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {17212#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:29,018 INFO L273 TraceCheckUtils]: 33: Hoare triple {17212#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {17213#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:29,018 INFO L273 TraceCheckUtils]: 34: Hoare triple {17213#(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); {17213#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:29,019 INFO L273 TraceCheckUtils]: 35: Hoare triple {17213#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {17213#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:29,020 INFO L273 TraceCheckUtils]: 36: Hoare triple {17213#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {17214#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:29,021 INFO L273 TraceCheckUtils]: 37: Hoare triple {17214#(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); {17214#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:29,022 INFO L273 TraceCheckUtils]: 38: Hoare triple {17214#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {17214#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:29,023 INFO L273 TraceCheckUtils]: 39: Hoare triple {17214#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {17215#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:29,024 INFO L273 TraceCheckUtils]: 40: Hoare triple {17215#(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); {17215#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:29,024 INFO L273 TraceCheckUtils]: 41: Hoare triple {17215#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {17215#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:29,025 INFO L273 TraceCheckUtils]: 42: Hoare triple {17215#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {17216#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:29,026 INFO L273 TraceCheckUtils]: 43: Hoare triple {17216#(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); {17216#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:29,027 INFO L273 TraceCheckUtils]: 44: Hoare triple {17216#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {17216#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:29,028 INFO L273 TraceCheckUtils]: 45: Hoare triple {17216#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {17217#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:29,029 INFO L273 TraceCheckUtils]: 46: Hoare triple {17217#(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); {17217#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:29,029 INFO L273 TraceCheckUtils]: 47: Hoare triple {17217#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {17217#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:29,030 INFO L273 TraceCheckUtils]: 48: Hoare triple {17217#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {17218#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:29,031 INFO L273 TraceCheckUtils]: 49: Hoare triple {17218#(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); {17218#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:29,032 INFO L273 TraceCheckUtils]: 50: Hoare triple {17218#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {17218#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:29,032 INFO L273 TraceCheckUtils]: 51: Hoare triple {17218#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {17219#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:29,033 INFO L273 TraceCheckUtils]: 52: Hoare triple {17219#(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); {17219#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:29,034 INFO L273 TraceCheckUtils]: 53: Hoare triple {17219#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {17219#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:29,035 INFO L273 TraceCheckUtils]: 54: Hoare triple {17219#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {17220#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:59:29,036 INFO L273 TraceCheckUtils]: 55: Hoare triple {17220#(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); {17220#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:59:29,037 INFO L273 TraceCheckUtils]: 56: Hoare triple {17220#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {17220#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:59:29,038 INFO L273 TraceCheckUtils]: 57: Hoare triple {17220#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} ~k~0 := 1 + ~k~0; {17221#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:29,038 INFO L273 TraceCheckUtils]: 58: Hoare triple {17221#(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); {17221#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:29,039 INFO L273 TraceCheckUtils]: 59: Hoare triple {17221#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {17221#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:29,040 INFO L273 TraceCheckUtils]: 60: Hoare triple {17221#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {17222#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:29,041 INFO L273 TraceCheckUtils]: 61: Hoare triple {17222#(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); {17222#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:29,042 INFO L273 TraceCheckUtils]: 62: Hoare triple {17222#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {17222#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:29,043 INFO L273 TraceCheckUtils]: 63: Hoare triple {17222#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {17223#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:29,043 INFO L273 TraceCheckUtils]: 64: Hoare triple {17223#(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); {17223#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:29,044 INFO L273 TraceCheckUtils]: 65: Hoare triple {17223#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {17223#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:29,045 INFO L273 TraceCheckUtils]: 66: Hoare triple {17223#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {17224#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:29,046 INFO L273 TraceCheckUtils]: 67: Hoare triple {17224#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} assume !(~k~0 < 100000); {17202#false} is VALID [2018-11-23 11:59:29,046 INFO L273 TraceCheckUtils]: 68: Hoare triple {17202#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); {17202#false} is VALID [2018-11-23 11:59:29,046 INFO L273 TraceCheckUtils]: 69: Hoare triple {17202#false} ~x~0 := 0; {17202#false} is VALID [2018-11-23 11:59:29,046 INFO L273 TraceCheckUtils]: 70: Hoare triple {17202#false} assume !(~x~0 < ~i~0); {17202#false} is VALID [2018-11-23 11:59:29,047 INFO L273 TraceCheckUtils]: 71: Hoare triple {17202#false} ~x~0 := ~i~0; {17202#false} is VALID [2018-11-23 11:59:29,047 INFO L273 TraceCheckUtils]: 72: Hoare triple {17202#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); {17202#false} is VALID [2018-11-23 11:59:29,047 INFO L256 TraceCheckUtils]: 73: Hoare triple {17202#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {17201#true} is VALID [2018-11-23 11:59:29,047 INFO L273 TraceCheckUtils]: 74: Hoare triple {17201#true} ~cond := #in~cond; {17201#true} is VALID [2018-11-23 11:59:29,047 INFO L273 TraceCheckUtils]: 75: Hoare triple {17201#true} assume !(0 == ~cond); {17201#true} is VALID [2018-11-23 11:59:29,048 INFO L273 TraceCheckUtils]: 76: Hoare triple {17201#true} assume true; {17201#true} is VALID [2018-11-23 11:59:29,048 INFO L268 TraceCheckUtils]: 77: Hoare quadruple {17201#true} {17202#false} #136#return; {17202#false} is VALID [2018-11-23 11:59:29,048 INFO L273 TraceCheckUtils]: 78: Hoare triple {17202#false} havoc #t~mem9;havoc #t~mem10; {17202#false} is VALID [2018-11-23 11:59:29,048 INFO L273 TraceCheckUtils]: 79: Hoare triple {17202#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {17202#false} is VALID [2018-11-23 11:59:29,048 INFO L273 TraceCheckUtils]: 80: Hoare triple {17202#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); {17202#false} is VALID [2018-11-23 11:59:29,049 INFO L256 TraceCheckUtils]: 81: Hoare triple {17202#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {17202#false} is VALID [2018-11-23 11:59:29,049 INFO L273 TraceCheckUtils]: 82: Hoare triple {17202#false} ~cond := #in~cond; {17202#false} is VALID [2018-11-23 11:59:29,049 INFO L273 TraceCheckUtils]: 83: Hoare triple {17202#false} assume 0 == ~cond; {17202#false} is VALID [2018-11-23 11:59:29,049 INFO L273 TraceCheckUtils]: 84: Hoare triple {17202#false} assume !false; {17202#false} is VALID [2018-11-23 11:59:29,059 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:59:29,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:29,060 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:59:29,069 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:59:29,117 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:59:29,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:29,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:29,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:29,693 INFO L256 TraceCheckUtils]: 0: Hoare triple {17201#true} call ULTIMATE.init(); {17201#true} is VALID [2018-11-23 11:59:29,693 INFO L273 TraceCheckUtils]: 1: Hoare triple {17201#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17201#true} is VALID [2018-11-23 11:59:29,693 INFO L273 TraceCheckUtils]: 2: Hoare triple {17201#true} assume true; {17201#true} is VALID [2018-11-23 11:59:29,694 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17201#true} {17201#true} #130#return; {17201#true} is VALID [2018-11-23 11:59:29,694 INFO L256 TraceCheckUtils]: 4: Hoare triple {17201#true} call #t~ret15 := main(); {17201#true} is VALID [2018-11-23 11:59:29,695 INFO L273 TraceCheckUtils]: 5: Hoare triple {17201#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {17243#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:29,695 INFO L273 TraceCheckUtils]: 6: Hoare triple {17243#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {17247#(<= main_~k~0 1)} is VALID [2018-11-23 11:59:29,696 INFO L273 TraceCheckUtils]: 7: Hoare triple {17247#(<= 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); {17247#(<= main_~k~0 1)} is VALID [2018-11-23 11:59:29,696 INFO L273 TraceCheckUtils]: 8: Hoare triple {17247#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {17247#(<= main_~k~0 1)} is VALID [2018-11-23 11:59:29,696 INFO L273 TraceCheckUtils]: 9: Hoare triple {17247#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {17257#(<= main_~k~0 2)} is VALID [2018-11-23 11:59:29,697 INFO L273 TraceCheckUtils]: 10: Hoare triple {17257#(<= 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); {17257#(<= main_~k~0 2)} is VALID [2018-11-23 11:59:29,697 INFO L273 TraceCheckUtils]: 11: Hoare triple {17257#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {17257#(<= main_~k~0 2)} is VALID [2018-11-23 11:59:29,697 INFO L273 TraceCheckUtils]: 12: Hoare triple {17257#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {17267#(<= main_~k~0 3)} is VALID [2018-11-23 11:59:29,698 INFO L273 TraceCheckUtils]: 13: Hoare triple {17267#(<= 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); {17267#(<= main_~k~0 3)} is VALID [2018-11-23 11:59:29,698 INFO L273 TraceCheckUtils]: 14: Hoare triple {17267#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {17267#(<= main_~k~0 3)} is VALID [2018-11-23 11:59:29,699 INFO L273 TraceCheckUtils]: 15: Hoare triple {17267#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {17277#(<= main_~k~0 4)} is VALID [2018-11-23 11:59:29,700 INFO L273 TraceCheckUtils]: 16: Hoare triple {17277#(<= 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); {17277#(<= main_~k~0 4)} is VALID [2018-11-23 11:59:29,700 INFO L273 TraceCheckUtils]: 17: Hoare triple {17277#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {17277#(<= main_~k~0 4)} is VALID [2018-11-23 11:59:29,701 INFO L273 TraceCheckUtils]: 18: Hoare triple {17277#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {17287#(<= main_~k~0 5)} is VALID [2018-11-23 11:59:29,701 INFO L273 TraceCheckUtils]: 19: Hoare triple {17287#(<= 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); {17287#(<= main_~k~0 5)} is VALID [2018-11-23 11:59:29,702 INFO L273 TraceCheckUtils]: 20: Hoare triple {17287#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {17287#(<= main_~k~0 5)} is VALID [2018-11-23 11:59:29,703 INFO L273 TraceCheckUtils]: 21: Hoare triple {17287#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {17297#(<= main_~k~0 6)} is VALID [2018-11-23 11:59:29,703 INFO L273 TraceCheckUtils]: 22: Hoare triple {17297#(<= 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); {17297#(<= main_~k~0 6)} is VALID [2018-11-23 11:59:29,704 INFO L273 TraceCheckUtils]: 23: Hoare triple {17297#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {17297#(<= main_~k~0 6)} is VALID [2018-11-23 11:59:29,705 INFO L273 TraceCheckUtils]: 24: Hoare triple {17297#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {17307#(<= main_~k~0 7)} is VALID [2018-11-23 11:59:29,705 INFO L273 TraceCheckUtils]: 25: Hoare triple {17307#(<= 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); {17307#(<= main_~k~0 7)} is VALID [2018-11-23 11:59:29,706 INFO L273 TraceCheckUtils]: 26: Hoare triple {17307#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {17307#(<= main_~k~0 7)} is VALID [2018-11-23 11:59:29,706 INFO L273 TraceCheckUtils]: 27: Hoare triple {17307#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {17317#(<= main_~k~0 8)} is VALID [2018-11-23 11:59:29,707 INFO L273 TraceCheckUtils]: 28: Hoare triple {17317#(<= 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); {17317#(<= main_~k~0 8)} is VALID [2018-11-23 11:59:29,707 INFO L273 TraceCheckUtils]: 29: Hoare triple {17317#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {17317#(<= main_~k~0 8)} is VALID [2018-11-23 11:59:29,708 INFO L273 TraceCheckUtils]: 30: Hoare triple {17317#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {17327#(<= main_~k~0 9)} is VALID [2018-11-23 11:59:29,709 INFO L273 TraceCheckUtils]: 31: Hoare triple {17327#(<= 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); {17327#(<= main_~k~0 9)} is VALID [2018-11-23 11:59:29,709 INFO L273 TraceCheckUtils]: 32: Hoare triple {17327#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {17327#(<= main_~k~0 9)} is VALID [2018-11-23 11:59:29,710 INFO L273 TraceCheckUtils]: 33: Hoare triple {17327#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {17337#(<= main_~k~0 10)} is VALID [2018-11-23 11:59:29,710 INFO L273 TraceCheckUtils]: 34: Hoare triple {17337#(<= 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); {17337#(<= main_~k~0 10)} is VALID [2018-11-23 11:59:29,711 INFO L273 TraceCheckUtils]: 35: Hoare triple {17337#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {17337#(<= main_~k~0 10)} is VALID [2018-11-23 11:59:29,712 INFO L273 TraceCheckUtils]: 36: Hoare triple {17337#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {17347#(<= main_~k~0 11)} is VALID [2018-11-23 11:59:29,712 INFO L273 TraceCheckUtils]: 37: Hoare triple {17347#(<= 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); {17347#(<= main_~k~0 11)} is VALID [2018-11-23 11:59:29,713 INFO L273 TraceCheckUtils]: 38: Hoare triple {17347#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {17347#(<= main_~k~0 11)} is VALID [2018-11-23 11:59:29,713 INFO L273 TraceCheckUtils]: 39: Hoare triple {17347#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {17357#(<= main_~k~0 12)} is VALID [2018-11-23 11:59:29,714 INFO L273 TraceCheckUtils]: 40: Hoare triple {17357#(<= 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); {17357#(<= main_~k~0 12)} is VALID [2018-11-23 11:59:29,715 INFO L273 TraceCheckUtils]: 41: Hoare triple {17357#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {17357#(<= main_~k~0 12)} is VALID [2018-11-23 11:59:29,715 INFO L273 TraceCheckUtils]: 42: Hoare triple {17357#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {17367#(<= main_~k~0 13)} is VALID [2018-11-23 11:59:29,716 INFO L273 TraceCheckUtils]: 43: Hoare triple {17367#(<= 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); {17367#(<= main_~k~0 13)} is VALID [2018-11-23 11:59:29,716 INFO L273 TraceCheckUtils]: 44: Hoare triple {17367#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {17367#(<= main_~k~0 13)} is VALID [2018-11-23 11:59:29,717 INFO L273 TraceCheckUtils]: 45: Hoare triple {17367#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {17377#(<= main_~k~0 14)} is VALID [2018-11-23 11:59:29,718 INFO L273 TraceCheckUtils]: 46: Hoare triple {17377#(<= 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); {17377#(<= main_~k~0 14)} is VALID [2018-11-23 11:59:29,718 INFO L273 TraceCheckUtils]: 47: Hoare triple {17377#(<= main_~k~0 14)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {17377#(<= main_~k~0 14)} is VALID [2018-11-23 11:59:29,719 INFO L273 TraceCheckUtils]: 48: Hoare triple {17377#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {17387#(<= main_~k~0 15)} is VALID [2018-11-23 11:59:29,719 INFO L273 TraceCheckUtils]: 49: Hoare triple {17387#(<= 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); {17387#(<= main_~k~0 15)} is VALID [2018-11-23 11:59:29,720 INFO L273 TraceCheckUtils]: 50: Hoare triple {17387#(<= main_~k~0 15)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {17387#(<= main_~k~0 15)} is VALID [2018-11-23 11:59:29,721 INFO L273 TraceCheckUtils]: 51: Hoare triple {17387#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {17397#(<= main_~k~0 16)} is VALID [2018-11-23 11:59:29,721 INFO L273 TraceCheckUtils]: 52: Hoare triple {17397#(<= 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); {17397#(<= main_~k~0 16)} is VALID [2018-11-23 11:59:29,722 INFO L273 TraceCheckUtils]: 53: Hoare triple {17397#(<= main_~k~0 16)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {17397#(<= main_~k~0 16)} is VALID [2018-11-23 11:59:29,723 INFO L273 TraceCheckUtils]: 54: Hoare triple {17397#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {17407#(<= main_~k~0 17)} is VALID [2018-11-23 11:59:29,723 INFO L273 TraceCheckUtils]: 55: Hoare triple {17407#(<= 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); {17407#(<= main_~k~0 17)} is VALID [2018-11-23 11:59:29,724 INFO L273 TraceCheckUtils]: 56: Hoare triple {17407#(<= main_~k~0 17)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {17407#(<= main_~k~0 17)} is VALID [2018-11-23 11:59:29,724 INFO L273 TraceCheckUtils]: 57: Hoare triple {17407#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {17417#(<= main_~k~0 18)} is VALID [2018-11-23 11:59:29,725 INFO L273 TraceCheckUtils]: 58: Hoare triple {17417#(<= 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); {17417#(<= main_~k~0 18)} is VALID [2018-11-23 11:59:29,725 INFO L273 TraceCheckUtils]: 59: Hoare triple {17417#(<= main_~k~0 18)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {17417#(<= main_~k~0 18)} is VALID [2018-11-23 11:59:29,726 INFO L273 TraceCheckUtils]: 60: Hoare triple {17417#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {17427#(<= main_~k~0 19)} is VALID [2018-11-23 11:59:29,727 INFO L273 TraceCheckUtils]: 61: Hoare triple {17427#(<= 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); {17427#(<= main_~k~0 19)} is VALID [2018-11-23 11:59:29,727 INFO L273 TraceCheckUtils]: 62: Hoare triple {17427#(<= main_~k~0 19)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {17427#(<= main_~k~0 19)} is VALID [2018-11-23 11:59:29,728 INFO L273 TraceCheckUtils]: 63: Hoare triple {17427#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {17437#(<= main_~k~0 20)} is VALID [2018-11-23 11:59:29,729 INFO L273 TraceCheckUtils]: 64: Hoare triple {17437#(<= 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); {17437#(<= main_~k~0 20)} is VALID [2018-11-23 11:59:29,729 INFO L273 TraceCheckUtils]: 65: Hoare triple {17437#(<= main_~k~0 20)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {17437#(<= main_~k~0 20)} is VALID [2018-11-23 11:59:29,730 INFO L273 TraceCheckUtils]: 66: Hoare triple {17437#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {17447#(<= main_~k~0 21)} is VALID [2018-11-23 11:59:29,731 INFO L273 TraceCheckUtils]: 67: Hoare triple {17447#(<= main_~k~0 21)} assume !(~k~0 < 100000); {17202#false} is VALID [2018-11-23 11:59:29,731 INFO L273 TraceCheckUtils]: 68: Hoare triple {17202#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); {17202#false} is VALID [2018-11-23 11:59:29,731 INFO L273 TraceCheckUtils]: 69: Hoare triple {17202#false} ~x~0 := 0; {17202#false} is VALID [2018-11-23 11:59:29,731 INFO L273 TraceCheckUtils]: 70: Hoare triple {17202#false} assume !(~x~0 < ~i~0); {17202#false} is VALID [2018-11-23 11:59:29,731 INFO L273 TraceCheckUtils]: 71: Hoare triple {17202#false} ~x~0 := ~i~0; {17202#false} is VALID [2018-11-23 11:59:29,732 INFO L273 TraceCheckUtils]: 72: Hoare triple {17202#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); {17202#false} is VALID [2018-11-23 11:59:29,732 INFO L256 TraceCheckUtils]: 73: Hoare triple {17202#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {17202#false} is VALID [2018-11-23 11:59:29,732 INFO L273 TraceCheckUtils]: 74: Hoare triple {17202#false} ~cond := #in~cond; {17202#false} is VALID [2018-11-23 11:59:29,732 INFO L273 TraceCheckUtils]: 75: Hoare triple {17202#false} assume !(0 == ~cond); {17202#false} is VALID [2018-11-23 11:59:29,732 INFO L273 TraceCheckUtils]: 76: Hoare triple {17202#false} assume true; {17202#false} is VALID [2018-11-23 11:59:29,733 INFO L268 TraceCheckUtils]: 77: Hoare quadruple {17202#false} {17202#false} #136#return; {17202#false} is VALID [2018-11-23 11:59:29,733 INFO L273 TraceCheckUtils]: 78: Hoare triple {17202#false} havoc #t~mem9;havoc #t~mem10; {17202#false} is VALID [2018-11-23 11:59:29,733 INFO L273 TraceCheckUtils]: 79: Hoare triple {17202#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {17202#false} is VALID [2018-11-23 11:59:29,733 INFO L273 TraceCheckUtils]: 80: Hoare triple {17202#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); {17202#false} is VALID [2018-11-23 11:59:29,733 INFO L256 TraceCheckUtils]: 81: Hoare triple {17202#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {17202#false} is VALID [2018-11-23 11:59:29,734 INFO L273 TraceCheckUtils]: 82: Hoare triple {17202#false} ~cond := #in~cond; {17202#false} is VALID [2018-11-23 11:59:29,734 INFO L273 TraceCheckUtils]: 83: Hoare triple {17202#false} assume 0 == ~cond; {17202#false} is VALID [2018-11-23 11:59:29,734 INFO L273 TraceCheckUtils]: 84: Hoare triple {17202#false} assume !false; {17202#false} is VALID [2018-11-23 11:59:29,738 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:59:29,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:29,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2018-11-23 11:59:29,758 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 85 [2018-11-23 11:59:29,759 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:29,759 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states. [2018-11-23 11:59:29,910 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:29,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-23 11:59:29,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-23 11:59:29,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=1287, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 11:59:29,912 INFO L87 Difference]: Start difference. First operand 174 states and 229 transitions. Second operand 46 states. [2018-11-23 11:59:31,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:31,253 INFO L93 Difference]: Finished difference Result 237 states and 315 transitions. [2018-11-23 11:59:31,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 11:59:31,253 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 85 [2018-11-23 11:59:31,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:31,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 11:59:31,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 191 transitions. [2018-11-23 11:59:31,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 11:59:31,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 191 transitions. [2018-11-23 11:59:31,258 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 191 transitions. [2018-11-23 11:59:31,913 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:59:31,916 INFO L225 Difference]: With dead ends: 237 [2018-11-23 11:59:31,916 INFO L226 Difference]: Without dead ends: 190 [2018-11-23 11:59:31,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 694 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=783, Invalid=1287, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 11:59:31,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-11-23 11:59:32,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 180. [2018-11-23 11:59:32,087 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:32,087 INFO L82 GeneralOperation]: Start isEquivalent. First operand 190 states. Second operand 180 states. [2018-11-23 11:59:32,087 INFO L74 IsIncluded]: Start isIncluded. First operand 190 states. Second operand 180 states. [2018-11-23 11:59:32,087 INFO L87 Difference]: Start difference. First operand 190 states. Second operand 180 states. [2018-11-23 11:59:32,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:32,091 INFO L93 Difference]: Finished difference Result 190 states and 252 transitions. [2018-11-23 11:59:32,091 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 252 transitions. [2018-11-23 11:59:32,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:32,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:32,092 INFO L74 IsIncluded]: Start isIncluded. First operand 180 states. Second operand 190 states. [2018-11-23 11:59:32,092 INFO L87 Difference]: Start difference. First operand 180 states. Second operand 190 states. [2018-11-23 11:59:32,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:32,096 INFO L93 Difference]: Finished difference Result 190 states and 252 transitions. [2018-11-23 11:59:32,096 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 252 transitions. [2018-11-23 11:59:32,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:32,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:32,097 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:32,097 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:32,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-11-23 11:59:32,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 237 transitions. [2018-11-23 11:59:32,101 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 237 transitions. Word has length 85 [2018-11-23 11:59:32,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:32,101 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 237 transitions. [2018-11-23 11:59:32,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-23 11:59:32,101 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 237 transitions. [2018-11-23 11:59:32,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-23 11:59:32,102 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:32,102 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:59:32,103 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:32,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:32,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1564282319, now seen corresponding path program 17 times [2018-11-23 11:59:32,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:32,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:32,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:32,104 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:32,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:32,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:32,897 INFO L256 TraceCheckUtils]: 0: Hoare triple {18448#true} call ULTIMATE.init(); {18448#true} is VALID [2018-11-23 11:59:32,897 INFO L273 TraceCheckUtils]: 1: Hoare triple {18448#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {18448#true} is VALID [2018-11-23 11:59:32,898 INFO L273 TraceCheckUtils]: 2: Hoare triple {18448#true} assume true; {18448#true} is VALID [2018-11-23 11:59:32,898 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18448#true} {18448#true} #130#return; {18448#true} is VALID [2018-11-23 11:59:32,898 INFO L256 TraceCheckUtils]: 4: Hoare triple {18448#true} call #t~ret15 := main(); {18448#true} is VALID [2018-11-23 11:59:32,898 INFO L273 TraceCheckUtils]: 5: Hoare triple {18448#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {18450#(= main_~i~0 0)} is VALID [2018-11-23 11:59:32,899 INFO L273 TraceCheckUtils]: 6: Hoare triple {18450#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {18451#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,900 INFO L273 TraceCheckUtils]: 7: Hoare triple {18451#(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); {18451#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,901 INFO L273 TraceCheckUtils]: 8: Hoare triple {18451#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {18451#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,902 INFO L273 TraceCheckUtils]: 9: Hoare triple {18451#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {18452#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,903 INFO L273 TraceCheckUtils]: 10: Hoare triple {18452#(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); {18452#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,903 INFO L273 TraceCheckUtils]: 11: Hoare triple {18452#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {18452#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,904 INFO L273 TraceCheckUtils]: 12: Hoare triple {18452#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {18453#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,905 INFO L273 TraceCheckUtils]: 13: Hoare triple {18453#(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); {18453#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,906 INFO L273 TraceCheckUtils]: 14: Hoare triple {18453#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {18453#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,907 INFO L273 TraceCheckUtils]: 15: Hoare triple {18453#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {18454#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,907 INFO L273 TraceCheckUtils]: 16: Hoare triple {18454#(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); {18454#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,908 INFO L273 TraceCheckUtils]: 17: Hoare triple {18454#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {18454#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,909 INFO L273 TraceCheckUtils]: 18: Hoare triple {18454#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {18455#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,910 INFO L273 TraceCheckUtils]: 19: Hoare triple {18455#(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); {18455#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,911 INFO L273 TraceCheckUtils]: 20: Hoare triple {18455#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {18455#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,912 INFO L273 TraceCheckUtils]: 21: Hoare triple {18455#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {18456#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,913 INFO L273 TraceCheckUtils]: 22: Hoare triple {18456#(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); {18456#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,913 INFO L273 TraceCheckUtils]: 23: Hoare triple {18456#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {18456#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,914 INFO L273 TraceCheckUtils]: 24: Hoare triple {18456#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {18457#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,915 INFO L273 TraceCheckUtils]: 25: Hoare triple {18457#(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); {18457#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,916 INFO L273 TraceCheckUtils]: 26: Hoare triple {18457#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {18457#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,917 INFO L273 TraceCheckUtils]: 27: Hoare triple {18457#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {18458#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,917 INFO L273 TraceCheckUtils]: 28: Hoare triple {18458#(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); {18458#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,918 INFO L273 TraceCheckUtils]: 29: Hoare triple {18458#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {18458#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,919 INFO L273 TraceCheckUtils]: 30: Hoare triple {18458#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {18459#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,920 INFO L273 TraceCheckUtils]: 31: Hoare triple {18459#(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); {18459#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,921 INFO L273 TraceCheckUtils]: 32: Hoare triple {18459#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {18459#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,921 INFO L273 TraceCheckUtils]: 33: Hoare triple {18459#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {18460#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,922 INFO L273 TraceCheckUtils]: 34: Hoare triple {18460#(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); {18460#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,923 INFO L273 TraceCheckUtils]: 35: Hoare triple {18460#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {18460#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,924 INFO L273 TraceCheckUtils]: 36: Hoare triple {18460#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {18461#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,925 INFO L273 TraceCheckUtils]: 37: Hoare triple {18461#(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); {18461#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,926 INFO L273 TraceCheckUtils]: 38: Hoare triple {18461#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {18461#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,926 INFO L273 TraceCheckUtils]: 39: Hoare triple {18461#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {18462#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,927 INFO L273 TraceCheckUtils]: 40: Hoare triple {18462#(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); {18462#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,928 INFO L273 TraceCheckUtils]: 41: Hoare triple {18462#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {18462#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,929 INFO L273 TraceCheckUtils]: 42: Hoare triple {18462#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {18463#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,930 INFO L273 TraceCheckUtils]: 43: Hoare triple {18463#(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); {18463#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,930 INFO L273 TraceCheckUtils]: 44: Hoare triple {18463#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {18463#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,931 INFO L273 TraceCheckUtils]: 45: Hoare triple {18463#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {18464#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,932 INFO L273 TraceCheckUtils]: 46: Hoare triple {18464#(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); {18464#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,933 INFO L273 TraceCheckUtils]: 47: Hoare triple {18464#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {18464#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,934 INFO L273 TraceCheckUtils]: 48: Hoare triple {18464#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {18465#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,935 INFO L273 TraceCheckUtils]: 49: Hoare triple {18465#(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); {18465#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,935 INFO L273 TraceCheckUtils]: 50: Hoare triple {18465#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {18465#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,936 INFO L273 TraceCheckUtils]: 51: Hoare triple {18465#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {18466#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,937 INFO L273 TraceCheckUtils]: 52: Hoare triple {18466#(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); {18466#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,938 INFO L273 TraceCheckUtils]: 53: Hoare triple {18466#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {18466#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,939 INFO L273 TraceCheckUtils]: 54: Hoare triple {18466#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {18467#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:59:32,940 INFO L273 TraceCheckUtils]: 55: Hoare triple {18467#(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); {18467#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:59:32,941 INFO L273 TraceCheckUtils]: 56: Hoare triple {18467#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {18467#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:59:32,941 INFO L273 TraceCheckUtils]: 57: Hoare triple {18467#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} ~k~0 := 1 + ~k~0; {18468#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,942 INFO L273 TraceCheckUtils]: 58: Hoare triple {18468#(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); {18468#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,943 INFO L273 TraceCheckUtils]: 59: Hoare triple {18468#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {18468#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,944 INFO L273 TraceCheckUtils]: 60: Hoare triple {18468#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {18469#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,945 INFO L273 TraceCheckUtils]: 61: Hoare triple {18469#(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); {18469#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,945 INFO L273 TraceCheckUtils]: 62: Hoare triple {18469#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {18469#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,946 INFO L273 TraceCheckUtils]: 63: Hoare triple {18469#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {18470#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,947 INFO L273 TraceCheckUtils]: 64: Hoare triple {18470#(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); {18470#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,948 INFO L273 TraceCheckUtils]: 65: Hoare triple {18470#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {18470#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,949 INFO L273 TraceCheckUtils]: 66: Hoare triple {18470#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {18471#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,950 INFO L273 TraceCheckUtils]: 67: Hoare triple {18471#(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); {18471#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,950 INFO L273 TraceCheckUtils]: 68: Hoare triple {18471#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {18471#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,951 INFO L273 TraceCheckUtils]: 69: Hoare triple {18471#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {18472#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:32,952 INFO L273 TraceCheckUtils]: 70: Hoare triple {18472#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} assume !(~k~0 < 100000); {18449#false} is VALID [2018-11-23 11:59:32,952 INFO L273 TraceCheckUtils]: 71: Hoare triple {18449#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); {18449#false} is VALID [2018-11-23 11:59:32,952 INFO L273 TraceCheckUtils]: 72: Hoare triple {18449#false} ~x~0 := 0; {18449#false} is VALID [2018-11-23 11:59:32,953 INFO L273 TraceCheckUtils]: 73: Hoare triple {18449#false} assume !(~x~0 < ~i~0); {18449#false} is VALID [2018-11-23 11:59:32,953 INFO L273 TraceCheckUtils]: 74: Hoare triple {18449#false} ~x~0 := ~i~0; {18449#false} is VALID [2018-11-23 11:59:32,953 INFO L273 TraceCheckUtils]: 75: Hoare triple {18449#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); {18449#false} is VALID [2018-11-23 11:59:32,953 INFO L256 TraceCheckUtils]: 76: Hoare triple {18449#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {18448#true} is VALID [2018-11-23 11:59:32,953 INFO L273 TraceCheckUtils]: 77: Hoare triple {18448#true} ~cond := #in~cond; {18448#true} is VALID [2018-11-23 11:59:32,954 INFO L273 TraceCheckUtils]: 78: Hoare triple {18448#true} assume !(0 == ~cond); {18448#true} is VALID [2018-11-23 11:59:32,954 INFO L273 TraceCheckUtils]: 79: Hoare triple {18448#true} assume true; {18448#true} is VALID [2018-11-23 11:59:32,954 INFO L268 TraceCheckUtils]: 80: Hoare quadruple {18448#true} {18449#false} #136#return; {18449#false} is VALID [2018-11-23 11:59:32,954 INFO L273 TraceCheckUtils]: 81: Hoare triple {18449#false} havoc #t~mem9;havoc #t~mem10; {18449#false} is VALID [2018-11-23 11:59:32,954 INFO L273 TraceCheckUtils]: 82: Hoare triple {18449#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {18449#false} is VALID [2018-11-23 11:59:32,955 INFO L273 TraceCheckUtils]: 83: Hoare triple {18449#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); {18449#false} is VALID [2018-11-23 11:59:32,955 INFO L256 TraceCheckUtils]: 84: Hoare triple {18449#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {18449#false} is VALID [2018-11-23 11:59:32,955 INFO L273 TraceCheckUtils]: 85: Hoare triple {18449#false} ~cond := #in~cond; {18449#false} is VALID [2018-11-23 11:59:32,955 INFO L273 TraceCheckUtils]: 86: Hoare triple {18449#false} assume 0 == ~cond; {18449#false} is VALID [2018-11-23 11:59:32,955 INFO L273 TraceCheckUtils]: 87: Hoare triple {18449#false} assume !false; {18449#false} is VALID [2018-11-23 11:59:32,965 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:59:32,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:32,966 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:59:32,974 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:59:33,052 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2018-11-23 11:59:33,052 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:33,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:33,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:33,908 INFO L256 TraceCheckUtils]: 0: Hoare triple {18448#true} call ULTIMATE.init(); {18448#true} is VALID [2018-11-23 11:59:33,908 INFO L273 TraceCheckUtils]: 1: Hoare triple {18448#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {18448#true} is VALID [2018-11-23 11:59:33,909 INFO L273 TraceCheckUtils]: 2: Hoare triple {18448#true} assume true; {18448#true} is VALID [2018-11-23 11:59:33,909 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18448#true} {18448#true} #130#return; {18448#true} is VALID [2018-11-23 11:59:33,909 INFO L256 TraceCheckUtils]: 4: Hoare triple {18448#true} call #t~ret15 := main(); {18448#true} is VALID [2018-11-23 11:59:33,910 INFO L273 TraceCheckUtils]: 5: Hoare triple {18448#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {18491#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:33,910 INFO L273 TraceCheckUtils]: 6: Hoare triple {18491#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {18495#(<= main_~k~0 1)} is VALID [2018-11-23 11:59:33,911 INFO L273 TraceCheckUtils]: 7: Hoare triple {18495#(<= 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); {18495#(<= main_~k~0 1)} is VALID [2018-11-23 11:59:33,911 INFO L273 TraceCheckUtils]: 8: Hoare triple {18495#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {18495#(<= main_~k~0 1)} is VALID [2018-11-23 11:59:33,911 INFO L273 TraceCheckUtils]: 9: Hoare triple {18495#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {18505#(<= main_~k~0 2)} is VALID [2018-11-23 11:59:33,912 INFO L273 TraceCheckUtils]: 10: Hoare triple {18505#(<= 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); {18505#(<= main_~k~0 2)} is VALID [2018-11-23 11:59:33,912 INFO L273 TraceCheckUtils]: 11: Hoare triple {18505#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {18505#(<= main_~k~0 2)} is VALID [2018-11-23 11:59:33,912 INFO L273 TraceCheckUtils]: 12: Hoare triple {18505#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {18515#(<= main_~k~0 3)} is VALID [2018-11-23 11:59:33,913 INFO L273 TraceCheckUtils]: 13: Hoare triple {18515#(<= 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); {18515#(<= main_~k~0 3)} is VALID [2018-11-23 11:59:33,914 INFO L273 TraceCheckUtils]: 14: Hoare triple {18515#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {18515#(<= main_~k~0 3)} is VALID [2018-11-23 11:59:33,914 INFO L273 TraceCheckUtils]: 15: Hoare triple {18515#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {18525#(<= main_~k~0 4)} is VALID [2018-11-23 11:59:33,915 INFO L273 TraceCheckUtils]: 16: Hoare triple {18525#(<= 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); {18525#(<= main_~k~0 4)} is VALID [2018-11-23 11:59:33,915 INFO L273 TraceCheckUtils]: 17: Hoare triple {18525#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {18525#(<= main_~k~0 4)} is VALID [2018-11-23 11:59:33,916 INFO L273 TraceCheckUtils]: 18: Hoare triple {18525#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {18535#(<= main_~k~0 5)} is VALID [2018-11-23 11:59:33,917 INFO L273 TraceCheckUtils]: 19: Hoare triple {18535#(<= 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); {18535#(<= main_~k~0 5)} is VALID [2018-11-23 11:59:33,917 INFO L273 TraceCheckUtils]: 20: Hoare triple {18535#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {18535#(<= main_~k~0 5)} is VALID [2018-11-23 11:59:33,918 INFO L273 TraceCheckUtils]: 21: Hoare triple {18535#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {18545#(<= main_~k~0 6)} is VALID [2018-11-23 11:59:33,918 INFO L273 TraceCheckUtils]: 22: Hoare triple {18545#(<= 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); {18545#(<= main_~k~0 6)} is VALID [2018-11-23 11:59:33,919 INFO L273 TraceCheckUtils]: 23: Hoare triple {18545#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {18545#(<= main_~k~0 6)} is VALID [2018-11-23 11:59:33,920 INFO L273 TraceCheckUtils]: 24: Hoare triple {18545#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {18555#(<= main_~k~0 7)} is VALID [2018-11-23 11:59:33,920 INFO L273 TraceCheckUtils]: 25: Hoare triple {18555#(<= 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); {18555#(<= main_~k~0 7)} is VALID [2018-11-23 11:59:33,921 INFO L273 TraceCheckUtils]: 26: Hoare triple {18555#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {18555#(<= main_~k~0 7)} is VALID [2018-11-23 11:59:33,922 INFO L273 TraceCheckUtils]: 27: Hoare triple {18555#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {18565#(<= main_~k~0 8)} is VALID [2018-11-23 11:59:33,922 INFO L273 TraceCheckUtils]: 28: Hoare triple {18565#(<= 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); {18565#(<= main_~k~0 8)} is VALID [2018-11-23 11:59:33,923 INFO L273 TraceCheckUtils]: 29: Hoare triple {18565#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {18565#(<= main_~k~0 8)} is VALID [2018-11-23 11:59:33,923 INFO L273 TraceCheckUtils]: 30: Hoare triple {18565#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {18575#(<= main_~k~0 9)} is VALID [2018-11-23 11:59:33,924 INFO L273 TraceCheckUtils]: 31: Hoare triple {18575#(<= 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); {18575#(<= main_~k~0 9)} is VALID [2018-11-23 11:59:33,924 INFO L273 TraceCheckUtils]: 32: Hoare triple {18575#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {18575#(<= main_~k~0 9)} is VALID [2018-11-23 11:59:33,925 INFO L273 TraceCheckUtils]: 33: Hoare triple {18575#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {18585#(<= main_~k~0 10)} is VALID [2018-11-23 11:59:33,926 INFO L273 TraceCheckUtils]: 34: Hoare triple {18585#(<= 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); {18585#(<= main_~k~0 10)} is VALID [2018-11-23 11:59:33,926 INFO L273 TraceCheckUtils]: 35: Hoare triple {18585#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {18585#(<= main_~k~0 10)} is VALID [2018-11-23 11:59:33,927 INFO L273 TraceCheckUtils]: 36: Hoare triple {18585#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {18595#(<= main_~k~0 11)} is VALID [2018-11-23 11:59:33,928 INFO L273 TraceCheckUtils]: 37: Hoare triple {18595#(<= 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); {18595#(<= main_~k~0 11)} is VALID [2018-11-23 11:59:33,928 INFO L273 TraceCheckUtils]: 38: Hoare triple {18595#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {18595#(<= main_~k~0 11)} is VALID [2018-11-23 11:59:33,929 INFO L273 TraceCheckUtils]: 39: Hoare triple {18595#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {18605#(<= main_~k~0 12)} is VALID [2018-11-23 11:59:33,929 INFO L273 TraceCheckUtils]: 40: Hoare triple {18605#(<= 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); {18605#(<= main_~k~0 12)} is VALID [2018-11-23 11:59:33,930 INFO L273 TraceCheckUtils]: 41: Hoare triple {18605#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {18605#(<= main_~k~0 12)} is VALID [2018-11-23 11:59:33,931 INFO L273 TraceCheckUtils]: 42: Hoare triple {18605#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {18615#(<= main_~k~0 13)} is VALID [2018-11-23 11:59:33,931 INFO L273 TraceCheckUtils]: 43: Hoare triple {18615#(<= 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); {18615#(<= main_~k~0 13)} is VALID [2018-11-23 11:59:33,932 INFO L273 TraceCheckUtils]: 44: Hoare triple {18615#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {18615#(<= main_~k~0 13)} is VALID [2018-11-23 11:59:33,932 INFO L273 TraceCheckUtils]: 45: Hoare triple {18615#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {18625#(<= main_~k~0 14)} is VALID [2018-11-23 11:59:33,933 INFO L273 TraceCheckUtils]: 46: Hoare triple {18625#(<= 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); {18625#(<= main_~k~0 14)} is VALID [2018-11-23 11:59:33,933 INFO L273 TraceCheckUtils]: 47: Hoare triple {18625#(<= main_~k~0 14)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {18625#(<= main_~k~0 14)} is VALID [2018-11-23 11:59:33,934 INFO L273 TraceCheckUtils]: 48: Hoare triple {18625#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {18635#(<= main_~k~0 15)} is VALID [2018-11-23 11:59:33,935 INFO L273 TraceCheckUtils]: 49: Hoare triple {18635#(<= 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); {18635#(<= main_~k~0 15)} is VALID [2018-11-23 11:59:33,935 INFO L273 TraceCheckUtils]: 50: Hoare triple {18635#(<= main_~k~0 15)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {18635#(<= main_~k~0 15)} is VALID [2018-11-23 11:59:33,936 INFO L273 TraceCheckUtils]: 51: Hoare triple {18635#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {18645#(<= main_~k~0 16)} is VALID [2018-11-23 11:59:33,937 INFO L273 TraceCheckUtils]: 52: Hoare triple {18645#(<= 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); {18645#(<= main_~k~0 16)} is VALID [2018-11-23 11:59:33,937 INFO L273 TraceCheckUtils]: 53: Hoare triple {18645#(<= main_~k~0 16)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {18645#(<= main_~k~0 16)} is VALID [2018-11-23 11:59:33,938 INFO L273 TraceCheckUtils]: 54: Hoare triple {18645#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {18655#(<= main_~k~0 17)} is VALID [2018-11-23 11:59:33,938 INFO L273 TraceCheckUtils]: 55: Hoare triple {18655#(<= 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); {18655#(<= main_~k~0 17)} is VALID [2018-11-23 11:59:33,939 INFO L273 TraceCheckUtils]: 56: Hoare triple {18655#(<= main_~k~0 17)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {18655#(<= main_~k~0 17)} is VALID [2018-11-23 11:59:33,940 INFO L273 TraceCheckUtils]: 57: Hoare triple {18655#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {18665#(<= main_~k~0 18)} is VALID [2018-11-23 11:59:33,940 INFO L273 TraceCheckUtils]: 58: Hoare triple {18665#(<= 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); {18665#(<= main_~k~0 18)} is VALID [2018-11-23 11:59:33,941 INFO L273 TraceCheckUtils]: 59: Hoare triple {18665#(<= main_~k~0 18)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {18665#(<= main_~k~0 18)} is VALID [2018-11-23 11:59:33,941 INFO L273 TraceCheckUtils]: 60: Hoare triple {18665#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {18675#(<= main_~k~0 19)} is VALID [2018-11-23 11:59:33,942 INFO L273 TraceCheckUtils]: 61: Hoare triple {18675#(<= 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); {18675#(<= main_~k~0 19)} is VALID [2018-11-23 11:59:33,943 INFO L273 TraceCheckUtils]: 62: Hoare triple {18675#(<= main_~k~0 19)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {18675#(<= main_~k~0 19)} is VALID [2018-11-23 11:59:33,943 INFO L273 TraceCheckUtils]: 63: Hoare triple {18675#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {18685#(<= main_~k~0 20)} is VALID [2018-11-23 11:59:33,944 INFO L273 TraceCheckUtils]: 64: Hoare triple {18685#(<= 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); {18685#(<= main_~k~0 20)} is VALID [2018-11-23 11:59:33,944 INFO L273 TraceCheckUtils]: 65: Hoare triple {18685#(<= main_~k~0 20)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {18685#(<= main_~k~0 20)} is VALID [2018-11-23 11:59:33,945 INFO L273 TraceCheckUtils]: 66: Hoare triple {18685#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {18695#(<= main_~k~0 21)} is VALID [2018-11-23 11:59:33,946 INFO L273 TraceCheckUtils]: 67: Hoare triple {18695#(<= 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); {18695#(<= main_~k~0 21)} is VALID [2018-11-23 11:59:33,946 INFO L273 TraceCheckUtils]: 68: Hoare triple {18695#(<= main_~k~0 21)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {18695#(<= main_~k~0 21)} is VALID [2018-11-23 11:59:33,947 INFO L273 TraceCheckUtils]: 69: Hoare triple {18695#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {18705#(<= main_~k~0 22)} is VALID [2018-11-23 11:59:33,948 INFO L273 TraceCheckUtils]: 70: Hoare triple {18705#(<= main_~k~0 22)} assume !(~k~0 < 100000); {18449#false} is VALID [2018-11-23 11:59:33,948 INFO L273 TraceCheckUtils]: 71: Hoare triple {18449#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); {18449#false} is VALID [2018-11-23 11:59:33,948 INFO L273 TraceCheckUtils]: 72: Hoare triple {18449#false} ~x~0 := 0; {18449#false} is VALID [2018-11-23 11:59:33,948 INFO L273 TraceCheckUtils]: 73: Hoare triple {18449#false} assume !(~x~0 < ~i~0); {18449#false} is VALID [2018-11-23 11:59:33,948 INFO L273 TraceCheckUtils]: 74: Hoare triple {18449#false} ~x~0 := ~i~0; {18449#false} is VALID [2018-11-23 11:59:33,949 INFO L273 TraceCheckUtils]: 75: Hoare triple {18449#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); {18449#false} is VALID [2018-11-23 11:59:33,949 INFO L256 TraceCheckUtils]: 76: Hoare triple {18449#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {18449#false} is VALID [2018-11-23 11:59:33,949 INFO L273 TraceCheckUtils]: 77: Hoare triple {18449#false} ~cond := #in~cond; {18449#false} is VALID [2018-11-23 11:59:33,949 INFO L273 TraceCheckUtils]: 78: Hoare triple {18449#false} assume !(0 == ~cond); {18449#false} is VALID [2018-11-23 11:59:33,949 INFO L273 TraceCheckUtils]: 79: Hoare triple {18449#false} assume true; {18449#false} is VALID [2018-11-23 11:59:33,950 INFO L268 TraceCheckUtils]: 80: Hoare quadruple {18449#false} {18449#false} #136#return; {18449#false} is VALID [2018-11-23 11:59:33,950 INFO L273 TraceCheckUtils]: 81: Hoare triple {18449#false} havoc #t~mem9;havoc #t~mem10; {18449#false} is VALID [2018-11-23 11:59:33,950 INFO L273 TraceCheckUtils]: 82: Hoare triple {18449#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {18449#false} is VALID [2018-11-23 11:59:33,950 INFO L273 TraceCheckUtils]: 83: Hoare triple {18449#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); {18449#false} is VALID [2018-11-23 11:59:33,950 INFO L256 TraceCheckUtils]: 84: Hoare triple {18449#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {18449#false} is VALID [2018-11-23 11:59:33,951 INFO L273 TraceCheckUtils]: 85: Hoare triple {18449#false} ~cond := #in~cond; {18449#false} is VALID [2018-11-23 11:59:33,951 INFO L273 TraceCheckUtils]: 86: Hoare triple {18449#false} assume 0 == ~cond; {18449#false} is VALID [2018-11-23 11:59:33,951 INFO L273 TraceCheckUtils]: 87: Hoare triple {18449#false} assume !false; {18449#false} is VALID [2018-11-23 11:59:33,955 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:59:33,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:33,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-23 11:59:33,976 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 88 [2018-11-23 11:59:33,977 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:33,977 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 11:59:34,136 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:59:34,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 11:59:34,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 11:59:34,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=853, Invalid=1403, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 11:59:34,138 INFO L87 Difference]: Start difference. First operand 180 states and 237 transitions. Second operand 48 states. [2018-11-23 11:59:34,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:34,958 INFO L93 Difference]: Finished difference Result 243 states and 323 transitions. [2018-11-23 11:59:34,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 11:59:34,958 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 88 [2018-11-23 11:59:34,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:34,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 11:59:34,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 195 transitions. [2018-11-23 11:59:34,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 11:59:34,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 195 transitions. [2018-11-23 11:59:34,962 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 195 transitions. [2018-11-23 11:59:35,227 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:59:35,231 INFO L225 Difference]: With dead ends: 243 [2018-11-23 11:59:35,231 INFO L226 Difference]: Without dead ends: 196 [2018-11-23 11:59:35,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=853, Invalid=1403, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 11:59:35,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-11-23 11:59:35,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 186. [2018-11-23 11:59:35,660 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:35,660 INFO L82 GeneralOperation]: Start isEquivalent. First operand 196 states. Second operand 186 states. [2018-11-23 11:59:35,660 INFO L74 IsIncluded]: Start isIncluded. First operand 196 states. Second operand 186 states. [2018-11-23 11:59:35,660 INFO L87 Difference]: Start difference. First operand 196 states. Second operand 186 states. [2018-11-23 11:59:35,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:35,664 INFO L93 Difference]: Finished difference Result 196 states and 260 transitions. [2018-11-23 11:59:35,664 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 260 transitions. [2018-11-23 11:59:35,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:35,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:35,665 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand 196 states. [2018-11-23 11:59:35,665 INFO L87 Difference]: Start difference. First operand 186 states. Second operand 196 states. [2018-11-23 11:59:35,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:35,669 INFO L93 Difference]: Finished difference Result 196 states and 260 transitions. [2018-11-23 11:59:35,670 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 260 transitions. [2018-11-23 11:59:35,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:35,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:35,670 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:35,670 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:35,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-11-23 11:59:35,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 245 transitions. [2018-11-23 11:59:35,674 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 245 transitions. Word has length 88 [2018-11-23 11:59:35,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:35,675 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 245 transitions. [2018-11-23 11:59:35,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 11:59:35,675 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 245 transitions. [2018-11-23 11:59:35,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 11:59:35,676 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:35,676 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:59:35,676 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:35,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:35,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1991798956, now seen corresponding path program 18 times [2018-11-23 11:59:35,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:35,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:35,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:35,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:35,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:35,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:36,399 INFO L256 TraceCheckUtils]: 0: Hoare triple {19734#true} call ULTIMATE.init(); {19734#true} is VALID [2018-11-23 11:59:36,399 INFO L273 TraceCheckUtils]: 1: Hoare triple {19734#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19734#true} is VALID [2018-11-23 11:59:36,400 INFO L273 TraceCheckUtils]: 2: Hoare triple {19734#true} assume true; {19734#true} is VALID [2018-11-23 11:59:36,400 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19734#true} {19734#true} #130#return; {19734#true} is VALID [2018-11-23 11:59:36,400 INFO L256 TraceCheckUtils]: 4: Hoare triple {19734#true} call #t~ret15 := main(); {19734#true} is VALID [2018-11-23 11:59:36,401 INFO L273 TraceCheckUtils]: 5: Hoare triple {19734#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {19736#(= main_~i~0 0)} is VALID [2018-11-23 11:59:36,401 INFO L273 TraceCheckUtils]: 6: Hoare triple {19736#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {19737#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,402 INFO L273 TraceCheckUtils]: 7: Hoare triple {19737#(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); {19737#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,403 INFO L273 TraceCheckUtils]: 8: Hoare triple {19737#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {19737#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,403 INFO L273 TraceCheckUtils]: 9: Hoare triple {19737#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {19738#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,404 INFO L273 TraceCheckUtils]: 10: Hoare triple {19738#(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); {19738#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,404 INFO L273 TraceCheckUtils]: 11: Hoare triple {19738#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {19738#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,405 INFO L273 TraceCheckUtils]: 12: Hoare triple {19738#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {19739#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,406 INFO L273 TraceCheckUtils]: 13: Hoare triple {19739#(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); {19739#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,406 INFO L273 TraceCheckUtils]: 14: Hoare triple {19739#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {19739#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,407 INFO L273 TraceCheckUtils]: 15: Hoare triple {19739#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {19740#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,408 INFO L273 TraceCheckUtils]: 16: Hoare triple {19740#(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); {19740#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,409 INFO L273 TraceCheckUtils]: 17: Hoare triple {19740#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {19740#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,410 INFO L273 TraceCheckUtils]: 18: Hoare triple {19740#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {19741#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,411 INFO L273 TraceCheckUtils]: 19: Hoare triple {19741#(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); {19741#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,411 INFO L273 TraceCheckUtils]: 20: Hoare triple {19741#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {19741#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,412 INFO L273 TraceCheckUtils]: 21: Hoare triple {19741#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {19742#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,413 INFO L273 TraceCheckUtils]: 22: Hoare triple {19742#(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); {19742#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,414 INFO L273 TraceCheckUtils]: 23: Hoare triple {19742#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {19742#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,415 INFO L273 TraceCheckUtils]: 24: Hoare triple {19742#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {19743#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,416 INFO L273 TraceCheckUtils]: 25: Hoare triple {19743#(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); {19743#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,416 INFO L273 TraceCheckUtils]: 26: Hoare triple {19743#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {19743#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,417 INFO L273 TraceCheckUtils]: 27: Hoare triple {19743#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {19744#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,418 INFO L273 TraceCheckUtils]: 28: Hoare triple {19744#(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); {19744#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,419 INFO L273 TraceCheckUtils]: 29: Hoare triple {19744#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {19744#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,420 INFO L273 TraceCheckUtils]: 30: Hoare triple {19744#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {19745#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,421 INFO L273 TraceCheckUtils]: 31: Hoare triple {19745#(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); {19745#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,421 INFO L273 TraceCheckUtils]: 32: Hoare triple {19745#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {19745#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,422 INFO L273 TraceCheckUtils]: 33: Hoare triple {19745#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {19746#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,423 INFO L273 TraceCheckUtils]: 34: Hoare triple {19746#(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); {19746#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,424 INFO L273 TraceCheckUtils]: 35: Hoare triple {19746#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {19746#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,425 INFO L273 TraceCheckUtils]: 36: Hoare triple {19746#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {19747#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,426 INFO L273 TraceCheckUtils]: 37: Hoare triple {19747#(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); {19747#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,426 INFO L273 TraceCheckUtils]: 38: Hoare triple {19747#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {19747#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,427 INFO L273 TraceCheckUtils]: 39: Hoare triple {19747#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {19748#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,428 INFO L273 TraceCheckUtils]: 40: Hoare triple {19748#(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); {19748#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,429 INFO L273 TraceCheckUtils]: 41: Hoare triple {19748#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {19748#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,430 INFO L273 TraceCheckUtils]: 42: Hoare triple {19748#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {19749#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,431 INFO L273 TraceCheckUtils]: 43: Hoare triple {19749#(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); {19749#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,431 INFO L273 TraceCheckUtils]: 44: Hoare triple {19749#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {19749#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,432 INFO L273 TraceCheckUtils]: 45: Hoare triple {19749#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {19750#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,433 INFO L273 TraceCheckUtils]: 46: Hoare triple {19750#(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); {19750#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,434 INFO L273 TraceCheckUtils]: 47: Hoare triple {19750#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {19750#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,434 INFO L273 TraceCheckUtils]: 48: Hoare triple {19750#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {19751#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,435 INFO L273 TraceCheckUtils]: 49: Hoare triple {19751#(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); {19751#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,436 INFO L273 TraceCheckUtils]: 50: Hoare triple {19751#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {19751#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,437 INFO L273 TraceCheckUtils]: 51: Hoare triple {19751#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {19752#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,438 INFO L273 TraceCheckUtils]: 52: Hoare triple {19752#(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); {19752#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,439 INFO L273 TraceCheckUtils]: 53: Hoare triple {19752#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {19752#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,440 INFO L273 TraceCheckUtils]: 54: Hoare triple {19752#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {19753#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:59:36,440 INFO L273 TraceCheckUtils]: 55: Hoare triple {19753#(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); {19753#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:59:36,441 INFO L273 TraceCheckUtils]: 56: Hoare triple {19753#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {19753#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:59:36,442 INFO L273 TraceCheckUtils]: 57: Hoare triple {19753#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} ~k~0 := 1 + ~k~0; {19754#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,443 INFO L273 TraceCheckUtils]: 58: Hoare triple {19754#(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); {19754#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,444 INFO L273 TraceCheckUtils]: 59: Hoare triple {19754#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {19754#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,444 INFO L273 TraceCheckUtils]: 60: Hoare triple {19754#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {19755#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,445 INFO L273 TraceCheckUtils]: 61: Hoare triple {19755#(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); {19755#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,446 INFO L273 TraceCheckUtils]: 62: Hoare triple {19755#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {19755#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,447 INFO L273 TraceCheckUtils]: 63: Hoare triple {19755#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {19756#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,448 INFO L273 TraceCheckUtils]: 64: Hoare triple {19756#(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); {19756#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,448 INFO L273 TraceCheckUtils]: 65: Hoare triple {19756#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {19756#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,449 INFO L273 TraceCheckUtils]: 66: Hoare triple {19756#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {19757#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,450 INFO L273 TraceCheckUtils]: 67: Hoare triple {19757#(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); {19757#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,451 INFO L273 TraceCheckUtils]: 68: Hoare triple {19757#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {19757#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,452 INFO L273 TraceCheckUtils]: 69: Hoare triple {19757#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {19758#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,453 INFO L273 TraceCheckUtils]: 70: Hoare triple {19758#(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); {19758#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,453 INFO L273 TraceCheckUtils]: 71: Hoare triple {19758#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {19758#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,454 INFO L273 TraceCheckUtils]: 72: Hoare triple {19758#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {19759#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:36,455 INFO L273 TraceCheckUtils]: 73: Hoare triple {19759#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} assume !(~k~0 < 100000); {19735#false} is VALID [2018-11-23 11:59:36,455 INFO L273 TraceCheckUtils]: 74: Hoare triple {19735#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); {19735#false} is VALID [2018-11-23 11:59:36,455 INFO L273 TraceCheckUtils]: 75: Hoare triple {19735#false} ~x~0 := 0; {19735#false} is VALID [2018-11-23 11:59:36,456 INFO L273 TraceCheckUtils]: 76: Hoare triple {19735#false} assume !(~x~0 < ~i~0); {19735#false} is VALID [2018-11-23 11:59:36,456 INFO L273 TraceCheckUtils]: 77: Hoare triple {19735#false} ~x~0 := ~i~0; {19735#false} is VALID [2018-11-23 11:59:36,456 INFO L273 TraceCheckUtils]: 78: Hoare triple {19735#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); {19735#false} is VALID [2018-11-23 11:59:36,456 INFO L256 TraceCheckUtils]: 79: Hoare triple {19735#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {19734#true} is VALID [2018-11-23 11:59:36,456 INFO L273 TraceCheckUtils]: 80: Hoare triple {19734#true} ~cond := #in~cond; {19734#true} is VALID [2018-11-23 11:59:36,457 INFO L273 TraceCheckUtils]: 81: Hoare triple {19734#true} assume !(0 == ~cond); {19734#true} is VALID [2018-11-23 11:59:36,457 INFO L273 TraceCheckUtils]: 82: Hoare triple {19734#true} assume true; {19734#true} is VALID [2018-11-23 11:59:36,457 INFO L268 TraceCheckUtils]: 83: Hoare quadruple {19734#true} {19735#false} #136#return; {19735#false} is VALID [2018-11-23 11:59:36,457 INFO L273 TraceCheckUtils]: 84: Hoare triple {19735#false} havoc #t~mem9;havoc #t~mem10; {19735#false} is VALID [2018-11-23 11:59:36,457 INFO L273 TraceCheckUtils]: 85: Hoare triple {19735#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {19735#false} is VALID [2018-11-23 11:59:36,457 INFO L273 TraceCheckUtils]: 86: Hoare triple {19735#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); {19735#false} is VALID [2018-11-23 11:59:36,458 INFO L256 TraceCheckUtils]: 87: Hoare triple {19735#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {19735#false} is VALID [2018-11-23 11:59:36,458 INFO L273 TraceCheckUtils]: 88: Hoare triple {19735#false} ~cond := #in~cond; {19735#false} is VALID [2018-11-23 11:59:36,458 INFO L273 TraceCheckUtils]: 89: Hoare triple {19735#false} assume 0 == ~cond; {19735#false} is VALID [2018-11-23 11:59:36,458 INFO L273 TraceCheckUtils]: 90: Hoare triple {19735#false} assume !false; {19735#false} is VALID [2018-11-23 11:59:36,469 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:59:36,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:36,469 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:59:36,477 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:59:36,597 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) [2018-11-23 11:59:36,597 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:36,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:36,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:37,208 INFO L256 TraceCheckUtils]: 0: Hoare triple {19734#true} call ULTIMATE.init(); {19734#true} is VALID [2018-11-23 11:59:37,209 INFO L273 TraceCheckUtils]: 1: Hoare triple {19734#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19734#true} is VALID [2018-11-23 11:59:37,209 INFO L273 TraceCheckUtils]: 2: Hoare triple {19734#true} assume true; {19734#true} is VALID [2018-11-23 11:59:37,209 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19734#true} {19734#true} #130#return; {19734#true} is VALID [2018-11-23 11:59:37,209 INFO L256 TraceCheckUtils]: 4: Hoare triple {19734#true} call #t~ret15 := main(); {19734#true} is VALID [2018-11-23 11:59:37,210 INFO L273 TraceCheckUtils]: 5: Hoare triple {19734#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {19778#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:37,211 INFO L273 TraceCheckUtils]: 6: Hoare triple {19778#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {19782#(<= main_~k~0 1)} is VALID [2018-11-23 11:59:37,211 INFO L273 TraceCheckUtils]: 7: Hoare triple {19782#(<= 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); {19782#(<= main_~k~0 1)} is VALID [2018-11-23 11:59:37,211 INFO L273 TraceCheckUtils]: 8: Hoare triple {19782#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {19782#(<= main_~k~0 1)} is VALID [2018-11-23 11:59:37,212 INFO L273 TraceCheckUtils]: 9: Hoare triple {19782#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {19792#(<= main_~k~0 2)} is VALID [2018-11-23 11:59:37,212 INFO L273 TraceCheckUtils]: 10: Hoare triple {19792#(<= 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); {19792#(<= main_~k~0 2)} is VALID [2018-11-23 11:59:37,213 INFO L273 TraceCheckUtils]: 11: Hoare triple {19792#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {19792#(<= main_~k~0 2)} is VALID [2018-11-23 11:59:37,213 INFO L273 TraceCheckUtils]: 12: Hoare triple {19792#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {19802#(<= main_~k~0 3)} is VALID [2018-11-23 11:59:37,214 INFO L273 TraceCheckUtils]: 13: Hoare triple {19802#(<= 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); {19802#(<= main_~k~0 3)} is VALID [2018-11-23 11:59:37,214 INFO L273 TraceCheckUtils]: 14: Hoare triple {19802#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {19802#(<= main_~k~0 3)} is VALID [2018-11-23 11:59:37,215 INFO L273 TraceCheckUtils]: 15: Hoare triple {19802#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {19812#(<= main_~k~0 4)} is VALID [2018-11-23 11:59:37,216 INFO L273 TraceCheckUtils]: 16: Hoare triple {19812#(<= 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); {19812#(<= main_~k~0 4)} is VALID [2018-11-23 11:59:37,216 INFO L273 TraceCheckUtils]: 17: Hoare triple {19812#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {19812#(<= main_~k~0 4)} is VALID [2018-11-23 11:59:37,217 INFO L273 TraceCheckUtils]: 18: Hoare triple {19812#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {19822#(<= main_~k~0 5)} is VALID [2018-11-23 11:59:37,217 INFO L273 TraceCheckUtils]: 19: Hoare triple {19822#(<= 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); {19822#(<= main_~k~0 5)} is VALID [2018-11-23 11:59:37,218 INFO L273 TraceCheckUtils]: 20: Hoare triple {19822#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {19822#(<= main_~k~0 5)} is VALID [2018-11-23 11:59:37,219 INFO L273 TraceCheckUtils]: 21: Hoare triple {19822#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {19832#(<= main_~k~0 6)} is VALID [2018-11-23 11:59:37,219 INFO L273 TraceCheckUtils]: 22: Hoare triple {19832#(<= 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); {19832#(<= main_~k~0 6)} is VALID [2018-11-23 11:59:37,220 INFO L273 TraceCheckUtils]: 23: Hoare triple {19832#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {19832#(<= main_~k~0 6)} is VALID [2018-11-23 11:59:37,220 INFO L273 TraceCheckUtils]: 24: Hoare triple {19832#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {19842#(<= main_~k~0 7)} is VALID [2018-11-23 11:59:37,221 INFO L273 TraceCheckUtils]: 25: Hoare triple {19842#(<= 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); {19842#(<= main_~k~0 7)} is VALID [2018-11-23 11:59:37,222 INFO L273 TraceCheckUtils]: 26: Hoare triple {19842#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {19842#(<= main_~k~0 7)} is VALID [2018-11-23 11:59:37,222 INFO L273 TraceCheckUtils]: 27: Hoare triple {19842#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {19852#(<= main_~k~0 8)} is VALID [2018-11-23 11:59:37,223 INFO L273 TraceCheckUtils]: 28: Hoare triple {19852#(<= 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); {19852#(<= main_~k~0 8)} is VALID [2018-11-23 11:59:37,223 INFO L273 TraceCheckUtils]: 29: Hoare triple {19852#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {19852#(<= main_~k~0 8)} is VALID [2018-11-23 11:59:37,224 INFO L273 TraceCheckUtils]: 30: Hoare triple {19852#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {19862#(<= main_~k~0 9)} is VALID [2018-11-23 11:59:37,225 INFO L273 TraceCheckUtils]: 31: Hoare triple {19862#(<= 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); {19862#(<= main_~k~0 9)} is VALID [2018-11-23 11:59:37,225 INFO L273 TraceCheckUtils]: 32: Hoare triple {19862#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {19862#(<= main_~k~0 9)} is VALID [2018-11-23 11:59:37,226 INFO L273 TraceCheckUtils]: 33: Hoare triple {19862#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {19872#(<= main_~k~0 10)} is VALID [2018-11-23 11:59:37,226 INFO L273 TraceCheckUtils]: 34: Hoare triple {19872#(<= 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); {19872#(<= main_~k~0 10)} is VALID [2018-11-23 11:59:37,227 INFO L273 TraceCheckUtils]: 35: Hoare triple {19872#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {19872#(<= main_~k~0 10)} is VALID [2018-11-23 11:59:37,228 INFO L273 TraceCheckUtils]: 36: Hoare triple {19872#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {19882#(<= main_~k~0 11)} is VALID [2018-11-23 11:59:37,228 INFO L273 TraceCheckUtils]: 37: Hoare triple {19882#(<= 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); {19882#(<= main_~k~0 11)} is VALID [2018-11-23 11:59:37,229 INFO L273 TraceCheckUtils]: 38: Hoare triple {19882#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {19882#(<= main_~k~0 11)} is VALID [2018-11-23 11:59:37,230 INFO L273 TraceCheckUtils]: 39: Hoare triple {19882#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {19892#(<= main_~k~0 12)} is VALID [2018-11-23 11:59:37,230 INFO L273 TraceCheckUtils]: 40: Hoare triple {19892#(<= 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); {19892#(<= main_~k~0 12)} is VALID [2018-11-23 11:59:37,231 INFO L273 TraceCheckUtils]: 41: Hoare triple {19892#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {19892#(<= main_~k~0 12)} is VALID [2018-11-23 11:59:37,231 INFO L273 TraceCheckUtils]: 42: Hoare triple {19892#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {19902#(<= main_~k~0 13)} is VALID [2018-11-23 11:59:37,232 INFO L273 TraceCheckUtils]: 43: Hoare triple {19902#(<= 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); {19902#(<= main_~k~0 13)} is VALID [2018-11-23 11:59:37,232 INFO L273 TraceCheckUtils]: 44: Hoare triple {19902#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {19902#(<= main_~k~0 13)} is VALID [2018-11-23 11:59:37,233 INFO L273 TraceCheckUtils]: 45: Hoare triple {19902#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {19912#(<= main_~k~0 14)} is VALID [2018-11-23 11:59:37,234 INFO L273 TraceCheckUtils]: 46: Hoare triple {19912#(<= 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); {19912#(<= main_~k~0 14)} is VALID [2018-11-23 11:59:37,234 INFO L273 TraceCheckUtils]: 47: Hoare triple {19912#(<= main_~k~0 14)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {19912#(<= main_~k~0 14)} is VALID [2018-11-23 11:59:37,235 INFO L273 TraceCheckUtils]: 48: Hoare triple {19912#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {19922#(<= main_~k~0 15)} is VALID [2018-11-23 11:59:37,235 INFO L273 TraceCheckUtils]: 49: Hoare triple {19922#(<= 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); {19922#(<= main_~k~0 15)} is VALID [2018-11-23 11:59:37,236 INFO L273 TraceCheckUtils]: 50: Hoare triple {19922#(<= main_~k~0 15)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {19922#(<= main_~k~0 15)} is VALID [2018-11-23 11:59:37,237 INFO L273 TraceCheckUtils]: 51: Hoare triple {19922#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {19932#(<= main_~k~0 16)} is VALID [2018-11-23 11:59:37,237 INFO L273 TraceCheckUtils]: 52: Hoare triple {19932#(<= 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); {19932#(<= main_~k~0 16)} is VALID [2018-11-23 11:59:37,238 INFO L273 TraceCheckUtils]: 53: Hoare triple {19932#(<= main_~k~0 16)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {19932#(<= main_~k~0 16)} is VALID [2018-11-23 11:59:37,239 INFO L273 TraceCheckUtils]: 54: Hoare triple {19932#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {19942#(<= main_~k~0 17)} is VALID [2018-11-23 11:59:37,239 INFO L273 TraceCheckUtils]: 55: Hoare triple {19942#(<= 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); {19942#(<= main_~k~0 17)} is VALID [2018-11-23 11:59:37,240 INFO L273 TraceCheckUtils]: 56: Hoare triple {19942#(<= main_~k~0 17)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {19942#(<= main_~k~0 17)} is VALID [2018-11-23 11:59:37,240 INFO L273 TraceCheckUtils]: 57: Hoare triple {19942#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {19952#(<= main_~k~0 18)} is VALID [2018-11-23 11:59:37,241 INFO L273 TraceCheckUtils]: 58: Hoare triple {19952#(<= 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); {19952#(<= main_~k~0 18)} is VALID [2018-11-23 11:59:37,241 INFO L273 TraceCheckUtils]: 59: Hoare triple {19952#(<= main_~k~0 18)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {19952#(<= main_~k~0 18)} is VALID [2018-11-23 11:59:37,242 INFO L273 TraceCheckUtils]: 60: Hoare triple {19952#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {19962#(<= main_~k~0 19)} is VALID [2018-11-23 11:59:37,243 INFO L273 TraceCheckUtils]: 61: Hoare triple {19962#(<= 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); {19962#(<= main_~k~0 19)} is VALID [2018-11-23 11:59:37,243 INFO L273 TraceCheckUtils]: 62: Hoare triple {19962#(<= main_~k~0 19)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {19962#(<= main_~k~0 19)} is VALID [2018-11-23 11:59:37,244 INFO L273 TraceCheckUtils]: 63: Hoare triple {19962#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {19972#(<= main_~k~0 20)} is VALID [2018-11-23 11:59:37,244 INFO L273 TraceCheckUtils]: 64: Hoare triple {19972#(<= 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); {19972#(<= main_~k~0 20)} is VALID [2018-11-23 11:59:37,245 INFO L273 TraceCheckUtils]: 65: Hoare triple {19972#(<= main_~k~0 20)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {19972#(<= main_~k~0 20)} is VALID [2018-11-23 11:59:37,246 INFO L273 TraceCheckUtils]: 66: Hoare triple {19972#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {19982#(<= main_~k~0 21)} is VALID [2018-11-23 11:59:37,246 INFO L273 TraceCheckUtils]: 67: Hoare triple {19982#(<= 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); {19982#(<= main_~k~0 21)} is VALID [2018-11-23 11:59:37,247 INFO L273 TraceCheckUtils]: 68: Hoare triple {19982#(<= main_~k~0 21)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {19982#(<= main_~k~0 21)} is VALID [2018-11-23 11:59:37,248 INFO L273 TraceCheckUtils]: 69: Hoare triple {19982#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {19992#(<= main_~k~0 22)} is VALID [2018-11-23 11:59:37,248 INFO L273 TraceCheckUtils]: 70: Hoare triple {19992#(<= 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); {19992#(<= main_~k~0 22)} is VALID [2018-11-23 11:59:37,249 INFO L273 TraceCheckUtils]: 71: Hoare triple {19992#(<= main_~k~0 22)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {19992#(<= main_~k~0 22)} is VALID [2018-11-23 11:59:37,249 INFO L273 TraceCheckUtils]: 72: Hoare triple {19992#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {20002#(<= main_~k~0 23)} is VALID [2018-11-23 11:59:37,250 INFO L273 TraceCheckUtils]: 73: Hoare triple {20002#(<= main_~k~0 23)} assume !(~k~0 < 100000); {19735#false} is VALID [2018-11-23 11:59:37,250 INFO L273 TraceCheckUtils]: 74: Hoare triple {19735#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); {19735#false} is VALID [2018-11-23 11:59:37,250 INFO L273 TraceCheckUtils]: 75: Hoare triple {19735#false} ~x~0 := 0; {19735#false} is VALID [2018-11-23 11:59:37,251 INFO L273 TraceCheckUtils]: 76: Hoare triple {19735#false} assume !(~x~0 < ~i~0); {19735#false} is VALID [2018-11-23 11:59:37,251 INFO L273 TraceCheckUtils]: 77: Hoare triple {19735#false} ~x~0 := ~i~0; {19735#false} is VALID [2018-11-23 11:59:37,251 INFO L273 TraceCheckUtils]: 78: Hoare triple {19735#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); {19735#false} is VALID [2018-11-23 11:59:37,251 INFO L256 TraceCheckUtils]: 79: Hoare triple {19735#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {19735#false} is VALID [2018-11-23 11:59:37,251 INFO L273 TraceCheckUtils]: 80: Hoare triple {19735#false} ~cond := #in~cond; {19735#false} is VALID [2018-11-23 11:59:37,252 INFO L273 TraceCheckUtils]: 81: Hoare triple {19735#false} assume !(0 == ~cond); {19735#false} is VALID [2018-11-23 11:59:37,252 INFO L273 TraceCheckUtils]: 82: Hoare triple {19735#false} assume true; {19735#false} is VALID [2018-11-23 11:59:37,252 INFO L268 TraceCheckUtils]: 83: Hoare quadruple {19735#false} {19735#false} #136#return; {19735#false} is VALID [2018-11-23 11:59:37,252 INFO L273 TraceCheckUtils]: 84: Hoare triple {19735#false} havoc #t~mem9;havoc #t~mem10; {19735#false} is VALID [2018-11-23 11:59:37,252 INFO L273 TraceCheckUtils]: 85: Hoare triple {19735#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {19735#false} is VALID [2018-11-23 11:59:37,253 INFO L273 TraceCheckUtils]: 86: Hoare triple {19735#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); {19735#false} is VALID [2018-11-23 11:59:37,253 INFO L256 TraceCheckUtils]: 87: Hoare triple {19735#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {19735#false} is VALID [2018-11-23 11:59:37,253 INFO L273 TraceCheckUtils]: 88: Hoare triple {19735#false} ~cond := #in~cond; {19735#false} is VALID [2018-11-23 11:59:37,253 INFO L273 TraceCheckUtils]: 89: Hoare triple {19735#false} assume 0 == ~cond; {19735#false} is VALID [2018-11-23 11:59:37,253 INFO L273 TraceCheckUtils]: 90: Hoare triple {19735#false} assume !false; {19735#false} is VALID [2018-11-23 11:59:37,259 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:59:37,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:37,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2018-11-23 11:59:37,281 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 91 [2018-11-23 11:59:37,281 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:37,281 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states. [2018-11-23 11:59:37,504 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:37,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-23 11:59:37,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-23 11:59:37,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=926, Invalid=1524, Unknown=0, NotChecked=0, Total=2450 [2018-11-23 11:59:37,506 INFO L87 Difference]: Start difference. First operand 186 states and 245 transitions. Second operand 50 states. [2018-11-23 11:59:38,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:38,442 INFO L93 Difference]: Finished difference Result 249 states and 331 transitions. [2018-11-23 11:59:38,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 11:59:38,442 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 91 [2018-11-23 11:59:38,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:38,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 11:59:38,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 199 transitions. [2018-11-23 11:59:38,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 11:59:38,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 199 transitions. [2018-11-23 11:59:38,447 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 199 transitions. [2018-11-23 11:59:38,687 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:59:38,691 INFO L225 Difference]: With dead ends: 249 [2018-11-23 11:59:38,691 INFO L226 Difference]: Without dead ends: 202 [2018-11-23 11:59:38,692 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:59:38,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-11-23 11:59:38,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 192. [2018-11-23 11:59:38,944 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:38,944 INFO L82 GeneralOperation]: Start isEquivalent. First operand 202 states. Second operand 192 states. [2018-11-23 11:59:38,944 INFO L74 IsIncluded]: Start isIncluded. First operand 202 states. Second operand 192 states. [2018-11-23 11:59:38,944 INFO L87 Difference]: Start difference. First operand 202 states. Second operand 192 states. [2018-11-23 11:59:38,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:38,949 INFO L93 Difference]: Finished difference Result 202 states and 268 transitions. [2018-11-23 11:59:38,949 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 268 transitions. [2018-11-23 11:59:38,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:38,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:38,950 INFO L74 IsIncluded]: Start isIncluded. First operand 192 states. Second operand 202 states. [2018-11-23 11:59:38,950 INFO L87 Difference]: Start difference. First operand 192 states. Second operand 202 states. [2018-11-23 11:59:38,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:38,954 INFO L93 Difference]: Finished difference Result 202 states and 268 transitions. [2018-11-23 11:59:38,954 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 268 transitions. [2018-11-23 11:59:38,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:38,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:38,955 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:38,955 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:38,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-11-23 11:59:38,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 253 transitions. [2018-11-23 11:59:38,959 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 253 transitions. Word has length 91 [2018-11-23 11:59:38,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:38,960 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 253 transitions. [2018-11-23 11:59:38,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-23 11:59:38,960 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 253 transitions. [2018-11-23 11:59:38,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-23 11:59:38,960 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:38,960 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:59:38,961 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:38,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:38,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1545739345, now seen corresponding path program 19 times [2018-11-23 11:59:38,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:38,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:38,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:38,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:38,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:38,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:39,691 INFO L256 TraceCheckUtils]: 0: Hoare triple {21059#true} call ULTIMATE.init(); {21059#true} is VALID [2018-11-23 11:59:39,692 INFO L273 TraceCheckUtils]: 1: Hoare triple {21059#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21059#true} is VALID [2018-11-23 11:59:39,692 INFO L273 TraceCheckUtils]: 2: Hoare triple {21059#true} assume true; {21059#true} is VALID [2018-11-23 11:59:39,692 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21059#true} {21059#true} #130#return; {21059#true} is VALID [2018-11-23 11:59:39,693 INFO L256 TraceCheckUtils]: 4: Hoare triple {21059#true} call #t~ret15 := main(); {21059#true} is VALID [2018-11-23 11:59:39,696 INFO L273 TraceCheckUtils]: 5: Hoare triple {21059#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {21061#(= main_~i~0 0)} is VALID [2018-11-23 11:59:39,697 INFO L273 TraceCheckUtils]: 6: Hoare triple {21061#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {21062#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,698 INFO L273 TraceCheckUtils]: 7: Hoare triple {21062#(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); {21062#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,698 INFO L273 TraceCheckUtils]: 8: Hoare triple {21062#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {21062#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,705 INFO L273 TraceCheckUtils]: 9: Hoare triple {21062#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {21063#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,706 INFO L273 TraceCheckUtils]: 10: Hoare triple {21063#(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); {21063#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,707 INFO L273 TraceCheckUtils]: 11: Hoare triple {21063#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {21063#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,707 INFO L273 TraceCheckUtils]: 12: Hoare triple {21063#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {21064#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,708 INFO L273 TraceCheckUtils]: 13: Hoare triple {21064#(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); {21064#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,708 INFO L273 TraceCheckUtils]: 14: Hoare triple {21064#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {21064#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,709 INFO L273 TraceCheckUtils]: 15: Hoare triple {21064#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {21065#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,709 INFO L273 TraceCheckUtils]: 16: Hoare triple {21065#(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); {21065#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,710 INFO L273 TraceCheckUtils]: 17: Hoare triple {21065#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {21065#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,710 INFO L273 TraceCheckUtils]: 18: Hoare triple {21065#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {21066#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,711 INFO L273 TraceCheckUtils]: 19: Hoare triple {21066#(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); {21066#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,712 INFO L273 TraceCheckUtils]: 20: Hoare triple {21066#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {21066#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,713 INFO L273 TraceCheckUtils]: 21: Hoare triple {21066#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {21067#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,713 INFO L273 TraceCheckUtils]: 22: Hoare triple {21067#(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); {21067#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,714 INFO L273 TraceCheckUtils]: 23: Hoare triple {21067#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {21067#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,715 INFO L273 TraceCheckUtils]: 24: Hoare triple {21067#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {21068#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,716 INFO L273 TraceCheckUtils]: 25: Hoare triple {21068#(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); {21068#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,717 INFO L273 TraceCheckUtils]: 26: Hoare triple {21068#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {21068#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,717 INFO L273 TraceCheckUtils]: 27: Hoare triple {21068#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {21069#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,718 INFO L273 TraceCheckUtils]: 28: Hoare triple {21069#(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); {21069#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,719 INFO L273 TraceCheckUtils]: 29: Hoare triple {21069#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {21069#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,720 INFO L273 TraceCheckUtils]: 30: Hoare triple {21069#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {21070#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,721 INFO L273 TraceCheckUtils]: 31: Hoare triple {21070#(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); {21070#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,721 INFO L273 TraceCheckUtils]: 32: Hoare triple {21070#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {21070#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,722 INFO L273 TraceCheckUtils]: 33: Hoare triple {21070#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {21071#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,723 INFO L273 TraceCheckUtils]: 34: Hoare triple {21071#(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); {21071#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,724 INFO L273 TraceCheckUtils]: 35: Hoare triple {21071#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {21071#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,725 INFO L273 TraceCheckUtils]: 36: Hoare triple {21071#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {21072#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,726 INFO L273 TraceCheckUtils]: 37: Hoare triple {21072#(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); {21072#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,727 INFO L273 TraceCheckUtils]: 38: Hoare triple {21072#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {21072#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,727 INFO L273 TraceCheckUtils]: 39: Hoare triple {21072#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {21073#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,728 INFO L273 TraceCheckUtils]: 40: Hoare triple {21073#(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); {21073#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,729 INFO L273 TraceCheckUtils]: 41: Hoare triple {21073#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {21073#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,730 INFO L273 TraceCheckUtils]: 42: Hoare triple {21073#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {21074#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,731 INFO L273 TraceCheckUtils]: 43: Hoare triple {21074#(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); {21074#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,731 INFO L273 TraceCheckUtils]: 44: Hoare triple {21074#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {21074#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,732 INFO L273 TraceCheckUtils]: 45: Hoare triple {21074#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {21075#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,733 INFO L273 TraceCheckUtils]: 46: Hoare triple {21075#(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); {21075#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,734 INFO L273 TraceCheckUtils]: 47: Hoare triple {21075#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {21075#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,735 INFO L273 TraceCheckUtils]: 48: Hoare triple {21075#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {21076#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,736 INFO L273 TraceCheckUtils]: 49: Hoare triple {21076#(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); {21076#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,736 INFO L273 TraceCheckUtils]: 50: Hoare triple {21076#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {21076#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,737 INFO L273 TraceCheckUtils]: 51: Hoare triple {21076#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {21077#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,738 INFO L273 TraceCheckUtils]: 52: Hoare triple {21077#(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); {21077#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,739 INFO L273 TraceCheckUtils]: 53: Hoare triple {21077#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {21077#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,740 INFO L273 TraceCheckUtils]: 54: Hoare triple {21077#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {21078#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:59:39,741 INFO L273 TraceCheckUtils]: 55: Hoare triple {21078#(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); {21078#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:59:39,741 INFO L273 TraceCheckUtils]: 56: Hoare triple {21078#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {21078#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:59:39,742 INFO L273 TraceCheckUtils]: 57: Hoare triple {21078#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} ~k~0 := 1 + ~k~0; {21079#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,743 INFO L273 TraceCheckUtils]: 58: Hoare triple {21079#(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); {21079#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,744 INFO L273 TraceCheckUtils]: 59: Hoare triple {21079#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {21079#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,745 INFO L273 TraceCheckUtils]: 60: Hoare triple {21079#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {21080#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,746 INFO L273 TraceCheckUtils]: 61: Hoare triple {21080#(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); {21080#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,746 INFO L273 TraceCheckUtils]: 62: Hoare triple {21080#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {21080#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,747 INFO L273 TraceCheckUtils]: 63: Hoare triple {21080#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {21081#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,748 INFO L273 TraceCheckUtils]: 64: Hoare triple {21081#(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); {21081#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,749 INFO L273 TraceCheckUtils]: 65: Hoare triple {21081#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {21081#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,750 INFO L273 TraceCheckUtils]: 66: Hoare triple {21081#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {21082#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,751 INFO L273 TraceCheckUtils]: 67: Hoare triple {21082#(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); {21082#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,751 INFO L273 TraceCheckUtils]: 68: Hoare triple {21082#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {21082#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,752 INFO L273 TraceCheckUtils]: 69: Hoare triple {21082#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {21083#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,753 INFO L273 TraceCheckUtils]: 70: Hoare triple {21083#(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); {21083#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,754 INFO L273 TraceCheckUtils]: 71: Hoare triple {21083#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {21083#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,755 INFO L273 TraceCheckUtils]: 72: Hoare triple {21083#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {21084#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,755 INFO L273 TraceCheckUtils]: 73: Hoare triple {21084#(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); {21084#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,756 INFO L273 TraceCheckUtils]: 74: Hoare triple {21084#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {21084#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,757 INFO L273 TraceCheckUtils]: 75: Hoare triple {21084#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {21085#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:39,758 INFO L273 TraceCheckUtils]: 76: Hoare triple {21085#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} assume !(~k~0 < 100000); {21060#false} is VALID [2018-11-23 11:59:39,758 INFO L273 TraceCheckUtils]: 77: Hoare triple {21060#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); {21060#false} is VALID [2018-11-23 11:59:39,758 INFO L273 TraceCheckUtils]: 78: Hoare triple {21060#false} ~x~0 := 0; {21060#false} is VALID [2018-11-23 11:59:39,759 INFO L273 TraceCheckUtils]: 79: Hoare triple {21060#false} assume !(~x~0 < ~i~0); {21060#false} is VALID [2018-11-23 11:59:39,759 INFO L273 TraceCheckUtils]: 80: Hoare triple {21060#false} ~x~0 := ~i~0; {21060#false} is VALID [2018-11-23 11:59:39,759 INFO L273 TraceCheckUtils]: 81: Hoare triple {21060#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); {21060#false} is VALID [2018-11-23 11:59:39,759 INFO L256 TraceCheckUtils]: 82: Hoare triple {21060#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {21059#true} is VALID [2018-11-23 11:59:39,760 INFO L273 TraceCheckUtils]: 83: Hoare triple {21059#true} ~cond := #in~cond; {21059#true} is VALID [2018-11-23 11:59:39,760 INFO L273 TraceCheckUtils]: 84: Hoare triple {21059#true} assume !(0 == ~cond); {21059#true} is VALID [2018-11-23 11:59:39,760 INFO L273 TraceCheckUtils]: 85: Hoare triple {21059#true} assume true; {21059#true} is VALID [2018-11-23 11:59:39,761 INFO L268 TraceCheckUtils]: 86: Hoare quadruple {21059#true} {21060#false} #136#return; {21060#false} is VALID [2018-11-23 11:59:39,761 INFO L273 TraceCheckUtils]: 87: Hoare triple {21060#false} havoc #t~mem9;havoc #t~mem10; {21060#false} is VALID [2018-11-23 11:59:39,761 INFO L273 TraceCheckUtils]: 88: Hoare triple {21060#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {21060#false} is VALID [2018-11-23 11:59:39,762 INFO L273 TraceCheckUtils]: 89: Hoare triple {21060#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); {21060#false} is VALID [2018-11-23 11:59:39,762 INFO L256 TraceCheckUtils]: 90: Hoare triple {21060#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {21060#false} is VALID [2018-11-23 11:59:39,762 INFO L273 TraceCheckUtils]: 91: Hoare triple {21060#false} ~cond := #in~cond; {21060#false} is VALID [2018-11-23 11:59:39,762 INFO L273 TraceCheckUtils]: 92: Hoare triple {21060#false} assume 0 == ~cond; {21060#false} is VALID [2018-11-23 11:59:39,762 INFO L273 TraceCheckUtils]: 93: Hoare triple {21060#false} assume !false; {21060#false} is VALID [2018-11-23 11:59:39,774 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:59:39,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:39,775 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:59:39,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:39,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:39,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:39,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:40,454 INFO L256 TraceCheckUtils]: 0: Hoare triple {21059#true} call ULTIMATE.init(); {21059#true} is VALID [2018-11-23 11:59:40,455 INFO L273 TraceCheckUtils]: 1: Hoare triple {21059#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21059#true} is VALID [2018-11-23 11:59:40,455 INFO L273 TraceCheckUtils]: 2: Hoare triple {21059#true} assume true; {21059#true} is VALID [2018-11-23 11:59:40,455 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21059#true} {21059#true} #130#return; {21059#true} is VALID [2018-11-23 11:59:40,455 INFO L256 TraceCheckUtils]: 4: Hoare triple {21059#true} call #t~ret15 := main(); {21059#true} is VALID [2018-11-23 11:59:40,472 INFO L273 TraceCheckUtils]: 5: Hoare triple {21059#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {21104#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:40,485 INFO L273 TraceCheckUtils]: 6: Hoare triple {21104#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {21108#(<= main_~k~0 1)} is VALID [2018-11-23 11:59:40,486 INFO L273 TraceCheckUtils]: 7: Hoare triple {21108#(<= 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); {21108#(<= main_~k~0 1)} is VALID [2018-11-23 11:59:40,486 INFO L273 TraceCheckUtils]: 8: Hoare triple {21108#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {21108#(<= main_~k~0 1)} is VALID [2018-11-23 11:59:40,486 INFO L273 TraceCheckUtils]: 9: Hoare triple {21108#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {21118#(<= main_~k~0 2)} is VALID [2018-11-23 11:59:40,487 INFO L273 TraceCheckUtils]: 10: Hoare triple {21118#(<= 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); {21118#(<= main_~k~0 2)} is VALID [2018-11-23 11:59:40,487 INFO L273 TraceCheckUtils]: 11: Hoare triple {21118#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {21118#(<= main_~k~0 2)} is VALID [2018-11-23 11:59:40,487 INFO L273 TraceCheckUtils]: 12: Hoare triple {21118#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {21128#(<= main_~k~0 3)} is VALID [2018-11-23 11:59:40,488 INFO L273 TraceCheckUtils]: 13: Hoare triple {21128#(<= 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); {21128#(<= main_~k~0 3)} is VALID [2018-11-23 11:59:40,488 INFO L273 TraceCheckUtils]: 14: Hoare triple {21128#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {21128#(<= main_~k~0 3)} is VALID [2018-11-23 11:59:40,489 INFO L273 TraceCheckUtils]: 15: Hoare triple {21128#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {21138#(<= main_~k~0 4)} is VALID [2018-11-23 11:59:40,490 INFO L273 TraceCheckUtils]: 16: Hoare triple {21138#(<= 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); {21138#(<= main_~k~0 4)} is VALID [2018-11-23 11:59:40,490 INFO L273 TraceCheckUtils]: 17: Hoare triple {21138#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {21138#(<= main_~k~0 4)} is VALID [2018-11-23 11:59:40,491 INFO L273 TraceCheckUtils]: 18: Hoare triple {21138#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {21148#(<= main_~k~0 5)} is VALID [2018-11-23 11:59:40,491 INFO L273 TraceCheckUtils]: 19: Hoare triple {21148#(<= 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); {21148#(<= main_~k~0 5)} is VALID [2018-11-23 11:59:40,492 INFO L273 TraceCheckUtils]: 20: Hoare triple {21148#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {21148#(<= main_~k~0 5)} is VALID [2018-11-23 11:59:40,493 INFO L273 TraceCheckUtils]: 21: Hoare triple {21148#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {21158#(<= main_~k~0 6)} is VALID [2018-11-23 11:59:40,493 INFO L273 TraceCheckUtils]: 22: Hoare triple {21158#(<= 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); {21158#(<= main_~k~0 6)} is VALID [2018-11-23 11:59:40,494 INFO L273 TraceCheckUtils]: 23: Hoare triple {21158#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {21158#(<= main_~k~0 6)} is VALID [2018-11-23 11:59:40,494 INFO L273 TraceCheckUtils]: 24: Hoare triple {21158#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {21168#(<= main_~k~0 7)} is VALID [2018-11-23 11:59:40,495 INFO L273 TraceCheckUtils]: 25: Hoare triple {21168#(<= 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); {21168#(<= main_~k~0 7)} is VALID [2018-11-23 11:59:40,495 INFO L273 TraceCheckUtils]: 26: Hoare triple {21168#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {21168#(<= main_~k~0 7)} is VALID [2018-11-23 11:59:40,496 INFO L273 TraceCheckUtils]: 27: Hoare triple {21168#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {21178#(<= main_~k~0 8)} is VALID [2018-11-23 11:59:40,497 INFO L273 TraceCheckUtils]: 28: Hoare triple {21178#(<= 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); {21178#(<= main_~k~0 8)} is VALID [2018-11-23 11:59:40,497 INFO L273 TraceCheckUtils]: 29: Hoare triple {21178#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {21178#(<= main_~k~0 8)} is VALID [2018-11-23 11:59:40,498 INFO L273 TraceCheckUtils]: 30: Hoare triple {21178#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {21188#(<= main_~k~0 9)} is VALID [2018-11-23 11:59:40,499 INFO L273 TraceCheckUtils]: 31: Hoare triple {21188#(<= 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); {21188#(<= main_~k~0 9)} is VALID [2018-11-23 11:59:40,499 INFO L273 TraceCheckUtils]: 32: Hoare triple {21188#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {21188#(<= main_~k~0 9)} is VALID [2018-11-23 11:59:40,500 INFO L273 TraceCheckUtils]: 33: Hoare triple {21188#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {21198#(<= main_~k~0 10)} is VALID [2018-11-23 11:59:40,500 INFO L273 TraceCheckUtils]: 34: Hoare triple {21198#(<= 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); {21198#(<= main_~k~0 10)} is VALID [2018-11-23 11:59:40,501 INFO L273 TraceCheckUtils]: 35: Hoare triple {21198#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {21198#(<= main_~k~0 10)} is VALID [2018-11-23 11:59:40,502 INFO L273 TraceCheckUtils]: 36: Hoare triple {21198#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {21208#(<= main_~k~0 11)} is VALID [2018-11-23 11:59:40,502 INFO L273 TraceCheckUtils]: 37: Hoare triple {21208#(<= 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); {21208#(<= main_~k~0 11)} is VALID [2018-11-23 11:59:40,503 INFO L273 TraceCheckUtils]: 38: Hoare triple {21208#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {21208#(<= main_~k~0 11)} is VALID [2018-11-23 11:59:40,504 INFO L273 TraceCheckUtils]: 39: Hoare triple {21208#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {21218#(<= main_~k~0 12)} is VALID [2018-11-23 11:59:40,504 INFO L273 TraceCheckUtils]: 40: Hoare triple {21218#(<= 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); {21218#(<= main_~k~0 12)} is VALID [2018-11-23 11:59:40,505 INFO L273 TraceCheckUtils]: 41: Hoare triple {21218#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {21218#(<= main_~k~0 12)} is VALID [2018-11-23 11:59:40,505 INFO L273 TraceCheckUtils]: 42: Hoare triple {21218#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {21228#(<= main_~k~0 13)} is VALID [2018-11-23 11:59:40,506 INFO L273 TraceCheckUtils]: 43: Hoare triple {21228#(<= 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); {21228#(<= main_~k~0 13)} is VALID [2018-11-23 11:59:40,506 INFO L273 TraceCheckUtils]: 44: Hoare triple {21228#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {21228#(<= main_~k~0 13)} is VALID [2018-11-23 11:59:40,507 INFO L273 TraceCheckUtils]: 45: Hoare triple {21228#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {21238#(<= main_~k~0 14)} is VALID [2018-11-23 11:59:40,508 INFO L273 TraceCheckUtils]: 46: Hoare triple {21238#(<= 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); {21238#(<= main_~k~0 14)} is VALID [2018-11-23 11:59:40,508 INFO L273 TraceCheckUtils]: 47: Hoare triple {21238#(<= main_~k~0 14)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {21238#(<= main_~k~0 14)} is VALID [2018-11-23 11:59:40,513 INFO L273 TraceCheckUtils]: 48: Hoare triple {21238#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {21248#(<= main_~k~0 15)} is VALID [2018-11-23 11:59:40,514 INFO L273 TraceCheckUtils]: 49: Hoare triple {21248#(<= 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); {21248#(<= main_~k~0 15)} is VALID [2018-11-23 11:59:40,514 INFO L273 TraceCheckUtils]: 50: Hoare triple {21248#(<= main_~k~0 15)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {21248#(<= main_~k~0 15)} is VALID [2018-11-23 11:59:40,515 INFO L273 TraceCheckUtils]: 51: Hoare triple {21248#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {21258#(<= main_~k~0 16)} is VALID [2018-11-23 11:59:40,515 INFO L273 TraceCheckUtils]: 52: Hoare triple {21258#(<= 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); {21258#(<= main_~k~0 16)} is VALID [2018-11-23 11:59:40,515 INFO L273 TraceCheckUtils]: 53: Hoare triple {21258#(<= main_~k~0 16)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {21258#(<= main_~k~0 16)} is VALID [2018-11-23 11:59:40,516 INFO L273 TraceCheckUtils]: 54: Hoare triple {21258#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {21268#(<= main_~k~0 17)} is VALID [2018-11-23 11:59:40,516 INFO L273 TraceCheckUtils]: 55: Hoare triple {21268#(<= 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); {21268#(<= main_~k~0 17)} is VALID [2018-11-23 11:59:40,516 INFO L273 TraceCheckUtils]: 56: Hoare triple {21268#(<= main_~k~0 17)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {21268#(<= main_~k~0 17)} is VALID [2018-11-23 11:59:40,517 INFO L273 TraceCheckUtils]: 57: Hoare triple {21268#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {21278#(<= main_~k~0 18)} is VALID [2018-11-23 11:59:40,517 INFO L273 TraceCheckUtils]: 58: Hoare triple {21278#(<= 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); {21278#(<= main_~k~0 18)} is VALID [2018-11-23 11:59:40,518 INFO L273 TraceCheckUtils]: 59: Hoare triple {21278#(<= main_~k~0 18)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {21278#(<= main_~k~0 18)} is VALID [2018-11-23 11:59:40,518 INFO L273 TraceCheckUtils]: 60: Hoare triple {21278#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {21288#(<= main_~k~0 19)} is VALID [2018-11-23 11:59:40,519 INFO L273 TraceCheckUtils]: 61: Hoare triple {21288#(<= 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); {21288#(<= main_~k~0 19)} is VALID [2018-11-23 11:59:40,519 INFO L273 TraceCheckUtils]: 62: Hoare triple {21288#(<= main_~k~0 19)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {21288#(<= main_~k~0 19)} is VALID [2018-11-23 11:59:40,520 INFO L273 TraceCheckUtils]: 63: Hoare triple {21288#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {21298#(<= main_~k~0 20)} is VALID [2018-11-23 11:59:40,521 INFO L273 TraceCheckUtils]: 64: Hoare triple {21298#(<= 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); {21298#(<= main_~k~0 20)} is VALID [2018-11-23 11:59:40,521 INFO L273 TraceCheckUtils]: 65: Hoare triple {21298#(<= main_~k~0 20)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {21298#(<= main_~k~0 20)} is VALID [2018-11-23 11:59:40,522 INFO L273 TraceCheckUtils]: 66: Hoare triple {21298#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {21308#(<= main_~k~0 21)} is VALID [2018-11-23 11:59:40,523 INFO L273 TraceCheckUtils]: 67: Hoare triple {21308#(<= 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); {21308#(<= main_~k~0 21)} is VALID [2018-11-23 11:59:40,523 INFO L273 TraceCheckUtils]: 68: Hoare triple {21308#(<= main_~k~0 21)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {21308#(<= main_~k~0 21)} is VALID [2018-11-23 11:59:40,524 INFO L273 TraceCheckUtils]: 69: Hoare triple {21308#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {21318#(<= main_~k~0 22)} is VALID [2018-11-23 11:59:40,524 INFO L273 TraceCheckUtils]: 70: Hoare triple {21318#(<= 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); {21318#(<= main_~k~0 22)} is VALID [2018-11-23 11:59:40,525 INFO L273 TraceCheckUtils]: 71: Hoare triple {21318#(<= main_~k~0 22)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {21318#(<= main_~k~0 22)} is VALID [2018-11-23 11:59:40,526 INFO L273 TraceCheckUtils]: 72: Hoare triple {21318#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {21328#(<= main_~k~0 23)} is VALID [2018-11-23 11:59:40,526 INFO L273 TraceCheckUtils]: 73: Hoare triple {21328#(<= 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); {21328#(<= main_~k~0 23)} is VALID [2018-11-23 11:59:40,527 INFO L273 TraceCheckUtils]: 74: Hoare triple {21328#(<= main_~k~0 23)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {21328#(<= main_~k~0 23)} is VALID [2018-11-23 11:59:40,527 INFO L273 TraceCheckUtils]: 75: Hoare triple {21328#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {21338#(<= main_~k~0 24)} is VALID [2018-11-23 11:59:40,528 INFO L273 TraceCheckUtils]: 76: Hoare triple {21338#(<= main_~k~0 24)} assume !(~k~0 < 100000); {21060#false} is VALID [2018-11-23 11:59:40,528 INFO L273 TraceCheckUtils]: 77: Hoare triple {21060#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); {21060#false} is VALID [2018-11-23 11:59:40,529 INFO L273 TraceCheckUtils]: 78: Hoare triple {21060#false} ~x~0 := 0; {21060#false} is VALID [2018-11-23 11:59:40,529 INFO L273 TraceCheckUtils]: 79: Hoare triple {21060#false} assume !(~x~0 < ~i~0); {21060#false} is VALID [2018-11-23 11:59:40,529 INFO L273 TraceCheckUtils]: 80: Hoare triple {21060#false} ~x~0 := ~i~0; {21060#false} is VALID [2018-11-23 11:59:40,529 INFO L273 TraceCheckUtils]: 81: Hoare triple {21060#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); {21060#false} is VALID [2018-11-23 11:59:40,529 INFO L256 TraceCheckUtils]: 82: Hoare triple {21060#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {21060#false} is VALID [2018-11-23 11:59:40,530 INFO L273 TraceCheckUtils]: 83: Hoare triple {21060#false} ~cond := #in~cond; {21060#false} is VALID [2018-11-23 11:59:40,530 INFO L273 TraceCheckUtils]: 84: Hoare triple {21060#false} assume !(0 == ~cond); {21060#false} is VALID [2018-11-23 11:59:40,530 INFO L273 TraceCheckUtils]: 85: Hoare triple {21060#false} assume true; {21060#false} is VALID [2018-11-23 11:59:40,530 INFO L268 TraceCheckUtils]: 86: Hoare quadruple {21060#false} {21060#false} #136#return; {21060#false} is VALID [2018-11-23 11:59:40,530 INFO L273 TraceCheckUtils]: 87: Hoare triple {21060#false} havoc #t~mem9;havoc #t~mem10; {21060#false} is VALID [2018-11-23 11:59:40,531 INFO L273 TraceCheckUtils]: 88: Hoare triple {21060#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {21060#false} is VALID [2018-11-23 11:59:40,531 INFO L273 TraceCheckUtils]: 89: Hoare triple {21060#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); {21060#false} is VALID [2018-11-23 11:59:40,531 INFO L256 TraceCheckUtils]: 90: Hoare triple {21060#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {21060#false} is VALID [2018-11-23 11:59:40,531 INFO L273 TraceCheckUtils]: 91: Hoare triple {21060#false} ~cond := #in~cond; {21060#false} is VALID [2018-11-23 11:59:40,531 INFO L273 TraceCheckUtils]: 92: Hoare triple {21060#false} assume 0 == ~cond; {21060#false} is VALID [2018-11-23 11:59:40,532 INFO L273 TraceCheckUtils]: 93: Hoare triple {21060#false} assume !false; {21060#false} is VALID [2018-11-23 11:59:40,538 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:59:40,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:40,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2018-11-23 11:59:40,558 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 94 [2018-11-23 11:59:40,558 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:40,558 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states. [2018-11-23 11:59:40,730 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:59:40,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-11-23 11:59:40,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-11-23 11:59:40,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1002, Invalid=1650, Unknown=0, NotChecked=0, Total=2652 [2018-11-23 11:59:40,733 INFO L87 Difference]: Start difference. First operand 192 states and 253 transitions. Second operand 52 states. [2018-11-23 11:59:41,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:41,988 INFO L93 Difference]: Finished difference Result 255 states and 339 transitions. [2018-11-23 11:59:41,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 11:59:41,988 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 94 [2018-11-23 11:59:41,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:41,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 11:59:41,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 203 transitions. [2018-11-23 11:59:41,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 11:59:41,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 203 transitions. [2018-11-23 11:59:41,992 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 203 transitions. [2018-11-23 11:59:42,193 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:59:42,197 INFO L225 Difference]: With dead ends: 255 [2018-11-23 11:59:42,197 INFO L226 Difference]: Without dead ends: 208 [2018-11-23 11:59:42,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 901 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1002, Invalid=1650, Unknown=0, NotChecked=0, Total=2652 [2018-11-23 11:59:42,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-11-23 11:59:42,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 198. [2018-11-23 11:59:42,348 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:42,348 INFO L82 GeneralOperation]: Start isEquivalent. First operand 208 states. Second operand 198 states. [2018-11-23 11:59:42,348 INFO L74 IsIncluded]: Start isIncluded. First operand 208 states. Second operand 198 states. [2018-11-23 11:59:42,348 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 198 states. [2018-11-23 11:59:42,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:42,352 INFO L93 Difference]: Finished difference Result 208 states and 276 transitions. [2018-11-23 11:59:42,352 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 276 transitions. [2018-11-23 11:59:42,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:42,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:42,353 INFO L74 IsIncluded]: Start isIncluded. First operand 198 states. Second operand 208 states. [2018-11-23 11:59:42,353 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 208 states. [2018-11-23 11:59:42,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:42,357 INFO L93 Difference]: Finished difference Result 208 states and 276 transitions. [2018-11-23 11:59:42,358 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 276 transitions. [2018-11-23 11:59:42,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:42,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:42,358 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:42,358 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:42,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-11-23 11:59:42,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 261 transitions. [2018-11-23 11:59:42,363 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 261 transitions. Word has length 94 [2018-11-23 11:59:42,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:42,363 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 261 transitions. [2018-11-23 11:59:42,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-11-23 11:59:42,363 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 261 transitions. [2018-11-23 11:59:42,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-23 11:59:42,364 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:42,364 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:59:42,365 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:42,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:42,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1612681868, now seen corresponding path program 20 times [2018-11-23 11:59:42,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:42,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:42,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:42,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:42,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:42,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:44,495 INFO L256 TraceCheckUtils]: 0: Hoare triple {22423#true} call ULTIMATE.init(); {22423#true} is VALID [2018-11-23 11:59:44,495 INFO L273 TraceCheckUtils]: 1: Hoare triple {22423#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {22423#true} is VALID [2018-11-23 11:59:44,496 INFO L273 TraceCheckUtils]: 2: Hoare triple {22423#true} assume true; {22423#true} is VALID [2018-11-23 11:59:44,496 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22423#true} {22423#true} #130#return; {22423#true} is VALID [2018-11-23 11:59:44,496 INFO L256 TraceCheckUtils]: 4: Hoare triple {22423#true} call #t~ret15 := main(); {22423#true} is VALID [2018-11-23 11:59:44,496 INFO L273 TraceCheckUtils]: 5: Hoare triple {22423#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {22425#(= main_~i~0 0)} is VALID [2018-11-23 11:59:44,497 INFO L273 TraceCheckUtils]: 6: Hoare triple {22425#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {22426#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,497 INFO L273 TraceCheckUtils]: 7: Hoare triple {22426#(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); {22426#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,498 INFO L273 TraceCheckUtils]: 8: Hoare triple {22426#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {22426#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,498 INFO L273 TraceCheckUtils]: 9: Hoare triple {22426#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {22427#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,499 INFO L273 TraceCheckUtils]: 10: Hoare triple {22427#(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); {22427#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,499 INFO L273 TraceCheckUtils]: 11: Hoare triple {22427#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {22427#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,500 INFO L273 TraceCheckUtils]: 12: Hoare triple {22427#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {22428#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,501 INFO L273 TraceCheckUtils]: 13: Hoare triple {22428#(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); {22428#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,502 INFO L273 TraceCheckUtils]: 14: Hoare triple {22428#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {22428#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,502 INFO L273 TraceCheckUtils]: 15: Hoare triple {22428#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {22429#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,503 INFO L273 TraceCheckUtils]: 16: Hoare triple {22429#(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); {22429#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,504 INFO L273 TraceCheckUtils]: 17: Hoare triple {22429#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {22429#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,505 INFO L273 TraceCheckUtils]: 18: Hoare triple {22429#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {22430#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,506 INFO L273 TraceCheckUtils]: 19: Hoare triple {22430#(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); {22430#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,507 INFO L273 TraceCheckUtils]: 20: Hoare triple {22430#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {22430#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,508 INFO L273 TraceCheckUtils]: 21: Hoare triple {22430#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {22431#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,508 INFO L273 TraceCheckUtils]: 22: Hoare triple {22431#(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); {22431#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,509 INFO L273 TraceCheckUtils]: 23: Hoare triple {22431#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {22431#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,510 INFO L273 TraceCheckUtils]: 24: Hoare triple {22431#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {22432#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,511 INFO L273 TraceCheckUtils]: 25: Hoare triple {22432#(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); {22432#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,512 INFO L273 TraceCheckUtils]: 26: Hoare triple {22432#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {22432#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,512 INFO L273 TraceCheckUtils]: 27: Hoare triple {22432#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {22433#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,513 INFO L273 TraceCheckUtils]: 28: Hoare triple {22433#(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); {22433#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,514 INFO L273 TraceCheckUtils]: 29: Hoare triple {22433#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {22433#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,515 INFO L273 TraceCheckUtils]: 30: Hoare triple {22433#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {22434#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,516 INFO L273 TraceCheckUtils]: 31: Hoare triple {22434#(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); {22434#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,516 INFO L273 TraceCheckUtils]: 32: Hoare triple {22434#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {22434#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,517 INFO L273 TraceCheckUtils]: 33: Hoare triple {22434#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {22435#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,518 INFO L273 TraceCheckUtils]: 34: Hoare triple {22435#(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); {22435#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,519 INFO L273 TraceCheckUtils]: 35: Hoare triple {22435#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {22435#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,520 INFO L273 TraceCheckUtils]: 36: Hoare triple {22435#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {22436#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,521 INFO L273 TraceCheckUtils]: 37: Hoare triple {22436#(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); {22436#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,521 INFO L273 TraceCheckUtils]: 38: Hoare triple {22436#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {22436#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,522 INFO L273 TraceCheckUtils]: 39: Hoare triple {22436#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {22437#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,523 INFO L273 TraceCheckUtils]: 40: Hoare triple {22437#(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); {22437#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,524 INFO L273 TraceCheckUtils]: 41: Hoare triple {22437#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {22437#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,525 INFO L273 TraceCheckUtils]: 42: Hoare triple {22437#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {22438#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,526 INFO L273 TraceCheckUtils]: 43: Hoare triple {22438#(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); {22438#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,526 INFO L273 TraceCheckUtils]: 44: Hoare triple {22438#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {22438#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,527 INFO L273 TraceCheckUtils]: 45: Hoare triple {22438#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {22439#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,528 INFO L273 TraceCheckUtils]: 46: Hoare triple {22439#(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); {22439#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,529 INFO L273 TraceCheckUtils]: 47: Hoare triple {22439#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {22439#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,530 INFO L273 TraceCheckUtils]: 48: Hoare triple {22439#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {22440#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,531 INFO L273 TraceCheckUtils]: 49: Hoare triple {22440#(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); {22440#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,531 INFO L273 TraceCheckUtils]: 50: Hoare triple {22440#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {22440#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,532 INFO L273 TraceCheckUtils]: 51: Hoare triple {22440#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {22441#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,533 INFO L273 TraceCheckUtils]: 52: Hoare triple {22441#(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); {22441#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,534 INFO L273 TraceCheckUtils]: 53: Hoare triple {22441#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {22441#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,535 INFO L273 TraceCheckUtils]: 54: Hoare triple {22441#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {22442#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:59:44,536 INFO L273 TraceCheckUtils]: 55: Hoare triple {22442#(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); {22442#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:59:44,536 INFO L273 TraceCheckUtils]: 56: Hoare triple {22442#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {22442#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:59:44,537 INFO L273 TraceCheckUtils]: 57: Hoare triple {22442#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} ~k~0 := 1 + ~k~0; {22443#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,538 INFO L273 TraceCheckUtils]: 58: Hoare triple {22443#(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); {22443#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,539 INFO L273 TraceCheckUtils]: 59: Hoare triple {22443#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {22443#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,540 INFO L273 TraceCheckUtils]: 60: Hoare triple {22443#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {22444#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,540 INFO L273 TraceCheckUtils]: 61: Hoare triple {22444#(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); {22444#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,541 INFO L273 TraceCheckUtils]: 62: Hoare triple {22444#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {22444#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,542 INFO L273 TraceCheckUtils]: 63: Hoare triple {22444#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {22445#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,543 INFO L273 TraceCheckUtils]: 64: Hoare triple {22445#(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); {22445#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,544 INFO L273 TraceCheckUtils]: 65: Hoare triple {22445#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {22445#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,545 INFO L273 TraceCheckUtils]: 66: Hoare triple {22445#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {22446#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,545 INFO L273 TraceCheckUtils]: 67: Hoare triple {22446#(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); {22446#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,546 INFO L273 TraceCheckUtils]: 68: Hoare triple {22446#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {22446#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,547 INFO L273 TraceCheckUtils]: 69: Hoare triple {22446#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {22447#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,548 INFO L273 TraceCheckUtils]: 70: Hoare triple {22447#(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); {22447#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,549 INFO L273 TraceCheckUtils]: 71: Hoare triple {22447#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {22447#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,549 INFO L273 TraceCheckUtils]: 72: Hoare triple {22447#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {22448#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,550 INFO L273 TraceCheckUtils]: 73: Hoare triple {22448#(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); {22448#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,551 INFO L273 TraceCheckUtils]: 74: Hoare triple {22448#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {22448#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,552 INFO L273 TraceCheckUtils]: 75: Hoare triple {22448#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {22449#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,553 INFO L273 TraceCheckUtils]: 76: Hoare triple {22449#(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); {22449#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,553 INFO L273 TraceCheckUtils]: 77: Hoare triple {22449#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {22449#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,554 INFO L273 TraceCheckUtils]: 78: Hoare triple {22449#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {22450#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:44,555 INFO L273 TraceCheckUtils]: 79: Hoare triple {22450#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} assume !(~k~0 < 100000); {22424#false} is VALID [2018-11-23 11:59:44,555 INFO L273 TraceCheckUtils]: 80: Hoare triple {22424#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); {22424#false} is VALID [2018-11-23 11:59:44,555 INFO L273 TraceCheckUtils]: 81: Hoare triple {22424#false} ~x~0 := 0; {22424#false} is VALID [2018-11-23 11:59:44,556 INFO L273 TraceCheckUtils]: 82: Hoare triple {22424#false} assume !(~x~0 < ~i~0); {22424#false} is VALID [2018-11-23 11:59:44,556 INFO L273 TraceCheckUtils]: 83: Hoare triple {22424#false} ~x~0 := ~i~0; {22424#false} is VALID [2018-11-23 11:59:44,556 INFO L273 TraceCheckUtils]: 84: Hoare triple {22424#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); {22424#false} is VALID [2018-11-23 11:59:44,556 INFO L256 TraceCheckUtils]: 85: Hoare triple {22424#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {22423#true} is VALID [2018-11-23 11:59:44,556 INFO L273 TraceCheckUtils]: 86: Hoare triple {22423#true} ~cond := #in~cond; {22423#true} is VALID [2018-11-23 11:59:44,557 INFO L273 TraceCheckUtils]: 87: Hoare triple {22423#true} assume !(0 == ~cond); {22423#true} is VALID [2018-11-23 11:59:44,557 INFO L273 TraceCheckUtils]: 88: Hoare triple {22423#true} assume true; {22423#true} is VALID [2018-11-23 11:59:44,557 INFO L268 TraceCheckUtils]: 89: Hoare quadruple {22423#true} {22424#false} #136#return; {22424#false} is VALID [2018-11-23 11:59:44,557 INFO L273 TraceCheckUtils]: 90: Hoare triple {22424#false} havoc #t~mem9;havoc #t~mem10; {22424#false} is VALID [2018-11-23 11:59:44,557 INFO L273 TraceCheckUtils]: 91: Hoare triple {22424#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {22424#false} is VALID [2018-11-23 11:59:44,558 INFO L273 TraceCheckUtils]: 92: Hoare triple {22424#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); {22424#false} is VALID [2018-11-23 11:59:44,558 INFO L256 TraceCheckUtils]: 93: Hoare triple {22424#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {22424#false} is VALID [2018-11-23 11:59:44,558 INFO L273 TraceCheckUtils]: 94: Hoare triple {22424#false} ~cond := #in~cond; {22424#false} is VALID [2018-11-23 11:59:44,558 INFO L273 TraceCheckUtils]: 95: Hoare triple {22424#false} assume 0 == ~cond; {22424#false} is VALID [2018-11-23 11:59:44,558 INFO L273 TraceCheckUtils]: 96: Hoare triple {22424#false} assume !false; {22424#false} is VALID [2018-11-23 11:59:44,571 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:59:44,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:44,572 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:59:44,580 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:59:44,636 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:59:44,636 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:44,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:44,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:45,310 INFO L256 TraceCheckUtils]: 0: Hoare triple {22423#true} call ULTIMATE.init(); {22423#true} is VALID [2018-11-23 11:59:45,310 INFO L273 TraceCheckUtils]: 1: Hoare triple {22423#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {22423#true} is VALID [2018-11-23 11:59:45,310 INFO L273 TraceCheckUtils]: 2: Hoare triple {22423#true} assume true; {22423#true} is VALID [2018-11-23 11:59:45,310 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22423#true} {22423#true} #130#return; {22423#true} is VALID [2018-11-23 11:59:45,311 INFO L256 TraceCheckUtils]: 4: Hoare triple {22423#true} call #t~ret15 := main(); {22423#true} is VALID [2018-11-23 11:59:45,311 INFO L273 TraceCheckUtils]: 5: Hoare triple {22423#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {22469#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:45,312 INFO L273 TraceCheckUtils]: 6: Hoare triple {22469#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {22473#(<= main_~k~0 1)} is VALID [2018-11-23 11:59:45,312 INFO L273 TraceCheckUtils]: 7: Hoare triple {22473#(<= 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); {22473#(<= main_~k~0 1)} is VALID [2018-11-23 11:59:45,313 INFO L273 TraceCheckUtils]: 8: Hoare triple {22473#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {22473#(<= main_~k~0 1)} is VALID [2018-11-23 11:59:45,313 INFO L273 TraceCheckUtils]: 9: Hoare triple {22473#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {22483#(<= main_~k~0 2)} is VALID [2018-11-23 11:59:45,313 INFO L273 TraceCheckUtils]: 10: Hoare triple {22483#(<= 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); {22483#(<= main_~k~0 2)} is VALID [2018-11-23 11:59:45,314 INFO L273 TraceCheckUtils]: 11: Hoare triple {22483#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {22483#(<= main_~k~0 2)} is VALID [2018-11-23 11:59:45,314 INFO L273 TraceCheckUtils]: 12: Hoare triple {22483#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {22493#(<= main_~k~0 3)} is VALID [2018-11-23 11:59:45,315 INFO L273 TraceCheckUtils]: 13: Hoare triple {22493#(<= 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); {22493#(<= main_~k~0 3)} is VALID [2018-11-23 11:59:45,315 INFO L273 TraceCheckUtils]: 14: Hoare triple {22493#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {22493#(<= main_~k~0 3)} is VALID [2018-11-23 11:59:45,316 INFO L273 TraceCheckUtils]: 15: Hoare triple {22493#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {22503#(<= main_~k~0 4)} is VALID [2018-11-23 11:59:45,317 INFO L273 TraceCheckUtils]: 16: Hoare triple {22503#(<= 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); {22503#(<= main_~k~0 4)} is VALID [2018-11-23 11:59:45,317 INFO L273 TraceCheckUtils]: 17: Hoare triple {22503#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {22503#(<= main_~k~0 4)} is VALID [2018-11-23 11:59:45,318 INFO L273 TraceCheckUtils]: 18: Hoare triple {22503#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {22513#(<= main_~k~0 5)} is VALID [2018-11-23 11:59:45,319 INFO L273 TraceCheckUtils]: 19: Hoare triple {22513#(<= 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); {22513#(<= main_~k~0 5)} is VALID [2018-11-23 11:59:45,319 INFO L273 TraceCheckUtils]: 20: Hoare triple {22513#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {22513#(<= main_~k~0 5)} is VALID [2018-11-23 11:59:45,320 INFO L273 TraceCheckUtils]: 21: Hoare triple {22513#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {22523#(<= main_~k~0 6)} is VALID [2018-11-23 11:59:45,320 INFO L273 TraceCheckUtils]: 22: Hoare triple {22523#(<= 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); {22523#(<= main_~k~0 6)} is VALID [2018-11-23 11:59:45,321 INFO L273 TraceCheckUtils]: 23: Hoare triple {22523#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {22523#(<= main_~k~0 6)} is VALID [2018-11-23 11:59:45,322 INFO L273 TraceCheckUtils]: 24: Hoare triple {22523#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {22533#(<= main_~k~0 7)} is VALID [2018-11-23 11:59:45,322 INFO L273 TraceCheckUtils]: 25: Hoare triple {22533#(<= 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); {22533#(<= main_~k~0 7)} is VALID [2018-11-23 11:59:45,323 INFO L273 TraceCheckUtils]: 26: Hoare triple {22533#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {22533#(<= main_~k~0 7)} is VALID [2018-11-23 11:59:45,323 INFO L273 TraceCheckUtils]: 27: Hoare triple {22533#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {22543#(<= main_~k~0 8)} is VALID [2018-11-23 11:59:45,324 INFO L273 TraceCheckUtils]: 28: Hoare triple {22543#(<= 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); {22543#(<= main_~k~0 8)} is VALID [2018-11-23 11:59:45,324 INFO L273 TraceCheckUtils]: 29: Hoare triple {22543#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {22543#(<= main_~k~0 8)} is VALID [2018-11-23 11:59:45,325 INFO L273 TraceCheckUtils]: 30: Hoare triple {22543#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {22553#(<= main_~k~0 9)} is VALID [2018-11-23 11:59:45,326 INFO L273 TraceCheckUtils]: 31: Hoare triple {22553#(<= 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); {22553#(<= main_~k~0 9)} is VALID [2018-11-23 11:59:45,326 INFO L273 TraceCheckUtils]: 32: Hoare triple {22553#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {22553#(<= main_~k~0 9)} is VALID [2018-11-23 11:59:45,327 INFO L273 TraceCheckUtils]: 33: Hoare triple {22553#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {22563#(<= main_~k~0 10)} is VALID [2018-11-23 11:59:45,327 INFO L273 TraceCheckUtils]: 34: Hoare triple {22563#(<= 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); {22563#(<= main_~k~0 10)} is VALID [2018-11-23 11:59:45,328 INFO L273 TraceCheckUtils]: 35: Hoare triple {22563#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {22563#(<= main_~k~0 10)} is VALID [2018-11-23 11:59:45,329 INFO L273 TraceCheckUtils]: 36: Hoare triple {22563#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {22573#(<= main_~k~0 11)} is VALID [2018-11-23 11:59:45,329 INFO L273 TraceCheckUtils]: 37: Hoare triple {22573#(<= 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); {22573#(<= main_~k~0 11)} is VALID [2018-11-23 11:59:45,330 INFO L273 TraceCheckUtils]: 38: Hoare triple {22573#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {22573#(<= main_~k~0 11)} is VALID [2018-11-23 11:59:45,331 INFO L273 TraceCheckUtils]: 39: Hoare triple {22573#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {22583#(<= main_~k~0 12)} is VALID [2018-11-23 11:59:45,331 INFO L273 TraceCheckUtils]: 40: Hoare triple {22583#(<= 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); {22583#(<= main_~k~0 12)} is VALID [2018-11-23 11:59:45,332 INFO L273 TraceCheckUtils]: 41: Hoare triple {22583#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {22583#(<= main_~k~0 12)} is VALID [2018-11-23 11:59:45,332 INFO L273 TraceCheckUtils]: 42: Hoare triple {22583#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {22593#(<= main_~k~0 13)} is VALID [2018-11-23 11:59:45,333 INFO L273 TraceCheckUtils]: 43: Hoare triple {22593#(<= 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); {22593#(<= main_~k~0 13)} is VALID [2018-11-23 11:59:45,333 INFO L273 TraceCheckUtils]: 44: Hoare triple {22593#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {22593#(<= main_~k~0 13)} is VALID [2018-11-23 11:59:45,334 INFO L273 TraceCheckUtils]: 45: Hoare triple {22593#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {22603#(<= main_~k~0 14)} is VALID [2018-11-23 11:59:45,335 INFO L273 TraceCheckUtils]: 46: Hoare triple {22603#(<= 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); {22603#(<= main_~k~0 14)} is VALID [2018-11-23 11:59:45,335 INFO L273 TraceCheckUtils]: 47: Hoare triple {22603#(<= main_~k~0 14)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {22603#(<= main_~k~0 14)} is VALID [2018-11-23 11:59:45,336 INFO L273 TraceCheckUtils]: 48: Hoare triple {22603#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {22613#(<= main_~k~0 15)} is VALID [2018-11-23 11:59:45,336 INFO L273 TraceCheckUtils]: 49: Hoare triple {22613#(<= 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); {22613#(<= main_~k~0 15)} is VALID [2018-11-23 11:59:45,337 INFO L273 TraceCheckUtils]: 50: Hoare triple {22613#(<= main_~k~0 15)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {22613#(<= main_~k~0 15)} is VALID [2018-11-23 11:59:45,338 INFO L273 TraceCheckUtils]: 51: Hoare triple {22613#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {22623#(<= main_~k~0 16)} is VALID [2018-11-23 11:59:45,338 INFO L273 TraceCheckUtils]: 52: Hoare triple {22623#(<= 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); {22623#(<= main_~k~0 16)} is VALID [2018-11-23 11:59:45,339 INFO L273 TraceCheckUtils]: 53: Hoare triple {22623#(<= main_~k~0 16)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {22623#(<= main_~k~0 16)} is VALID [2018-11-23 11:59:45,339 INFO L273 TraceCheckUtils]: 54: Hoare triple {22623#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {22633#(<= main_~k~0 17)} is VALID [2018-11-23 11:59:45,340 INFO L273 TraceCheckUtils]: 55: Hoare triple {22633#(<= 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); {22633#(<= main_~k~0 17)} is VALID [2018-11-23 11:59:45,341 INFO L273 TraceCheckUtils]: 56: Hoare triple {22633#(<= main_~k~0 17)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {22633#(<= main_~k~0 17)} is VALID [2018-11-23 11:59:45,341 INFO L273 TraceCheckUtils]: 57: Hoare triple {22633#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {22643#(<= main_~k~0 18)} is VALID [2018-11-23 11:59:45,342 INFO L273 TraceCheckUtils]: 58: Hoare triple {22643#(<= 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); {22643#(<= main_~k~0 18)} is VALID [2018-11-23 11:59:45,342 INFO L273 TraceCheckUtils]: 59: Hoare triple {22643#(<= main_~k~0 18)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {22643#(<= main_~k~0 18)} is VALID [2018-11-23 11:59:45,343 INFO L273 TraceCheckUtils]: 60: Hoare triple {22643#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {22653#(<= main_~k~0 19)} is VALID [2018-11-23 11:59:45,344 INFO L273 TraceCheckUtils]: 61: Hoare triple {22653#(<= 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); {22653#(<= main_~k~0 19)} is VALID [2018-11-23 11:59:45,344 INFO L273 TraceCheckUtils]: 62: Hoare triple {22653#(<= main_~k~0 19)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {22653#(<= main_~k~0 19)} is VALID [2018-11-23 11:59:45,345 INFO L273 TraceCheckUtils]: 63: Hoare triple {22653#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {22663#(<= main_~k~0 20)} is VALID [2018-11-23 11:59:45,345 INFO L273 TraceCheckUtils]: 64: Hoare triple {22663#(<= 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); {22663#(<= main_~k~0 20)} is VALID [2018-11-23 11:59:45,346 INFO L273 TraceCheckUtils]: 65: Hoare triple {22663#(<= main_~k~0 20)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {22663#(<= main_~k~0 20)} is VALID [2018-11-23 11:59:45,347 INFO L273 TraceCheckUtils]: 66: Hoare triple {22663#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {22673#(<= main_~k~0 21)} is VALID [2018-11-23 11:59:45,347 INFO L273 TraceCheckUtils]: 67: Hoare triple {22673#(<= 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); {22673#(<= main_~k~0 21)} is VALID [2018-11-23 11:59:45,348 INFO L273 TraceCheckUtils]: 68: Hoare triple {22673#(<= main_~k~0 21)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {22673#(<= main_~k~0 21)} is VALID [2018-11-23 11:59:45,348 INFO L273 TraceCheckUtils]: 69: Hoare triple {22673#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {22683#(<= main_~k~0 22)} is VALID [2018-11-23 11:59:45,349 INFO L273 TraceCheckUtils]: 70: Hoare triple {22683#(<= 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); {22683#(<= main_~k~0 22)} is VALID [2018-11-23 11:59:45,349 INFO L273 TraceCheckUtils]: 71: Hoare triple {22683#(<= main_~k~0 22)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {22683#(<= main_~k~0 22)} is VALID [2018-11-23 11:59:45,350 INFO L273 TraceCheckUtils]: 72: Hoare triple {22683#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {22693#(<= main_~k~0 23)} is VALID [2018-11-23 11:59:45,351 INFO L273 TraceCheckUtils]: 73: Hoare triple {22693#(<= 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); {22693#(<= main_~k~0 23)} is VALID [2018-11-23 11:59:45,351 INFO L273 TraceCheckUtils]: 74: Hoare triple {22693#(<= main_~k~0 23)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {22693#(<= main_~k~0 23)} is VALID [2018-11-23 11:59:45,352 INFO L273 TraceCheckUtils]: 75: Hoare triple {22693#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {22703#(<= main_~k~0 24)} is VALID [2018-11-23 11:59:45,353 INFO L273 TraceCheckUtils]: 76: Hoare triple {22703#(<= 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); {22703#(<= main_~k~0 24)} is VALID [2018-11-23 11:59:45,353 INFO L273 TraceCheckUtils]: 77: Hoare triple {22703#(<= main_~k~0 24)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {22703#(<= main_~k~0 24)} is VALID [2018-11-23 11:59:45,354 INFO L273 TraceCheckUtils]: 78: Hoare triple {22703#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {22713#(<= main_~k~0 25)} is VALID [2018-11-23 11:59:45,355 INFO L273 TraceCheckUtils]: 79: Hoare triple {22713#(<= main_~k~0 25)} assume !(~k~0 < 100000); {22424#false} is VALID [2018-11-23 11:59:45,355 INFO L273 TraceCheckUtils]: 80: Hoare triple {22424#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); {22424#false} is VALID [2018-11-23 11:59:45,355 INFO L273 TraceCheckUtils]: 81: Hoare triple {22424#false} ~x~0 := 0; {22424#false} is VALID [2018-11-23 11:59:45,355 INFO L273 TraceCheckUtils]: 82: Hoare triple {22424#false} assume !(~x~0 < ~i~0); {22424#false} is VALID [2018-11-23 11:59:45,355 INFO L273 TraceCheckUtils]: 83: Hoare triple {22424#false} ~x~0 := ~i~0; {22424#false} is VALID [2018-11-23 11:59:45,356 INFO L273 TraceCheckUtils]: 84: Hoare triple {22424#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); {22424#false} is VALID [2018-11-23 11:59:45,356 INFO L256 TraceCheckUtils]: 85: Hoare triple {22424#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {22424#false} is VALID [2018-11-23 11:59:45,356 INFO L273 TraceCheckUtils]: 86: Hoare triple {22424#false} ~cond := #in~cond; {22424#false} is VALID [2018-11-23 11:59:45,356 INFO L273 TraceCheckUtils]: 87: Hoare triple {22424#false} assume !(0 == ~cond); {22424#false} is VALID [2018-11-23 11:59:45,356 INFO L273 TraceCheckUtils]: 88: Hoare triple {22424#false} assume true; {22424#false} is VALID [2018-11-23 11:59:45,356 INFO L268 TraceCheckUtils]: 89: Hoare quadruple {22424#false} {22424#false} #136#return; {22424#false} is VALID [2018-11-23 11:59:45,357 INFO L273 TraceCheckUtils]: 90: Hoare triple {22424#false} havoc #t~mem9;havoc #t~mem10; {22424#false} is VALID [2018-11-23 11:59:45,357 INFO L273 TraceCheckUtils]: 91: Hoare triple {22424#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {22424#false} is VALID [2018-11-23 11:59:45,357 INFO L273 TraceCheckUtils]: 92: Hoare triple {22424#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); {22424#false} is VALID [2018-11-23 11:59:45,357 INFO L256 TraceCheckUtils]: 93: Hoare triple {22424#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {22424#false} is VALID [2018-11-23 11:59:45,357 INFO L273 TraceCheckUtils]: 94: Hoare triple {22424#false} ~cond := #in~cond; {22424#false} is VALID [2018-11-23 11:59:45,357 INFO L273 TraceCheckUtils]: 95: Hoare triple {22424#false} assume 0 == ~cond; {22424#false} is VALID [2018-11-23 11:59:45,358 INFO L273 TraceCheckUtils]: 96: Hoare triple {22424#false} assume !false; {22424#false} is VALID [2018-11-23 11:59:45,363 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:59:45,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:45,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 54 [2018-11-23 11:59:45,383 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 97 [2018-11-23 11:59:45,383 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:45,384 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states. [2018-11-23 11:59:45,573 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:45,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-11-23 11:59:45,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-11-23 11:59:45,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1781, Unknown=0, NotChecked=0, Total=2862 [2018-11-23 11:59:45,576 INFO L87 Difference]: Start difference. First operand 198 states and 261 transitions. Second operand 54 states. [2018-11-23 11:59:46,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:46,644 INFO L93 Difference]: Finished difference Result 261 states and 347 transitions. [2018-11-23 11:59:46,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 11:59:46,644 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 97 [2018-11-23 11:59:46,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:46,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 11:59:46,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 207 transitions. [2018-11-23 11:59:46,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 11:59:46,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 207 transitions. [2018-11-23 11:59:46,647 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 207 transitions. [2018-11-23 11:59:46,866 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:59:46,871 INFO L225 Difference]: With dead ends: 261 [2018-11-23 11:59:46,871 INFO L226 Difference]: Without dead ends: 214 [2018-11-23 11:59:46,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 976 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1081, Invalid=1781, Unknown=0, NotChecked=0, Total=2862 [2018-11-23 11:59:46,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-11-23 11:59:47,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 204. [2018-11-23 11:59:47,050 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:47,050 INFO L82 GeneralOperation]: Start isEquivalent. First operand 214 states. Second operand 204 states. [2018-11-23 11:59:47,050 INFO L74 IsIncluded]: Start isIncluded. First operand 214 states. Second operand 204 states. [2018-11-23 11:59:47,051 INFO L87 Difference]: Start difference. First operand 214 states. Second operand 204 states. [2018-11-23 11:59:47,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:47,055 INFO L93 Difference]: Finished difference Result 214 states and 284 transitions. [2018-11-23 11:59:47,055 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 284 transitions. [2018-11-23 11:59:47,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:47,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:47,056 INFO L74 IsIncluded]: Start isIncluded. First operand 204 states. Second operand 214 states. [2018-11-23 11:59:47,056 INFO L87 Difference]: Start difference. First operand 204 states. Second operand 214 states. [2018-11-23 11:59:47,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:47,061 INFO L93 Difference]: Finished difference Result 214 states and 284 transitions. [2018-11-23 11:59:47,061 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 284 transitions. [2018-11-23 11:59:47,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:47,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:47,062 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:47,062 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:47,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-11-23 11:59:47,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 269 transitions. [2018-11-23 11:59:47,066 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 269 transitions. Word has length 97 [2018-11-23 11:59:47,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:47,066 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 269 transitions. [2018-11-23 11:59:47,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-11-23 11:59:47,066 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 269 transitions. [2018-11-23 11:59:47,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-23 11:59:47,067 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:47,067 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:59:47,068 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:47,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:47,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1262408079, now seen corresponding path program 21 times [2018-11-23 11:59:47,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:47,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:47,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:47,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:47,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:47,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:47,793 INFO L256 TraceCheckUtils]: 0: Hoare triple {23826#true} call ULTIMATE.init(); {23826#true} is VALID [2018-11-23 11:59:47,793 INFO L273 TraceCheckUtils]: 1: Hoare triple {23826#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23826#true} is VALID [2018-11-23 11:59:47,794 INFO L273 TraceCheckUtils]: 2: Hoare triple {23826#true} assume true; {23826#true} is VALID [2018-11-23 11:59:47,794 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23826#true} {23826#true} #130#return; {23826#true} is VALID [2018-11-23 11:59:47,794 INFO L256 TraceCheckUtils]: 4: Hoare triple {23826#true} call #t~ret15 := main(); {23826#true} is VALID [2018-11-23 11:59:47,795 INFO L273 TraceCheckUtils]: 5: Hoare triple {23826#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {23828#(= main_~i~0 0)} is VALID [2018-11-23 11:59:47,795 INFO L273 TraceCheckUtils]: 6: Hoare triple {23828#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {23829#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,796 INFO L273 TraceCheckUtils]: 7: Hoare triple {23829#(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); {23829#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,797 INFO L273 TraceCheckUtils]: 8: Hoare triple {23829#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {23829#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,798 INFO L273 TraceCheckUtils]: 9: Hoare triple {23829#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {23830#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,799 INFO L273 TraceCheckUtils]: 10: Hoare triple {23830#(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); {23830#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,799 INFO L273 TraceCheckUtils]: 11: Hoare triple {23830#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {23830#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,800 INFO L273 TraceCheckUtils]: 12: Hoare triple {23830#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {23831#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,801 INFO L273 TraceCheckUtils]: 13: Hoare triple {23831#(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); {23831#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,802 INFO L273 TraceCheckUtils]: 14: Hoare triple {23831#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {23831#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,803 INFO L273 TraceCheckUtils]: 15: Hoare triple {23831#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {23832#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,804 INFO L273 TraceCheckUtils]: 16: Hoare triple {23832#(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); {23832#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,804 INFO L273 TraceCheckUtils]: 17: Hoare triple {23832#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {23832#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,805 INFO L273 TraceCheckUtils]: 18: Hoare triple {23832#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {23833#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,806 INFO L273 TraceCheckUtils]: 19: Hoare triple {23833#(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); {23833#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,807 INFO L273 TraceCheckUtils]: 20: Hoare triple {23833#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {23833#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,808 INFO L273 TraceCheckUtils]: 21: Hoare triple {23833#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {23834#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,809 INFO L273 TraceCheckUtils]: 22: Hoare triple {23834#(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); {23834#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,809 INFO L273 TraceCheckUtils]: 23: Hoare triple {23834#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {23834#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,810 INFO L273 TraceCheckUtils]: 24: Hoare triple {23834#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {23835#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,811 INFO L273 TraceCheckUtils]: 25: Hoare triple {23835#(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); {23835#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,812 INFO L273 TraceCheckUtils]: 26: Hoare triple {23835#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {23835#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,813 INFO L273 TraceCheckUtils]: 27: Hoare triple {23835#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {23836#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,814 INFO L273 TraceCheckUtils]: 28: Hoare triple {23836#(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); {23836#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,814 INFO L273 TraceCheckUtils]: 29: Hoare triple {23836#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {23836#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,815 INFO L273 TraceCheckUtils]: 30: Hoare triple {23836#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {23837#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,816 INFO L273 TraceCheckUtils]: 31: Hoare triple {23837#(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); {23837#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,817 INFO L273 TraceCheckUtils]: 32: Hoare triple {23837#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {23837#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,818 INFO L273 TraceCheckUtils]: 33: Hoare triple {23837#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {23838#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,818 INFO L273 TraceCheckUtils]: 34: Hoare triple {23838#(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); {23838#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,819 INFO L273 TraceCheckUtils]: 35: Hoare triple {23838#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {23838#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,820 INFO L273 TraceCheckUtils]: 36: Hoare triple {23838#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {23839#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,821 INFO L273 TraceCheckUtils]: 37: Hoare triple {23839#(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); {23839#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,822 INFO L273 TraceCheckUtils]: 38: Hoare triple {23839#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {23839#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,823 INFO L273 TraceCheckUtils]: 39: Hoare triple {23839#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {23840#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,824 INFO L273 TraceCheckUtils]: 40: Hoare triple {23840#(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); {23840#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,824 INFO L273 TraceCheckUtils]: 41: Hoare triple {23840#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {23840#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,825 INFO L273 TraceCheckUtils]: 42: Hoare triple {23840#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {23841#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,826 INFO L273 TraceCheckUtils]: 43: Hoare triple {23841#(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); {23841#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,827 INFO L273 TraceCheckUtils]: 44: Hoare triple {23841#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {23841#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,828 INFO L273 TraceCheckUtils]: 45: Hoare triple {23841#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {23842#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,828 INFO L273 TraceCheckUtils]: 46: Hoare triple {23842#(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); {23842#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,829 INFO L273 TraceCheckUtils]: 47: Hoare triple {23842#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {23842#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,830 INFO L273 TraceCheckUtils]: 48: Hoare triple {23842#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {23843#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,831 INFO L273 TraceCheckUtils]: 49: Hoare triple {23843#(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); {23843#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,832 INFO L273 TraceCheckUtils]: 50: Hoare triple {23843#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {23843#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,832 INFO L273 TraceCheckUtils]: 51: Hoare triple {23843#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {23844#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,833 INFO L273 TraceCheckUtils]: 52: Hoare triple {23844#(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); {23844#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,834 INFO L273 TraceCheckUtils]: 53: Hoare triple {23844#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {23844#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,835 INFO L273 TraceCheckUtils]: 54: Hoare triple {23844#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {23845#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:59:47,836 INFO L273 TraceCheckUtils]: 55: Hoare triple {23845#(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); {23845#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:59:47,837 INFO L273 TraceCheckUtils]: 56: Hoare triple {23845#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {23845#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:59:47,838 INFO L273 TraceCheckUtils]: 57: Hoare triple {23845#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} ~k~0 := 1 + ~k~0; {23846#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,838 INFO L273 TraceCheckUtils]: 58: Hoare triple {23846#(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); {23846#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,839 INFO L273 TraceCheckUtils]: 59: Hoare triple {23846#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {23846#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,840 INFO L273 TraceCheckUtils]: 60: Hoare triple {23846#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {23847#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,841 INFO L273 TraceCheckUtils]: 61: Hoare triple {23847#(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); {23847#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,842 INFO L273 TraceCheckUtils]: 62: Hoare triple {23847#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {23847#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,842 INFO L273 TraceCheckUtils]: 63: Hoare triple {23847#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {23848#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,843 INFO L273 TraceCheckUtils]: 64: Hoare triple {23848#(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); {23848#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,844 INFO L273 TraceCheckUtils]: 65: Hoare triple {23848#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {23848#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,845 INFO L273 TraceCheckUtils]: 66: Hoare triple {23848#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {23849#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,846 INFO L273 TraceCheckUtils]: 67: Hoare triple {23849#(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); {23849#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,846 INFO L273 TraceCheckUtils]: 68: Hoare triple {23849#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {23849#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,847 INFO L273 TraceCheckUtils]: 69: Hoare triple {23849#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {23850#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,848 INFO L273 TraceCheckUtils]: 70: Hoare triple {23850#(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); {23850#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,849 INFO L273 TraceCheckUtils]: 71: Hoare triple {23850#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {23850#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,850 INFO L273 TraceCheckUtils]: 72: Hoare triple {23850#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {23851#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,851 INFO L273 TraceCheckUtils]: 73: Hoare triple {23851#(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); {23851#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,851 INFO L273 TraceCheckUtils]: 74: Hoare triple {23851#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {23851#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,852 INFO L273 TraceCheckUtils]: 75: Hoare triple {23851#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {23852#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,853 INFO L273 TraceCheckUtils]: 76: Hoare triple {23852#(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); {23852#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,854 INFO L273 TraceCheckUtils]: 77: Hoare triple {23852#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {23852#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,855 INFO L273 TraceCheckUtils]: 78: Hoare triple {23852#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {23853#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,856 INFO L273 TraceCheckUtils]: 79: Hoare triple {23853#(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); {23853#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,857 INFO L273 TraceCheckUtils]: 80: Hoare triple {23853#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {23853#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,858 INFO L273 TraceCheckUtils]: 81: Hoare triple {23853#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {23854#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:47,858 INFO L273 TraceCheckUtils]: 82: Hoare triple {23854#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} assume !(~k~0 < 100000); {23827#false} is VALID [2018-11-23 11:59:47,859 INFO L273 TraceCheckUtils]: 83: Hoare triple {23827#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); {23827#false} is VALID [2018-11-23 11:59:47,859 INFO L273 TraceCheckUtils]: 84: Hoare triple {23827#false} ~x~0 := 0; {23827#false} is VALID [2018-11-23 11:59:47,859 INFO L273 TraceCheckUtils]: 85: Hoare triple {23827#false} assume !(~x~0 < ~i~0); {23827#false} is VALID [2018-11-23 11:59:47,859 INFO L273 TraceCheckUtils]: 86: Hoare triple {23827#false} ~x~0 := ~i~0; {23827#false} is VALID [2018-11-23 11:59:47,859 INFO L273 TraceCheckUtils]: 87: Hoare triple {23827#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); {23827#false} is VALID [2018-11-23 11:59:47,860 INFO L256 TraceCheckUtils]: 88: Hoare triple {23827#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {23826#true} is VALID [2018-11-23 11:59:47,860 INFO L273 TraceCheckUtils]: 89: Hoare triple {23826#true} ~cond := #in~cond; {23826#true} is VALID [2018-11-23 11:59:47,860 INFO L273 TraceCheckUtils]: 90: Hoare triple {23826#true} assume !(0 == ~cond); {23826#true} is VALID [2018-11-23 11:59:47,860 INFO L273 TraceCheckUtils]: 91: Hoare triple {23826#true} assume true; {23826#true} is VALID [2018-11-23 11:59:47,860 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {23826#true} {23827#false} #136#return; {23827#false} is VALID [2018-11-23 11:59:47,861 INFO L273 TraceCheckUtils]: 93: Hoare triple {23827#false} havoc #t~mem9;havoc #t~mem10; {23827#false} is VALID [2018-11-23 11:59:47,861 INFO L273 TraceCheckUtils]: 94: Hoare triple {23827#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {23827#false} is VALID [2018-11-23 11:59:47,861 INFO L273 TraceCheckUtils]: 95: Hoare triple {23827#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); {23827#false} is VALID [2018-11-23 11:59:47,861 INFO L256 TraceCheckUtils]: 96: Hoare triple {23827#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {23827#false} is VALID [2018-11-23 11:59:47,861 INFO L273 TraceCheckUtils]: 97: Hoare triple {23827#false} ~cond := #in~cond; {23827#false} is VALID [2018-11-23 11:59:47,862 INFO L273 TraceCheckUtils]: 98: Hoare triple {23827#false} assume 0 == ~cond; {23827#false} is VALID [2018-11-23 11:59:47,862 INFO L273 TraceCheckUtils]: 99: Hoare triple {23827#false} assume !false; {23827#false} is VALID [2018-11-23 11:59:47,876 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:59:47,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:47,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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:59:47,886 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:59:48,021 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-11-23 11:59:48,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:48,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:48,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:48,771 INFO L256 TraceCheckUtils]: 0: Hoare triple {23826#true} call ULTIMATE.init(); {23826#true} is VALID [2018-11-23 11:59:48,772 INFO L273 TraceCheckUtils]: 1: Hoare triple {23826#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23826#true} is VALID [2018-11-23 11:59:48,772 INFO L273 TraceCheckUtils]: 2: Hoare triple {23826#true} assume true; {23826#true} is VALID [2018-11-23 11:59:48,772 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23826#true} {23826#true} #130#return; {23826#true} is VALID [2018-11-23 11:59:48,772 INFO L256 TraceCheckUtils]: 4: Hoare triple {23826#true} call #t~ret15 := main(); {23826#true} is VALID [2018-11-23 11:59:48,773 INFO L273 TraceCheckUtils]: 5: Hoare triple {23826#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {23873#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:48,774 INFO L273 TraceCheckUtils]: 6: Hoare triple {23873#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {23877#(<= main_~k~0 1)} is VALID [2018-11-23 11:59:48,774 INFO L273 TraceCheckUtils]: 7: Hoare triple {23877#(<= 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); {23877#(<= main_~k~0 1)} is VALID [2018-11-23 11:59:48,774 INFO L273 TraceCheckUtils]: 8: Hoare triple {23877#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {23877#(<= main_~k~0 1)} is VALID [2018-11-23 11:59:48,775 INFO L273 TraceCheckUtils]: 9: Hoare triple {23877#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {23887#(<= main_~k~0 2)} is VALID [2018-11-23 11:59:48,775 INFO L273 TraceCheckUtils]: 10: Hoare triple {23887#(<= 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); {23887#(<= main_~k~0 2)} is VALID [2018-11-23 11:59:48,775 INFO L273 TraceCheckUtils]: 11: Hoare triple {23887#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {23887#(<= main_~k~0 2)} is VALID [2018-11-23 11:59:48,776 INFO L273 TraceCheckUtils]: 12: Hoare triple {23887#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {23897#(<= main_~k~0 3)} is VALID [2018-11-23 11:59:48,777 INFO L273 TraceCheckUtils]: 13: Hoare triple {23897#(<= 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); {23897#(<= main_~k~0 3)} is VALID [2018-11-23 11:59:48,777 INFO L273 TraceCheckUtils]: 14: Hoare triple {23897#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {23897#(<= main_~k~0 3)} is VALID [2018-11-23 11:59:48,778 INFO L273 TraceCheckUtils]: 15: Hoare triple {23897#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {23907#(<= main_~k~0 4)} is VALID [2018-11-23 11:59:48,779 INFO L273 TraceCheckUtils]: 16: Hoare triple {23907#(<= 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); {23907#(<= main_~k~0 4)} is VALID [2018-11-23 11:59:48,779 INFO L273 TraceCheckUtils]: 17: Hoare triple {23907#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {23907#(<= main_~k~0 4)} is VALID [2018-11-23 11:59:48,780 INFO L273 TraceCheckUtils]: 18: Hoare triple {23907#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {23917#(<= main_~k~0 5)} is VALID [2018-11-23 11:59:48,780 INFO L273 TraceCheckUtils]: 19: Hoare triple {23917#(<= 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); {23917#(<= main_~k~0 5)} is VALID [2018-11-23 11:59:48,781 INFO L273 TraceCheckUtils]: 20: Hoare triple {23917#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {23917#(<= main_~k~0 5)} is VALID [2018-11-23 11:59:48,782 INFO L273 TraceCheckUtils]: 21: Hoare triple {23917#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {23927#(<= main_~k~0 6)} is VALID [2018-11-23 11:59:48,782 INFO L273 TraceCheckUtils]: 22: Hoare triple {23927#(<= 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); {23927#(<= main_~k~0 6)} is VALID [2018-11-23 11:59:48,783 INFO L273 TraceCheckUtils]: 23: Hoare triple {23927#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {23927#(<= main_~k~0 6)} is VALID [2018-11-23 11:59:48,783 INFO L273 TraceCheckUtils]: 24: Hoare triple {23927#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {23937#(<= main_~k~0 7)} is VALID [2018-11-23 11:59:48,784 INFO L273 TraceCheckUtils]: 25: Hoare triple {23937#(<= 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); {23937#(<= main_~k~0 7)} is VALID [2018-11-23 11:59:48,784 INFO L273 TraceCheckUtils]: 26: Hoare triple {23937#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {23937#(<= main_~k~0 7)} is VALID [2018-11-23 11:59:48,785 INFO L273 TraceCheckUtils]: 27: Hoare triple {23937#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {23947#(<= main_~k~0 8)} is VALID [2018-11-23 11:59:48,786 INFO L273 TraceCheckUtils]: 28: Hoare triple {23947#(<= 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); {23947#(<= main_~k~0 8)} is VALID [2018-11-23 11:59:48,786 INFO L273 TraceCheckUtils]: 29: Hoare triple {23947#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {23947#(<= main_~k~0 8)} is VALID [2018-11-23 11:59:48,787 INFO L273 TraceCheckUtils]: 30: Hoare triple {23947#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {23957#(<= main_~k~0 9)} is VALID [2018-11-23 11:59:48,788 INFO L273 TraceCheckUtils]: 31: Hoare triple {23957#(<= 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); {23957#(<= main_~k~0 9)} is VALID [2018-11-23 11:59:48,788 INFO L273 TraceCheckUtils]: 32: Hoare triple {23957#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {23957#(<= main_~k~0 9)} is VALID [2018-11-23 11:59:48,789 INFO L273 TraceCheckUtils]: 33: Hoare triple {23957#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {23967#(<= main_~k~0 10)} is VALID [2018-11-23 11:59:48,789 INFO L273 TraceCheckUtils]: 34: Hoare triple {23967#(<= 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); {23967#(<= main_~k~0 10)} is VALID [2018-11-23 11:59:48,790 INFO L273 TraceCheckUtils]: 35: Hoare triple {23967#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {23967#(<= main_~k~0 10)} is VALID [2018-11-23 11:59:48,791 INFO L273 TraceCheckUtils]: 36: Hoare triple {23967#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {23977#(<= main_~k~0 11)} is VALID [2018-11-23 11:59:48,791 INFO L273 TraceCheckUtils]: 37: Hoare triple {23977#(<= 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); {23977#(<= main_~k~0 11)} is VALID [2018-11-23 11:59:48,792 INFO L273 TraceCheckUtils]: 38: Hoare triple {23977#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {23977#(<= main_~k~0 11)} is VALID [2018-11-23 11:59:48,792 INFO L273 TraceCheckUtils]: 39: Hoare triple {23977#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {23987#(<= main_~k~0 12)} is VALID [2018-11-23 11:59:48,793 INFO L273 TraceCheckUtils]: 40: Hoare triple {23987#(<= 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); {23987#(<= main_~k~0 12)} is VALID [2018-11-23 11:59:48,794 INFO L273 TraceCheckUtils]: 41: Hoare triple {23987#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {23987#(<= main_~k~0 12)} is VALID [2018-11-23 11:59:48,794 INFO L273 TraceCheckUtils]: 42: Hoare triple {23987#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {23997#(<= main_~k~0 13)} is VALID [2018-11-23 11:59:48,795 INFO L273 TraceCheckUtils]: 43: Hoare triple {23997#(<= 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); {23997#(<= main_~k~0 13)} is VALID [2018-11-23 11:59:48,795 INFO L273 TraceCheckUtils]: 44: Hoare triple {23997#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {23997#(<= main_~k~0 13)} is VALID [2018-11-23 11:59:48,796 INFO L273 TraceCheckUtils]: 45: Hoare triple {23997#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {24007#(<= main_~k~0 14)} is VALID [2018-11-23 11:59:48,797 INFO L273 TraceCheckUtils]: 46: Hoare triple {24007#(<= 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); {24007#(<= main_~k~0 14)} is VALID [2018-11-23 11:59:48,797 INFO L273 TraceCheckUtils]: 47: Hoare triple {24007#(<= main_~k~0 14)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {24007#(<= main_~k~0 14)} is VALID [2018-11-23 11:59:48,798 INFO L273 TraceCheckUtils]: 48: Hoare triple {24007#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {24017#(<= main_~k~0 15)} is VALID [2018-11-23 11:59:48,798 INFO L273 TraceCheckUtils]: 49: Hoare triple {24017#(<= 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); {24017#(<= main_~k~0 15)} is VALID [2018-11-23 11:59:48,799 INFO L273 TraceCheckUtils]: 50: Hoare triple {24017#(<= main_~k~0 15)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {24017#(<= main_~k~0 15)} is VALID [2018-11-23 11:59:48,800 INFO L273 TraceCheckUtils]: 51: Hoare triple {24017#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {24027#(<= main_~k~0 16)} is VALID [2018-11-23 11:59:48,800 INFO L273 TraceCheckUtils]: 52: Hoare triple {24027#(<= 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); {24027#(<= main_~k~0 16)} is VALID [2018-11-23 11:59:48,801 INFO L273 TraceCheckUtils]: 53: Hoare triple {24027#(<= main_~k~0 16)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {24027#(<= main_~k~0 16)} is VALID [2018-11-23 11:59:48,802 INFO L273 TraceCheckUtils]: 54: Hoare triple {24027#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {24037#(<= main_~k~0 17)} is VALID [2018-11-23 11:59:48,802 INFO L273 TraceCheckUtils]: 55: Hoare triple {24037#(<= 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); {24037#(<= main_~k~0 17)} is VALID [2018-11-23 11:59:48,803 INFO L273 TraceCheckUtils]: 56: Hoare triple {24037#(<= main_~k~0 17)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {24037#(<= main_~k~0 17)} is VALID [2018-11-23 11:59:48,803 INFO L273 TraceCheckUtils]: 57: Hoare triple {24037#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {24047#(<= main_~k~0 18)} is VALID [2018-11-23 11:59:48,804 INFO L273 TraceCheckUtils]: 58: Hoare triple {24047#(<= 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); {24047#(<= main_~k~0 18)} is VALID [2018-11-23 11:59:48,804 INFO L273 TraceCheckUtils]: 59: Hoare triple {24047#(<= main_~k~0 18)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {24047#(<= main_~k~0 18)} is VALID [2018-11-23 11:59:48,805 INFO L273 TraceCheckUtils]: 60: Hoare triple {24047#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {24057#(<= main_~k~0 19)} is VALID [2018-11-23 11:59:48,806 INFO L273 TraceCheckUtils]: 61: Hoare triple {24057#(<= 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); {24057#(<= main_~k~0 19)} is VALID [2018-11-23 11:59:48,806 INFO L273 TraceCheckUtils]: 62: Hoare triple {24057#(<= main_~k~0 19)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {24057#(<= main_~k~0 19)} is VALID [2018-11-23 11:59:48,807 INFO L273 TraceCheckUtils]: 63: Hoare triple {24057#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {24067#(<= main_~k~0 20)} is VALID [2018-11-23 11:59:48,807 INFO L273 TraceCheckUtils]: 64: Hoare triple {24067#(<= 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); {24067#(<= main_~k~0 20)} is VALID [2018-11-23 11:59:48,808 INFO L273 TraceCheckUtils]: 65: Hoare triple {24067#(<= main_~k~0 20)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {24067#(<= main_~k~0 20)} is VALID [2018-11-23 11:59:48,809 INFO L273 TraceCheckUtils]: 66: Hoare triple {24067#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {24077#(<= main_~k~0 21)} is VALID [2018-11-23 11:59:48,809 INFO L273 TraceCheckUtils]: 67: Hoare triple {24077#(<= 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); {24077#(<= main_~k~0 21)} is VALID [2018-11-23 11:59:48,810 INFO L273 TraceCheckUtils]: 68: Hoare triple {24077#(<= main_~k~0 21)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {24077#(<= main_~k~0 21)} is VALID [2018-11-23 11:59:48,811 INFO L273 TraceCheckUtils]: 69: Hoare triple {24077#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {24087#(<= main_~k~0 22)} is VALID [2018-11-23 11:59:48,811 INFO L273 TraceCheckUtils]: 70: Hoare triple {24087#(<= 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); {24087#(<= main_~k~0 22)} is VALID [2018-11-23 11:59:48,812 INFO L273 TraceCheckUtils]: 71: Hoare triple {24087#(<= main_~k~0 22)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {24087#(<= main_~k~0 22)} is VALID [2018-11-23 11:59:48,812 INFO L273 TraceCheckUtils]: 72: Hoare triple {24087#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {24097#(<= main_~k~0 23)} is VALID [2018-11-23 11:59:48,813 INFO L273 TraceCheckUtils]: 73: Hoare triple {24097#(<= 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); {24097#(<= main_~k~0 23)} is VALID [2018-11-23 11:59:48,814 INFO L273 TraceCheckUtils]: 74: Hoare triple {24097#(<= main_~k~0 23)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {24097#(<= main_~k~0 23)} is VALID [2018-11-23 11:59:48,814 INFO L273 TraceCheckUtils]: 75: Hoare triple {24097#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {24107#(<= main_~k~0 24)} is VALID [2018-11-23 11:59:48,815 INFO L273 TraceCheckUtils]: 76: Hoare triple {24107#(<= 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); {24107#(<= main_~k~0 24)} is VALID [2018-11-23 11:59:48,815 INFO L273 TraceCheckUtils]: 77: Hoare triple {24107#(<= main_~k~0 24)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {24107#(<= main_~k~0 24)} is VALID [2018-11-23 11:59:48,816 INFO L273 TraceCheckUtils]: 78: Hoare triple {24107#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {24117#(<= main_~k~0 25)} is VALID [2018-11-23 11:59:48,817 INFO L273 TraceCheckUtils]: 79: Hoare triple {24117#(<= 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); {24117#(<= main_~k~0 25)} is VALID [2018-11-23 11:59:48,817 INFO L273 TraceCheckUtils]: 80: Hoare triple {24117#(<= main_~k~0 25)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {24117#(<= main_~k~0 25)} is VALID [2018-11-23 11:59:48,818 INFO L273 TraceCheckUtils]: 81: Hoare triple {24117#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {24127#(<= main_~k~0 26)} is VALID [2018-11-23 11:59:48,819 INFO L273 TraceCheckUtils]: 82: Hoare triple {24127#(<= main_~k~0 26)} assume !(~k~0 < 100000); {23827#false} is VALID [2018-11-23 11:59:48,819 INFO L273 TraceCheckUtils]: 83: Hoare triple {23827#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); {23827#false} is VALID [2018-11-23 11:59:48,819 INFO L273 TraceCheckUtils]: 84: Hoare triple {23827#false} ~x~0 := 0; {23827#false} is VALID [2018-11-23 11:59:48,819 INFO L273 TraceCheckUtils]: 85: Hoare triple {23827#false} assume !(~x~0 < ~i~0); {23827#false} is VALID [2018-11-23 11:59:48,819 INFO L273 TraceCheckUtils]: 86: Hoare triple {23827#false} ~x~0 := ~i~0; {23827#false} is VALID [2018-11-23 11:59:48,820 INFO L273 TraceCheckUtils]: 87: Hoare triple {23827#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); {23827#false} is VALID [2018-11-23 11:59:48,820 INFO L256 TraceCheckUtils]: 88: Hoare triple {23827#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {23827#false} is VALID [2018-11-23 11:59:48,820 INFO L273 TraceCheckUtils]: 89: Hoare triple {23827#false} ~cond := #in~cond; {23827#false} is VALID [2018-11-23 11:59:48,820 INFO L273 TraceCheckUtils]: 90: Hoare triple {23827#false} assume !(0 == ~cond); {23827#false} is VALID [2018-11-23 11:59:48,820 INFO L273 TraceCheckUtils]: 91: Hoare triple {23827#false} assume true; {23827#false} is VALID [2018-11-23 11:59:48,821 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {23827#false} {23827#false} #136#return; {23827#false} is VALID [2018-11-23 11:59:48,821 INFO L273 TraceCheckUtils]: 93: Hoare triple {23827#false} havoc #t~mem9;havoc #t~mem10; {23827#false} is VALID [2018-11-23 11:59:48,821 INFO L273 TraceCheckUtils]: 94: Hoare triple {23827#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {23827#false} is VALID [2018-11-23 11:59:48,821 INFO L273 TraceCheckUtils]: 95: Hoare triple {23827#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); {23827#false} is VALID [2018-11-23 11:59:48,821 INFO L256 TraceCheckUtils]: 96: Hoare triple {23827#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {23827#false} is VALID [2018-11-23 11:59:48,822 INFO L273 TraceCheckUtils]: 97: Hoare triple {23827#false} ~cond := #in~cond; {23827#false} is VALID [2018-11-23 11:59:48,822 INFO L273 TraceCheckUtils]: 98: Hoare triple {23827#false} assume 0 == ~cond; {23827#false} is VALID [2018-11-23 11:59:48,822 INFO L273 TraceCheckUtils]: 99: Hoare triple {23827#false} assume !false; {23827#false} is VALID [2018-11-23 11:59:48,828 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:59:48,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:48,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 56 [2018-11-23 11:59:48,852 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 100 [2018-11-23 11:59:48,852 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:48,852 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 56 states. [2018-11-23 11:59:49,107 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:59:49,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-11-23 11:59:49,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-11-23 11:59:49,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1163, Invalid=1917, Unknown=0, NotChecked=0, Total=3080 [2018-11-23 11:59:49,110 INFO L87 Difference]: Start difference. First operand 204 states and 269 transitions. Second operand 56 states. [2018-11-23 11:59:50,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:50,242 INFO L93 Difference]: Finished difference Result 267 states and 355 transitions. [2018-11-23 11:59:50,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 11:59:50,242 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 100 [2018-11-23 11:59:50,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:50,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 11:59:50,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 211 transitions. [2018-11-23 11:59:50,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 11:59:50,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 211 transitions. [2018-11-23 11:59:50,246 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 211 transitions. [2018-11-23 11:59:50,449 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:59:50,453 INFO L225 Difference]: With dead ends: 267 [2018-11-23 11:59:50,453 INFO L226 Difference]: Without dead ends: 220 [2018-11-23 11:59:50,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1163, Invalid=1917, Unknown=0, NotChecked=0, Total=3080 [2018-11-23 11:59:50,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-11-23 11:59:50,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 210. [2018-11-23 11:59:50,581 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:50,581 INFO L82 GeneralOperation]: Start isEquivalent. First operand 220 states. Second operand 210 states. [2018-11-23 11:59:50,581 INFO L74 IsIncluded]: Start isIncluded. First operand 220 states. Second operand 210 states. [2018-11-23 11:59:50,581 INFO L87 Difference]: Start difference. First operand 220 states. Second operand 210 states. [2018-11-23 11:59:50,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:50,586 INFO L93 Difference]: Finished difference Result 220 states and 292 transitions. [2018-11-23 11:59:50,586 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 292 transitions. [2018-11-23 11:59:50,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:50,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:50,587 INFO L74 IsIncluded]: Start isIncluded. First operand 210 states. Second operand 220 states. [2018-11-23 11:59:50,587 INFO L87 Difference]: Start difference. First operand 210 states. Second operand 220 states. [2018-11-23 11:59:50,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:50,591 INFO L93 Difference]: Finished difference Result 220 states and 292 transitions. [2018-11-23 11:59:50,591 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 292 transitions. [2018-11-23 11:59:50,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:50,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:50,591 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:50,591 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:50,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-11-23 11:59:50,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 277 transitions. [2018-11-23 11:59:50,595 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 277 transitions. Word has length 100 [2018-11-23 11:59:50,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:50,595 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 277 transitions. [2018-11-23 11:59:50,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-11-23 11:59:50,595 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 277 transitions. [2018-11-23 11:59:50,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-23 11:59:50,596 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:50,596 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:59:50,596 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:50,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:50,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1465764972, now seen corresponding path program 22 times [2018-11-23 11:59:50,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:50,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:50,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:50,597 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:50,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:50,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:51,489 INFO L256 TraceCheckUtils]: 0: Hoare triple {25268#true} call ULTIMATE.init(); {25268#true} is VALID [2018-11-23 11:59:51,489 INFO L273 TraceCheckUtils]: 1: Hoare triple {25268#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {25268#true} is VALID [2018-11-23 11:59:51,489 INFO L273 TraceCheckUtils]: 2: Hoare triple {25268#true} assume true; {25268#true} is VALID [2018-11-23 11:59:51,489 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25268#true} {25268#true} #130#return; {25268#true} is VALID [2018-11-23 11:59:51,490 INFO L256 TraceCheckUtils]: 4: Hoare triple {25268#true} call #t~ret15 := main(); {25268#true} is VALID [2018-11-23 11:59:51,490 INFO L273 TraceCheckUtils]: 5: Hoare triple {25268#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {25270#(= main_~i~0 0)} is VALID [2018-11-23 11:59:51,491 INFO L273 TraceCheckUtils]: 6: Hoare triple {25270#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {25271#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,492 INFO L273 TraceCheckUtils]: 7: Hoare triple {25271#(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); {25271#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,493 INFO L273 TraceCheckUtils]: 8: Hoare triple {25271#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {25271#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,494 INFO L273 TraceCheckUtils]: 9: Hoare triple {25271#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {25272#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,494 INFO L273 TraceCheckUtils]: 10: Hoare triple {25272#(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); {25272#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,495 INFO L273 TraceCheckUtils]: 11: Hoare triple {25272#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {25272#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,495 INFO L273 TraceCheckUtils]: 12: Hoare triple {25272#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {25273#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,496 INFO L273 TraceCheckUtils]: 13: Hoare triple {25273#(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); {25273#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,496 INFO L273 TraceCheckUtils]: 14: Hoare triple {25273#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {25273#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,497 INFO L273 TraceCheckUtils]: 15: Hoare triple {25273#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {25274#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,503 INFO L273 TraceCheckUtils]: 16: Hoare triple {25274#(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); {25274#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,503 INFO L273 TraceCheckUtils]: 17: Hoare triple {25274#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {25274#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,504 INFO L273 TraceCheckUtils]: 18: Hoare triple {25274#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {25275#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,505 INFO L273 TraceCheckUtils]: 19: Hoare triple {25275#(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); {25275#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,505 INFO L273 TraceCheckUtils]: 20: Hoare triple {25275#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {25275#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,506 INFO L273 TraceCheckUtils]: 21: Hoare triple {25275#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {25276#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,506 INFO L273 TraceCheckUtils]: 22: Hoare triple {25276#(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); {25276#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,506 INFO L273 TraceCheckUtils]: 23: Hoare triple {25276#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {25276#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,507 INFO L273 TraceCheckUtils]: 24: Hoare triple {25276#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {25277#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,508 INFO L273 TraceCheckUtils]: 25: Hoare triple {25277#(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); {25277#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,509 INFO L273 TraceCheckUtils]: 26: Hoare triple {25277#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {25277#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,510 INFO L273 TraceCheckUtils]: 27: Hoare triple {25277#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {25278#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,510 INFO L273 TraceCheckUtils]: 28: Hoare triple {25278#(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); {25278#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,511 INFO L273 TraceCheckUtils]: 29: Hoare triple {25278#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {25278#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,512 INFO L273 TraceCheckUtils]: 30: Hoare triple {25278#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {25279#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,513 INFO L273 TraceCheckUtils]: 31: Hoare triple {25279#(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); {25279#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,514 INFO L273 TraceCheckUtils]: 32: Hoare triple {25279#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {25279#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,514 INFO L273 TraceCheckUtils]: 33: Hoare triple {25279#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {25280#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,515 INFO L273 TraceCheckUtils]: 34: Hoare triple {25280#(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); {25280#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,516 INFO L273 TraceCheckUtils]: 35: Hoare triple {25280#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {25280#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,517 INFO L273 TraceCheckUtils]: 36: Hoare triple {25280#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {25281#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,518 INFO L273 TraceCheckUtils]: 37: Hoare triple {25281#(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); {25281#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,519 INFO L273 TraceCheckUtils]: 38: Hoare triple {25281#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {25281#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,520 INFO L273 TraceCheckUtils]: 39: Hoare triple {25281#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {25282#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,520 INFO L273 TraceCheckUtils]: 40: Hoare triple {25282#(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); {25282#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,521 INFO L273 TraceCheckUtils]: 41: Hoare triple {25282#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {25282#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,522 INFO L273 TraceCheckUtils]: 42: Hoare triple {25282#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {25283#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,523 INFO L273 TraceCheckUtils]: 43: Hoare triple {25283#(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); {25283#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,523 INFO L273 TraceCheckUtils]: 44: Hoare triple {25283#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {25283#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,524 INFO L273 TraceCheckUtils]: 45: Hoare triple {25283#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {25284#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,525 INFO L273 TraceCheckUtils]: 46: Hoare triple {25284#(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); {25284#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,526 INFO L273 TraceCheckUtils]: 47: Hoare triple {25284#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {25284#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,527 INFO L273 TraceCheckUtils]: 48: Hoare triple {25284#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {25285#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,528 INFO L273 TraceCheckUtils]: 49: Hoare triple {25285#(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); {25285#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,528 INFO L273 TraceCheckUtils]: 50: Hoare triple {25285#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {25285#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,529 INFO L273 TraceCheckUtils]: 51: Hoare triple {25285#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {25286#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,530 INFO L273 TraceCheckUtils]: 52: Hoare triple {25286#(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); {25286#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,531 INFO L273 TraceCheckUtils]: 53: Hoare triple {25286#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {25286#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,532 INFO L273 TraceCheckUtils]: 54: Hoare triple {25286#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {25287#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:59:51,533 INFO L273 TraceCheckUtils]: 55: Hoare triple {25287#(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); {25287#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:59:51,533 INFO L273 TraceCheckUtils]: 56: Hoare triple {25287#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {25287#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:59:51,538 INFO L273 TraceCheckUtils]: 57: Hoare triple {25287#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} ~k~0 := 1 + ~k~0; {25288#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,539 INFO L273 TraceCheckUtils]: 58: Hoare triple {25288#(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); {25288#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,539 INFO L273 TraceCheckUtils]: 59: Hoare triple {25288#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {25288#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,540 INFO L273 TraceCheckUtils]: 60: Hoare triple {25288#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {25289#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,540 INFO L273 TraceCheckUtils]: 61: Hoare triple {25289#(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); {25289#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,541 INFO L273 TraceCheckUtils]: 62: Hoare triple {25289#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {25289#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,542 INFO L273 TraceCheckUtils]: 63: Hoare triple {25289#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {25290#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,542 INFO L273 TraceCheckUtils]: 64: Hoare triple {25290#(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); {25290#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,543 INFO L273 TraceCheckUtils]: 65: Hoare triple {25290#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {25290#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,544 INFO L273 TraceCheckUtils]: 66: Hoare triple {25290#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {25291#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,545 INFO L273 TraceCheckUtils]: 67: Hoare triple {25291#(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); {25291#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,546 INFO L273 TraceCheckUtils]: 68: Hoare triple {25291#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {25291#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,546 INFO L273 TraceCheckUtils]: 69: Hoare triple {25291#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {25292#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,547 INFO L273 TraceCheckUtils]: 70: Hoare triple {25292#(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); {25292#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,548 INFO L273 TraceCheckUtils]: 71: Hoare triple {25292#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {25292#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,549 INFO L273 TraceCheckUtils]: 72: Hoare triple {25292#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {25293#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,550 INFO L273 TraceCheckUtils]: 73: Hoare triple {25293#(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); {25293#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,550 INFO L273 TraceCheckUtils]: 74: Hoare triple {25293#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {25293#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,551 INFO L273 TraceCheckUtils]: 75: Hoare triple {25293#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {25294#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,552 INFO L273 TraceCheckUtils]: 76: Hoare triple {25294#(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); {25294#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,553 INFO L273 TraceCheckUtils]: 77: Hoare triple {25294#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {25294#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,554 INFO L273 TraceCheckUtils]: 78: Hoare triple {25294#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {25295#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,555 INFO L273 TraceCheckUtils]: 79: Hoare triple {25295#(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); {25295#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,555 INFO L273 TraceCheckUtils]: 80: Hoare triple {25295#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {25295#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,556 INFO L273 TraceCheckUtils]: 81: Hoare triple {25295#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {25296#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,557 INFO L273 TraceCheckUtils]: 82: Hoare triple {25296#(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); {25296#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,577 INFO L273 TraceCheckUtils]: 83: Hoare triple {25296#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {25296#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,586 INFO L273 TraceCheckUtils]: 84: Hoare triple {25296#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {25297#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:51,599 INFO L273 TraceCheckUtils]: 85: Hoare triple {25297#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} assume !(~k~0 < 100000); {25269#false} is VALID [2018-11-23 11:59:51,599 INFO L273 TraceCheckUtils]: 86: Hoare triple {25269#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); {25269#false} is VALID [2018-11-23 11:59:51,599 INFO L273 TraceCheckUtils]: 87: Hoare triple {25269#false} ~x~0 := 0; {25269#false} is VALID [2018-11-23 11:59:51,599 INFO L273 TraceCheckUtils]: 88: Hoare triple {25269#false} assume !(~x~0 < ~i~0); {25269#false} is VALID [2018-11-23 11:59:51,600 INFO L273 TraceCheckUtils]: 89: Hoare triple {25269#false} ~x~0 := ~i~0; {25269#false} is VALID [2018-11-23 11:59:51,600 INFO L273 TraceCheckUtils]: 90: Hoare triple {25269#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); {25269#false} is VALID [2018-11-23 11:59:51,600 INFO L256 TraceCheckUtils]: 91: Hoare triple {25269#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {25268#true} is VALID [2018-11-23 11:59:51,600 INFO L273 TraceCheckUtils]: 92: Hoare triple {25268#true} ~cond := #in~cond; {25268#true} is VALID [2018-11-23 11:59:51,600 INFO L273 TraceCheckUtils]: 93: Hoare triple {25268#true} assume !(0 == ~cond); {25268#true} is VALID [2018-11-23 11:59:51,601 INFO L273 TraceCheckUtils]: 94: Hoare triple {25268#true} assume true; {25268#true} is VALID [2018-11-23 11:59:51,601 INFO L268 TraceCheckUtils]: 95: Hoare quadruple {25268#true} {25269#false} #136#return; {25269#false} is VALID [2018-11-23 11:59:51,601 INFO L273 TraceCheckUtils]: 96: Hoare triple {25269#false} havoc #t~mem9;havoc #t~mem10; {25269#false} is VALID [2018-11-23 11:59:51,601 INFO L273 TraceCheckUtils]: 97: Hoare triple {25269#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {25269#false} is VALID [2018-11-23 11:59:51,601 INFO L273 TraceCheckUtils]: 98: Hoare triple {25269#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); {25269#false} is VALID [2018-11-23 11:59:51,601 INFO L256 TraceCheckUtils]: 99: Hoare triple {25269#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {25269#false} is VALID [2018-11-23 11:59:51,602 INFO L273 TraceCheckUtils]: 100: Hoare triple {25269#false} ~cond := #in~cond; {25269#false} is VALID [2018-11-23 11:59:51,602 INFO L273 TraceCheckUtils]: 101: Hoare triple {25269#false} assume 0 == ~cond; {25269#false} is VALID [2018-11-23 11:59:51,602 INFO L273 TraceCheckUtils]: 102: Hoare triple {25269#false} assume !false; {25269#false} is VALID [2018-11-23 11:59:51,622 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:59:51,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:51,623 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:59:51,636 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:59:51,708 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:59:51,708 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:51,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:51,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:52,542 INFO L256 TraceCheckUtils]: 0: Hoare triple {25268#true} call ULTIMATE.init(); {25268#true} is VALID [2018-11-23 11:59:52,542 INFO L273 TraceCheckUtils]: 1: Hoare triple {25268#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {25268#true} is VALID [2018-11-23 11:59:52,542 INFO L273 TraceCheckUtils]: 2: Hoare triple {25268#true} assume true; {25268#true} is VALID [2018-11-23 11:59:52,543 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25268#true} {25268#true} #130#return; {25268#true} is VALID [2018-11-23 11:59:52,543 INFO L256 TraceCheckUtils]: 4: Hoare triple {25268#true} call #t~ret15 := main(); {25268#true} is VALID [2018-11-23 11:59:52,544 INFO L273 TraceCheckUtils]: 5: Hoare triple {25268#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {25316#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:52,544 INFO L273 TraceCheckUtils]: 6: Hoare triple {25316#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {25320#(<= main_~k~0 1)} is VALID [2018-11-23 11:59:52,545 INFO L273 TraceCheckUtils]: 7: Hoare triple {25320#(<= 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); {25320#(<= main_~k~0 1)} is VALID [2018-11-23 11:59:52,545 INFO L273 TraceCheckUtils]: 8: Hoare triple {25320#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {25320#(<= main_~k~0 1)} is VALID [2018-11-23 11:59:52,546 INFO L273 TraceCheckUtils]: 9: Hoare triple {25320#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {25330#(<= main_~k~0 2)} is VALID [2018-11-23 11:59:52,546 INFO L273 TraceCheckUtils]: 10: Hoare triple {25330#(<= 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); {25330#(<= main_~k~0 2)} is VALID [2018-11-23 11:59:52,547 INFO L273 TraceCheckUtils]: 11: Hoare triple {25330#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {25330#(<= main_~k~0 2)} is VALID [2018-11-23 11:59:52,547 INFO L273 TraceCheckUtils]: 12: Hoare triple {25330#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {25340#(<= main_~k~0 3)} is VALID [2018-11-23 11:59:52,547 INFO L273 TraceCheckUtils]: 13: Hoare triple {25340#(<= 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); {25340#(<= main_~k~0 3)} is VALID [2018-11-23 11:59:52,548 INFO L273 TraceCheckUtils]: 14: Hoare triple {25340#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {25340#(<= main_~k~0 3)} is VALID [2018-11-23 11:59:52,548 INFO L273 TraceCheckUtils]: 15: Hoare triple {25340#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {25350#(<= main_~k~0 4)} is VALID [2018-11-23 11:59:52,549 INFO L273 TraceCheckUtils]: 16: Hoare triple {25350#(<= 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); {25350#(<= main_~k~0 4)} is VALID [2018-11-23 11:59:52,549 INFO L273 TraceCheckUtils]: 17: Hoare triple {25350#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {25350#(<= main_~k~0 4)} is VALID [2018-11-23 11:59:52,550 INFO L273 TraceCheckUtils]: 18: Hoare triple {25350#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {25360#(<= main_~k~0 5)} is VALID [2018-11-23 11:59:52,551 INFO L273 TraceCheckUtils]: 19: Hoare triple {25360#(<= 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); {25360#(<= main_~k~0 5)} is VALID [2018-11-23 11:59:52,551 INFO L273 TraceCheckUtils]: 20: Hoare triple {25360#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {25360#(<= main_~k~0 5)} is VALID [2018-11-23 11:59:52,552 INFO L273 TraceCheckUtils]: 21: Hoare triple {25360#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {25370#(<= main_~k~0 6)} is VALID [2018-11-23 11:59:52,552 INFO L273 TraceCheckUtils]: 22: Hoare triple {25370#(<= 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); {25370#(<= main_~k~0 6)} is VALID [2018-11-23 11:59:52,553 INFO L273 TraceCheckUtils]: 23: Hoare triple {25370#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {25370#(<= main_~k~0 6)} is VALID [2018-11-23 11:59:52,554 INFO L273 TraceCheckUtils]: 24: Hoare triple {25370#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {25380#(<= main_~k~0 7)} is VALID [2018-11-23 11:59:52,554 INFO L273 TraceCheckUtils]: 25: Hoare triple {25380#(<= 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); {25380#(<= main_~k~0 7)} is VALID [2018-11-23 11:59:52,555 INFO L273 TraceCheckUtils]: 26: Hoare triple {25380#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {25380#(<= main_~k~0 7)} is VALID [2018-11-23 11:59:52,555 INFO L273 TraceCheckUtils]: 27: Hoare triple {25380#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {25390#(<= main_~k~0 8)} is VALID [2018-11-23 11:59:52,556 INFO L273 TraceCheckUtils]: 28: Hoare triple {25390#(<= 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); {25390#(<= main_~k~0 8)} is VALID [2018-11-23 11:59:52,556 INFO L273 TraceCheckUtils]: 29: Hoare triple {25390#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {25390#(<= main_~k~0 8)} is VALID [2018-11-23 11:59:52,557 INFO L273 TraceCheckUtils]: 30: Hoare triple {25390#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {25400#(<= main_~k~0 9)} is VALID [2018-11-23 11:59:52,558 INFO L273 TraceCheckUtils]: 31: Hoare triple {25400#(<= 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); {25400#(<= main_~k~0 9)} is VALID [2018-11-23 11:59:52,558 INFO L273 TraceCheckUtils]: 32: Hoare triple {25400#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {25400#(<= main_~k~0 9)} is VALID [2018-11-23 11:59:52,559 INFO L273 TraceCheckUtils]: 33: Hoare triple {25400#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {25410#(<= main_~k~0 10)} is VALID [2018-11-23 11:59:52,559 INFO L273 TraceCheckUtils]: 34: Hoare triple {25410#(<= 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); {25410#(<= main_~k~0 10)} is VALID [2018-11-23 11:59:52,560 INFO L273 TraceCheckUtils]: 35: Hoare triple {25410#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {25410#(<= main_~k~0 10)} is VALID [2018-11-23 11:59:52,561 INFO L273 TraceCheckUtils]: 36: Hoare triple {25410#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {25420#(<= main_~k~0 11)} is VALID [2018-11-23 11:59:52,561 INFO L273 TraceCheckUtils]: 37: Hoare triple {25420#(<= 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); {25420#(<= main_~k~0 11)} is VALID [2018-11-23 11:59:52,562 INFO L273 TraceCheckUtils]: 38: Hoare triple {25420#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {25420#(<= main_~k~0 11)} is VALID [2018-11-23 11:59:52,562 INFO L273 TraceCheckUtils]: 39: Hoare triple {25420#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {25430#(<= main_~k~0 12)} is VALID [2018-11-23 11:59:52,563 INFO L273 TraceCheckUtils]: 40: Hoare triple {25430#(<= 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); {25430#(<= main_~k~0 12)} is VALID [2018-11-23 11:59:52,563 INFO L273 TraceCheckUtils]: 41: Hoare triple {25430#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {25430#(<= main_~k~0 12)} is VALID [2018-11-23 11:59:52,564 INFO L273 TraceCheckUtils]: 42: Hoare triple {25430#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {25440#(<= main_~k~0 13)} is VALID [2018-11-23 11:59:52,565 INFO L273 TraceCheckUtils]: 43: Hoare triple {25440#(<= 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); {25440#(<= main_~k~0 13)} is VALID [2018-11-23 11:59:52,565 INFO L273 TraceCheckUtils]: 44: Hoare triple {25440#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {25440#(<= main_~k~0 13)} is VALID [2018-11-23 11:59:52,566 INFO L273 TraceCheckUtils]: 45: Hoare triple {25440#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {25450#(<= main_~k~0 14)} is VALID [2018-11-23 11:59:52,566 INFO L273 TraceCheckUtils]: 46: Hoare triple {25450#(<= 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); {25450#(<= main_~k~0 14)} is VALID [2018-11-23 11:59:52,567 INFO L273 TraceCheckUtils]: 47: Hoare triple {25450#(<= main_~k~0 14)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {25450#(<= main_~k~0 14)} is VALID [2018-11-23 11:59:52,568 INFO L273 TraceCheckUtils]: 48: Hoare triple {25450#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {25460#(<= main_~k~0 15)} is VALID [2018-11-23 11:59:52,568 INFO L273 TraceCheckUtils]: 49: Hoare triple {25460#(<= 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); {25460#(<= main_~k~0 15)} is VALID [2018-11-23 11:59:52,569 INFO L273 TraceCheckUtils]: 50: Hoare triple {25460#(<= main_~k~0 15)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {25460#(<= main_~k~0 15)} is VALID [2018-11-23 11:59:52,569 INFO L273 TraceCheckUtils]: 51: Hoare triple {25460#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {25470#(<= main_~k~0 16)} is VALID [2018-11-23 11:59:52,570 INFO L273 TraceCheckUtils]: 52: Hoare triple {25470#(<= 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); {25470#(<= main_~k~0 16)} is VALID [2018-11-23 11:59:52,570 INFO L273 TraceCheckUtils]: 53: Hoare triple {25470#(<= main_~k~0 16)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {25470#(<= main_~k~0 16)} is VALID [2018-11-23 11:59:52,571 INFO L273 TraceCheckUtils]: 54: Hoare triple {25470#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {25480#(<= main_~k~0 17)} is VALID [2018-11-23 11:59:52,572 INFO L273 TraceCheckUtils]: 55: Hoare triple {25480#(<= 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); {25480#(<= main_~k~0 17)} is VALID [2018-11-23 11:59:52,572 INFO L273 TraceCheckUtils]: 56: Hoare triple {25480#(<= main_~k~0 17)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {25480#(<= main_~k~0 17)} is VALID [2018-11-23 11:59:52,573 INFO L273 TraceCheckUtils]: 57: Hoare triple {25480#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {25490#(<= main_~k~0 18)} is VALID [2018-11-23 11:59:52,573 INFO L273 TraceCheckUtils]: 58: Hoare triple {25490#(<= 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); {25490#(<= main_~k~0 18)} is VALID [2018-11-23 11:59:52,574 INFO L273 TraceCheckUtils]: 59: Hoare triple {25490#(<= main_~k~0 18)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {25490#(<= main_~k~0 18)} is VALID [2018-11-23 11:59:52,575 INFO L273 TraceCheckUtils]: 60: Hoare triple {25490#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {25500#(<= main_~k~0 19)} is VALID [2018-11-23 11:59:52,575 INFO L273 TraceCheckUtils]: 61: Hoare triple {25500#(<= 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); {25500#(<= main_~k~0 19)} is VALID [2018-11-23 11:59:52,576 INFO L273 TraceCheckUtils]: 62: Hoare triple {25500#(<= main_~k~0 19)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {25500#(<= main_~k~0 19)} is VALID [2018-11-23 11:59:52,576 INFO L273 TraceCheckUtils]: 63: Hoare triple {25500#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {25510#(<= main_~k~0 20)} is VALID [2018-11-23 11:59:52,577 INFO L273 TraceCheckUtils]: 64: Hoare triple {25510#(<= 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); {25510#(<= main_~k~0 20)} is VALID [2018-11-23 11:59:52,577 INFO L273 TraceCheckUtils]: 65: Hoare triple {25510#(<= main_~k~0 20)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {25510#(<= main_~k~0 20)} is VALID [2018-11-23 11:59:52,578 INFO L273 TraceCheckUtils]: 66: Hoare triple {25510#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {25520#(<= main_~k~0 21)} is VALID [2018-11-23 11:59:52,579 INFO L273 TraceCheckUtils]: 67: Hoare triple {25520#(<= 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); {25520#(<= main_~k~0 21)} is VALID [2018-11-23 11:59:52,579 INFO L273 TraceCheckUtils]: 68: Hoare triple {25520#(<= main_~k~0 21)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {25520#(<= main_~k~0 21)} is VALID [2018-11-23 11:59:52,580 INFO L273 TraceCheckUtils]: 69: Hoare triple {25520#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {25530#(<= main_~k~0 22)} is VALID [2018-11-23 11:59:52,600 INFO L273 TraceCheckUtils]: 70: Hoare triple {25530#(<= 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); {25530#(<= main_~k~0 22)} is VALID [2018-11-23 11:59:52,618 INFO L273 TraceCheckUtils]: 71: Hoare triple {25530#(<= main_~k~0 22)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {25530#(<= main_~k~0 22)} is VALID [2018-11-23 11:59:52,620 INFO L273 TraceCheckUtils]: 72: Hoare triple {25530#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {25540#(<= main_~k~0 23)} is VALID [2018-11-23 11:59:52,620 INFO L273 TraceCheckUtils]: 73: Hoare triple {25540#(<= 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); {25540#(<= main_~k~0 23)} is VALID [2018-11-23 11:59:52,621 INFO L273 TraceCheckUtils]: 74: Hoare triple {25540#(<= main_~k~0 23)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {25540#(<= main_~k~0 23)} is VALID [2018-11-23 11:59:52,621 INFO L273 TraceCheckUtils]: 75: Hoare triple {25540#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {25550#(<= main_~k~0 24)} is VALID [2018-11-23 11:59:52,621 INFO L273 TraceCheckUtils]: 76: Hoare triple {25550#(<= 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); {25550#(<= main_~k~0 24)} is VALID [2018-11-23 11:59:52,622 INFO L273 TraceCheckUtils]: 77: Hoare triple {25550#(<= main_~k~0 24)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {25550#(<= main_~k~0 24)} is VALID [2018-11-23 11:59:52,622 INFO L273 TraceCheckUtils]: 78: Hoare triple {25550#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {25560#(<= main_~k~0 25)} is VALID [2018-11-23 11:59:52,622 INFO L273 TraceCheckUtils]: 79: Hoare triple {25560#(<= 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); {25560#(<= main_~k~0 25)} is VALID [2018-11-23 11:59:52,623 INFO L273 TraceCheckUtils]: 80: Hoare triple {25560#(<= main_~k~0 25)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {25560#(<= main_~k~0 25)} is VALID [2018-11-23 11:59:52,623 INFO L273 TraceCheckUtils]: 81: Hoare triple {25560#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {25570#(<= main_~k~0 26)} is VALID [2018-11-23 11:59:52,624 INFO L273 TraceCheckUtils]: 82: Hoare triple {25570#(<= 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); {25570#(<= main_~k~0 26)} is VALID [2018-11-23 11:59:52,624 INFO L273 TraceCheckUtils]: 83: Hoare triple {25570#(<= main_~k~0 26)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {25570#(<= main_~k~0 26)} is VALID [2018-11-23 11:59:52,625 INFO L273 TraceCheckUtils]: 84: Hoare triple {25570#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {25580#(<= main_~k~0 27)} is VALID [2018-11-23 11:59:52,626 INFO L273 TraceCheckUtils]: 85: Hoare triple {25580#(<= main_~k~0 27)} assume !(~k~0 < 100000); {25269#false} is VALID [2018-11-23 11:59:52,626 INFO L273 TraceCheckUtils]: 86: Hoare triple {25269#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); {25269#false} is VALID [2018-11-23 11:59:52,626 INFO L273 TraceCheckUtils]: 87: Hoare triple {25269#false} ~x~0 := 0; {25269#false} is VALID [2018-11-23 11:59:52,626 INFO L273 TraceCheckUtils]: 88: Hoare triple {25269#false} assume !(~x~0 < ~i~0); {25269#false} is VALID [2018-11-23 11:59:52,627 INFO L273 TraceCheckUtils]: 89: Hoare triple {25269#false} ~x~0 := ~i~0; {25269#false} is VALID [2018-11-23 11:59:52,627 INFO L273 TraceCheckUtils]: 90: Hoare triple {25269#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); {25269#false} is VALID [2018-11-23 11:59:52,627 INFO L256 TraceCheckUtils]: 91: Hoare triple {25269#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {25269#false} is VALID [2018-11-23 11:59:52,627 INFO L273 TraceCheckUtils]: 92: Hoare triple {25269#false} ~cond := #in~cond; {25269#false} is VALID [2018-11-23 11:59:52,627 INFO L273 TraceCheckUtils]: 93: Hoare triple {25269#false} assume !(0 == ~cond); {25269#false} is VALID [2018-11-23 11:59:52,628 INFO L273 TraceCheckUtils]: 94: Hoare triple {25269#false} assume true; {25269#false} is VALID [2018-11-23 11:59:52,628 INFO L268 TraceCheckUtils]: 95: Hoare quadruple {25269#false} {25269#false} #136#return; {25269#false} is VALID [2018-11-23 11:59:52,628 INFO L273 TraceCheckUtils]: 96: Hoare triple {25269#false} havoc #t~mem9;havoc #t~mem10; {25269#false} is VALID [2018-11-23 11:59:52,629 INFO L273 TraceCheckUtils]: 97: Hoare triple {25269#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {25269#false} is VALID [2018-11-23 11:59:52,629 INFO L273 TraceCheckUtils]: 98: Hoare triple {25269#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); {25269#false} is VALID [2018-11-23 11:59:52,630 INFO L256 TraceCheckUtils]: 99: Hoare triple {25269#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {25269#false} is VALID [2018-11-23 11:59:52,630 INFO L273 TraceCheckUtils]: 100: Hoare triple {25269#false} ~cond := #in~cond; {25269#false} is VALID [2018-11-23 11:59:52,630 INFO L273 TraceCheckUtils]: 101: Hoare triple {25269#false} assume 0 == ~cond; {25269#false} is VALID [2018-11-23 11:59:52,630 INFO L273 TraceCheckUtils]: 102: Hoare triple {25269#false} assume !false; {25269#false} is VALID [2018-11-23 11:59:52,639 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:59:52,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:52,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 58 [2018-11-23 11:59:52,667 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 103 [2018-11-23 11:59:52,668 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:52,668 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 58 states. [2018-11-23 11:59:52,862 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:52,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-11-23 11:59:52,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-11-23 11:59:52,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1248, Invalid=2058, Unknown=0, NotChecked=0, Total=3306 [2018-11-23 11:59:52,865 INFO L87 Difference]: Start difference. First operand 210 states and 277 transitions. Second operand 58 states. [2018-11-23 11:59:54,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:54,425 INFO L93 Difference]: Finished difference Result 273 states and 363 transitions. [2018-11-23 11:59:54,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 11:59:54,425 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 103 [2018-11-23 11:59:54,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:54,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 11:59:54,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 215 transitions. [2018-11-23 11:59:54,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 11:59:54,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 215 transitions. [2018-11-23 11:59:54,428 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 215 transitions. [2018-11-23 11:59:54,637 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 215 edges. 215 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:54,643 INFO L225 Difference]: With dead ends: 273 [2018-11-23 11:59:54,643 INFO L226 Difference]: Without dead ends: 226 [2018-11-23 11:59:54,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1135 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1248, Invalid=2058, Unknown=0, NotChecked=0, Total=3306 [2018-11-23 11:59:54,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-11-23 11:59:54,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 216. [2018-11-23 11:59:54,766 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:54,766 INFO L82 GeneralOperation]: Start isEquivalent. First operand 226 states. Second operand 216 states. [2018-11-23 11:59:54,766 INFO L74 IsIncluded]: Start isIncluded. First operand 226 states. Second operand 216 states. [2018-11-23 11:59:54,767 INFO L87 Difference]: Start difference. First operand 226 states. Second operand 216 states. [2018-11-23 11:59:54,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:54,772 INFO L93 Difference]: Finished difference Result 226 states and 300 transitions. [2018-11-23 11:59:54,772 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 300 transitions. [2018-11-23 11:59:54,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:54,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:54,772 INFO L74 IsIncluded]: Start isIncluded. First operand 216 states. Second operand 226 states. [2018-11-23 11:59:54,772 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 226 states. [2018-11-23 11:59:54,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:54,777 INFO L93 Difference]: Finished difference Result 226 states and 300 transitions. [2018-11-23 11:59:54,777 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 300 transitions. [2018-11-23 11:59:54,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:54,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:54,778 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:54,778 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:54,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-11-23 11:59:54,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 285 transitions. [2018-11-23 11:59:54,783 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 285 transitions. Word has length 103 [2018-11-23 11:59:54,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:54,784 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 285 transitions. [2018-11-23 11:59:54,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-11-23 11:59:54,784 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 285 transitions. [2018-11-23 11:59:54,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-23 11:59:54,785 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:54,785 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:59:54,785 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:54,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:54,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1491982191, now seen corresponding path program 23 times [2018-11-23 11:59:54,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:54,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:54,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:54,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:54,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:54,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:55,590 INFO L256 TraceCheckUtils]: 0: Hoare triple {26749#true} call ULTIMATE.init(); {26749#true} is VALID [2018-11-23 11:59:55,591 INFO L273 TraceCheckUtils]: 1: Hoare triple {26749#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26749#true} is VALID [2018-11-23 11:59:55,591 INFO L273 TraceCheckUtils]: 2: Hoare triple {26749#true} assume true; {26749#true} is VALID [2018-11-23 11:59:55,591 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26749#true} {26749#true} #130#return; {26749#true} is VALID [2018-11-23 11:59:55,591 INFO L256 TraceCheckUtils]: 4: Hoare triple {26749#true} call #t~ret15 := main(); {26749#true} is VALID [2018-11-23 11:59:55,592 INFO L273 TraceCheckUtils]: 5: Hoare triple {26749#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {26751#(= main_~i~0 0)} is VALID [2018-11-23 11:59:55,592 INFO L273 TraceCheckUtils]: 6: Hoare triple {26751#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {26752#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,593 INFO L273 TraceCheckUtils]: 7: Hoare triple {26752#(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); {26752#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,593 INFO L273 TraceCheckUtils]: 8: Hoare triple {26752#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {26752#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,594 INFO L273 TraceCheckUtils]: 9: Hoare triple {26752#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {26753#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,594 INFO L273 TraceCheckUtils]: 10: Hoare triple {26753#(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); {26753#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,595 INFO L273 TraceCheckUtils]: 11: Hoare triple {26753#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {26753#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,596 INFO L273 TraceCheckUtils]: 12: Hoare triple {26753#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {26754#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,597 INFO L273 TraceCheckUtils]: 13: Hoare triple {26754#(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); {26754#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,597 INFO L273 TraceCheckUtils]: 14: Hoare triple {26754#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {26754#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,598 INFO L273 TraceCheckUtils]: 15: Hoare triple {26754#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {26755#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,599 INFO L273 TraceCheckUtils]: 16: Hoare triple {26755#(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); {26755#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,600 INFO L273 TraceCheckUtils]: 17: Hoare triple {26755#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {26755#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,601 INFO L273 TraceCheckUtils]: 18: Hoare triple {26755#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {26756#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,602 INFO L273 TraceCheckUtils]: 19: Hoare triple {26756#(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); {26756#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,602 INFO L273 TraceCheckUtils]: 20: Hoare triple {26756#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {26756#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,603 INFO L273 TraceCheckUtils]: 21: Hoare triple {26756#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {26757#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,604 INFO L273 TraceCheckUtils]: 22: Hoare triple {26757#(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); {26757#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,605 INFO L273 TraceCheckUtils]: 23: Hoare triple {26757#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {26757#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,606 INFO L273 TraceCheckUtils]: 24: Hoare triple {26757#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {26758#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,606 INFO L273 TraceCheckUtils]: 25: Hoare triple {26758#(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); {26758#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,607 INFO L273 TraceCheckUtils]: 26: Hoare triple {26758#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {26758#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,608 INFO L273 TraceCheckUtils]: 27: Hoare triple {26758#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {26759#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,609 INFO L273 TraceCheckUtils]: 28: Hoare triple {26759#(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); {26759#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,610 INFO L273 TraceCheckUtils]: 29: Hoare triple {26759#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {26759#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,611 INFO L273 TraceCheckUtils]: 30: Hoare triple {26759#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {26760#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,611 INFO L273 TraceCheckUtils]: 31: Hoare triple {26760#(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); {26760#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,612 INFO L273 TraceCheckUtils]: 32: Hoare triple {26760#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {26760#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,613 INFO L273 TraceCheckUtils]: 33: Hoare triple {26760#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {26761#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,614 INFO L273 TraceCheckUtils]: 34: Hoare triple {26761#(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); {26761#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,614 INFO L273 TraceCheckUtils]: 35: Hoare triple {26761#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {26761#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,615 INFO L273 TraceCheckUtils]: 36: Hoare triple {26761#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {26762#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,616 INFO L273 TraceCheckUtils]: 37: Hoare triple {26762#(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); {26762#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,617 INFO L273 TraceCheckUtils]: 38: Hoare triple {26762#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {26762#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,618 INFO L273 TraceCheckUtils]: 39: Hoare triple {26762#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {26763#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,619 INFO L273 TraceCheckUtils]: 40: Hoare triple {26763#(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); {26763#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,619 INFO L273 TraceCheckUtils]: 41: Hoare triple {26763#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {26763#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,620 INFO L273 TraceCheckUtils]: 42: Hoare triple {26763#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {26764#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,621 INFO L273 TraceCheckUtils]: 43: Hoare triple {26764#(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); {26764#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,622 INFO L273 TraceCheckUtils]: 44: Hoare triple {26764#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {26764#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,623 INFO L273 TraceCheckUtils]: 45: Hoare triple {26764#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {26765#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,623 INFO L273 TraceCheckUtils]: 46: Hoare triple {26765#(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); {26765#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,624 INFO L273 TraceCheckUtils]: 47: Hoare triple {26765#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {26765#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,625 INFO L273 TraceCheckUtils]: 48: Hoare triple {26765#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {26766#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,626 INFO L273 TraceCheckUtils]: 49: Hoare triple {26766#(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); {26766#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,627 INFO L273 TraceCheckUtils]: 50: Hoare triple {26766#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {26766#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,627 INFO L273 TraceCheckUtils]: 51: Hoare triple {26766#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {26767#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,628 INFO L273 TraceCheckUtils]: 52: Hoare triple {26767#(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); {26767#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,629 INFO L273 TraceCheckUtils]: 53: Hoare triple {26767#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {26767#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,630 INFO L273 TraceCheckUtils]: 54: Hoare triple {26767#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {26768#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:59:55,631 INFO L273 TraceCheckUtils]: 55: Hoare triple {26768#(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); {26768#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:59:55,632 INFO L273 TraceCheckUtils]: 56: Hoare triple {26768#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {26768#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 11:59:55,632 INFO L273 TraceCheckUtils]: 57: Hoare triple {26768#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} ~k~0 := 1 + ~k~0; {26769#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,633 INFO L273 TraceCheckUtils]: 58: Hoare triple {26769#(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); {26769#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,634 INFO L273 TraceCheckUtils]: 59: Hoare triple {26769#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {26769#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,635 INFO L273 TraceCheckUtils]: 60: Hoare triple {26769#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {26770#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,636 INFO L273 TraceCheckUtils]: 61: Hoare triple {26770#(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); {26770#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,636 INFO L273 TraceCheckUtils]: 62: Hoare triple {26770#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {26770#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,637 INFO L273 TraceCheckUtils]: 63: Hoare triple {26770#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {26771#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,638 INFO L273 TraceCheckUtils]: 64: Hoare triple {26771#(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); {26771#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,639 INFO L273 TraceCheckUtils]: 65: Hoare triple {26771#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {26771#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,640 INFO L273 TraceCheckUtils]: 66: Hoare triple {26771#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {26772#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,640 INFO L273 TraceCheckUtils]: 67: Hoare triple {26772#(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); {26772#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,641 INFO L273 TraceCheckUtils]: 68: Hoare triple {26772#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {26772#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,642 INFO L273 TraceCheckUtils]: 69: Hoare triple {26772#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {26773#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,643 INFO L273 TraceCheckUtils]: 70: Hoare triple {26773#(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); {26773#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,644 INFO L273 TraceCheckUtils]: 71: Hoare triple {26773#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {26773#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,644 INFO L273 TraceCheckUtils]: 72: Hoare triple {26773#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {26774#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,645 INFO L273 TraceCheckUtils]: 73: Hoare triple {26774#(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); {26774#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,646 INFO L273 TraceCheckUtils]: 74: Hoare triple {26774#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {26774#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,647 INFO L273 TraceCheckUtils]: 75: Hoare triple {26774#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {26775#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,648 INFO L273 TraceCheckUtils]: 76: Hoare triple {26775#(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); {26775#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,648 INFO L273 TraceCheckUtils]: 77: Hoare triple {26775#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {26775#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,649 INFO L273 TraceCheckUtils]: 78: Hoare triple {26775#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {26776#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,650 INFO L273 TraceCheckUtils]: 79: Hoare triple {26776#(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); {26776#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,651 INFO L273 TraceCheckUtils]: 80: Hoare triple {26776#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {26776#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,652 INFO L273 TraceCheckUtils]: 81: Hoare triple {26776#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {26777#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,653 INFO L273 TraceCheckUtils]: 82: Hoare triple {26777#(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); {26777#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,653 INFO L273 TraceCheckUtils]: 83: Hoare triple {26777#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {26777#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,654 INFO L273 TraceCheckUtils]: 84: Hoare triple {26777#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {26778#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,655 INFO L273 TraceCheckUtils]: 85: Hoare triple {26778#(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); {26778#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,656 INFO L273 TraceCheckUtils]: 86: Hoare triple {26778#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {26778#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,657 INFO L273 TraceCheckUtils]: 87: Hoare triple {26778#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {26779#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 11:59:55,657 INFO L273 TraceCheckUtils]: 88: Hoare triple {26779#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} assume !(~k~0 < 100000); {26750#false} is VALID [2018-11-23 11:59:55,658 INFO L273 TraceCheckUtils]: 89: Hoare triple {26750#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); {26750#false} is VALID [2018-11-23 11:59:55,658 INFO L273 TraceCheckUtils]: 90: Hoare triple {26750#false} ~x~0 := 0; {26750#false} is VALID [2018-11-23 11:59:55,658 INFO L273 TraceCheckUtils]: 91: Hoare triple {26750#false} assume !(~x~0 < ~i~0); {26750#false} is VALID [2018-11-23 11:59:55,658 INFO L273 TraceCheckUtils]: 92: Hoare triple {26750#false} ~x~0 := ~i~0; {26750#false} is VALID [2018-11-23 11:59:55,658 INFO L273 TraceCheckUtils]: 93: Hoare triple {26750#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); {26750#false} is VALID [2018-11-23 11:59:55,658 INFO L256 TraceCheckUtils]: 94: Hoare triple {26750#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {26749#true} is VALID [2018-11-23 11:59:55,659 INFO L273 TraceCheckUtils]: 95: Hoare triple {26749#true} ~cond := #in~cond; {26749#true} is VALID [2018-11-23 11:59:55,659 INFO L273 TraceCheckUtils]: 96: Hoare triple {26749#true} assume !(0 == ~cond); {26749#true} is VALID [2018-11-23 11:59:55,659 INFO L273 TraceCheckUtils]: 97: Hoare triple {26749#true} assume true; {26749#true} is VALID [2018-11-23 11:59:55,659 INFO L268 TraceCheckUtils]: 98: Hoare quadruple {26749#true} {26750#false} #136#return; {26750#false} is VALID [2018-11-23 11:59:55,659 INFO L273 TraceCheckUtils]: 99: Hoare triple {26750#false} havoc #t~mem9;havoc #t~mem10; {26750#false} is VALID [2018-11-23 11:59:55,660 INFO L273 TraceCheckUtils]: 100: Hoare triple {26750#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {26750#false} is VALID [2018-11-23 11:59:55,660 INFO L273 TraceCheckUtils]: 101: Hoare triple {26750#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); {26750#false} is VALID [2018-11-23 11:59:55,660 INFO L256 TraceCheckUtils]: 102: Hoare triple {26750#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {26750#false} is VALID [2018-11-23 11:59:55,660 INFO L273 TraceCheckUtils]: 103: Hoare triple {26750#false} ~cond := #in~cond; {26750#false} is VALID [2018-11-23 11:59:55,660 INFO L273 TraceCheckUtils]: 104: Hoare triple {26750#false} assume 0 == ~cond; {26750#false} is VALID [2018-11-23 11:59:55,661 INFO L273 TraceCheckUtils]: 105: Hoare triple {26750#false} assume !false; {26750#false} is VALID [2018-11-23 11:59:55,677 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:59:55,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:55,677 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:59:55,689 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:59:55,779 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 28 check-sat command(s) [2018-11-23 11:59:55,779 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:55,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:55,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:56,685 INFO L256 TraceCheckUtils]: 0: Hoare triple {26749#true} call ULTIMATE.init(); {26749#true} is VALID [2018-11-23 11:59:56,686 INFO L273 TraceCheckUtils]: 1: Hoare triple {26749#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26749#true} is VALID [2018-11-23 11:59:56,686 INFO L273 TraceCheckUtils]: 2: Hoare triple {26749#true} assume true; {26749#true} is VALID [2018-11-23 11:59:56,686 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26749#true} {26749#true} #130#return; {26749#true} is VALID [2018-11-23 11:59:56,686 INFO L256 TraceCheckUtils]: 4: Hoare triple {26749#true} call #t~ret15 := main(); {26749#true} is VALID [2018-11-23 11:59:56,687 INFO L273 TraceCheckUtils]: 5: Hoare triple {26749#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {26798#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:56,688 INFO L273 TraceCheckUtils]: 6: Hoare triple {26798#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {26802#(<= main_~k~0 1)} is VALID [2018-11-23 11:59:56,688 INFO L273 TraceCheckUtils]: 7: Hoare triple {26802#(<= 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); {26802#(<= main_~k~0 1)} is VALID [2018-11-23 11:59:56,688 INFO L273 TraceCheckUtils]: 8: Hoare triple {26802#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {26802#(<= main_~k~0 1)} is VALID [2018-11-23 11:59:56,689 INFO L273 TraceCheckUtils]: 9: Hoare triple {26802#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {26812#(<= main_~k~0 2)} is VALID [2018-11-23 11:59:56,689 INFO L273 TraceCheckUtils]: 10: Hoare triple {26812#(<= 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); {26812#(<= main_~k~0 2)} is VALID [2018-11-23 11:59:56,689 INFO L273 TraceCheckUtils]: 11: Hoare triple {26812#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {26812#(<= main_~k~0 2)} is VALID [2018-11-23 11:59:56,690 INFO L273 TraceCheckUtils]: 12: Hoare triple {26812#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {26822#(<= main_~k~0 3)} is VALID [2018-11-23 11:59:56,691 INFO L273 TraceCheckUtils]: 13: Hoare triple {26822#(<= 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); {26822#(<= main_~k~0 3)} is VALID [2018-11-23 11:59:56,691 INFO L273 TraceCheckUtils]: 14: Hoare triple {26822#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {26822#(<= main_~k~0 3)} is VALID [2018-11-23 11:59:56,692 INFO L273 TraceCheckUtils]: 15: Hoare triple {26822#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {26832#(<= main_~k~0 4)} is VALID [2018-11-23 11:59:56,692 INFO L273 TraceCheckUtils]: 16: Hoare triple {26832#(<= 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); {26832#(<= main_~k~0 4)} is VALID [2018-11-23 11:59:56,693 INFO L273 TraceCheckUtils]: 17: Hoare triple {26832#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {26832#(<= main_~k~0 4)} is VALID [2018-11-23 11:59:56,694 INFO L273 TraceCheckUtils]: 18: Hoare triple {26832#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {26842#(<= main_~k~0 5)} is VALID [2018-11-23 11:59:56,694 INFO L273 TraceCheckUtils]: 19: Hoare triple {26842#(<= 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); {26842#(<= main_~k~0 5)} is VALID [2018-11-23 11:59:56,695 INFO L273 TraceCheckUtils]: 20: Hoare triple {26842#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {26842#(<= main_~k~0 5)} is VALID [2018-11-23 11:59:56,695 INFO L273 TraceCheckUtils]: 21: Hoare triple {26842#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {26852#(<= main_~k~0 6)} is VALID [2018-11-23 11:59:56,696 INFO L273 TraceCheckUtils]: 22: Hoare triple {26852#(<= 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); {26852#(<= main_~k~0 6)} is VALID [2018-11-23 11:59:56,697 INFO L273 TraceCheckUtils]: 23: Hoare triple {26852#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {26852#(<= main_~k~0 6)} is VALID [2018-11-23 11:59:56,697 INFO L273 TraceCheckUtils]: 24: Hoare triple {26852#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {26862#(<= main_~k~0 7)} is VALID [2018-11-23 11:59:56,698 INFO L273 TraceCheckUtils]: 25: Hoare triple {26862#(<= 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); {26862#(<= main_~k~0 7)} is VALID [2018-11-23 11:59:56,698 INFO L273 TraceCheckUtils]: 26: Hoare triple {26862#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {26862#(<= main_~k~0 7)} is VALID [2018-11-23 11:59:56,699 INFO L273 TraceCheckUtils]: 27: Hoare triple {26862#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {26872#(<= main_~k~0 8)} is VALID [2018-11-23 11:59:56,700 INFO L273 TraceCheckUtils]: 28: Hoare triple {26872#(<= 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); {26872#(<= main_~k~0 8)} is VALID [2018-11-23 11:59:56,700 INFO L273 TraceCheckUtils]: 29: Hoare triple {26872#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {26872#(<= main_~k~0 8)} is VALID [2018-11-23 11:59:56,701 INFO L273 TraceCheckUtils]: 30: Hoare triple {26872#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {26882#(<= main_~k~0 9)} is VALID [2018-11-23 11:59:56,701 INFO L273 TraceCheckUtils]: 31: Hoare triple {26882#(<= 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); {26882#(<= main_~k~0 9)} is VALID [2018-11-23 11:59:56,702 INFO L273 TraceCheckUtils]: 32: Hoare triple {26882#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {26882#(<= main_~k~0 9)} is VALID [2018-11-23 11:59:56,703 INFO L273 TraceCheckUtils]: 33: Hoare triple {26882#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {26892#(<= main_~k~0 10)} is VALID [2018-11-23 11:59:56,703 INFO L273 TraceCheckUtils]: 34: Hoare triple {26892#(<= 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); {26892#(<= main_~k~0 10)} is VALID [2018-11-23 11:59:56,704 INFO L273 TraceCheckUtils]: 35: Hoare triple {26892#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {26892#(<= main_~k~0 10)} is VALID [2018-11-23 11:59:56,704 INFO L273 TraceCheckUtils]: 36: Hoare triple {26892#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {26902#(<= main_~k~0 11)} is VALID [2018-11-23 11:59:56,705 INFO L273 TraceCheckUtils]: 37: Hoare triple {26902#(<= 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); {26902#(<= main_~k~0 11)} is VALID [2018-11-23 11:59:56,705 INFO L273 TraceCheckUtils]: 38: Hoare triple {26902#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {26902#(<= main_~k~0 11)} is VALID [2018-11-23 11:59:56,706 INFO L273 TraceCheckUtils]: 39: Hoare triple {26902#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {26912#(<= main_~k~0 12)} is VALID [2018-11-23 11:59:56,707 INFO L273 TraceCheckUtils]: 40: Hoare triple {26912#(<= 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); {26912#(<= main_~k~0 12)} is VALID [2018-11-23 11:59:56,707 INFO L273 TraceCheckUtils]: 41: Hoare triple {26912#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {26912#(<= main_~k~0 12)} is VALID [2018-11-23 11:59:56,708 INFO L273 TraceCheckUtils]: 42: Hoare triple {26912#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {26922#(<= main_~k~0 13)} is VALID [2018-11-23 11:59:56,708 INFO L273 TraceCheckUtils]: 43: Hoare triple {26922#(<= 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); {26922#(<= main_~k~0 13)} is VALID [2018-11-23 11:59:56,709 INFO L273 TraceCheckUtils]: 44: Hoare triple {26922#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {26922#(<= main_~k~0 13)} is VALID [2018-11-23 11:59:56,710 INFO L273 TraceCheckUtils]: 45: Hoare triple {26922#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {26932#(<= main_~k~0 14)} is VALID [2018-11-23 11:59:56,710 INFO L273 TraceCheckUtils]: 46: Hoare triple {26932#(<= 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); {26932#(<= main_~k~0 14)} is VALID [2018-11-23 11:59:56,711 INFO L273 TraceCheckUtils]: 47: Hoare triple {26932#(<= main_~k~0 14)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {26932#(<= main_~k~0 14)} is VALID [2018-11-23 11:59:56,711 INFO L273 TraceCheckUtils]: 48: Hoare triple {26932#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {26942#(<= main_~k~0 15)} is VALID [2018-11-23 11:59:56,712 INFO L273 TraceCheckUtils]: 49: Hoare triple {26942#(<= 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); {26942#(<= main_~k~0 15)} is VALID [2018-11-23 11:59:56,712 INFO L273 TraceCheckUtils]: 50: Hoare triple {26942#(<= main_~k~0 15)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {26942#(<= main_~k~0 15)} is VALID [2018-11-23 11:59:56,713 INFO L273 TraceCheckUtils]: 51: Hoare triple {26942#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {26952#(<= main_~k~0 16)} is VALID [2018-11-23 11:59:56,714 INFO L273 TraceCheckUtils]: 52: Hoare triple {26952#(<= 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); {26952#(<= main_~k~0 16)} is VALID [2018-11-23 11:59:56,714 INFO L273 TraceCheckUtils]: 53: Hoare triple {26952#(<= main_~k~0 16)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {26952#(<= main_~k~0 16)} is VALID [2018-11-23 11:59:56,715 INFO L273 TraceCheckUtils]: 54: Hoare triple {26952#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {26962#(<= main_~k~0 17)} is VALID [2018-11-23 11:59:56,715 INFO L273 TraceCheckUtils]: 55: Hoare triple {26962#(<= 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); {26962#(<= main_~k~0 17)} is VALID [2018-11-23 11:59:56,716 INFO L273 TraceCheckUtils]: 56: Hoare triple {26962#(<= main_~k~0 17)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {26962#(<= main_~k~0 17)} is VALID [2018-11-23 11:59:56,717 INFO L273 TraceCheckUtils]: 57: Hoare triple {26962#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {26972#(<= main_~k~0 18)} is VALID [2018-11-23 11:59:56,717 INFO L273 TraceCheckUtils]: 58: Hoare triple {26972#(<= 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); {26972#(<= main_~k~0 18)} is VALID [2018-11-23 11:59:56,718 INFO L273 TraceCheckUtils]: 59: Hoare triple {26972#(<= main_~k~0 18)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {26972#(<= main_~k~0 18)} is VALID [2018-11-23 11:59:56,718 INFO L273 TraceCheckUtils]: 60: Hoare triple {26972#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {26982#(<= main_~k~0 19)} is VALID [2018-11-23 11:59:56,719 INFO L273 TraceCheckUtils]: 61: Hoare triple {26982#(<= 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); {26982#(<= main_~k~0 19)} is VALID [2018-11-23 11:59:56,719 INFO L273 TraceCheckUtils]: 62: Hoare triple {26982#(<= main_~k~0 19)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {26982#(<= main_~k~0 19)} is VALID [2018-11-23 11:59:56,720 INFO L273 TraceCheckUtils]: 63: Hoare triple {26982#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {26992#(<= main_~k~0 20)} is VALID [2018-11-23 11:59:56,721 INFO L273 TraceCheckUtils]: 64: Hoare triple {26992#(<= 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); {26992#(<= main_~k~0 20)} is VALID [2018-11-23 11:59:56,721 INFO L273 TraceCheckUtils]: 65: Hoare triple {26992#(<= main_~k~0 20)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {26992#(<= main_~k~0 20)} is VALID [2018-11-23 11:59:56,722 INFO L273 TraceCheckUtils]: 66: Hoare triple {26992#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {27002#(<= main_~k~0 21)} is VALID [2018-11-23 11:59:56,722 INFO L273 TraceCheckUtils]: 67: Hoare triple {27002#(<= 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); {27002#(<= main_~k~0 21)} is VALID [2018-11-23 11:59:56,723 INFO L273 TraceCheckUtils]: 68: Hoare triple {27002#(<= main_~k~0 21)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {27002#(<= main_~k~0 21)} is VALID [2018-11-23 11:59:56,724 INFO L273 TraceCheckUtils]: 69: Hoare triple {27002#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {27012#(<= main_~k~0 22)} is VALID [2018-11-23 11:59:56,724 INFO L273 TraceCheckUtils]: 70: Hoare triple {27012#(<= 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); {27012#(<= main_~k~0 22)} is VALID [2018-11-23 11:59:56,725 INFO L273 TraceCheckUtils]: 71: Hoare triple {27012#(<= main_~k~0 22)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {27012#(<= main_~k~0 22)} is VALID [2018-11-23 11:59:56,725 INFO L273 TraceCheckUtils]: 72: Hoare triple {27012#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {27022#(<= main_~k~0 23)} is VALID [2018-11-23 11:59:56,726 INFO L273 TraceCheckUtils]: 73: Hoare triple {27022#(<= 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); {27022#(<= main_~k~0 23)} is VALID [2018-11-23 11:59:56,727 INFO L273 TraceCheckUtils]: 74: Hoare triple {27022#(<= main_~k~0 23)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {27022#(<= main_~k~0 23)} is VALID [2018-11-23 11:59:56,727 INFO L273 TraceCheckUtils]: 75: Hoare triple {27022#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {27032#(<= main_~k~0 24)} is VALID [2018-11-23 11:59:56,728 INFO L273 TraceCheckUtils]: 76: Hoare triple {27032#(<= 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); {27032#(<= main_~k~0 24)} is VALID [2018-11-23 11:59:56,728 INFO L273 TraceCheckUtils]: 77: Hoare triple {27032#(<= main_~k~0 24)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {27032#(<= main_~k~0 24)} is VALID [2018-11-23 11:59:56,729 INFO L273 TraceCheckUtils]: 78: Hoare triple {27032#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {27042#(<= main_~k~0 25)} is VALID [2018-11-23 11:59:56,730 INFO L273 TraceCheckUtils]: 79: Hoare triple {27042#(<= 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); {27042#(<= main_~k~0 25)} is VALID [2018-11-23 11:59:56,730 INFO L273 TraceCheckUtils]: 80: Hoare triple {27042#(<= main_~k~0 25)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {27042#(<= main_~k~0 25)} is VALID [2018-11-23 11:59:56,731 INFO L273 TraceCheckUtils]: 81: Hoare triple {27042#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {27052#(<= main_~k~0 26)} is VALID [2018-11-23 11:59:56,731 INFO L273 TraceCheckUtils]: 82: Hoare triple {27052#(<= 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); {27052#(<= main_~k~0 26)} is VALID [2018-11-23 11:59:56,732 INFO L273 TraceCheckUtils]: 83: Hoare triple {27052#(<= main_~k~0 26)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {27052#(<= main_~k~0 26)} is VALID [2018-11-23 11:59:56,733 INFO L273 TraceCheckUtils]: 84: Hoare triple {27052#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {27062#(<= main_~k~0 27)} is VALID [2018-11-23 11:59:56,733 INFO L273 TraceCheckUtils]: 85: Hoare triple {27062#(<= 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); {27062#(<= main_~k~0 27)} is VALID [2018-11-23 11:59:56,734 INFO L273 TraceCheckUtils]: 86: Hoare triple {27062#(<= main_~k~0 27)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {27062#(<= main_~k~0 27)} is VALID [2018-11-23 11:59:56,734 INFO L273 TraceCheckUtils]: 87: Hoare triple {27062#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {27072#(<= main_~k~0 28)} is VALID [2018-11-23 11:59:56,735 INFO L273 TraceCheckUtils]: 88: Hoare triple {27072#(<= main_~k~0 28)} assume !(~k~0 < 100000); {26750#false} is VALID [2018-11-23 11:59:56,735 INFO L273 TraceCheckUtils]: 89: Hoare triple {26750#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); {26750#false} is VALID [2018-11-23 11:59:56,735 INFO L273 TraceCheckUtils]: 90: Hoare triple {26750#false} ~x~0 := 0; {26750#false} is VALID [2018-11-23 11:59:56,736 INFO L273 TraceCheckUtils]: 91: Hoare triple {26750#false} assume !(~x~0 < ~i~0); {26750#false} is VALID [2018-11-23 11:59:56,736 INFO L273 TraceCheckUtils]: 92: Hoare triple {26750#false} ~x~0 := ~i~0; {26750#false} is VALID [2018-11-23 11:59:56,736 INFO L273 TraceCheckUtils]: 93: Hoare triple {26750#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); {26750#false} is VALID [2018-11-23 11:59:56,736 INFO L256 TraceCheckUtils]: 94: Hoare triple {26750#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {26750#false} is VALID [2018-11-23 11:59:56,736 INFO L273 TraceCheckUtils]: 95: Hoare triple {26750#false} ~cond := #in~cond; {26750#false} is VALID [2018-11-23 11:59:56,736 INFO L273 TraceCheckUtils]: 96: Hoare triple {26750#false} assume !(0 == ~cond); {26750#false} is VALID [2018-11-23 11:59:56,737 INFO L273 TraceCheckUtils]: 97: Hoare triple {26750#false} assume true; {26750#false} is VALID [2018-11-23 11:59:56,737 INFO L268 TraceCheckUtils]: 98: Hoare quadruple {26750#false} {26750#false} #136#return; {26750#false} is VALID [2018-11-23 11:59:56,737 INFO L273 TraceCheckUtils]: 99: Hoare triple {26750#false} havoc #t~mem9;havoc #t~mem10; {26750#false} is VALID [2018-11-23 11:59:56,737 INFO L273 TraceCheckUtils]: 100: Hoare triple {26750#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {26750#false} is VALID [2018-11-23 11:59:56,737 INFO L273 TraceCheckUtils]: 101: Hoare triple {26750#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); {26750#false} is VALID [2018-11-23 11:59:56,738 INFO L256 TraceCheckUtils]: 102: Hoare triple {26750#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {26750#false} is VALID [2018-11-23 11:59:56,738 INFO L273 TraceCheckUtils]: 103: Hoare triple {26750#false} ~cond := #in~cond; {26750#false} is VALID [2018-11-23 11:59:56,738 INFO L273 TraceCheckUtils]: 104: Hoare triple {26750#false} assume 0 == ~cond; {26750#false} is VALID [2018-11-23 11:59:56,738 INFO L273 TraceCheckUtils]: 105: Hoare triple {26750#false} assume !false; {26750#false} is VALID [2018-11-23 11:59:56,745 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:59:56,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:56,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 60 [2018-11-23 11:59:56,765 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 106 [2018-11-23 11:59:56,766 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:56,766 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 60 states. [2018-11-23 11:59:56,962 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:59:56,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-11-23 11:59:56,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-11-23 11:59:56,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1336, Invalid=2204, Unknown=0, NotChecked=0, Total=3540 [2018-11-23 11:59:56,965 INFO L87 Difference]: Start difference. First operand 216 states and 285 transitions. Second operand 60 states. [2018-11-23 11:59:58,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:58,833 INFO L93 Difference]: Finished difference Result 279 states and 371 transitions. [2018-11-23 11:59:58,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 11:59:58,833 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 106 [2018-11-23 11:59:58,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:58,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 11:59:58,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 219 transitions. [2018-11-23 11:59:58,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 11:59:58,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 219 transitions. [2018-11-23 11:59:58,836 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 219 transitions. [2018-11-23 11:59:59,035 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:59:59,041 INFO L225 Difference]: With dead ends: 279 [2018-11-23 11:59:59,041 INFO L226 Difference]: Without dead ends: 232 [2018-11-23 11:59:59,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1219 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1336, Invalid=2204, Unknown=0, NotChecked=0, Total=3540 [2018-11-23 11:59:59,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-11-23 11:59:59,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 222. [2018-11-23 11:59:59,376 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:59,376 INFO L82 GeneralOperation]: Start isEquivalent. First operand 232 states. Second operand 222 states. [2018-11-23 11:59:59,376 INFO L74 IsIncluded]: Start isIncluded. First operand 232 states. Second operand 222 states. [2018-11-23 11:59:59,376 INFO L87 Difference]: Start difference. First operand 232 states. Second operand 222 states. [2018-11-23 11:59:59,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:59,381 INFO L93 Difference]: Finished difference Result 232 states and 308 transitions. [2018-11-23 11:59:59,381 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 308 transitions. [2018-11-23 11:59:59,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:59,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:59,382 INFO L74 IsIncluded]: Start isIncluded. First operand 222 states. Second operand 232 states. [2018-11-23 11:59:59,382 INFO L87 Difference]: Start difference. First operand 222 states. Second operand 232 states. [2018-11-23 11:59:59,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:59,385 INFO L93 Difference]: Finished difference Result 232 states and 308 transitions. [2018-11-23 11:59:59,386 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 308 transitions. [2018-11-23 11:59:59,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:59,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:59,386 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:59,386 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:59,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-11-23 11:59:59,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 293 transitions. [2018-11-23 11:59:59,390 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 293 transitions. Word has length 106 [2018-11-23 11:59:59,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:59,390 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 293 transitions. [2018-11-23 11:59:59,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-11-23 11:59:59,390 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 293 transitions. [2018-11-23 11:59:59,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-23 11:59:59,391 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:59,391 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:59:59,391 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:59,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:59,391 INFO L82 PathProgramCache]: Analyzing trace with hash -188670388, now seen corresponding path program 24 times [2018-11-23 11:59:59,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:59,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:59,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:59,392 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:59,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:59,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:00,515 INFO L256 TraceCheckUtils]: 0: Hoare triple {28269#true} call ULTIMATE.init(); {28269#true} is VALID [2018-11-23 12:00:00,515 INFO L273 TraceCheckUtils]: 1: Hoare triple {28269#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28269#true} is VALID [2018-11-23 12:00:00,515 INFO L273 TraceCheckUtils]: 2: Hoare triple {28269#true} assume true; {28269#true} is VALID [2018-11-23 12:00:00,515 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28269#true} {28269#true} #130#return; {28269#true} is VALID [2018-11-23 12:00:00,515 INFO L256 TraceCheckUtils]: 4: Hoare triple {28269#true} call #t~ret15 := main(); {28269#true} is VALID [2018-11-23 12:00:00,516 INFO L273 TraceCheckUtils]: 5: Hoare triple {28269#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {28271#(= main_~i~0 0)} is VALID [2018-11-23 12:00:00,516 INFO L273 TraceCheckUtils]: 6: Hoare triple {28271#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {28272#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,517 INFO L273 TraceCheckUtils]: 7: Hoare triple {28272#(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); {28272#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,517 INFO L273 TraceCheckUtils]: 8: Hoare triple {28272#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {28272#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,518 INFO L273 TraceCheckUtils]: 9: Hoare triple {28272#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {28273#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,519 INFO L273 TraceCheckUtils]: 10: Hoare triple {28273#(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); {28273#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,520 INFO L273 TraceCheckUtils]: 11: Hoare triple {28273#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {28273#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,521 INFO L273 TraceCheckUtils]: 12: Hoare triple {28273#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {28274#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,522 INFO L273 TraceCheckUtils]: 13: Hoare triple {28274#(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); {28274#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,522 INFO L273 TraceCheckUtils]: 14: Hoare triple {28274#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {28274#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,523 INFO L273 TraceCheckUtils]: 15: Hoare triple {28274#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {28275#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,524 INFO L273 TraceCheckUtils]: 16: Hoare triple {28275#(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); {28275#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,525 INFO L273 TraceCheckUtils]: 17: Hoare triple {28275#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {28275#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,526 INFO L273 TraceCheckUtils]: 18: Hoare triple {28275#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {28276#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,527 INFO L273 TraceCheckUtils]: 19: Hoare triple {28276#(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); {28276#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,527 INFO L273 TraceCheckUtils]: 20: Hoare triple {28276#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {28276#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,528 INFO L273 TraceCheckUtils]: 21: Hoare triple {28276#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {28277#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,529 INFO L273 TraceCheckUtils]: 22: Hoare triple {28277#(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); {28277#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,530 INFO L273 TraceCheckUtils]: 23: Hoare triple {28277#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {28277#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,531 INFO L273 TraceCheckUtils]: 24: Hoare triple {28277#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {28278#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,531 INFO L273 TraceCheckUtils]: 25: Hoare triple {28278#(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); {28278#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,532 INFO L273 TraceCheckUtils]: 26: Hoare triple {28278#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {28278#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,533 INFO L273 TraceCheckUtils]: 27: Hoare triple {28278#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {28279#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,534 INFO L273 TraceCheckUtils]: 28: Hoare triple {28279#(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); {28279#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,535 INFO L273 TraceCheckUtils]: 29: Hoare triple {28279#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {28279#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,535 INFO L273 TraceCheckUtils]: 30: Hoare triple {28279#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {28280#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,536 INFO L273 TraceCheckUtils]: 31: Hoare triple {28280#(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); {28280#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,537 INFO L273 TraceCheckUtils]: 32: Hoare triple {28280#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {28280#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,538 INFO L273 TraceCheckUtils]: 33: Hoare triple {28280#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {28281#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,539 INFO L273 TraceCheckUtils]: 34: Hoare triple {28281#(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); {28281#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,539 INFO L273 TraceCheckUtils]: 35: Hoare triple {28281#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {28281#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,540 INFO L273 TraceCheckUtils]: 36: Hoare triple {28281#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {28282#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,541 INFO L273 TraceCheckUtils]: 37: Hoare triple {28282#(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); {28282#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,542 INFO L273 TraceCheckUtils]: 38: Hoare triple {28282#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {28282#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,543 INFO L273 TraceCheckUtils]: 39: Hoare triple {28282#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {28283#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,544 INFO L273 TraceCheckUtils]: 40: Hoare triple {28283#(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); {28283#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,545 INFO L273 TraceCheckUtils]: 41: Hoare triple {28283#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {28283#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,545 INFO L273 TraceCheckUtils]: 42: Hoare triple {28283#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {28284#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,546 INFO L273 TraceCheckUtils]: 43: Hoare triple {28284#(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); {28284#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,547 INFO L273 TraceCheckUtils]: 44: Hoare triple {28284#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {28284#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,548 INFO L273 TraceCheckUtils]: 45: Hoare triple {28284#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {28285#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,549 INFO L273 TraceCheckUtils]: 46: Hoare triple {28285#(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); {28285#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,549 INFO L273 TraceCheckUtils]: 47: Hoare triple {28285#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {28285#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,550 INFO L273 TraceCheckUtils]: 48: Hoare triple {28285#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {28286#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,551 INFO L273 TraceCheckUtils]: 49: Hoare triple {28286#(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); {28286#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,552 INFO L273 TraceCheckUtils]: 50: Hoare triple {28286#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {28286#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,553 INFO L273 TraceCheckUtils]: 51: Hoare triple {28286#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {28287#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,554 INFO L273 TraceCheckUtils]: 52: Hoare triple {28287#(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); {28287#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,554 INFO L273 TraceCheckUtils]: 53: Hoare triple {28287#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {28287#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,555 INFO L273 TraceCheckUtils]: 54: Hoare triple {28287#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {28288#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 12:00:00,556 INFO L273 TraceCheckUtils]: 55: Hoare triple {28288#(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); {28288#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 12:00:00,557 INFO L273 TraceCheckUtils]: 56: Hoare triple {28288#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {28288#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 12:00:00,558 INFO L273 TraceCheckUtils]: 57: Hoare triple {28288#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} ~k~0 := 1 + ~k~0; {28289#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,558 INFO L273 TraceCheckUtils]: 58: Hoare triple {28289#(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); {28289#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,559 INFO L273 TraceCheckUtils]: 59: Hoare triple {28289#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {28289#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,560 INFO L273 TraceCheckUtils]: 60: Hoare triple {28289#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {28290#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,561 INFO L273 TraceCheckUtils]: 61: Hoare triple {28290#(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); {28290#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,561 INFO L273 TraceCheckUtils]: 62: Hoare triple {28290#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {28290#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,570 INFO L273 TraceCheckUtils]: 63: Hoare triple {28290#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {28291#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,571 INFO L273 TraceCheckUtils]: 64: Hoare triple {28291#(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); {28291#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,572 INFO L273 TraceCheckUtils]: 65: Hoare triple {28291#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {28291#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,572 INFO L273 TraceCheckUtils]: 66: Hoare triple {28291#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {28292#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,573 INFO L273 TraceCheckUtils]: 67: Hoare triple {28292#(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); {28292#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,573 INFO L273 TraceCheckUtils]: 68: Hoare triple {28292#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {28292#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,574 INFO L273 TraceCheckUtils]: 69: Hoare triple {28292#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {28293#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,574 INFO L273 TraceCheckUtils]: 70: Hoare triple {28293#(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); {28293#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,575 INFO L273 TraceCheckUtils]: 71: Hoare triple {28293#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {28293#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,576 INFO L273 TraceCheckUtils]: 72: Hoare triple {28293#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {28294#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,577 INFO L273 TraceCheckUtils]: 73: Hoare triple {28294#(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); {28294#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,577 INFO L273 TraceCheckUtils]: 74: Hoare triple {28294#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {28294#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,578 INFO L273 TraceCheckUtils]: 75: Hoare triple {28294#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {28295#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,579 INFO L273 TraceCheckUtils]: 76: Hoare triple {28295#(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); {28295#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,580 INFO L273 TraceCheckUtils]: 77: Hoare triple {28295#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {28295#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,581 INFO L273 TraceCheckUtils]: 78: Hoare triple {28295#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {28296#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,582 INFO L273 TraceCheckUtils]: 79: Hoare triple {28296#(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); {28296#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,582 INFO L273 TraceCheckUtils]: 80: Hoare triple {28296#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {28296#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,583 INFO L273 TraceCheckUtils]: 81: Hoare triple {28296#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {28297#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,584 INFO L273 TraceCheckUtils]: 82: Hoare triple {28297#(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); {28297#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,585 INFO L273 TraceCheckUtils]: 83: Hoare triple {28297#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {28297#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,586 INFO L273 TraceCheckUtils]: 84: Hoare triple {28297#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {28298#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,586 INFO L273 TraceCheckUtils]: 85: Hoare triple {28298#(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); {28298#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,587 INFO L273 TraceCheckUtils]: 86: Hoare triple {28298#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {28298#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,588 INFO L273 TraceCheckUtils]: 87: Hoare triple {28298#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {28299#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,589 INFO L273 TraceCheckUtils]: 88: Hoare triple {28299#(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); {28299#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,590 INFO L273 TraceCheckUtils]: 89: Hoare triple {28299#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {28299#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,591 INFO L273 TraceCheckUtils]: 90: Hoare triple {28299#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {28300#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:00,591 INFO L273 TraceCheckUtils]: 91: Hoare triple {28300#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} assume !(~k~0 < 100000); {28270#false} is VALID [2018-11-23 12:00:00,592 INFO L273 TraceCheckUtils]: 92: Hoare triple {28270#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); {28270#false} is VALID [2018-11-23 12:00:00,592 INFO L273 TraceCheckUtils]: 93: Hoare triple {28270#false} ~x~0 := 0; {28270#false} is VALID [2018-11-23 12:00:00,592 INFO L273 TraceCheckUtils]: 94: Hoare triple {28270#false} assume !(~x~0 < ~i~0); {28270#false} is VALID [2018-11-23 12:00:00,592 INFO L273 TraceCheckUtils]: 95: Hoare triple {28270#false} ~x~0 := ~i~0; {28270#false} is VALID [2018-11-23 12:00:00,593 INFO L273 TraceCheckUtils]: 96: Hoare triple {28270#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); {28270#false} is VALID [2018-11-23 12:00:00,593 INFO L256 TraceCheckUtils]: 97: Hoare triple {28270#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {28269#true} is VALID [2018-11-23 12:00:00,593 INFO L273 TraceCheckUtils]: 98: Hoare triple {28269#true} ~cond := #in~cond; {28269#true} is VALID [2018-11-23 12:00:00,593 INFO L273 TraceCheckUtils]: 99: Hoare triple {28269#true} assume !(0 == ~cond); {28269#true} is VALID [2018-11-23 12:00:00,594 INFO L273 TraceCheckUtils]: 100: Hoare triple {28269#true} assume true; {28269#true} is VALID [2018-11-23 12:00:00,594 INFO L268 TraceCheckUtils]: 101: Hoare quadruple {28269#true} {28270#false} #136#return; {28270#false} is VALID [2018-11-23 12:00:00,594 INFO L273 TraceCheckUtils]: 102: Hoare triple {28270#false} havoc #t~mem9;havoc #t~mem10; {28270#false} is VALID [2018-11-23 12:00:00,594 INFO L273 TraceCheckUtils]: 103: Hoare triple {28270#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {28270#false} is VALID [2018-11-23 12:00:00,594 INFO L273 TraceCheckUtils]: 104: Hoare triple {28270#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); {28270#false} is VALID [2018-11-23 12:00:00,595 INFO L256 TraceCheckUtils]: 105: Hoare triple {28270#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {28270#false} is VALID [2018-11-23 12:00:00,595 INFO L273 TraceCheckUtils]: 106: Hoare triple {28270#false} ~cond := #in~cond; {28270#false} is VALID [2018-11-23 12:00:00,595 INFO L273 TraceCheckUtils]: 107: Hoare triple {28270#false} assume 0 == ~cond; {28270#false} is VALID [2018-11-23 12:00:00,595 INFO L273 TraceCheckUtils]: 108: Hoare triple {28270#false} assume !false; {28270#false} is VALID [2018-11-23 12:00:00,612 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 12:00:00,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:00,612 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:00:00,620 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:00:00,802 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 29 check-sat command(s) [2018-11-23 12:00:00,802 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:00:00,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:00,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:01,744 INFO L256 TraceCheckUtils]: 0: Hoare triple {28269#true} call ULTIMATE.init(); {28269#true} is VALID [2018-11-23 12:00:01,744 INFO L273 TraceCheckUtils]: 1: Hoare triple {28269#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28269#true} is VALID [2018-11-23 12:00:01,744 INFO L273 TraceCheckUtils]: 2: Hoare triple {28269#true} assume true; {28269#true} is VALID [2018-11-23 12:00:01,745 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28269#true} {28269#true} #130#return; {28269#true} is VALID [2018-11-23 12:00:01,745 INFO L256 TraceCheckUtils]: 4: Hoare triple {28269#true} call #t~ret15 := main(); {28269#true} is VALID [2018-11-23 12:00:01,751 INFO L273 TraceCheckUtils]: 5: Hoare triple {28269#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {28319#(<= main_~i~0 0)} is VALID [2018-11-23 12:00:01,751 INFO L273 TraceCheckUtils]: 6: Hoare triple {28319#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {28323#(<= main_~k~0 1)} is VALID [2018-11-23 12:00:01,752 INFO L273 TraceCheckUtils]: 7: Hoare triple {28323#(<= 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); {28323#(<= main_~k~0 1)} is VALID [2018-11-23 12:00:01,752 INFO L273 TraceCheckUtils]: 8: Hoare triple {28323#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {28323#(<= main_~k~0 1)} is VALID [2018-11-23 12:00:01,752 INFO L273 TraceCheckUtils]: 9: Hoare triple {28323#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {28333#(<= main_~k~0 2)} is VALID [2018-11-23 12:00:01,753 INFO L273 TraceCheckUtils]: 10: Hoare triple {28333#(<= 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); {28333#(<= main_~k~0 2)} is VALID [2018-11-23 12:00:01,753 INFO L273 TraceCheckUtils]: 11: Hoare triple {28333#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {28333#(<= main_~k~0 2)} is VALID [2018-11-23 12:00:01,753 INFO L273 TraceCheckUtils]: 12: Hoare triple {28333#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {28343#(<= main_~k~0 3)} is VALID [2018-11-23 12:00:01,754 INFO L273 TraceCheckUtils]: 13: Hoare triple {28343#(<= 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); {28343#(<= main_~k~0 3)} is VALID [2018-11-23 12:00:01,754 INFO L273 TraceCheckUtils]: 14: Hoare triple {28343#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {28343#(<= main_~k~0 3)} is VALID [2018-11-23 12:00:01,754 INFO L273 TraceCheckUtils]: 15: Hoare triple {28343#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {28353#(<= main_~k~0 4)} is VALID [2018-11-23 12:00:01,755 INFO L273 TraceCheckUtils]: 16: Hoare triple {28353#(<= 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); {28353#(<= main_~k~0 4)} is VALID [2018-11-23 12:00:01,755 INFO L273 TraceCheckUtils]: 17: Hoare triple {28353#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {28353#(<= main_~k~0 4)} is VALID [2018-11-23 12:00:01,756 INFO L273 TraceCheckUtils]: 18: Hoare triple {28353#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {28363#(<= main_~k~0 5)} is VALID [2018-11-23 12:00:01,756 INFO L273 TraceCheckUtils]: 19: Hoare triple {28363#(<= 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); {28363#(<= main_~k~0 5)} is VALID [2018-11-23 12:00:01,757 INFO L273 TraceCheckUtils]: 20: Hoare triple {28363#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {28363#(<= main_~k~0 5)} is VALID [2018-11-23 12:00:01,757 INFO L273 TraceCheckUtils]: 21: Hoare triple {28363#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {28373#(<= main_~k~0 6)} is VALID [2018-11-23 12:00:01,758 INFO L273 TraceCheckUtils]: 22: Hoare triple {28373#(<= 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); {28373#(<= main_~k~0 6)} is VALID [2018-11-23 12:00:01,758 INFO L273 TraceCheckUtils]: 23: Hoare triple {28373#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {28373#(<= main_~k~0 6)} is VALID [2018-11-23 12:00:01,759 INFO L273 TraceCheckUtils]: 24: Hoare triple {28373#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {28383#(<= main_~k~0 7)} is VALID [2018-11-23 12:00:01,760 INFO L273 TraceCheckUtils]: 25: Hoare triple {28383#(<= 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); {28383#(<= main_~k~0 7)} is VALID [2018-11-23 12:00:01,760 INFO L273 TraceCheckUtils]: 26: Hoare triple {28383#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {28383#(<= main_~k~0 7)} is VALID [2018-11-23 12:00:01,761 INFO L273 TraceCheckUtils]: 27: Hoare triple {28383#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {28393#(<= main_~k~0 8)} is VALID [2018-11-23 12:00:01,761 INFO L273 TraceCheckUtils]: 28: Hoare triple {28393#(<= 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); {28393#(<= main_~k~0 8)} is VALID [2018-11-23 12:00:01,762 INFO L273 TraceCheckUtils]: 29: Hoare triple {28393#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {28393#(<= main_~k~0 8)} is VALID [2018-11-23 12:00:01,762 INFO L273 TraceCheckUtils]: 30: Hoare triple {28393#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {28403#(<= main_~k~0 9)} is VALID [2018-11-23 12:00:01,763 INFO L273 TraceCheckUtils]: 31: Hoare triple {28403#(<= 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); {28403#(<= main_~k~0 9)} is VALID [2018-11-23 12:00:01,763 INFO L273 TraceCheckUtils]: 32: Hoare triple {28403#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {28403#(<= main_~k~0 9)} is VALID [2018-11-23 12:00:01,764 INFO L273 TraceCheckUtils]: 33: Hoare triple {28403#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {28413#(<= main_~k~0 10)} is VALID [2018-11-23 12:00:01,764 INFO L273 TraceCheckUtils]: 34: Hoare triple {28413#(<= 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); {28413#(<= main_~k~0 10)} is VALID [2018-11-23 12:00:01,765 INFO L273 TraceCheckUtils]: 35: Hoare triple {28413#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {28413#(<= main_~k~0 10)} is VALID [2018-11-23 12:00:01,766 INFO L273 TraceCheckUtils]: 36: Hoare triple {28413#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {28423#(<= main_~k~0 11)} is VALID [2018-11-23 12:00:01,766 INFO L273 TraceCheckUtils]: 37: Hoare triple {28423#(<= 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); {28423#(<= main_~k~0 11)} is VALID [2018-11-23 12:00:01,767 INFO L273 TraceCheckUtils]: 38: Hoare triple {28423#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {28423#(<= main_~k~0 11)} is VALID [2018-11-23 12:00:01,767 INFO L273 TraceCheckUtils]: 39: Hoare triple {28423#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {28433#(<= main_~k~0 12)} is VALID [2018-11-23 12:00:01,768 INFO L273 TraceCheckUtils]: 40: Hoare triple {28433#(<= 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); {28433#(<= main_~k~0 12)} is VALID [2018-11-23 12:00:01,768 INFO L273 TraceCheckUtils]: 41: Hoare triple {28433#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {28433#(<= main_~k~0 12)} is VALID [2018-11-23 12:00:01,769 INFO L273 TraceCheckUtils]: 42: Hoare triple {28433#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {28443#(<= main_~k~0 13)} is VALID [2018-11-23 12:00:01,769 INFO L273 TraceCheckUtils]: 43: Hoare triple {28443#(<= 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); {28443#(<= main_~k~0 13)} is VALID [2018-11-23 12:00:01,770 INFO L273 TraceCheckUtils]: 44: Hoare triple {28443#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {28443#(<= main_~k~0 13)} is VALID [2018-11-23 12:00:01,771 INFO L273 TraceCheckUtils]: 45: Hoare triple {28443#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {28453#(<= main_~k~0 14)} is VALID [2018-11-23 12:00:01,771 INFO L273 TraceCheckUtils]: 46: Hoare triple {28453#(<= 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); {28453#(<= main_~k~0 14)} is VALID [2018-11-23 12:00:01,772 INFO L273 TraceCheckUtils]: 47: Hoare triple {28453#(<= main_~k~0 14)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {28453#(<= main_~k~0 14)} is VALID [2018-11-23 12:00:01,772 INFO L273 TraceCheckUtils]: 48: Hoare triple {28453#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {28463#(<= main_~k~0 15)} is VALID [2018-11-23 12:00:01,773 INFO L273 TraceCheckUtils]: 49: Hoare triple {28463#(<= 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); {28463#(<= main_~k~0 15)} is VALID [2018-11-23 12:00:01,773 INFO L273 TraceCheckUtils]: 50: Hoare triple {28463#(<= main_~k~0 15)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {28463#(<= main_~k~0 15)} is VALID [2018-11-23 12:00:01,774 INFO L273 TraceCheckUtils]: 51: Hoare triple {28463#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {28473#(<= main_~k~0 16)} is VALID [2018-11-23 12:00:01,774 INFO L273 TraceCheckUtils]: 52: Hoare triple {28473#(<= 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); {28473#(<= main_~k~0 16)} is VALID [2018-11-23 12:00:01,775 INFO L273 TraceCheckUtils]: 53: Hoare triple {28473#(<= main_~k~0 16)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {28473#(<= main_~k~0 16)} is VALID [2018-11-23 12:00:01,776 INFO L273 TraceCheckUtils]: 54: Hoare triple {28473#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {28483#(<= main_~k~0 17)} is VALID [2018-11-23 12:00:01,776 INFO L273 TraceCheckUtils]: 55: Hoare triple {28483#(<= 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); {28483#(<= main_~k~0 17)} is VALID [2018-11-23 12:00:01,777 INFO L273 TraceCheckUtils]: 56: Hoare triple {28483#(<= main_~k~0 17)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {28483#(<= main_~k~0 17)} is VALID [2018-11-23 12:00:01,777 INFO L273 TraceCheckUtils]: 57: Hoare triple {28483#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {28493#(<= main_~k~0 18)} is VALID [2018-11-23 12:00:01,778 INFO L273 TraceCheckUtils]: 58: Hoare triple {28493#(<= 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); {28493#(<= main_~k~0 18)} is VALID [2018-11-23 12:00:01,778 INFO L273 TraceCheckUtils]: 59: Hoare triple {28493#(<= main_~k~0 18)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {28493#(<= main_~k~0 18)} is VALID [2018-11-23 12:00:01,779 INFO L273 TraceCheckUtils]: 60: Hoare triple {28493#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {28503#(<= main_~k~0 19)} is VALID [2018-11-23 12:00:01,780 INFO L273 TraceCheckUtils]: 61: Hoare triple {28503#(<= 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); {28503#(<= main_~k~0 19)} is VALID [2018-11-23 12:00:01,780 INFO L273 TraceCheckUtils]: 62: Hoare triple {28503#(<= main_~k~0 19)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {28503#(<= main_~k~0 19)} is VALID [2018-11-23 12:00:01,781 INFO L273 TraceCheckUtils]: 63: Hoare triple {28503#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {28513#(<= main_~k~0 20)} is VALID [2018-11-23 12:00:01,781 INFO L273 TraceCheckUtils]: 64: Hoare triple {28513#(<= 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); {28513#(<= main_~k~0 20)} is VALID [2018-11-23 12:00:01,782 INFO L273 TraceCheckUtils]: 65: Hoare triple {28513#(<= main_~k~0 20)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {28513#(<= main_~k~0 20)} is VALID [2018-11-23 12:00:01,782 INFO L273 TraceCheckUtils]: 66: Hoare triple {28513#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {28523#(<= main_~k~0 21)} is VALID [2018-11-23 12:00:01,783 INFO L273 TraceCheckUtils]: 67: Hoare triple {28523#(<= 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); {28523#(<= main_~k~0 21)} is VALID [2018-11-23 12:00:01,783 INFO L273 TraceCheckUtils]: 68: Hoare triple {28523#(<= main_~k~0 21)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {28523#(<= main_~k~0 21)} is VALID [2018-11-23 12:00:01,784 INFO L273 TraceCheckUtils]: 69: Hoare triple {28523#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {28533#(<= main_~k~0 22)} is VALID [2018-11-23 12:00:01,785 INFO L273 TraceCheckUtils]: 70: Hoare triple {28533#(<= 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); {28533#(<= main_~k~0 22)} is VALID [2018-11-23 12:00:01,785 INFO L273 TraceCheckUtils]: 71: Hoare triple {28533#(<= main_~k~0 22)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {28533#(<= main_~k~0 22)} is VALID [2018-11-23 12:00:01,786 INFO L273 TraceCheckUtils]: 72: Hoare triple {28533#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {28543#(<= main_~k~0 23)} is VALID [2018-11-23 12:00:01,786 INFO L273 TraceCheckUtils]: 73: Hoare triple {28543#(<= 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); {28543#(<= main_~k~0 23)} is VALID [2018-11-23 12:00:01,787 INFO L273 TraceCheckUtils]: 74: Hoare triple {28543#(<= main_~k~0 23)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {28543#(<= main_~k~0 23)} is VALID [2018-11-23 12:00:01,787 INFO L273 TraceCheckUtils]: 75: Hoare triple {28543#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {28553#(<= main_~k~0 24)} is VALID [2018-11-23 12:00:01,788 INFO L273 TraceCheckUtils]: 76: Hoare triple {28553#(<= 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); {28553#(<= main_~k~0 24)} is VALID [2018-11-23 12:00:01,788 INFO L273 TraceCheckUtils]: 77: Hoare triple {28553#(<= main_~k~0 24)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {28553#(<= main_~k~0 24)} is VALID [2018-11-23 12:00:01,789 INFO L273 TraceCheckUtils]: 78: Hoare triple {28553#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {28563#(<= main_~k~0 25)} is VALID [2018-11-23 12:00:01,789 INFO L273 TraceCheckUtils]: 79: Hoare triple {28563#(<= 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); {28563#(<= main_~k~0 25)} is VALID [2018-11-23 12:00:01,790 INFO L273 TraceCheckUtils]: 80: Hoare triple {28563#(<= main_~k~0 25)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {28563#(<= main_~k~0 25)} is VALID [2018-11-23 12:00:01,791 INFO L273 TraceCheckUtils]: 81: Hoare triple {28563#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {28573#(<= main_~k~0 26)} is VALID [2018-11-23 12:00:01,791 INFO L273 TraceCheckUtils]: 82: Hoare triple {28573#(<= 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); {28573#(<= main_~k~0 26)} is VALID [2018-11-23 12:00:01,792 INFO L273 TraceCheckUtils]: 83: Hoare triple {28573#(<= main_~k~0 26)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {28573#(<= main_~k~0 26)} is VALID [2018-11-23 12:00:01,792 INFO L273 TraceCheckUtils]: 84: Hoare triple {28573#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {28583#(<= main_~k~0 27)} is VALID [2018-11-23 12:00:01,793 INFO L273 TraceCheckUtils]: 85: Hoare triple {28583#(<= 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); {28583#(<= main_~k~0 27)} is VALID [2018-11-23 12:00:01,793 INFO L273 TraceCheckUtils]: 86: Hoare triple {28583#(<= main_~k~0 27)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {28583#(<= main_~k~0 27)} is VALID [2018-11-23 12:00:01,794 INFO L273 TraceCheckUtils]: 87: Hoare triple {28583#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {28593#(<= main_~k~0 28)} is VALID [2018-11-23 12:00:01,794 INFO L273 TraceCheckUtils]: 88: Hoare triple {28593#(<= 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); {28593#(<= main_~k~0 28)} is VALID [2018-11-23 12:00:01,795 INFO L273 TraceCheckUtils]: 89: Hoare triple {28593#(<= main_~k~0 28)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {28593#(<= main_~k~0 28)} is VALID [2018-11-23 12:00:01,796 INFO L273 TraceCheckUtils]: 90: Hoare triple {28593#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {28603#(<= main_~k~0 29)} is VALID [2018-11-23 12:00:01,796 INFO L273 TraceCheckUtils]: 91: Hoare triple {28603#(<= main_~k~0 29)} assume !(~k~0 < 100000); {28270#false} is VALID [2018-11-23 12:00:01,796 INFO L273 TraceCheckUtils]: 92: Hoare triple {28270#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); {28270#false} is VALID [2018-11-23 12:00:01,797 INFO L273 TraceCheckUtils]: 93: Hoare triple {28270#false} ~x~0 := 0; {28270#false} is VALID [2018-11-23 12:00:01,797 INFO L273 TraceCheckUtils]: 94: Hoare triple {28270#false} assume !(~x~0 < ~i~0); {28270#false} is VALID [2018-11-23 12:00:01,797 INFO L273 TraceCheckUtils]: 95: Hoare triple {28270#false} ~x~0 := ~i~0; {28270#false} is VALID [2018-11-23 12:00:01,797 INFO L273 TraceCheckUtils]: 96: Hoare triple {28270#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); {28270#false} is VALID [2018-11-23 12:00:01,797 INFO L256 TraceCheckUtils]: 97: Hoare triple {28270#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {28270#false} is VALID [2018-11-23 12:00:01,798 INFO L273 TraceCheckUtils]: 98: Hoare triple {28270#false} ~cond := #in~cond; {28270#false} is VALID [2018-11-23 12:00:01,798 INFO L273 TraceCheckUtils]: 99: Hoare triple {28270#false} assume !(0 == ~cond); {28270#false} is VALID [2018-11-23 12:00:01,798 INFO L273 TraceCheckUtils]: 100: Hoare triple {28270#false} assume true; {28270#false} is VALID [2018-11-23 12:00:01,798 INFO L268 TraceCheckUtils]: 101: Hoare quadruple {28270#false} {28270#false} #136#return; {28270#false} is VALID [2018-11-23 12:00:01,798 INFO L273 TraceCheckUtils]: 102: Hoare triple {28270#false} havoc #t~mem9;havoc #t~mem10; {28270#false} is VALID [2018-11-23 12:00:01,798 INFO L273 TraceCheckUtils]: 103: Hoare triple {28270#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {28270#false} is VALID [2018-11-23 12:00:01,798 INFO L273 TraceCheckUtils]: 104: Hoare triple {28270#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); {28270#false} is VALID [2018-11-23 12:00:01,799 INFO L256 TraceCheckUtils]: 105: Hoare triple {28270#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {28270#false} is VALID [2018-11-23 12:00:01,799 INFO L273 TraceCheckUtils]: 106: Hoare triple {28270#false} ~cond := #in~cond; {28270#false} is VALID [2018-11-23 12:00:01,799 INFO L273 TraceCheckUtils]: 107: Hoare triple {28270#false} assume 0 == ~cond; {28270#false} is VALID [2018-11-23 12:00:01,799 INFO L273 TraceCheckUtils]: 108: Hoare triple {28270#false} assume !false; {28270#false} is VALID [2018-11-23 12:00:01,806 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 12:00:01,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:01,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 62 [2018-11-23 12:00:01,826 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 109 [2018-11-23 12:00:01,827 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:01,827 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 62 states. [2018-11-23 12:00:02,060 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:02,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-11-23 12:00:02,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-11-23 12:00:02,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1427, Invalid=2355, Unknown=0, NotChecked=0, Total=3782 [2018-11-23 12:00:02,062 INFO L87 Difference]: Start difference. First operand 222 states and 293 transitions. Second operand 62 states. [2018-11-23 12:00:03,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:03,685 INFO L93 Difference]: Finished difference Result 285 states and 379 transitions. [2018-11-23 12:00:03,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-23 12:00:03,685 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 109 [2018-11-23 12:00:03,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:03,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-23 12:00:03,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 223 transitions. [2018-11-23 12:00:03,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-23 12:00:03,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 223 transitions. [2018-11-23 12:00:03,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 223 transitions. [2018-11-23 12:00:03,913 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 12:00:03,919 INFO L225 Difference]: With dead ends: 285 [2018-11-23 12:00:03,919 INFO L226 Difference]: Without dead ends: 238 [2018-11-23 12:00:03,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1306 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1427, Invalid=2355, Unknown=0, NotChecked=0, Total=3782 [2018-11-23 12:00:03,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-11-23 12:00:04,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 228. [2018-11-23 12:00:04,046 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:04,046 INFO L82 GeneralOperation]: Start isEquivalent. First operand 238 states. Second operand 228 states. [2018-11-23 12:00:04,047 INFO L74 IsIncluded]: Start isIncluded. First operand 238 states. Second operand 228 states. [2018-11-23 12:00:04,047 INFO L87 Difference]: Start difference. First operand 238 states. Second operand 228 states. [2018-11-23 12:00:04,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:04,051 INFO L93 Difference]: Finished difference Result 238 states and 316 transitions. [2018-11-23 12:00:04,052 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 316 transitions. [2018-11-23 12:00:04,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:04,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:04,052 INFO L74 IsIncluded]: Start isIncluded. First operand 228 states. Second operand 238 states. [2018-11-23 12:00:04,052 INFO L87 Difference]: Start difference. First operand 228 states. Second operand 238 states. [2018-11-23 12:00:04,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:04,057 INFO L93 Difference]: Finished difference Result 238 states and 316 transitions. [2018-11-23 12:00:04,057 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 316 transitions. [2018-11-23 12:00:04,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:04,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:04,058 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:04,058 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:04,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-11-23 12:00:04,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 301 transitions. [2018-11-23 12:00:04,063 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 301 transitions. Word has length 109 [2018-11-23 12:00:04,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:04,063 INFO L480 AbstractCegarLoop]: Abstraction has 228 states and 301 transitions. [2018-11-23 12:00:04,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-11-23 12:00:04,064 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 301 transitions. [2018-11-23 12:00:04,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-23 12:00:04,064 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:04,064 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 12:00:04,065 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:04,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:04,065 INFO L82 PathProgramCache]: Analyzing trace with hash 268896945, now seen corresponding path program 25 times [2018-11-23 12:00:04,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:04,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:04,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:04,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:00:04,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:04,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:05,212 INFO L256 TraceCheckUtils]: 0: Hoare triple {29828#true} call ULTIMATE.init(); {29828#true} is VALID [2018-11-23 12:00:05,213 INFO L273 TraceCheckUtils]: 1: Hoare triple {29828#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {29828#true} is VALID [2018-11-23 12:00:05,213 INFO L273 TraceCheckUtils]: 2: Hoare triple {29828#true} assume true; {29828#true} is VALID [2018-11-23 12:00:05,213 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {29828#true} {29828#true} #130#return; {29828#true} is VALID [2018-11-23 12:00:05,213 INFO L256 TraceCheckUtils]: 4: Hoare triple {29828#true} call #t~ret15 := main(); {29828#true} is VALID [2018-11-23 12:00:05,214 INFO L273 TraceCheckUtils]: 5: Hoare triple {29828#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {29830#(= main_~i~0 0)} is VALID [2018-11-23 12:00:05,215 INFO L273 TraceCheckUtils]: 6: Hoare triple {29830#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {29831#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,215 INFO L273 TraceCheckUtils]: 7: Hoare triple {29831#(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); {29831#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,216 INFO L273 TraceCheckUtils]: 8: Hoare triple {29831#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {29831#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,216 INFO L273 TraceCheckUtils]: 9: Hoare triple {29831#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {29832#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,217 INFO L273 TraceCheckUtils]: 10: Hoare triple {29832#(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); {29832#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,217 INFO L273 TraceCheckUtils]: 11: Hoare triple {29832#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {29832#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,218 INFO L273 TraceCheckUtils]: 12: Hoare triple {29832#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {29833#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,219 INFO L273 TraceCheckUtils]: 13: Hoare triple {29833#(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); {29833#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,220 INFO L273 TraceCheckUtils]: 14: Hoare triple {29833#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {29833#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,220 INFO L273 TraceCheckUtils]: 15: Hoare triple {29833#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {29834#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,221 INFO L273 TraceCheckUtils]: 16: Hoare triple {29834#(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); {29834#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,222 INFO L273 TraceCheckUtils]: 17: Hoare triple {29834#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {29834#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,223 INFO L273 TraceCheckUtils]: 18: Hoare triple {29834#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {29835#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,224 INFO L273 TraceCheckUtils]: 19: Hoare triple {29835#(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); {29835#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,225 INFO L273 TraceCheckUtils]: 20: Hoare triple {29835#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {29835#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,225 INFO L273 TraceCheckUtils]: 21: Hoare triple {29835#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {29836#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,226 INFO L273 TraceCheckUtils]: 22: Hoare triple {29836#(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); {29836#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,227 INFO L273 TraceCheckUtils]: 23: Hoare triple {29836#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {29836#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,228 INFO L273 TraceCheckUtils]: 24: Hoare triple {29836#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {29837#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,229 INFO L273 TraceCheckUtils]: 25: Hoare triple {29837#(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); {29837#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,229 INFO L273 TraceCheckUtils]: 26: Hoare triple {29837#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {29837#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,230 INFO L273 TraceCheckUtils]: 27: Hoare triple {29837#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {29838#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,231 INFO L273 TraceCheckUtils]: 28: Hoare triple {29838#(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); {29838#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,232 INFO L273 TraceCheckUtils]: 29: Hoare triple {29838#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {29838#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,232 INFO L273 TraceCheckUtils]: 30: Hoare triple {29838#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {29839#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,233 INFO L273 TraceCheckUtils]: 31: Hoare triple {29839#(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); {29839#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,234 INFO L273 TraceCheckUtils]: 32: Hoare triple {29839#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {29839#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,235 INFO L273 TraceCheckUtils]: 33: Hoare triple {29839#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {29840#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,236 INFO L273 TraceCheckUtils]: 34: Hoare triple {29840#(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); {29840#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,236 INFO L273 TraceCheckUtils]: 35: Hoare triple {29840#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {29840#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,237 INFO L273 TraceCheckUtils]: 36: Hoare triple {29840#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {29841#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,238 INFO L273 TraceCheckUtils]: 37: Hoare triple {29841#(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); {29841#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,239 INFO L273 TraceCheckUtils]: 38: Hoare triple {29841#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {29841#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,240 INFO L273 TraceCheckUtils]: 39: Hoare triple {29841#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {29842#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,241 INFO L273 TraceCheckUtils]: 40: Hoare triple {29842#(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); {29842#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,241 INFO L273 TraceCheckUtils]: 41: Hoare triple {29842#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {29842#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,242 INFO L273 TraceCheckUtils]: 42: Hoare triple {29842#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {29843#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,243 INFO L273 TraceCheckUtils]: 43: Hoare triple {29843#(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); {29843#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,244 INFO L273 TraceCheckUtils]: 44: Hoare triple {29843#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {29843#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,245 INFO L273 TraceCheckUtils]: 45: Hoare triple {29843#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {29844#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,245 INFO L273 TraceCheckUtils]: 46: Hoare triple {29844#(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); {29844#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,246 INFO L273 TraceCheckUtils]: 47: Hoare triple {29844#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {29844#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,247 INFO L273 TraceCheckUtils]: 48: Hoare triple {29844#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {29845#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,248 INFO L273 TraceCheckUtils]: 49: Hoare triple {29845#(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); {29845#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,248 INFO L273 TraceCheckUtils]: 50: Hoare triple {29845#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {29845#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,249 INFO L273 TraceCheckUtils]: 51: Hoare triple {29845#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {29846#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,250 INFO L273 TraceCheckUtils]: 52: Hoare triple {29846#(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); {29846#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,251 INFO L273 TraceCheckUtils]: 53: Hoare triple {29846#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {29846#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,252 INFO L273 TraceCheckUtils]: 54: Hoare triple {29846#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {29847#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 12:00:05,253 INFO L273 TraceCheckUtils]: 55: Hoare triple {29847#(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); {29847#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 12:00:05,253 INFO L273 TraceCheckUtils]: 56: Hoare triple {29847#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {29847#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 12:00:05,254 INFO L273 TraceCheckUtils]: 57: Hoare triple {29847#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} ~k~0 := 1 + ~k~0; {29848#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,255 INFO L273 TraceCheckUtils]: 58: Hoare triple {29848#(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); {29848#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,256 INFO L273 TraceCheckUtils]: 59: Hoare triple {29848#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {29848#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,257 INFO L273 TraceCheckUtils]: 60: Hoare triple {29848#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {29849#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,257 INFO L273 TraceCheckUtils]: 61: Hoare triple {29849#(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); {29849#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,258 INFO L273 TraceCheckUtils]: 62: Hoare triple {29849#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {29849#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,259 INFO L273 TraceCheckUtils]: 63: Hoare triple {29849#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {29850#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,260 INFO L273 TraceCheckUtils]: 64: Hoare triple {29850#(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); {29850#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,261 INFO L273 TraceCheckUtils]: 65: Hoare triple {29850#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {29850#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,261 INFO L273 TraceCheckUtils]: 66: Hoare triple {29850#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {29851#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,262 INFO L273 TraceCheckUtils]: 67: Hoare triple {29851#(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); {29851#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,263 INFO L273 TraceCheckUtils]: 68: Hoare triple {29851#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {29851#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,264 INFO L273 TraceCheckUtils]: 69: Hoare triple {29851#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {29852#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,265 INFO L273 TraceCheckUtils]: 70: Hoare triple {29852#(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); {29852#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,265 INFO L273 TraceCheckUtils]: 71: Hoare triple {29852#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {29852#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,266 INFO L273 TraceCheckUtils]: 72: Hoare triple {29852#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {29853#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,267 INFO L273 TraceCheckUtils]: 73: Hoare triple {29853#(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); {29853#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,268 INFO L273 TraceCheckUtils]: 74: Hoare triple {29853#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {29853#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,269 INFO L273 TraceCheckUtils]: 75: Hoare triple {29853#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {29854#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,269 INFO L273 TraceCheckUtils]: 76: Hoare triple {29854#(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); {29854#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,270 INFO L273 TraceCheckUtils]: 77: Hoare triple {29854#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {29854#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,271 INFO L273 TraceCheckUtils]: 78: Hoare triple {29854#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {29855#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,272 INFO L273 TraceCheckUtils]: 79: Hoare triple {29855#(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); {29855#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,273 INFO L273 TraceCheckUtils]: 80: Hoare triple {29855#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {29855#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,274 INFO L273 TraceCheckUtils]: 81: Hoare triple {29855#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {29856#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,274 INFO L273 TraceCheckUtils]: 82: Hoare triple {29856#(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); {29856#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,275 INFO L273 TraceCheckUtils]: 83: Hoare triple {29856#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {29856#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,276 INFO L273 TraceCheckUtils]: 84: Hoare triple {29856#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {29857#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,277 INFO L273 TraceCheckUtils]: 85: Hoare triple {29857#(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); {29857#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,277 INFO L273 TraceCheckUtils]: 86: Hoare triple {29857#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {29857#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,278 INFO L273 TraceCheckUtils]: 87: Hoare triple {29857#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {29858#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,279 INFO L273 TraceCheckUtils]: 88: Hoare triple {29858#(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); {29858#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,280 INFO L273 TraceCheckUtils]: 89: Hoare triple {29858#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {29858#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,281 INFO L273 TraceCheckUtils]: 90: Hoare triple {29858#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {29859#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,282 INFO L273 TraceCheckUtils]: 91: Hoare triple {29859#(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); {29859#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,283 INFO L273 TraceCheckUtils]: 92: Hoare triple {29859#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {29859#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,284 INFO L273 TraceCheckUtils]: 93: Hoare triple {29859#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {29860#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:05,284 INFO L273 TraceCheckUtils]: 94: Hoare triple {29860#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} assume !(~k~0 < 100000); {29829#false} is VALID [2018-11-23 12:00:05,285 INFO L273 TraceCheckUtils]: 95: Hoare triple {29829#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); {29829#false} is VALID [2018-11-23 12:00:05,285 INFO L273 TraceCheckUtils]: 96: Hoare triple {29829#false} ~x~0 := 0; {29829#false} is VALID [2018-11-23 12:00:05,285 INFO L273 TraceCheckUtils]: 97: Hoare triple {29829#false} assume !(~x~0 < ~i~0); {29829#false} is VALID [2018-11-23 12:00:05,285 INFO L273 TraceCheckUtils]: 98: Hoare triple {29829#false} ~x~0 := ~i~0; {29829#false} is VALID [2018-11-23 12:00:05,285 INFO L273 TraceCheckUtils]: 99: Hoare triple {29829#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); {29829#false} is VALID [2018-11-23 12:00:05,286 INFO L256 TraceCheckUtils]: 100: Hoare triple {29829#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {29828#true} is VALID [2018-11-23 12:00:05,286 INFO L273 TraceCheckUtils]: 101: Hoare triple {29828#true} ~cond := #in~cond; {29828#true} is VALID [2018-11-23 12:00:05,286 INFO L273 TraceCheckUtils]: 102: Hoare triple {29828#true} assume !(0 == ~cond); {29828#true} is VALID [2018-11-23 12:00:05,286 INFO L273 TraceCheckUtils]: 103: Hoare triple {29828#true} assume true; {29828#true} is VALID [2018-11-23 12:00:05,286 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {29828#true} {29829#false} #136#return; {29829#false} is VALID [2018-11-23 12:00:05,286 INFO L273 TraceCheckUtils]: 105: Hoare triple {29829#false} havoc #t~mem9;havoc #t~mem10; {29829#false} is VALID [2018-11-23 12:00:05,287 INFO L273 TraceCheckUtils]: 106: Hoare triple {29829#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {29829#false} is VALID [2018-11-23 12:00:05,287 INFO L273 TraceCheckUtils]: 107: Hoare triple {29829#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); {29829#false} is VALID [2018-11-23 12:00:05,287 INFO L256 TraceCheckUtils]: 108: Hoare triple {29829#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {29829#false} is VALID [2018-11-23 12:00:05,287 INFO L273 TraceCheckUtils]: 109: Hoare triple {29829#false} ~cond := #in~cond; {29829#false} is VALID [2018-11-23 12:00:05,287 INFO L273 TraceCheckUtils]: 110: Hoare triple {29829#false} assume 0 == ~cond; {29829#false} is VALID [2018-11-23 12:00:05,288 INFO L273 TraceCheckUtils]: 111: Hoare triple {29829#false} assume !false; {29829#false} is VALID [2018-11-23 12:00:05,306 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 12:00:05,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:05,306 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:00:05,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:00:05,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:05,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:05,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:06,265 INFO L256 TraceCheckUtils]: 0: Hoare triple {29828#true} call ULTIMATE.init(); {29828#true} is VALID [2018-11-23 12:00:06,266 INFO L273 TraceCheckUtils]: 1: Hoare triple {29828#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {29828#true} is VALID [2018-11-23 12:00:06,266 INFO L273 TraceCheckUtils]: 2: Hoare triple {29828#true} assume true; {29828#true} is VALID [2018-11-23 12:00:06,266 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {29828#true} {29828#true} #130#return; {29828#true} is VALID [2018-11-23 12:00:06,266 INFO L256 TraceCheckUtils]: 4: Hoare triple {29828#true} call #t~ret15 := main(); {29828#true} is VALID [2018-11-23 12:00:06,267 INFO L273 TraceCheckUtils]: 5: Hoare triple {29828#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {29879#(<= main_~i~0 0)} is VALID [2018-11-23 12:00:06,268 INFO L273 TraceCheckUtils]: 6: Hoare triple {29879#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {29883#(<= main_~k~0 1)} is VALID [2018-11-23 12:00:06,268 INFO L273 TraceCheckUtils]: 7: Hoare triple {29883#(<= 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); {29883#(<= main_~k~0 1)} is VALID [2018-11-23 12:00:06,268 INFO L273 TraceCheckUtils]: 8: Hoare triple {29883#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {29883#(<= main_~k~0 1)} is VALID [2018-11-23 12:00:06,288 INFO L273 TraceCheckUtils]: 9: Hoare triple {29883#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {29893#(<= main_~k~0 2)} is VALID [2018-11-23 12:00:06,303 INFO L273 TraceCheckUtils]: 10: Hoare triple {29893#(<= 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); {29893#(<= main_~k~0 2)} is VALID [2018-11-23 12:00:06,312 INFO L273 TraceCheckUtils]: 11: Hoare triple {29893#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {29893#(<= main_~k~0 2)} is VALID [2018-11-23 12:00:06,315 INFO L273 TraceCheckUtils]: 12: Hoare triple {29893#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {29903#(<= main_~k~0 3)} is VALID [2018-11-23 12:00:06,316 INFO L273 TraceCheckUtils]: 13: Hoare triple {29903#(<= 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); {29903#(<= main_~k~0 3)} is VALID [2018-11-23 12:00:06,316 INFO L273 TraceCheckUtils]: 14: Hoare triple {29903#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {29903#(<= main_~k~0 3)} is VALID [2018-11-23 12:00:06,317 INFO L273 TraceCheckUtils]: 15: Hoare triple {29903#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {29913#(<= main_~k~0 4)} is VALID [2018-11-23 12:00:06,317 INFO L273 TraceCheckUtils]: 16: Hoare triple {29913#(<= 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); {29913#(<= main_~k~0 4)} is VALID [2018-11-23 12:00:06,317 INFO L273 TraceCheckUtils]: 17: Hoare triple {29913#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {29913#(<= main_~k~0 4)} is VALID [2018-11-23 12:00:06,318 INFO L273 TraceCheckUtils]: 18: Hoare triple {29913#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {29923#(<= main_~k~0 5)} is VALID [2018-11-23 12:00:06,318 INFO L273 TraceCheckUtils]: 19: Hoare triple {29923#(<= 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); {29923#(<= main_~k~0 5)} is VALID [2018-11-23 12:00:06,318 INFO L273 TraceCheckUtils]: 20: Hoare triple {29923#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {29923#(<= main_~k~0 5)} is VALID [2018-11-23 12:00:06,319 INFO L273 TraceCheckUtils]: 21: Hoare triple {29923#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {29933#(<= main_~k~0 6)} is VALID [2018-11-23 12:00:06,319 INFO L273 TraceCheckUtils]: 22: Hoare triple {29933#(<= 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); {29933#(<= main_~k~0 6)} is VALID [2018-11-23 12:00:06,319 INFO L273 TraceCheckUtils]: 23: Hoare triple {29933#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {29933#(<= main_~k~0 6)} is VALID [2018-11-23 12:00:06,320 INFO L273 TraceCheckUtils]: 24: Hoare triple {29933#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {29943#(<= main_~k~0 7)} is VALID [2018-11-23 12:00:06,320 INFO L273 TraceCheckUtils]: 25: Hoare triple {29943#(<= 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); {29943#(<= main_~k~0 7)} is VALID [2018-11-23 12:00:06,321 INFO L273 TraceCheckUtils]: 26: Hoare triple {29943#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {29943#(<= main_~k~0 7)} is VALID [2018-11-23 12:00:06,326 INFO L273 TraceCheckUtils]: 27: Hoare triple {29943#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {29953#(<= main_~k~0 8)} is VALID [2018-11-23 12:00:06,326 INFO L273 TraceCheckUtils]: 28: Hoare triple {29953#(<= 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); {29953#(<= main_~k~0 8)} is VALID [2018-11-23 12:00:06,326 INFO L273 TraceCheckUtils]: 29: Hoare triple {29953#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {29953#(<= main_~k~0 8)} is VALID [2018-11-23 12:00:06,327 INFO L273 TraceCheckUtils]: 30: Hoare triple {29953#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {29963#(<= main_~k~0 9)} is VALID [2018-11-23 12:00:06,327 INFO L273 TraceCheckUtils]: 31: Hoare triple {29963#(<= 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); {29963#(<= main_~k~0 9)} is VALID [2018-11-23 12:00:06,327 INFO L273 TraceCheckUtils]: 32: Hoare triple {29963#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {29963#(<= main_~k~0 9)} is VALID [2018-11-23 12:00:06,328 INFO L273 TraceCheckUtils]: 33: Hoare triple {29963#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {29973#(<= main_~k~0 10)} is VALID [2018-11-23 12:00:06,328 INFO L273 TraceCheckUtils]: 34: Hoare triple {29973#(<= 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); {29973#(<= main_~k~0 10)} is VALID [2018-11-23 12:00:06,329 INFO L273 TraceCheckUtils]: 35: Hoare triple {29973#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {29973#(<= main_~k~0 10)} is VALID [2018-11-23 12:00:06,329 INFO L273 TraceCheckUtils]: 36: Hoare triple {29973#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {29983#(<= main_~k~0 11)} is VALID [2018-11-23 12:00:06,330 INFO L273 TraceCheckUtils]: 37: Hoare triple {29983#(<= 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); {29983#(<= main_~k~0 11)} is VALID [2018-11-23 12:00:06,330 INFO L273 TraceCheckUtils]: 38: Hoare triple {29983#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {29983#(<= main_~k~0 11)} is VALID [2018-11-23 12:00:06,331 INFO L273 TraceCheckUtils]: 39: Hoare triple {29983#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {29993#(<= main_~k~0 12)} is VALID [2018-11-23 12:00:06,331 INFO L273 TraceCheckUtils]: 40: Hoare triple {29993#(<= 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); {29993#(<= main_~k~0 12)} is VALID [2018-11-23 12:00:06,332 INFO L273 TraceCheckUtils]: 41: Hoare triple {29993#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {29993#(<= main_~k~0 12)} is VALID [2018-11-23 12:00:06,333 INFO L273 TraceCheckUtils]: 42: Hoare triple {29993#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {30003#(<= main_~k~0 13)} is VALID [2018-11-23 12:00:06,333 INFO L273 TraceCheckUtils]: 43: Hoare triple {30003#(<= 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); {30003#(<= main_~k~0 13)} is VALID [2018-11-23 12:00:06,334 INFO L273 TraceCheckUtils]: 44: Hoare triple {30003#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {30003#(<= main_~k~0 13)} is VALID [2018-11-23 12:00:06,334 INFO L273 TraceCheckUtils]: 45: Hoare triple {30003#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {30013#(<= main_~k~0 14)} is VALID [2018-11-23 12:00:06,335 INFO L273 TraceCheckUtils]: 46: Hoare triple {30013#(<= 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); {30013#(<= main_~k~0 14)} is VALID [2018-11-23 12:00:06,335 INFO L273 TraceCheckUtils]: 47: Hoare triple {30013#(<= main_~k~0 14)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {30013#(<= main_~k~0 14)} is VALID [2018-11-23 12:00:06,336 INFO L273 TraceCheckUtils]: 48: Hoare triple {30013#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {30023#(<= main_~k~0 15)} is VALID [2018-11-23 12:00:06,337 INFO L273 TraceCheckUtils]: 49: Hoare triple {30023#(<= 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); {30023#(<= main_~k~0 15)} is VALID [2018-11-23 12:00:06,337 INFO L273 TraceCheckUtils]: 50: Hoare triple {30023#(<= main_~k~0 15)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {30023#(<= main_~k~0 15)} is VALID [2018-11-23 12:00:06,338 INFO L273 TraceCheckUtils]: 51: Hoare triple {30023#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {30033#(<= main_~k~0 16)} is VALID [2018-11-23 12:00:06,338 INFO L273 TraceCheckUtils]: 52: Hoare triple {30033#(<= 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); {30033#(<= main_~k~0 16)} is VALID [2018-11-23 12:00:06,339 INFO L273 TraceCheckUtils]: 53: Hoare triple {30033#(<= main_~k~0 16)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {30033#(<= main_~k~0 16)} is VALID [2018-11-23 12:00:06,340 INFO L273 TraceCheckUtils]: 54: Hoare triple {30033#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {30043#(<= main_~k~0 17)} is VALID [2018-11-23 12:00:06,340 INFO L273 TraceCheckUtils]: 55: Hoare triple {30043#(<= 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); {30043#(<= main_~k~0 17)} is VALID [2018-11-23 12:00:06,341 INFO L273 TraceCheckUtils]: 56: Hoare triple {30043#(<= main_~k~0 17)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {30043#(<= main_~k~0 17)} is VALID [2018-11-23 12:00:06,341 INFO L273 TraceCheckUtils]: 57: Hoare triple {30043#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {30053#(<= main_~k~0 18)} is VALID [2018-11-23 12:00:06,342 INFO L273 TraceCheckUtils]: 58: Hoare triple {30053#(<= 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); {30053#(<= main_~k~0 18)} is VALID [2018-11-23 12:00:06,342 INFO L273 TraceCheckUtils]: 59: Hoare triple {30053#(<= main_~k~0 18)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {30053#(<= main_~k~0 18)} is VALID [2018-11-23 12:00:06,343 INFO L273 TraceCheckUtils]: 60: Hoare triple {30053#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {30063#(<= main_~k~0 19)} is VALID [2018-11-23 12:00:06,344 INFO L273 TraceCheckUtils]: 61: Hoare triple {30063#(<= 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); {30063#(<= main_~k~0 19)} is VALID [2018-11-23 12:00:06,344 INFO L273 TraceCheckUtils]: 62: Hoare triple {30063#(<= main_~k~0 19)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {30063#(<= main_~k~0 19)} is VALID [2018-11-23 12:00:06,345 INFO L273 TraceCheckUtils]: 63: Hoare triple {30063#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {30073#(<= main_~k~0 20)} is VALID [2018-11-23 12:00:06,345 INFO L273 TraceCheckUtils]: 64: Hoare triple {30073#(<= 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); {30073#(<= main_~k~0 20)} is VALID [2018-11-23 12:00:06,346 INFO L273 TraceCheckUtils]: 65: Hoare triple {30073#(<= main_~k~0 20)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {30073#(<= main_~k~0 20)} is VALID [2018-11-23 12:00:06,347 INFO L273 TraceCheckUtils]: 66: Hoare triple {30073#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {30083#(<= main_~k~0 21)} is VALID [2018-11-23 12:00:06,347 INFO L273 TraceCheckUtils]: 67: Hoare triple {30083#(<= 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); {30083#(<= main_~k~0 21)} is VALID [2018-11-23 12:00:06,348 INFO L273 TraceCheckUtils]: 68: Hoare triple {30083#(<= main_~k~0 21)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {30083#(<= main_~k~0 21)} is VALID [2018-11-23 12:00:06,348 INFO L273 TraceCheckUtils]: 69: Hoare triple {30083#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {30093#(<= main_~k~0 22)} is VALID [2018-11-23 12:00:06,349 INFO L273 TraceCheckUtils]: 70: Hoare triple {30093#(<= 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); {30093#(<= main_~k~0 22)} is VALID [2018-11-23 12:00:06,349 INFO L273 TraceCheckUtils]: 71: Hoare triple {30093#(<= main_~k~0 22)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {30093#(<= main_~k~0 22)} is VALID [2018-11-23 12:00:06,350 INFO L273 TraceCheckUtils]: 72: Hoare triple {30093#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {30103#(<= main_~k~0 23)} is VALID [2018-11-23 12:00:06,351 INFO L273 TraceCheckUtils]: 73: Hoare triple {30103#(<= 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); {30103#(<= main_~k~0 23)} is VALID [2018-11-23 12:00:06,351 INFO L273 TraceCheckUtils]: 74: Hoare triple {30103#(<= main_~k~0 23)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {30103#(<= main_~k~0 23)} is VALID [2018-11-23 12:00:06,352 INFO L273 TraceCheckUtils]: 75: Hoare triple {30103#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {30113#(<= main_~k~0 24)} is VALID [2018-11-23 12:00:06,352 INFO L273 TraceCheckUtils]: 76: Hoare triple {30113#(<= 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); {30113#(<= main_~k~0 24)} is VALID [2018-11-23 12:00:06,353 INFO L273 TraceCheckUtils]: 77: Hoare triple {30113#(<= main_~k~0 24)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {30113#(<= main_~k~0 24)} is VALID [2018-11-23 12:00:06,354 INFO L273 TraceCheckUtils]: 78: Hoare triple {30113#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {30123#(<= main_~k~0 25)} is VALID [2018-11-23 12:00:06,354 INFO L273 TraceCheckUtils]: 79: Hoare triple {30123#(<= 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); {30123#(<= main_~k~0 25)} is VALID [2018-11-23 12:00:06,355 INFO L273 TraceCheckUtils]: 80: Hoare triple {30123#(<= main_~k~0 25)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {30123#(<= main_~k~0 25)} is VALID [2018-11-23 12:00:06,355 INFO L273 TraceCheckUtils]: 81: Hoare triple {30123#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {30133#(<= main_~k~0 26)} is VALID [2018-11-23 12:00:06,356 INFO L273 TraceCheckUtils]: 82: Hoare triple {30133#(<= 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); {30133#(<= main_~k~0 26)} is VALID [2018-11-23 12:00:06,356 INFO L273 TraceCheckUtils]: 83: Hoare triple {30133#(<= main_~k~0 26)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {30133#(<= main_~k~0 26)} is VALID [2018-11-23 12:00:06,357 INFO L273 TraceCheckUtils]: 84: Hoare triple {30133#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {30143#(<= main_~k~0 27)} is VALID [2018-11-23 12:00:06,358 INFO L273 TraceCheckUtils]: 85: Hoare triple {30143#(<= 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); {30143#(<= main_~k~0 27)} is VALID [2018-11-23 12:00:06,358 INFO L273 TraceCheckUtils]: 86: Hoare triple {30143#(<= main_~k~0 27)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {30143#(<= main_~k~0 27)} is VALID [2018-11-23 12:00:06,359 INFO L273 TraceCheckUtils]: 87: Hoare triple {30143#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {30153#(<= main_~k~0 28)} is VALID [2018-11-23 12:00:06,359 INFO L273 TraceCheckUtils]: 88: Hoare triple {30153#(<= 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); {30153#(<= main_~k~0 28)} is VALID [2018-11-23 12:00:06,360 INFO L273 TraceCheckUtils]: 89: Hoare triple {30153#(<= main_~k~0 28)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {30153#(<= main_~k~0 28)} is VALID [2018-11-23 12:00:06,361 INFO L273 TraceCheckUtils]: 90: Hoare triple {30153#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {30163#(<= main_~k~0 29)} is VALID [2018-11-23 12:00:06,361 INFO L273 TraceCheckUtils]: 91: Hoare triple {30163#(<= 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); {30163#(<= main_~k~0 29)} is VALID [2018-11-23 12:00:06,362 INFO L273 TraceCheckUtils]: 92: Hoare triple {30163#(<= main_~k~0 29)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {30163#(<= main_~k~0 29)} is VALID [2018-11-23 12:00:06,362 INFO L273 TraceCheckUtils]: 93: Hoare triple {30163#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {30173#(<= main_~k~0 30)} is VALID [2018-11-23 12:00:06,363 INFO L273 TraceCheckUtils]: 94: Hoare triple {30173#(<= main_~k~0 30)} assume !(~k~0 < 100000); {29829#false} is VALID [2018-11-23 12:00:06,363 INFO L273 TraceCheckUtils]: 95: Hoare triple {29829#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); {29829#false} is VALID [2018-11-23 12:00:06,363 INFO L273 TraceCheckUtils]: 96: Hoare triple {29829#false} ~x~0 := 0; {29829#false} is VALID [2018-11-23 12:00:06,364 INFO L273 TraceCheckUtils]: 97: Hoare triple {29829#false} assume !(~x~0 < ~i~0); {29829#false} is VALID [2018-11-23 12:00:06,364 INFO L273 TraceCheckUtils]: 98: Hoare triple {29829#false} ~x~0 := ~i~0; {29829#false} is VALID [2018-11-23 12:00:06,364 INFO L273 TraceCheckUtils]: 99: Hoare triple {29829#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); {29829#false} is VALID [2018-11-23 12:00:06,364 INFO L256 TraceCheckUtils]: 100: Hoare triple {29829#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {29829#false} is VALID [2018-11-23 12:00:06,364 INFO L273 TraceCheckUtils]: 101: Hoare triple {29829#false} ~cond := #in~cond; {29829#false} is VALID [2018-11-23 12:00:06,364 INFO L273 TraceCheckUtils]: 102: Hoare triple {29829#false} assume !(0 == ~cond); {29829#false} is VALID [2018-11-23 12:00:06,365 INFO L273 TraceCheckUtils]: 103: Hoare triple {29829#false} assume true; {29829#false} is VALID [2018-11-23 12:00:06,365 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {29829#false} {29829#false} #136#return; {29829#false} is VALID [2018-11-23 12:00:06,365 INFO L273 TraceCheckUtils]: 105: Hoare triple {29829#false} havoc #t~mem9;havoc #t~mem10; {29829#false} is VALID [2018-11-23 12:00:06,365 INFO L273 TraceCheckUtils]: 106: Hoare triple {29829#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {29829#false} is VALID [2018-11-23 12:00:06,365 INFO L273 TraceCheckUtils]: 107: Hoare triple {29829#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); {29829#false} is VALID [2018-11-23 12:00:06,366 INFO L256 TraceCheckUtils]: 108: Hoare triple {29829#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {29829#false} is VALID [2018-11-23 12:00:06,366 INFO L273 TraceCheckUtils]: 109: Hoare triple {29829#false} ~cond := #in~cond; {29829#false} is VALID [2018-11-23 12:00:06,366 INFO L273 TraceCheckUtils]: 110: Hoare triple {29829#false} assume 0 == ~cond; {29829#false} is VALID [2018-11-23 12:00:06,366 INFO L273 TraceCheckUtils]: 111: Hoare triple {29829#false} assume !false; {29829#false} is VALID [2018-11-23 12:00:06,374 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 12:00:06,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:06,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 64 [2018-11-23 12:00:06,394 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 112 [2018-11-23 12:00:06,394 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:06,395 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 64 states. [2018-11-23 12:00:06,654 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 12:00:06,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-11-23 12:00:06,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-11-23 12:00:06,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1521, Invalid=2511, Unknown=0, NotChecked=0, Total=4032 [2018-11-23 12:00:06,656 INFO L87 Difference]: Start difference. First operand 228 states and 301 transitions. Second operand 64 states. [2018-11-23 12:00:08,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:08,154 INFO L93 Difference]: Finished difference Result 291 states and 387 transitions. [2018-11-23 12:00:08,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-23 12:00:08,154 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 112 [2018-11-23 12:00:08,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:08,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 12:00:08,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 227 transitions. [2018-11-23 12:00:08,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 12:00:08,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 227 transitions. [2018-11-23 12:00:08,159 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 227 transitions. [2018-11-23 12:00:08,378 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 12:00:08,383 INFO L225 Difference]: With dead ends: 291 [2018-11-23 12:00:08,384 INFO L226 Difference]: Without dead ends: 244 [2018-11-23 12:00:08,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1396 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1521, Invalid=2511, Unknown=0, NotChecked=0, Total=4032 [2018-11-23 12:00:08,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-11-23 12:00:08,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 234. [2018-11-23 12:00:08,644 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:08,644 INFO L82 GeneralOperation]: Start isEquivalent. First operand 244 states. Second operand 234 states. [2018-11-23 12:00:08,645 INFO L74 IsIncluded]: Start isIncluded. First operand 244 states. Second operand 234 states. [2018-11-23 12:00:08,645 INFO L87 Difference]: Start difference. First operand 244 states. Second operand 234 states. [2018-11-23 12:00:08,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:08,650 INFO L93 Difference]: Finished difference Result 244 states and 324 transitions. [2018-11-23 12:00:08,650 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 324 transitions. [2018-11-23 12:00:08,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:08,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:08,651 INFO L74 IsIncluded]: Start isIncluded. First operand 234 states. Second operand 244 states. [2018-11-23 12:00:08,651 INFO L87 Difference]: Start difference. First operand 234 states. Second operand 244 states. [2018-11-23 12:00:08,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:08,656 INFO L93 Difference]: Finished difference Result 244 states and 324 transitions. [2018-11-23 12:00:08,657 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 324 transitions. [2018-11-23 12:00:08,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:08,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:08,657 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:08,657 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:08,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-11-23 12:00:08,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 309 transitions. [2018-11-23 12:00:08,663 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 309 transitions. Word has length 112 [2018-11-23 12:00:08,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:08,664 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 309 transitions. [2018-11-23 12:00:08,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-11-23 12:00:08,664 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 309 transitions. [2018-11-23 12:00:08,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-23 12:00:08,664 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:08,665 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 12:00:08,665 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:08,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:08,665 INFO L82 PathProgramCache]: Analyzing trace with hash -568883156, now seen corresponding path program 26 times [2018-11-23 12:00:08,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:08,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:08,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:08,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:00:08,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:08,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:09,870 INFO L256 TraceCheckUtils]: 0: Hoare triple {31426#true} call ULTIMATE.init(); {31426#true} is VALID [2018-11-23 12:00:09,871 INFO L273 TraceCheckUtils]: 1: Hoare triple {31426#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {31426#true} is VALID [2018-11-23 12:00:09,871 INFO L273 TraceCheckUtils]: 2: Hoare triple {31426#true} assume true; {31426#true} is VALID [2018-11-23 12:00:09,871 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31426#true} {31426#true} #130#return; {31426#true} is VALID [2018-11-23 12:00:09,871 INFO L256 TraceCheckUtils]: 4: Hoare triple {31426#true} call #t~ret15 := main(); {31426#true} is VALID [2018-11-23 12:00:09,872 INFO L273 TraceCheckUtils]: 5: Hoare triple {31426#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {31428#(= main_~i~0 0)} is VALID [2018-11-23 12:00:09,873 INFO L273 TraceCheckUtils]: 6: Hoare triple {31428#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {31429#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,873 INFO L273 TraceCheckUtils]: 7: Hoare triple {31429#(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); {31429#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,874 INFO L273 TraceCheckUtils]: 8: Hoare triple {31429#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {31429#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,874 INFO L273 TraceCheckUtils]: 9: Hoare triple {31429#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {31430#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,875 INFO L273 TraceCheckUtils]: 10: Hoare triple {31430#(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); {31430#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,875 INFO L273 TraceCheckUtils]: 11: Hoare triple {31430#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {31430#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,876 INFO L273 TraceCheckUtils]: 12: Hoare triple {31430#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {31431#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,877 INFO L273 TraceCheckUtils]: 13: Hoare triple {31431#(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); {31431#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,877 INFO L273 TraceCheckUtils]: 14: Hoare triple {31431#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {31431#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,878 INFO L273 TraceCheckUtils]: 15: Hoare triple {31431#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {31432#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,879 INFO L273 TraceCheckUtils]: 16: Hoare triple {31432#(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); {31432#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,880 INFO L273 TraceCheckUtils]: 17: Hoare triple {31432#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {31432#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,881 INFO L273 TraceCheckUtils]: 18: Hoare triple {31432#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {31433#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,882 INFO L273 TraceCheckUtils]: 19: Hoare triple {31433#(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); {31433#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,883 INFO L273 TraceCheckUtils]: 20: Hoare triple {31433#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {31433#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,883 INFO L273 TraceCheckUtils]: 21: Hoare triple {31433#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {31434#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,884 INFO L273 TraceCheckUtils]: 22: Hoare triple {31434#(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); {31434#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,885 INFO L273 TraceCheckUtils]: 23: Hoare triple {31434#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {31434#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,886 INFO L273 TraceCheckUtils]: 24: Hoare triple {31434#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {31435#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,887 INFO L273 TraceCheckUtils]: 25: Hoare triple {31435#(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); {31435#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,887 INFO L273 TraceCheckUtils]: 26: Hoare triple {31435#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {31435#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,888 INFO L273 TraceCheckUtils]: 27: Hoare triple {31435#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {31436#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,889 INFO L273 TraceCheckUtils]: 28: Hoare triple {31436#(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); {31436#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,890 INFO L273 TraceCheckUtils]: 29: Hoare triple {31436#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {31436#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,891 INFO L273 TraceCheckUtils]: 30: Hoare triple {31436#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {31437#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,892 INFO L273 TraceCheckUtils]: 31: Hoare triple {31437#(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); {31437#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,892 INFO L273 TraceCheckUtils]: 32: Hoare triple {31437#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {31437#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,893 INFO L273 TraceCheckUtils]: 33: Hoare triple {31437#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {31438#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,894 INFO L273 TraceCheckUtils]: 34: Hoare triple {31438#(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); {31438#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,895 INFO L273 TraceCheckUtils]: 35: Hoare triple {31438#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {31438#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,895 INFO L273 TraceCheckUtils]: 36: Hoare triple {31438#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {31439#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,896 INFO L273 TraceCheckUtils]: 37: Hoare triple {31439#(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); {31439#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,897 INFO L273 TraceCheckUtils]: 38: Hoare triple {31439#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {31439#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,898 INFO L273 TraceCheckUtils]: 39: Hoare triple {31439#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {31440#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,899 INFO L273 TraceCheckUtils]: 40: Hoare triple {31440#(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); {31440#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,900 INFO L273 TraceCheckUtils]: 41: Hoare triple {31440#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {31440#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,900 INFO L273 TraceCheckUtils]: 42: Hoare triple {31440#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {31441#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,901 INFO L273 TraceCheckUtils]: 43: Hoare triple {31441#(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); {31441#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,902 INFO L273 TraceCheckUtils]: 44: Hoare triple {31441#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {31441#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,903 INFO L273 TraceCheckUtils]: 45: Hoare triple {31441#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {31442#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,904 INFO L273 TraceCheckUtils]: 46: Hoare triple {31442#(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); {31442#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,904 INFO L273 TraceCheckUtils]: 47: Hoare triple {31442#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {31442#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,905 INFO L273 TraceCheckUtils]: 48: Hoare triple {31442#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {31443#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,906 INFO L273 TraceCheckUtils]: 49: Hoare triple {31443#(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); {31443#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,907 INFO L273 TraceCheckUtils]: 50: Hoare triple {31443#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {31443#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,908 INFO L273 TraceCheckUtils]: 51: Hoare triple {31443#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {31444#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,909 INFO L273 TraceCheckUtils]: 52: Hoare triple {31444#(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); {31444#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,909 INFO L273 TraceCheckUtils]: 53: Hoare triple {31444#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {31444#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,910 INFO L273 TraceCheckUtils]: 54: Hoare triple {31444#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {31445#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 12:00:09,911 INFO L273 TraceCheckUtils]: 55: Hoare triple {31445#(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); {31445#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 12:00:09,912 INFO L273 TraceCheckUtils]: 56: Hoare triple {31445#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {31445#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 12:00:09,913 INFO L273 TraceCheckUtils]: 57: Hoare triple {31445#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} ~k~0 := 1 + ~k~0; {31446#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,913 INFO L273 TraceCheckUtils]: 58: Hoare triple {31446#(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); {31446#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,914 INFO L273 TraceCheckUtils]: 59: Hoare triple {31446#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {31446#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,915 INFO L273 TraceCheckUtils]: 60: Hoare triple {31446#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {31447#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,916 INFO L273 TraceCheckUtils]: 61: Hoare triple {31447#(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); {31447#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,916 INFO L273 TraceCheckUtils]: 62: Hoare triple {31447#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {31447#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,917 INFO L273 TraceCheckUtils]: 63: Hoare triple {31447#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {31448#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,918 INFO L273 TraceCheckUtils]: 64: Hoare triple {31448#(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); {31448#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,919 INFO L273 TraceCheckUtils]: 65: Hoare triple {31448#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {31448#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,920 INFO L273 TraceCheckUtils]: 66: Hoare triple {31448#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {31449#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,920 INFO L273 TraceCheckUtils]: 67: Hoare triple {31449#(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); {31449#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,921 INFO L273 TraceCheckUtils]: 68: Hoare triple {31449#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {31449#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,922 INFO L273 TraceCheckUtils]: 69: Hoare triple {31449#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {31450#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,923 INFO L273 TraceCheckUtils]: 70: Hoare triple {31450#(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); {31450#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,923 INFO L273 TraceCheckUtils]: 71: Hoare triple {31450#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {31450#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,924 INFO L273 TraceCheckUtils]: 72: Hoare triple {31450#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {31451#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,925 INFO L273 TraceCheckUtils]: 73: Hoare triple {31451#(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); {31451#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,926 INFO L273 TraceCheckUtils]: 74: Hoare triple {31451#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {31451#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,927 INFO L273 TraceCheckUtils]: 75: Hoare triple {31451#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {31452#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,927 INFO L273 TraceCheckUtils]: 76: Hoare triple {31452#(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); {31452#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,928 INFO L273 TraceCheckUtils]: 77: Hoare triple {31452#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {31452#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,929 INFO L273 TraceCheckUtils]: 78: Hoare triple {31452#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {31453#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,930 INFO L273 TraceCheckUtils]: 79: Hoare triple {31453#(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); {31453#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,931 INFO L273 TraceCheckUtils]: 80: Hoare triple {31453#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {31453#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,932 INFO L273 TraceCheckUtils]: 81: Hoare triple {31453#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {31454#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,951 INFO L273 TraceCheckUtils]: 82: Hoare triple {31454#(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); {31454#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,952 INFO L273 TraceCheckUtils]: 83: Hoare triple {31454#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {31454#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,953 INFO L273 TraceCheckUtils]: 84: Hoare triple {31454#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {31455#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,953 INFO L273 TraceCheckUtils]: 85: Hoare triple {31455#(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); {31455#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,954 INFO L273 TraceCheckUtils]: 86: Hoare triple {31455#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {31455#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,954 INFO L273 TraceCheckUtils]: 87: Hoare triple {31455#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {31456#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,955 INFO L273 TraceCheckUtils]: 88: Hoare triple {31456#(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); {31456#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,955 INFO L273 TraceCheckUtils]: 89: Hoare triple {31456#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {31456#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,956 INFO L273 TraceCheckUtils]: 90: Hoare triple {31456#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {31457#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,957 INFO L273 TraceCheckUtils]: 91: Hoare triple {31457#(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); {31457#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,957 INFO L273 TraceCheckUtils]: 92: Hoare triple {31457#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {31457#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,958 INFO L273 TraceCheckUtils]: 93: Hoare triple {31457#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {31458#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,959 INFO L273 TraceCheckUtils]: 94: Hoare triple {31458#(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); {31458#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,960 INFO L273 TraceCheckUtils]: 95: Hoare triple {31458#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {31458#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,961 INFO L273 TraceCheckUtils]: 96: Hoare triple {31458#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {31459#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:09,961 INFO L273 TraceCheckUtils]: 97: Hoare triple {31459#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} assume !(~k~0 < 100000); {31427#false} is VALID [2018-11-23 12:00:09,961 INFO L273 TraceCheckUtils]: 98: Hoare triple {31427#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); {31427#false} is VALID [2018-11-23 12:00:09,962 INFO L273 TraceCheckUtils]: 99: Hoare triple {31427#false} ~x~0 := 0; {31427#false} is VALID [2018-11-23 12:00:09,962 INFO L273 TraceCheckUtils]: 100: Hoare triple {31427#false} assume !(~x~0 < ~i~0); {31427#false} is VALID [2018-11-23 12:00:09,962 INFO L273 TraceCheckUtils]: 101: Hoare triple {31427#false} ~x~0 := ~i~0; {31427#false} is VALID [2018-11-23 12:00:09,962 INFO L273 TraceCheckUtils]: 102: Hoare triple {31427#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); {31427#false} is VALID [2018-11-23 12:00:09,962 INFO L256 TraceCheckUtils]: 103: Hoare triple {31427#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {31426#true} is VALID [2018-11-23 12:00:09,962 INFO L273 TraceCheckUtils]: 104: Hoare triple {31426#true} ~cond := #in~cond; {31426#true} is VALID [2018-11-23 12:00:09,963 INFO L273 TraceCheckUtils]: 105: Hoare triple {31426#true} assume !(0 == ~cond); {31426#true} is VALID [2018-11-23 12:00:09,963 INFO L273 TraceCheckUtils]: 106: Hoare triple {31426#true} assume true; {31426#true} is VALID [2018-11-23 12:00:09,963 INFO L268 TraceCheckUtils]: 107: Hoare quadruple {31426#true} {31427#false} #136#return; {31427#false} is VALID [2018-11-23 12:00:09,963 INFO L273 TraceCheckUtils]: 108: Hoare triple {31427#false} havoc #t~mem9;havoc #t~mem10; {31427#false} is VALID [2018-11-23 12:00:09,963 INFO L273 TraceCheckUtils]: 109: Hoare triple {31427#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {31427#false} is VALID [2018-11-23 12:00:09,964 INFO L273 TraceCheckUtils]: 110: Hoare triple {31427#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); {31427#false} is VALID [2018-11-23 12:00:09,964 INFO L256 TraceCheckUtils]: 111: Hoare triple {31427#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {31427#false} is VALID [2018-11-23 12:00:09,964 INFO L273 TraceCheckUtils]: 112: Hoare triple {31427#false} ~cond := #in~cond; {31427#false} is VALID [2018-11-23 12:00:09,964 INFO L273 TraceCheckUtils]: 113: Hoare triple {31427#false} assume 0 == ~cond; {31427#false} is VALID [2018-11-23 12:00:09,964 INFO L273 TraceCheckUtils]: 114: Hoare triple {31427#false} assume !false; {31427#false} is VALID [2018-11-23 12:00:09,983 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 12:00:09,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:09,984 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:00:09,994 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:00:10,055 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:00:10,055 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:00:10,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:10,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:11,932 INFO L256 TraceCheckUtils]: 0: Hoare triple {31426#true} call ULTIMATE.init(); {31426#true} is VALID [2018-11-23 12:00:11,932 INFO L273 TraceCheckUtils]: 1: Hoare triple {31426#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {31426#true} is VALID [2018-11-23 12:00:11,933 INFO L273 TraceCheckUtils]: 2: Hoare triple {31426#true} assume true; {31426#true} is VALID [2018-11-23 12:00:11,933 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31426#true} {31426#true} #130#return; {31426#true} is VALID [2018-11-23 12:00:11,933 INFO L256 TraceCheckUtils]: 4: Hoare triple {31426#true} call #t~ret15 := main(); {31426#true} is VALID [2018-11-23 12:00:11,933 INFO L273 TraceCheckUtils]: 5: Hoare triple {31426#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {31478#(<= main_~i~0 0)} is VALID [2018-11-23 12:00:11,934 INFO L273 TraceCheckUtils]: 6: Hoare triple {31478#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {31482#(<= main_~k~0 1)} is VALID [2018-11-23 12:00:11,934 INFO L273 TraceCheckUtils]: 7: Hoare triple {31482#(<= 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); {31482#(<= main_~k~0 1)} is VALID [2018-11-23 12:00:11,934 INFO L273 TraceCheckUtils]: 8: Hoare triple {31482#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {31482#(<= main_~k~0 1)} is VALID [2018-11-23 12:00:11,935 INFO L273 TraceCheckUtils]: 9: Hoare triple {31482#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {31492#(<= main_~k~0 2)} is VALID [2018-11-23 12:00:11,936 INFO L273 TraceCheckUtils]: 10: Hoare triple {31492#(<= 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); {31492#(<= main_~k~0 2)} is VALID [2018-11-23 12:00:11,936 INFO L273 TraceCheckUtils]: 11: Hoare triple {31492#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {31492#(<= main_~k~0 2)} is VALID [2018-11-23 12:00:11,937 INFO L273 TraceCheckUtils]: 12: Hoare triple {31492#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {31502#(<= main_~k~0 3)} is VALID [2018-11-23 12:00:11,937 INFO L273 TraceCheckUtils]: 13: Hoare triple {31502#(<= 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); {31502#(<= main_~k~0 3)} is VALID [2018-11-23 12:00:11,938 INFO L273 TraceCheckUtils]: 14: Hoare triple {31502#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {31502#(<= main_~k~0 3)} is VALID [2018-11-23 12:00:11,939 INFO L273 TraceCheckUtils]: 15: Hoare triple {31502#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {31512#(<= main_~k~0 4)} is VALID [2018-11-23 12:00:11,939 INFO L273 TraceCheckUtils]: 16: Hoare triple {31512#(<= 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); {31512#(<= main_~k~0 4)} is VALID [2018-11-23 12:00:11,940 INFO L273 TraceCheckUtils]: 17: Hoare triple {31512#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {31512#(<= main_~k~0 4)} is VALID [2018-11-23 12:00:11,940 INFO L273 TraceCheckUtils]: 18: Hoare triple {31512#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {31522#(<= main_~k~0 5)} is VALID [2018-11-23 12:00:11,941 INFO L273 TraceCheckUtils]: 19: Hoare triple {31522#(<= 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); {31522#(<= main_~k~0 5)} is VALID [2018-11-23 12:00:11,941 INFO L273 TraceCheckUtils]: 20: Hoare triple {31522#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {31522#(<= main_~k~0 5)} is VALID [2018-11-23 12:00:11,942 INFO L273 TraceCheckUtils]: 21: Hoare triple {31522#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {31532#(<= main_~k~0 6)} is VALID [2018-11-23 12:00:11,943 INFO L273 TraceCheckUtils]: 22: Hoare triple {31532#(<= 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); {31532#(<= main_~k~0 6)} is VALID [2018-11-23 12:00:11,943 INFO L273 TraceCheckUtils]: 23: Hoare triple {31532#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {31532#(<= main_~k~0 6)} is VALID [2018-11-23 12:00:11,944 INFO L273 TraceCheckUtils]: 24: Hoare triple {31532#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {31542#(<= main_~k~0 7)} is VALID [2018-11-23 12:00:11,944 INFO L273 TraceCheckUtils]: 25: Hoare triple {31542#(<= 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); {31542#(<= main_~k~0 7)} is VALID [2018-11-23 12:00:11,945 INFO L273 TraceCheckUtils]: 26: Hoare triple {31542#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {31542#(<= main_~k~0 7)} is VALID [2018-11-23 12:00:11,946 INFO L273 TraceCheckUtils]: 27: Hoare triple {31542#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {31552#(<= main_~k~0 8)} is VALID [2018-11-23 12:00:11,946 INFO L273 TraceCheckUtils]: 28: Hoare triple {31552#(<= 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); {31552#(<= main_~k~0 8)} is VALID [2018-11-23 12:00:11,947 INFO L273 TraceCheckUtils]: 29: Hoare triple {31552#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {31552#(<= main_~k~0 8)} is VALID [2018-11-23 12:00:11,947 INFO L273 TraceCheckUtils]: 30: Hoare triple {31552#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {31562#(<= main_~k~0 9)} is VALID [2018-11-23 12:00:11,948 INFO L273 TraceCheckUtils]: 31: Hoare triple {31562#(<= 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); {31562#(<= main_~k~0 9)} is VALID [2018-11-23 12:00:11,948 INFO L273 TraceCheckUtils]: 32: Hoare triple {31562#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {31562#(<= main_~k~0 9)} is VALID [2018-11-23 12:00:11,949 INFO L273 TraceCheckUtils]: 33: Hoare triple {31562#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {31572#(<= main_~k~0 10)} is VALID [2018-11-23 12:00:11,950 INFO L273 TraceCheckUtils]: 34: Hoare triple {31572#(<= 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); {31572#(<= main_~k~0 10)} is VALID [2018-11-23 12:00:11,950 INFO L273 TraceCheckUtils]: 35: Hoare triple {31572#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {31572#(<= main_~k~0 10)} is VALID [2018-11-23 12:00:11,951 INFO L273 TraceCheckUtils]: 36: Hoare triple {31572#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {31582#(<= main_~k~0 11)} is VALID [2018-11-23 12:00:11,951 INFO L273 TraceCheckUtils]: 37: Hoare triple {31582#(<= 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); {31582#(<= main_~k~0 11)} is VALID [2018-11-23 12:00:11,952 INFO L273 TraceCheckUtils]: 38: Hoare triple {31582#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {31582#(<= main_~k~0 11)} is VALID [2018-11-23 12:00:11,953 INFO L273 TraceCheckUtils]: 39: Hoare triple {31582#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {31592#(<= main_~k~0 12)} is VALID [2018-11-23 12:00:11,953 INFO L273 TraceCheckUtils]: 40: Hoare triple {31592#(<= 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); {31592#(<= main_~k~0 12)} is VALID [2018-11-23 12:00:11,954 INFO L273 TraceCheckUtils]: 41: Hoare triple {31592#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {31592#(<= main_~k~0 12)} is VALID [2018-11-23 12:00:11,954 INFO L273 TraceCheckUtils]: 42: Hoare triple {31592#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {31602#(<= main_~k~0 13)} is VALID [2018-11-23 12:00:11,955 INFO L273 TraceCheckUtils]: 43: Hoare triple {31602#(<= 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); {31602#(<= main_~k~0 13)} is VALID [2018-11-23 12:00:11,955 INFO L273 TraceCheckUtils]: 44: Hoare triple {31602#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {31602#(<= main_~k~0 13)} is VALID [2018-11-23 12:00:11,956 INFO L273 TraceCheckUtils]: 45: Hoare triple {31602#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {31612#(<= main_~k~0 14)} is VALID [2018-11-23 12:00:11,957 INFO L273 TraceCheckUtils]: 46: Hoare triple {31612#(<= 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); {31612#(<= main_~k~0 14)} is VALID [2018-11-23 12:00:11,957 INFO L273 TraceCheckUtils]: 47: Hoare triple {31612#(<= main_~k~0 14)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {31612#(<= main_~k~0 14)} is VALID [2018-11-23 12:00:11,958 INFO L273 TraceCheckUtils]: 48: Hoare triple {31612#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {31622#(<= main_~k~0 15)} is VALID [2018-11-23 12:00:11,958 INFO L273 TraceCheckUtils]: 49: Hoare triple {31622#(<= 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); {31622#(<= main_~k~0 15)} is VALID [2018-11-23 12:00:11,959 INFO L273 TraceCheckUtils]: 50: Hoare triple {31622#(<= main_~k~0 15)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {31622#(<= main_~k~0 15)} is VALID [2018-11-23 12:00:11,959 INFO L273 TraceCheckUtils]: 51: Hoare triple {31622#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {31632#(<= main_~k~0 16)} is VALID [2018-11-23 12:00:11,960 INFO L273 TraceCheckUtils]: 52: Hoare triple {31632#(<= 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); {31632#(<= main_~k~0 16)} is VALID [2018-11-23 12:00:11,960 INFO L273 TraceCheckUtils]: 53: Hoare triple {31632#(<= main_~k~0 16)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {31632#(<= main_~k~0 16)} is VALID [2018-11-23 12:00:11,961 INFO L273 TraceCheckUtils]: 54: Hoare triple {31632#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {31642#(<= main_~k~0 17)} is VALID [2018-11-23 12:00:11,962 INFO L273 TraceCheckUtils]: 55: Hoare triple {31642#(<= 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); {31642#(<= main_~k~0 17)} is VALID [2018-11-23 12:00:11,962 INFO L273 TraceCheckUtils]: 56: Hoare triple {31642#(<= main_~k~0 17)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {31642#(<= main_~k~0 17)} is VALID [2018-11-23 12:00:11,963 INFO L273 TraceCheckUtils]: 57: Hoare triple {31642#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {31652#(<= main_~k~0 18)} is VALID [2018-11-23 12:00:11,963 INFO L273 TraceCheckUtils]: 58: Hoare triple {31652#(<= 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); {31652#(<= main_~k~0 18)} is VALID [2018-11-23 12:00:11,964 INFO L273 TraceCheckUtils]: 59: Hoare triple {31652#(<= main_~k~0 18)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {31652#(<= main_~k~0 18)} is VALID [2018-11-23 12:00:11,965 INFO L273 TraceCheckUtils]: 60: Hoare triple {31652#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {31662#(<= main_~k~0 19)} is VALID [2018-11-23 12:00:11,965 INFO L273 TraceCheckUtils]: 61: Hoare triple {31662#(<= 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); {31662#(<= main_~k~0 19)} is VALID [2018-11-23 12:00:11,966 INFO L273 TraceCheckUtils]: 62: Hoare triple {31662#(<= main_~k~0 19)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {31662#(<= main_~k~0 19)} is VALID [2018-11-23 12:00:11,966 INFO L273 TraceCheckUtils]: 63: Hoare triple {31662#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {31672#(<= main_~k~0 20)} is VALID [2018-11-23 12:00:11,967 INFO L273 TraceCheckUtils]: 64: Hoare triple {31672#(<= 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); {31672#(<= main_~k~0 20)} is VALID [2018-11-23 12:00:11,967 INFO L273 TraceCheckUtils]: 65: Hoare triple {31672#(<= main_~k~0 20)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {31672#(<= main_~k~0 20)} is VALID [2018-11-23 12:00:11,968 INFO L273 TraceCheckUtils]: 66: Hoare triple {31672#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {31682#(<= main_~k~0 21)} is VALID [2018-11-23 12:00:11,969 INFO L273 TraceCheckUtils]: 67: Hoare triple {31682#(<= 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); {31682#(<= main_~k~0 21)} is VALID [2018-11-23 12:00:11,969 INFO L273 TraceCheckUtils]: 68: Hoare triple {31682#(<= main_~k~0 21)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {31682#(<= main_~k~0 21)} is VALID [2018-11-23 12:00:11,970 INFO L273 TraceCheckUtils]: 69: Hoare triple {31682#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {31692#(<= main_~k~0 22)} is VALID [2018-11-23 12:00:11,970 INFO L273 TraceCheckUtils]: 70: Hoare triple {31692#(<= 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); {31692#(<= main_~k~0 22)} is VALID [2018-11-23 12:00:11,971 INFO L273 TraceCheckUtils]: 71: Hoare triple {31692#(<= main_~k~0 22)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {31692#(<= main_~k~0 22)} is VALID [2018-11-23 12:00:11,972 INFO L273 TraceCheckUtils]: 72: Hoare triple {31692#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {31702#(<= main_~k~0 23)} is VALID [2018-11-23 12:00:11,972 INFO L273 TraceCheckUtils]: 73: Hoare triple {31702#(<= 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); {31702#(<= main_~k~0 23)} is VALID [2018-11-23 12:00:11,973 INFO L273 TraceCheckUtils]: 74: Hoare triple {31702#(<= main_~k~0 23)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {31702#(<= main_~k~0 23)} is VALID [2018-11-23 12:00:11,973 INFO L273 TraceCheckUtils]: 75: Hoare triple {31702#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {31712#(<= main_~k~0 24)} is VALID [2018-11-23 12:00:11,974 INFO L273 TraceCheckUtils]: 76: Hoare triple {31712#(<= 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); {31712#(<= main_~k~0 24)} is VALID [2018-11-23 12:00:11,974 INFO L273 TraceCheckUtils]: 77: Hoare triple {31712#(<= main_~k~0 24)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {31712#(<= main_~k~0 24)} is VALID [2018-11-23 12:00:11,975 INFO L273 TraceCheckUtils]: 78: Hoare triple {31712#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {31722#(<= main_~k~0 25)} is VALID [2018-11-23 12:00:11,976 INFO L273 TraceCheckUtils]: 79: Hoare triple {31722#(<= 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); {31722#(<= main_~k~0 25)} is VALID [2018-11-23 12:00:11,976 INFO L273 TraceCheckUtils]: 80: Hoare triple {31722#(<= main_~k~0 25)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {31722#(<= main_~k~0 25)} is VALID [2018-11-23 12:00:11,977 INFO L273 TraceCheckUtils]: 81: Hoare triple {31722#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {31732#(<= main_~k~0 26)} is VALID [2018-11-23 12:00:11,977 INFO L273 TraceCheckUtils]: 82: Hoare triple {31732#(<= 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); {31732#(<= main_~k~0 26)} is VALID [2018-11-23 12:00:11,978 INFO L273 TraceCheckUtils]: 83: Hoare triple {31732#(<= main_~k~0 26)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {31732#(<= main_~k~0 26)} is VALID [2018-11-23 12:00:11,979 INFO L273 TraceCheckUtils]: 84: Hoare triple {31732#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {31742#(<= main_~k~0 27)} is VALID [2018-11-23 12:00:11,979 INFO L273 TraceCheckUtils]: 85: Hoare triple {31742#(<= 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); {31742#(<= main_~k~0 27)} is VALID [2018-11-23 12:00:11,980 INFO L273 TraceCheckUtils]: 86: Hoare triple {31742#(<= main_~k~0 27)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {31742#(<= main_~k~0 27)} is VALID [2018-11-23 12:00:11,980 INFO L273 TraceCheckUtils]: 87: Hoare triple {31742#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {31752#(<= main_~k~0 28)} is VALID [2018-11-23 12:00:11,981 INFO L273 TraceCheckUtils]: 88: Hoare triple {31752#(<= 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); {31752#(<= main_~k~0 28)} is VALID [2018-11-23 12:00:11,981 INFO L273 TraceCheckUtils]: 89: Hoare triple {31752#(<= main_~k~0 28)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {31752#(<= main_~k~0 28)} is VALID [2018-11-23 12:00:11,982 INFO L273 TraceCheckUtils]: 90: Hoare triple {31752#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {31762#(<= main_~k~0 29)} is VALID [2018-11-23 12:00:11,983 INFO L273 TraceCheckUtils]: 91: Hoare triple {31762#(<= 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); {31762#(<= main_~k~0 29)} is VALID [2018-11-23 12:00:11,983 INFO L273 TraceCheckUtils]: 92: Hoare triple {31762#(<= main_~k~0 29)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {31762#(<= main_~k~0 29)} is VALID [2018-11-23 12:00:11,984 INFO L273 TraceCheckUtils]: 93: Hoare triple {31762#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {31772#(<= main_~k~0 30)} is VALID [2018-11-23 12:00:11,984 INFO L273 TraceCheckUtils]: 94: Hoare triple {31772#(<= 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); {31772#(<= main_~k~0 30)} is VALID [2018-11-23 12:00:11,985 INFO L273 TraceCheckUtils]: 95: Hoare triple {31772#(<= main_~k~0 30)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {31772#(<= main_~k~0 30)} is VALID [2018-11-23 12:00:11,986 INFO L273 TraceCheckUtils]: 96: Hoare triple {31772#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {31782#(<= main_~k~0 31)} is VALID [2018-11-23 12:00:11,986 INFO L273 TraceCheckUtils]: 97: Hoare triple {31782#(<= main_~k~0 31)} assume !(~k~0 < 100000); {31427#false} is VALID [2018-11-23 12:00:11,986 INFO L273 TraceCheckUtils]: 98: Hoare triple {31427#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); {31427#false} is VALID [2018-11-23 12:00:11,987 INFO L273 TraceCheckUtils]: 99: Hoare triple {31427#false} ~x~0 := 0; {31427#false} is VALID [2018-11-23 12:00:11,987 INFO L273 TraceCheckUtils]: 100: Hoare triple {31427#false} assume !(~x~0 < ~i~0); {31427#false} is VALID [2018-11-23 12:00:11,987 INFO L273 TraceCheckUtils]: 101: Hoare triple {31427#false} ~x~0 := ~i~0; {31427#false} is VALID [2018-11-23 12:00:11,987 INFO L273 TraceCheckUtils]: 102: Hoare triple {31427#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); {31427#false} is VALID [2018-11-23 12:00:11,987 INFO L256 TraceCheckUtils]: 103: Hoare triple {31427#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {31427#false} is VALID [2018-11-23 12:00:11,988 INFO L273 TraceCheckUtils]: 104: Hoare triple {31427#false} ~cond := #in~cond; {31427#false} is VALID [2018-11-23 12:00:11,988 INFO L273 TraceCheckUtils]: 105: Hoare triple {31427#false} assume !(0 == ~cond); {31427#false} is VALID [2018-11-23 12:00:11,988 INFO L273 TraceCheckUtils]: 106: Hoare triple {31427#false} assume true; {31427#false} is VALID [2018-11-23 12:00:11,988 INFO L268 TraceCheckUtils]: 107: Hoare quadruple {31427#false} {31427#false} #136#return; {31427#false} is VALID [2018-11-23 12:00:11,988 INFO L273 TraceCheckUtils]: 108: Hoare triple {31427#false} havoc #t~mem9;havoc #t~mem10; {31427#false} is VALID [2018-11-23 12:00:11,988 INFO L273 TraceCheckUtils]: 109: Hoare triple {31427#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {31427#false} is VALID [2018-11-23 12:00:11,989 INFO L273 TraceCheckUtils]: 110: Hoare triple {31427#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); {31427#false} is VALID [2018-11-23 12:00:11,989 INFO L256 TraceCheckUtils]: 111: Hoare triple {31427#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {31427#false} is VALID [2018-11-23 12:00:11,989 INFO L273 TraceCheckUtils]: 112: Hoare triple {31427#false} ~cond := #in~cond; {31427#false} is VALID [2018-11-23 12:00:11,989 INFO L273 TraceCheckUtils]: 113: Hoare triple {31427#false} assume 0 == ~cond; {31427#false} is VALID [2018-11-23 12:00:11,989 INFO L273 TraceCheckUtils]: 114: Hoare triple {31427#false} assume !false; {31427#false} is VALID [2018-11-23 12:00:11,998 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 12:00:12,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:12,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 66 [2018-11-23 12:00:12,017 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 115 [2018-11-23 12:00:12,018 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:12,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 66 states. [2018-11-23 12:00:12,230 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 210 edges. 210 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:12,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-11-23 12:00:12,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-11-23 12:00:12,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1618, Invalid=2672, Unknown=0, NotChecked=0, Total=4290 [2018-11-23 12:00:12,232 INFO L87 Difference]: Start difference. First operand 234 states and 309 transitions. Second operand 66 states. [2018-11-23 12:00:13,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:13,350 INFO L93 Difference]: Finished difference Result 297 states and 395 transitions. [2018-11-23 12:00:13,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 12:00:13,350 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 115 [2018-11-23 12:00:13,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:13,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 12:00:13,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 231 transitions. [2018-11-23 12:00:13,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 12:00:13,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 231 transitions. [2018-11-23 12:00:13,354 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 231 transitions. [2018-11-23 12:00:13,579 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 12:00:13,584 INFO L225 Difference]: With dead ends: 297 [2018-11-23 12:00:13,584 INFO L226 Difference]: Without dead ends: 250 [2018-11-23 12:00:13,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1489 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1618, Invalid=2672, Unknown=0, NotChecked=0, Total=4290 [2018-11-23 12:00:13,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-11-23 12:00:13,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 240. [2018-11-23 12:00:13,735 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:13,736 INFO L82 GeneralOperation]: Start isEquivalent. First operand 250 states. Second operand 240 states. [2018-11-23 12:00:13,736 INFO L74 IsIncluded]: Start isIncluded. First operand 250 states. Second operand 240 states. [2018-11-23 12:00:13,736 INFO L87 Difference]: Start difference. First operand 250 states. Second operand 240 states. [2018-11-23 12:00:13,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:13,741 INFO L93 Difference]: Finished difference Result 250 states and 332 transitions. [2018-11-23 12:00:13,741 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 332 transitions. [2018-11-23 12:00:13,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:13,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:13,742 INFO L74 IsIncluded]: Start isIncluded. First operand 240 states. Second operand 250 states. [2018-11-23 12:00:13,742 INFO L87 Difference]: Start difference. First operand 240 states. Second operand 250 states. [2018-11-23 12:00:13,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:13,747 INFO L93 Difference]: Finished difference Result 250 states and 332 transitions. [2018-11-23 12:00:13,747 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 332 transitions. [2018-11-23 12:00:13,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:13,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:13,747 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:13,747 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:13,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-11-23 12:00:13,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 317 transitions. [2018-11-23 12:00:13,751 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 317 transitions. Word has length 115 [2018-11-23 12:00:13,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:13,752 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 317 transitions. [2018-11-23 12:00:13,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-11-23 12:00:13,752 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 317 transitions. [2018-11-23 12:00:13,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-23 12:00:13,753 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:13,753 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 12:00:13,753 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:13,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:13,753 INFO L82 PathProgramCache]: Analyzing trace with hash -820914991, now seen corresponding path program 27 times [2018-11-23 12:00:13,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:13,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:13,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:13,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:00:13,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:13,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:15,350 INFO L256 TraceCheckUtils]: 0: Hoare triple {33063#true} call ULTIMATE.init(); {33063#true} is VALID [2018-11-23 12:00:15,351 INFO L273 TraceCheckUtils]: 1: Hoare triple {33063#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {33063#true} is VALID [2018-11-23 12:00:15,351 INFO L273 TraceCheckUtils]: 2: Hoare triple {33063#true} assume true; {33063#true} is VALID [2018-11-23 12:00:15,351 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33063#true} {33063#true} #130#return; {33063#true} is VALID [2018-11-23 12:00:15,351 INFO L256 TraceCheckUtils]: 4: Hoare triple {33063#true} call #t~ret15 := main(); {33063#true} is VALID [2018-11-23 12:00:15,351 INFO L273 TraceCheckUtils]: 5: Hoare triple {33063#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {33065#(= main_~i~0 0)} is VALID [2018-11-23 12:00:15,352 INFO L273 TraceCheckUtils]: 6: Hoare triple {33065#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {33066#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,353 INFO L273 TraceCheckUtils]: 7: Hoare triple {33066#(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); {33066#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,354 INFO L273 TraceCheckUtils]: 8: Hoare triple {33066#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33066#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,355 INFO L273 TraceCheckUtils]: 9: Hoare triple {33066#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {33067#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,355 INFO L273 TraceCheckUtils]: 10: Hoare triple {33067#(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); {33067#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,356 INFO L273 TraceCheckUtils]: 11: Hoare triple {33067#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33067#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,357 INFO L273 TraceCheckUtils]: 12: Hoare triple {33067#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {33068#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,358 INFO L273 TraceCheckUtils]: 13: Hoare triple {33068#(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); {33068#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,359 INFO L273 TraceCheckUtils]: 14: Hoare triple {33068#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33068#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,359 INFO L273 TraceCheckUtils]: 15: Hoare triple {33068#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {33069#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,360 INFO L273 TraceCheckUtils]: 16: Hoare triple {33069#(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); {33069#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,361 INFO L273 TraceCheckUtils]: 17: Hoare triple {33069#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33069#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,362 INFO L273 TraceCheckUtils]: 18: Hoare triple {33069#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {33070#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,363 INFO L273 TraceCheckUtils]: 19: Hoare triple {33070#(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); {33070#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,364 INFO L273 TraceCheckUtils]: 20: Hoare triple {33070#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33070#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,364 INFO L273 TraceCheckUtils]: 21: Hoare triple {33070#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {33071#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,365 INFO L273 TraceCheckUtils]: 22: Hoare triple {33071#(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); {33071#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,366 INFO L273 TraceCheckUtils]: 23: Hoare triple {33071#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33071#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,367 INFO L273 TraceCheckUtils]: 24: Hoare triple {33071#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {33072#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,368 INFO L273 TraceCheckUtils]: 25: Hoare triple {33072#(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); {33072#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,368 INFO L273 TraceCheckUtils]: 26: Hoare triple {33072#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33072#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,369 INFO L273 TraceCheckUtils]: 27: Hoare triple {33072#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {33073#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,370 INFO L273 TraceCheckUtils]: 28: Hoare triple {33073#(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); {33073#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,371 INFO L273 TraceCheckUtils]: 29: Hoare triple {33073#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33073#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,372 INFO L273 TraceCheckUtils]: 30: Hoare triple {33073#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {33074#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,372 INFO L273 TraceCheckUtils]: 31: Hoare triple {33074#(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); {33074#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,373 INFO L273 TraceCheckUtils]: 32: Hoare triple {33074#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33074#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,374 INFO L273 TraceCheckUtils]: 33: Hoare triple {33074#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {33075#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,375 INFO L273 TraceCheckUtils]: 34: Hoare triple {33075#(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); {33075#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,375 INFO L273 TraceCheckUtils]: 35: Hoare triple {33075#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33075#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,376 INFO L273 TraceCheckUtils]: 36: Hoare triple {33075#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {33076#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,377 INFO L273 TraceCheckUtils]: 37: Hoare triple {33076#(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); {33076#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,378 INFO L273 TraceCheckUtils]: 38: Hoare triple {33076#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33076#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,379 INFO L273 TraceCheckUtils]: 39: Hoare triple {33076#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {33077#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,380 INFO L273 TraceCheckUtils]: 40: Hoare triple {33077#(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); {33077#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,380 INFO L273 TraceCheckUtils]: 41: Hoare triple {33077#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33077#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,381 INFO L273 TraceCheckUtils]: 42: Hoare triple {33077#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {33078#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,382 INFO L273 TraceCheckUtils]: 43: Hoare triple {33078#(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); {33078#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,383 INFO L273 TraceCheckUtils]: 44: Hoare triple {33078#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33078#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,384 INFO L273 TraceCheckUtils]: 45: Hoare triple {33078#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {33079#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,384 INFO L273 TraceCheckUtils]: 46: Hoare triple {33079#(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); {33079#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,385 INFO L273 TraceCheckUtils]: 47: Hoare triple {33079#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33079#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,386 INFO L273 TraceCheckUtils]: 48: Hoare triple {33079#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {33080#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,387 INFO L273 TraceCheckUtils]: 49: Hoare triple {33080#(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); {33080#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,388 INFO L273 TraceCheckUtils]: 50: Hoare triple {33080#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33080#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,388 INFO L273 TraceCheckUtils]: 51: Hoare triple {33080#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {33081#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,389 INFO L273 TraceCheckUtils]: 52: Hoare triple {33081#(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); {33081#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,390 INFO L273 TraceCheckUtils]: 53: Hoare triple {33081#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33081#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,391 INFO L273 TraceCheckUtils]: 54: Hoare triple {33081#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {33082#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 12:00:15,392 INFO L273 TraceCheckUtils]: 55: Hoare triple {33082#(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); {33082#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 12:00:15,393 INFO L273 TraceCheckUtils]: 56: Hoare triple {33082#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33082#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 12:00:15,394 INFO L273 TraceCheckUtils]: 57: Hoare triple {33082#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} ~k~0 := 1 + ~k~0; {33083#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,394 INFO L273 TraceCheckUtils]: 58: Hoare triple {33083#(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); {33083#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,395 INFO L273 TraceCheckUtils]: 59: Hoare triple {33083#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33083#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,396 INFO L273 TraceCheckUtils]: 60: Hoare triple {33083#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {33084#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,397 INFO L273 TraceCheckUtils]: 61: Hoare triple {33084#(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); {33084#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,397 INFO L273 TraceCheckUtils]: 62: Hoare triple {33084#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33084#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,398 INFO L273 TraceCheckUtils]: 63: Hoare triple {33084#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {33085#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,399 INFO L273 TraceCheckUtils]: 64: Hoare triple {33085#(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); {33085#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,400 INFO L273 TraceCheckUtils]: 65: Hoare triple {33085#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33085#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,401 INFO L273 TraceCheckUtils]: 66: Hoare triple {33085#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {33086#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,401 INFO L273 TraceCheckUtils]: 67: Hoare triple {33086#(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); {33086#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,402 INFO L273 TraceCheckUtils]: 68: Hoare triple {33086#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33086#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,403 INFO L273 TraceCheckUtils]: 69: Hoare triple {33086#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {33087#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,404 INFO L273 TraceCheckUtils]: 70: Hoare triple {33087#(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); {33087#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,404 INFO L273 TraceCheckUtils]: 71: Hoare triple {33087#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33087#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,405 INFO L273 TraceCheckUtils]: 72: Hoare triple {33087#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {33088#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,406 INFO L273 TraceCheckUtils]: 73: Hoare triple {33088#(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); {33088#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,407 INFO L273 TraceCheckUtils]: 74: Hoare triple {33088#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33088#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,408 INFO L273 TraceCheckUtils]: 75: Hoare triple {33088#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {33089#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,409 INFO L273 TraceCheckUtils]: 76: Hoare triple {33089#(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); {33089#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,409 INFO L273 TraceCheckUtils]: 77: Hoare triple {33089#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33089#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,410 INFO L273 TraceCheckUtils]: 78: Hoare triple {33089#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {33090#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,411 INFO L273 TraceCheckUtils]: 79: Hoare triple {33090#(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); {33090#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,412 INFO L273 TraceCheckUtils]: 80: Hoare triple {33090#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33090#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,413 INFO L273 TraceCheckUtils]: 81: Hoare triple {33090#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {33091#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,414 INFO L273 TraceCheckUtils]: 82: Hoare triple {33091#(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); {33091#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,414 INFO L273 TraceCheckUtils]: 83: Hoare triple {33091#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33091#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,415 INFO L273 TraceCheckUtils]: 84: Hoare triple {33091#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {33092#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,416 INFO L273 TraceCheckUtils]: 85: Hoare triple {33092#(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); {33092#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,417 INFO L273 TraceCheckUtils]: 86: Hoare triple {33092#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33092#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,417 INFO L273 TraceCheckUtils]: 87: Hoare triple {33092#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {33093#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,418 INFO L273 TraceCheckUtils]: 88: Hoare triple {33093#(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); {33093#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,419 INFO L273 TraceCheckUtils]: 89: Hoare triple {33093#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33093#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,420 INFO L273 TraceCheckUtils]: 90: Hoare triple {33093#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {33094#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,421 INFO L273 TraceCheckUtils]: 91: Hoare triple {33094#(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); {33094#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,422 INFO L273 TraceCheckUtils]: 92: Hoare triple {33094#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33094#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,423 INFO L273 TraceCheckUtils]: 93: Hoare triple {33094#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {33095#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,424 INFO L273 TraceCheckUtils]: 94: Hoare triple {33095#(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); {33095#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,424 INFO L273 TraceCheckUtils]: 95: Hoare triple {33095#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33095#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,425 INFO L273 TraceCheckUtils]: 96: Hoare triple {33095#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {33096#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,426 INFO L273 TraceCheckUtils]: 97: Hoare triple {33096#(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); {33096#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,427 INFO L273 TraceCheckUtils]: 98: Hoare triple {33096#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33096#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,428 INFO L273 TraceCheckUtils]: 99: Hoare triple {33096#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {33097#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:15,429 INFO L273 TraceCheckUtils]: 100: Hoare triple {33097#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} assume !(~k~0 < 100000); {33064#false} is VALID [2018-11-23 12:00:15,429 INFO L273 TraceCheckUtils]: 101: Hoare triple {33064#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); {33064#false} is VALID [2018-11-23 12:00:15,429 INFO L273 TraceCheckUtils]: 102: Hoare triple {33064#false} ~x~0 := 0; {33064#false} is VALID [2018-11-23 12:00:15,429 INFO L273 TraceCheckUtils]: 103: Hoare triple {33064#false} assume !(~x~0 < ~i~0); {33064#false} is VALID [2018-11-23 12:00:15,429 INFO L273 TraceCheckUtils]: 104: Hoare triple {33064#false} ~x~0 := ~i~0; {33064#false} is VALID [2018-11-23 12:00:15,430 INFO L273 TraceCheckUtils]: 105: Hoare triple {33064#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); {33064#false} is VALID [2018-11-23 12:00:15,430 INFO L256 TraceCheckUtils]: 106: Hoare triple {33064#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {33063#true} is VALID [2018-11-23 12:00:15,430 INFO L273 TraceCheckUtils]: 107: Hoare triple {33063#true} ~cond := #in~cond; {33063#true} is VALID [2018-11-23 12:00:15,430 INFO L273 TraceCheckUtils]: 108: Hoare triple {33063#true} assume !(0 == ~cond); {33063#true} is VALID [2018-11-23 12:00:15,430 INFO L273 TraceCheckUtils]: 109: Hoare triple {33063#true} assume true; {33063#true} is VALID [2018-11-23 12:00:15,430 INFO L268 TraceCheckUtils]: 110: Hoare quadruple {33063#true} {33064#false} #136#return; {33064#false} is VALID [2018-11-23 12:00:15,431 INFO L273 TraceCheckUtils]: 111: Hoare triple {33064#false} havoc #t~mem9;havoc #t~mem10; {33064#false} is VALID [2018-11-23 12:00:15,431 INFO L273 TraceCheckUtils]: 112: Hoare triple {33064#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {33064#false} is VALID [2018-11-23 12:00:15,431 INFO L273 TraceCheckUtils]: 113: Hoare triple {33064#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); {33064#false} is VALID [2018-11-23 12:00:15,431 INFO L256 TraceCheckUtils]: 114: Hoare triple {33064#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {33064#false} is VALID [2018-11-23 12:00:15,431 INFO L273 TraceCheckUtils]: 115: Hoare triple {33064#false} ~cond := #in~cond; {33064#false} is VALID [2018-11-23 12:00:15,432 INFO L273 TraceCheckUtils]: 116: Hoare triple {33064#false} assume 0 == ~cond; {33064#false} is VALID [2018-11-23 12:00:15,432 INFO L273 TraceCheckUtils]: 117: Hoare triple {33064#false} assume !false; {33064#false} is VALID [2018-11-23 12:00:15,453 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 12:00:15,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:15,453 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:00:15,461 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:00:15,625 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-11-23 12:00:15,626 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:00:15,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:15,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:16,618 INFO L256 TraceCheckUtils]: 0: Hoare triple {33063#true} call ULTIMATE.init(); {33063#true} is VALID [2018-11-23 12:00:16,618 INFO L273 TraceCheckUtils]: 1: Hoare triple {33063#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {33063#true} is VALID [2018-11-23 12:00:16,618 INFO L273 TraceCheckUtils]: 2: Hoare triple {33063#true} assume true; {33063#true} is VALID [2018-11-23 12:00:16,619 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33063#true} {33063#true} #130#return; {33063#true} is VALID [2018-11-23 12:00:16,619 INFO L256 TraceCheckUtils]: 4: Hoare triple {33063#true} call #t~ret15 := main(); {33063#true} is VALID [2018-11-23 12:00:16,619 INFO L273 TraceCheckUtils]: 5: Hoare triple {33063#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {33116#(<= main_~i~0 0)} is VALID [2018-11-23 12:00:16,620 INFO L273 TraceCheckUtils]: 6: Hoare triple {33116#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {33120#(<= main_~k~0 1)} is VALID [2018-11-23 12:00:16,620 INFO L273 TraceCheckUtils]: 7: Hoare triple {33120#(<= 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); {33120#(<= main_~k~0 1)} is VALID [2018-11-23 12:00:16,621 INFO L273 TraceCheckUtils]: 8: Hoare triple {33120#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33120#(<= main_~k~0 1)} is VALID [2018-11-23 12:00:16,621 INFO L273 TraceCheckUtils]: 9: Hoare triple {33120#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {33130#(<= main_~k~0 2)} is VALID [2018-11-23 12:00:16,621 INFO L273 TraceCheckUtils]: 10: Hoare triple {33130#(<= 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); {33130#(<= main_~k~0 2)} is VALID [2018-11-23 12:00:16,622 INFO L273 TraceCheckUtils]: 11: Hoare triple {33130#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33130#(<= main_~k~0 2)} is VALID [2018-11-23 12:00:16,622 INFO L273 TraceCheckUtils]: 12: Hoare triple {33130#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {33140#(<= main_~k~0 3)} is VALID [2018-11-23 12:00:16,623 INFO L273 TraceCheckUtils]: 13: Hoare triple {33140#(<= 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); {33140#(<= main_~k~0 3)} is VALID [2018-11-23 12:00:16,623 INFO L273 TraceCheckUtils]: 14: Hoare triple {33140#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33140#(<= main_~k~0 3)} is VALID [2018-11-23 12:00:16,624 INFO L273 TraceCheckUtils]: 15: Hoare triple {33140#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {33150#(<= main_~k~0 4)} is VALID [2018-11-23 12:00:16,624 INFO L273 TraceCheckUtils]: 16: Hoare triple {33150#(<= 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); {33150#(<= main_~k~0 4)} is VALID [2018-11-23 12:00:16,625 INFO L273 TraceCheckUtils]: 17: Hoare triple {33150#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33150#(<= main_~k~0 4)} is VALID [2018-11-23 12:00:16,626 INFO L273 TraceCheckUtils]: 18: Hoare triple {33150#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {33160#(<= main_~k~0 5)} is VALID [2018-11-23 12:00:16,626 INFO L273 TraceCheckUtils]: 19: Hoare triple {33160#(<= 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); {33160#(<= main_~k~0 5)} is VALID [2018-11-23 12:00:16,627 INFO L273 TraceCheckUtils]: 20: Hoare triple {33160#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33160#(<= main_~k~0 5)} is VALID [2018-11-23 12:00:16,627 INFO L273 TraceCheckUtils]: 21: Hoare triple {33160#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {33170#(<= main_~k~0 6)} is VALID [2018-11-23 12:00:16,628 INFO L273 TraceCheckUtils]: 22: Hoare triple {33170#(<= 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); {33170#(<= main_~k~0 6)} is VALID [2018-11-23 12:00:16,628 INFO L273 TraceCheckUtils]: 23: Hoare triple {33170#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33170#(<= main_~k~0 6)} is VALID [2018-11-23 12:00:16,629 INFO L273 TraceCheckUtils]: 24: Hoare triple {33170#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {33180#(<= main_~k~0 7)} is VALID [2018-11-23 12:00:16,630 INFO L273 TraceCheckUtils]: 25: Hoare triple {33180#(<= 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); {33180#(<= main_~k~0 7)} is VALID [2018-11-23 12:00:16,630 INFO L273 TraceCheckUtils]: 26: Hoare triple {33180#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33180#(<= main_~k~0 7)} is VALID [2018-11-23 12:00:16,631 INFO L273 TraceCheckUtils]: 27: Hoare triple {33180#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {33190#(<= main_~k~0 8)} is VALID [2018-11-23 12:00:16,632 INFO L273 TraceCheckUtils]: 28: Hoare triple {33190#(<= 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); {33190#(<= main_~k~0 8)} is VALID [2018-11-23 12:00:16,632 INFO L273 TraceCheckUtils]: 29: Hoare triple {33190#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33190#(<= main_~k~0 8)} is VALID [2018-11-23 12:00:16,633 INFO L273 TraceCheckUtils]: 30: Hoare triple {33190#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {33200#(<= main_~k~0 9)} is VALID [2018-11-23 12:00:16,633 INFO L273 TraceCheckUtils]: 31: Hoare triple {33200#(<= 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); {33200#(<= main_~k~0 9)} is VALID [2018-11-23 12:00:16,634 INFO L273 TraceCheckUtils]: 32: Hoare triple {33200#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33200#(<= main_~k~0 9)} is VALID [2018-11-23 12:00:16,635 INFO L273 TraceCheckUtils]: 33: Hoare triple {33200#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {33210#(<= main_~k~0 10)} is VALID [2018-11-23 12:00:16,635 INFO L273 TraceCheckUtils]: 34: Hoare triple {33210#(<= 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); {33210#(<= main_~k~0 10)} is VALID [2018-11-23 12:00:16,636 INFO L273 TraceCheckUtils]: 35: Hoare triple {33210#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33210#(<= main_~k~0 10)} is VALID [2018-11-23 12:00:16,636 INFO L273 TraceCheckUtils]: 36: Hoare triple {33210#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {33220#(<= main_~k~0 11)} is VALID [2018-11-23 12:00:16,637 INFO L273 TraceCheckUtils]: 37: Hoare triple {33220#(<= 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); {33220#(<= main_~k~0 11)} is VALID [2018-11-23 12:00:16,637 INFO L273 TraceCheckUtils]: 38: Hoare triple {33220#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33220#(<= main_~k~0 11)} is VALID [2018-11-23 12:00:16,638 INFO L273 TraceCheckUtils]: 39: Hoare triple {33220#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {33230#(<= main_~k~0 12)} is VALID [2018-11-23 12:00:16,639 INFO L273 TraceCheckUtils]: 40: Hoare triple {33230#(<= 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); {33230#(<= main_~k~0 12)} is VALID [2018-11-23 12:00:16,639 INFO L273 TraceCheckUtils]: 41: Hoare triple {33230#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33230#(<= main_~k~0 12)} is VALID [2018-11-23 12:00:16,640 INFO L273 TraceCheckUtils]: 42: Hoare triple {33230#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {33240#(<= main_~k~0 13)} is VALID [2018-11-23 12:00:16,640 INFO L273 TraceCheckUtils]: 43: Hoare triple {33240#(<= 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); {33240#(<= main_~k~0 13)} is VALID [2018-11-23 12:00:16,641 INFO L273 TraceCheckUtils]: 44: Hoare triple {33240#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33240#(<= main_~k~0 13)} is VALID [2018-11-23 12:00:16,642 INFO L273 TraceCheckUtils]: 45: Hoare triple {33240#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {33250#(<= main_~k~0 14)} is VALID [2018-11-23 12:00:16,642 INFO L273 TraceCheckUtils]: 46: Hoare triple {33250#(<= 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); {33250#(<= main_~k~0 14)} is VALID [2018-11-23 12:00:16,643 INFO L273 TraceCheckUtils]: 47: Hoare triple {33250#(<= main_~k~0 14)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33250#(<= main_~k~0 14)} is VALID [2018-11-23 12:00:16,643 INFO L273 TraceCheckUtils]: 48: Hoare triple {33250#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {33260#(<= main_~k~0 15)} is VALID [2018-11-23 12:00:16,644 INFO L273 TraceCheckUtils]: 49: Hoare triple {33260#(<= 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); {33260#(<= main_~k~0 15)} is VALID [2018-11-23 12:00:16,644 INFO L273 TraceCheckUtils]: 50: Hoare triple {33260#(<= main_~k~0 15)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33260#(<= main_~k~0 15)} is VALID [2018-11-23 12:00:16,645 INFO L273 TraceCheckUtils]: 51: Hoare triple {33260#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {33270#(<= main_~k~0 16)} is VALID [2018-11-23 12:00:16,646 INFO L273 TraceCheckUtils]: 52: Hoare triple {33270#(<= 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); {33270#(<= main_~k~0 16)} is VALID [2018-11-23 12:00:16,646 INFO L273 TraceCheckUtils]: 53: Hoare triple {33270#(<= main_~k~0 16)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33270#(<= main_~k~0 16)} is VALID [2018-11-23 12:00:16,647 INFO L273 TraceCheckUtils]: 54: Hoare triple {33270#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {33280#(<= main_~k~0 17)} is VALID [2018-11-23 12:00:16,647 INFO L273 TraceCheckUtils]: 55: Hoare triple {33280#(<= 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); {33280#(<= main_~k~0 17)} is VALID [2018-11-23 12:00:16,648 INFO L273 TraceCheckUtils]: 56: Hoare triple {33280#(<= main_~k~0 17)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33280#(<= main_~k~0 17)} is VALID [2018-11-23 12:00:16,649 INFO L273 TraceCheckUtils]: 57: Hoare triple {33280#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {33290#(<= main_~k~0 18)} is VALID [2018-11-23 12:00:16,649 INFO L273 TraceCheckUtils]: 58: Hoare triple {33290#(<= 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); {33290#(<= main_~k~0 18)} is VALID [2018-11-23 12:00:16,650 INFO L273 TraceCheckUtils]: 59: Hoare triple {33290#(<= main_~k~0 18)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33290#(<= main_~k~0 18)} is VALID [2018-11-23 12:00:16,650 INFO L273 TraceCheckUtils]: 60: Hoare triple {33290#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {33300#(<= main_~k~0 19)} is VALID [2018-11-23 12:00:16,651 INFO L273 TraceCheckUtils]: 61: Hoare triple {33300#(<= 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); {33300#(<= main_~k~0 19)} is VALID [2018-11-23 12:00:16,651 INFO L273 TraceCheckUtils]: 62: Hoare triple {33300#(<= main_~k~0 19)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33300#(<= main_~k~0 19)} is VALID [2018-11-23 12:00:16,652 INFO L273 TraceCheckUtils]: 63: Hoare triple {33300#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {33310#(<= main_~k~0 20)} is VALID [2018-11-23 12:00:16,653 INFO L273 TraceCheckUtils]: 64: Hoare triple {33310#(<= 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); {33310#(<= main_~k~0 20)} is VALID [2018-11-23 12:00:16,653 INFO L273 TraceCheckUtils]: 65: Hoare triple {33310#(<= main_~k~0 20)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33310#(<= main_~k~0 20)} is VALID [2018-11-23 12:00:16,654 INFO L273 TraceCheckUtils]: 66: Hoare triple {33310#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {33320#(<= main_~k~0 21)} is VALID [2018-11-23 12:00:16,654 INFO L273 TraceCheckUtils]: 67: Hoare triple {33320#(<= 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); {33320#(<= main_~k~0 21)} is VALID [2018-11-23 12:00:16,655 INFO L273 TraceCheckUtils]: 68: Hoare triple {33320#(<= main_~k~0 21)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33320#(<= main_~k~0 21)} is VALID [2018-11-23 12:00:16,656 INFO L273 TraceCheckUtils]: 69: Hoare triple {33320#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {33330#(<= main_~k~0 22)} is VALID [2018-11-23 12:00:16,656 INFO L273 TraceCheckUtils]: 70: Hoare triple {33330#(<= 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); {33330#(<= main_~k~0 22)} is VALID [2018-11-23 12:00:16,657 INFO L273 TraceCheckUtils]: 71: Hoare triple {33330#(<= main_~k~0 22)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33330#(<= main_~k~0 22)} is VALID [2018-11-23 12:00:16,657 INFO L273 TraceCheckUtils]: 72: Hoare triple {33330#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {33340#(<= main_~k~0 23)} is VALID [2018-11-23 12:00:16,658 INFO L273 TraceCheckUtils]: 73: Hoare triple {33340#(<= 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); {33340#(<= main_~k~0 23)} is VALID [2018-11-23 12:00:16,659 INFO L273 TraceCheckUtils]: 74: Hoare triple {33340#(<= main_~k~0 23)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33340#(<= main_~k~0 23)} is VALID [2018-11-23 12:00:16,659 INFO L273 TraceCheckUtils]: 75: Hoare triple {33340#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {33350#(<= main_~k~0 24)} is VALID [2018-11-23 12:00:16,660 INFO L273 TraceCheckUtils]: 76: Hoare triple {33350#(<= 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); {33350#(<= main_~k~0 24)} is VALID [2018-11-23 12:00:16,660 INFO L273 TraceCheckUtils]: 77: Hoare triple {33350#(<= main_~k~0 24)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33350#(<= main_~k~0 24)} is VALID [2018-11-23 12:00:16,661 INFO L273 TraceCheckUtils]: 78: Hoare triple {33350#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {33360#(<= main_~k~0 25)} is VALID [2018-11-23 12:00:16,662 INFO L273 TraceCheckUtils]: 79: Hoare triple {33360#(<= 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); {33360#(<= main_~k~0 25)} is VALID [2018-11-23 12:00:16,662 INFO L273 TraceCheckUtils]: 80: Hoare triple {33360#(<= main_~k~0 25)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33360#(<= main_~k~0 25)} is VALID [2018-11-23 12:00:16,663 INFO L273 TraceCheckUtils]: 81: Hoare triple {33360#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {33370#(<= main_~k~0 26)} is VALID [2018-11-23 12:00:16,663 INFO L273 TraceCheckUtils]: 82: Hoare triple {33370#(<= 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); {33370#(<= main_~k~0 26)} is VALID [2018-11-23 12:00:16,664 INFO L273 TraceCheckUtils]: 83: Hoare triple {33370#(<= main_~k~0 26)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33370#(<= main_~k~0 26)} is VALID [2018-11-23 12:00:16,665 INFO L273 TraceCheckUtils]: 84: Hoare triple {33370#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {33380#(<= main_~k~0 27)} is VALID [2018-11-23 12:00:16,665 INFO L273 TraceCheckUtils]: 85: Hoare triple {33380#(<= 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); {33380#(<= main_~k~0 27)} is VALID [2018-11-23 12:00:16,666 INFO L273 TraceCheckUtils]: 86: Hoare triple {33380#(<= main_~k~0 27)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33380#(<= main_~k~0 27)} is VALID [2018-11-23 12:00:16,666 INFO L273 TraceCheckUtils]: 87: Hoare triple {33380#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {33390#(<= main_~k~0 28)} is VALID [2018-11-23 12:00:16,667 INFO L273 TraceCheckUtils]: 88: Hoare triple {33390#(<= 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); {33390#(<= main_~k~0 28)} is VALID [2018-11-23 12:00:16,667 INFO L273 TraceCheckUtils]: 89: Hoare triple {33390#(<= main_~k~0 28)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33390#(<= main_~k~0 28)} is VALID [2018-11-23 12:00:16,668 INFO L273 TraceCheckUtils]: 90: Hoare triple {33390#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {33400#(<= main_~k~0 29)} is VALID [2018-11-23 12:00:16,669 INFO L273 TraceCheckUtils]: 91: Hoare triple {33400#(<= 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); {33400#(<= main_~k~0 29)} is VALID [2018-11-23 12:00:16,669 INFO L273 TraceCheckUtils]: 92: Hoare triple {33400#(<= main_~k~0 29)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33400#(<= main_~k~0 29)} is VALID [2018-11-23 12:00:16,670 INFO L273 TraceCheckUtils]: 93: Hoare triple {33400#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {33410#(<= main_~k~0 30)} is VALID [2018-11-23 12:00:16,670 INFO L273 TraceCheckUtils]: 94: Hoare triple {33410#(<= 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); {33410#(<= main_~k~0 30)} is VALID [2018-11-23 12:00:16,671 INFO L273 TraceCheckUtils]: 95: Hoare triple {33410#(<= main_~k~0 30)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33410#(<= main_~k~0 30)} is VALID [2018-11-23 12:00:16,672 INFO L273 TraceCheckUtils]: 96: Hoare triple {33410#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {33420#(<= main_~k~0 31)} is VALID [2018-11-23 12:00:16,672 INFO L273 TraceCheckUtils]: 97: Hoare triple {33420#(<= 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); {33420#(<= main_~k~0 31)} is VALID [2018-11-23 12:00:16,673 INFO L273 TraceCheckUtils]: 98: Hoare triple {33420#(<= main_~k~0 31)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {33420#(<= main_~k~0 31)} is VALID [2018-11-23 12:00:16,673 INFO L273 TraceCheckUtils]: 99: Hoare triple {33420#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {33430#(<= main_~k~0 32)} is VALID [2018-11-23 12:00:16,674 INFO L273 TraceCheckUtils]: 100: Hoare triple {33430#(<= main_~k~0 32)} assume !(~k~0 < 100000); {33064#false} is VALID [2018-11-23 12:00:16,674 INFO L273 TraceCheckUtils]: 101: Hoare triple {33064#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); {33064#false} is VALID [2018-11-23 12:00:16,674 INFO L273 TraceCheckUtils]: 102: Hoare triple {33064#false} ~x~0 := 0; {33064#false} is VALID [2018-11-23 12:00:16,675 INFO L273 TraceCheckUtils]: 103: Hoare triple {33064#false} assume !(~x~0 < ~i~0); {33064#false} is VALID [2018-11-23 12:00:16,675 INFO L273 TraceCheckUtils]: 104: Hoare triple {33064#false} ~x~0 := ~i~0; {33064#false} is VALID [2018-11-23 12:00:16,675 INFO L273 TraceCheckUtils]: 105: Hoare triple {33064#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); {33064#false} is VALID [2018-11-23 12:00:16,675 INFO L256 TraceCheckUtils]: 106: Hoare triple {33064#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {33064#false} is VALID [2018-11-23 12:00:16,675 INFO L273 TraceCheckUtils]: 107: Hoare triple {33064#false} ~cond := #in~cond; {33064#false} is VALID [2018-11-23 12:00:16,675 INFO L273 TraceCheckUtils]: 108: Hoare triple {33064#false} assume !(0 == ~cond); {33064#false} is VALID [2018-11-23 12:00:16,676 INFO L273 TraceCheckUtils]: 109: Hoare triple {33064#false} assume true; {33064#false} is VALID [2018-11-23 12:00:16,676 INFO L268 TraceCheckUtils]: 110: Hoare quadruple {33064#false} {33064#false} #136#return; {33064#false} is VALID [2018-11-23 12:00:16,676 INFO L273 TraceCheckUtils]: 111: Hoare triple {33064#false} havoc #t~mem9;havoc #t~mem10; {33064#false} is VALID [2018-11-23 12:00:16,676 INFO L273 TraceCheckUtils]: 112: Hoare triple {33064#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {33064#false} is VALID [2018-11-23 12:00:16,676 INFO L273 TraceCheckUtils]: 113: Hoare triple {33064#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); {33064#false} is VALID [2018-11-23 12:00:16,676 INFO L256 TraceCheckUtils]: 114: Hoare triple {33064#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {33064#false} is VALID [2018-11-23 12:00:16,676 INFO L273 TraceCheckUtils]: 115: Hoare triple {33064#false} ~cond := #in~cond; {33064#false} is VALID [2018-11-23 12:00:16,676 INFO L273 TraceCheckUtils]: 116: Hoare triple {33064#false} assume 0 == ~cond; {33064#false} is VALID [2018-11-23 12:00:16,676 INFO L273 TraceCheckUtils]: 117: Hoare triple {33064#false} assume !false; {33064#false} is VALID [2018-11-23 12:00:16,690 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 12:00:16,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:16,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 68 [2018-11-23 12:00:16,710 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 118 [2018-11-23 12:00:16,710 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:16,710 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 68 states. [2018-11-23 12:00:16,964 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 12:00:16,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-11-23 12:00:16,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-11-23 12:00:16,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1718, Invalid=2838, Unknown=0, NotChecked=0, Total=4556 [2018-11-23 12:00:16,987 INFO L87 Difference]: Start difference. First operand 240 states and 317 transitions. Second operand 68 states. [2018-11-23 12:00:18,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:18,089 INFO L93 Difference]: Finished difference Result 303 states and 403 transitions. [2018-11-23 12:00:18,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-23 12:00:18,089 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 118 [2018-11-23 12:00:18,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:18,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-23 12:00:18,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 235 transitions. [2018-11-23 12:00:18,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-23 12:00:18,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 235 transitions. [2018-11-23 12:00:18,094 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 235 transitions. [2018-11-23 12:00:18,329 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 12:00:18,334 INFO L225 Difference]: With dead ends: 303 [2018-11-23 12:00:18,334 INFO L226 Difference]: Without dead ends: 256 [2018-11-23 12:00:18,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1585 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1718, Invalid=2838, Unknown=0, NotChecked=0, Total=4556 [2018-11-23 12:00:18,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-11-23 12:00:18,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 246. [2018-11-23 12:00:18,498 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:18,498 INFO L82 GeneralOperation]: Start isEquivalent. First operand 256 states. Second operand 246 states. [2018-11-23 12:00:18,498 INFO L74 IsIncluded]: Start isIncluded. First operand 256 states. Second operand 246 states. [2018-11-23 12:00:18,499 INFO L87 Difference]: Start difference. First operand 256 states. Second operand 246 states. [2018-11-23 12:00:18,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:18,504 INFO L93 Difference]: Finished difference Result 256 states and 340 transitions. [2018-11-23 12:00:18,505 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 340 transitions. [2018-11-23 12:00:18,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:18,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:18,505 INFO L74 IsIncluded]: Start isIncluded. First operand 246 states. Second operand 256 states. [2018-11-23 12:00:18,505 INFO L87 Difference]: Start difference. First operand 246 states. Second operand 256 states. [2018-11-23 12:00:18,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:18,509 INFO L93 Difference]: Finished difference Result 256 states and 340 transitions. [2018-11-23 12:00:18,510 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 340 transitions. [2018-11-23 12:00:18,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:18,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:18,510 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:18,510 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:18,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-11-23 12:00:18,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 325 transitions. [2018-11-23 12:00:18,514 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 325 transitions. Word has length 118 [2018-11-23 12:00:18,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:18,514 INFO L480 AbstractCegarLoop]: Abstraction has 246 states and 325 transitions. [2018-11-23 12:00:18,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-11-23 12:00:18,515 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 325 transitions. [2018-11-23 12:00:18,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-23 12:00:18,515 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:18,515 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 12:00:18,515 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:18,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:18,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1498478068, now seen corresponding path program 28 times [2018-11-23 12:00:18,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:18,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:18,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:18,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:00:18,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:18,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:19,607 INFO L256 TraceCheckUtils]: 0: Hoare triple {34739#true} call ULTIMATE.init(); {34739#true} is VALID [2018-11-23 12:00:19,607 INFO L273 TraceCheckUtils]: 1: Hoare triple {34739#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {34739#true} is VALID [2018-11-23 12:00:19,607 INFO L273 TraceCheckUtils]: 2: Hoare triple {34739#true} assume true; {34739#true} is VALID [2018-11-23 12:00:19,607 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34739#true} {34739#true} #130#return; {34739#true} is VALID [2018-11-23 12:00:19,607 INFO L256 TraceCheckUtils]: 4: Hoare triple {34739#true} call #t~ret15 := main(); {34739#true} is VALID [2018-11-23 12:00:19,608 INFO L273 TraceCheckUtils]: 5: Hoare triple {34739#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {34741#(= main_~i~0 0)} is VALID [2018-11-23 12:00:19,609 INFO L273 TraceCheckUtils]: 6: Hoare triple {34741#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {34742#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,609 INFO L273 TraceCheckUtils]: 7: Hoare triple {34742#(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); {34742#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,611 INFO L273 TraceCheckUtils]: 8: Hoare triple {34742#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {34742#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,611 INFO L273 TraceCheckUtils]: 9: Hoare triple {34742#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {34743#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,613 INFO L273 TraceCheckUtils]: 10: Hoare triple {34743#(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); {34743#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,613 INFO L273 TraceCheckUtils]: 11: Hoare triple {34743#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {34743#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,615 INFO L273 TraceCheckUtils]: 12: Hoare triple {34743#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {34744#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,616 INFO L273 TraceCheckUtils]: 13: Hoare triple {34744#(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); {34744#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,617 INFO L273 TraceCheckUtils]: 14: Hoare triple {34744#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {34744#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,617 INFO L273 TraceCheckUtils]: 15: Hoare triple {34744#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {34745#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,619 INFO L273 TraceCheckUtils]: 16: Hoare triple {34745#(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); {34745#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,619 INFO L273 TraceCheckUtils]: 17: Hoare triple {34745#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {34745#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,621 INFO L273 TraceCheckUtils]: 18: Hoare triple {34745#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {34746#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,622 INFO L273 TraceCheckUtils]: 19: Hoare triple {34746#(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); {34746#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,623 INFO L273 TraceCheckUtils]: 20: Hoare triple {34746#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {34746#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,623 INFO L273 TraceCheckUtils]: 21: Hoare triple {34746#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {34747#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,625 INFO L273 TraceCheckUtils]: 22: Hoare triple {34747#(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); {34747#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,627 INFO L273 TraceCheckUtils]: 23: Hoare triple {34747#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {34747#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,629 INFO L273 TraceCheckUtils]: 24: Hoare triple {34747#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {34748#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,629 INFO L273 TraceCheckUtils]: 25: Hoare triple {34748#(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); {34748#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,632 INFO L273 TraceCheckUtils]: 26: Hoare triple {34748#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {34748#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,632 INFO L273 TraceCheckUtils]: 27: Hoare triple {34748#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {34749#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,635 INFO L273 TraceCheckUtils]: 28: Hoare triple {34749#(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); {34749#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,635 INFO L273 TraceCheckUtils]: 29: Hoare triple {34749#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {34749#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,637 INFO L273 TraceCheckUtils]: 30: Hoare triple {34749#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {34750#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,637 INFO L273 TraceCheckUtils]: 31: Hoare triple {34750#(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); {34750#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,640 INFO L273 TraceCheckUtils]: 32: Hoare triple {34750#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {34750#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,640 INFO L273 TraceCheckUtils]: 33: Hoare triple {34750#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {34751#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,642 INFO L273 TraceCheckUtils]: 34: Hoare triple {34751#(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); {34751#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,642 INFO L273 TraceCheckUtils]: 35: Hoare triple {34751#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {34751#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,645 INFO L273 TraceCheckUtils]: 36: Hoare triple {34751#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {34752#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,645 INFO L273 TraceCheckUtils]: 37: Hoare triple {34752#(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); {34752#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,647 INFO L273 TraceCheckUtils]: 38: Hoare triple {34752#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {34752#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,647 INFO L273 TraceCheckUtils]: 39: Hoare triple {34752#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {34753#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,649 INFO L273 TraceCheckUtils]: 40: Hoare triple {34753#(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); {34753#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,649 INFO L273 TraceCheckUtils]: 41: Hoare triple {34753#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {34753#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,651 INFO L273 TraceCheckUtils]: 42: Hoare triple {34753#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {34754#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,651 INFO L273 TraceCheckUtils]: 43: Hoare triple {34754#(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); {34754#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,653 INFO L273 TraceCheckUtils]: 44: Hoare triple {34754#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {34754#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,654 INFO L273 TraceCheckUtils]: 45: Hoare triple {34754#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {34755#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,655 INFO L273 TraceCheckUtils]: 46: Hoare triple {34755#(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); {34755#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,655 INFO L273 TraceCheckUtils]: 47: Hoare triple {34755#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {34755#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,657 INFO L273 TraceCheckUtils]: 48: Hoare triple {34755#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {34756#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,657 INFO L273 TraceCheckUtils]: 49: Hoare triple {34756#(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); {34756#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,658 INFO L273 TraceCheckUtils]: 50: Hoare triple {34756#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {34756#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,660 INFO L273 TraceCheckUtils]: 51: Hoare triple {34756#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {34757#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,661 INFO L273 TraceCheckUtils]: 52: Hoare triple {34757#(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); {34757#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,662 INFO L273 TraceCheckUtils]: 53: Hoare triple {34757#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {34757#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,663 INFO L273 TraceCheckUtils]: 54: Hoare triple {34757#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {34758#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 12:00:19,664 INFO L273 TraceCheckUtils]: 55: Hoare triple {34758#(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); {34758#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 12:00:19,666 INFO L273 TraceCheckUtils]: 56: Hoare triple {34758#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {34758#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 12:00:19,667 INFO L273 TraceCheckUtils]: 57: Hoare triple {34758#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} ~k~0 := 1 + ~k~0; {34759#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,668 INFO L273 TraceCheckUtils]: 58: Hoare triple {34759#(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); {34759#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,668 INFO L273 TraceCheckUtils]: 59: Hoare triple {34759#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {34759#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,670 INFO L273 TraceCheckUtils]: 60: Hoare triple {34759#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {34760#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,671 INFO L273 TraceCheckUtils]: 61: Hoare triple {34760#(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); {34760#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,672 INFO L273 TraceCheckUtils]: 62: Hoare triple {34760#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {34760#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,672 INFO L273 TraceCheckUtils]: 63: Hoare triple {34760#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {34761#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,674 INFO L273 TraceCheckUtils]: 64: Hoare triple {34761#(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); {34761#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,674 INFO L273 TraceCheckUtils]: 65: Hoare triple {34761#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {34761#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,676 INFO L273 TraceCheckUtils]: 66: Hoare triple {34761#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {34762#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,676 INFO L273 TraceCheckUtils]: 67: Hoare triple {34762#(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); {34762#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,678 INFO L273 TraceCheckUtils]: 68: Hoare triple {34762#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {34762#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,678 INFO L273 TraceCheckUtils]: 69: Hoare triple {34762#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {34763#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,681 INFO L273 TraceCheckUtils]: 70: Hoare triple {34763#(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); {34763#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,681 INFO L273 TraceCheckUtils]: 71: Hoare triple {34763#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {34763#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,683 INFO L273 TraceCheckUtils]: 72: Hoare triple {34763#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {34764#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,683 INFO L273 TraceCheckUtils]: 73: Hoare triple {34764#(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); {34764#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,685 INFO L273 TraceCheckUtils]: 74: Hoare triple {34764#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {34764#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,685 INFO L273 TraceCheckUtils]: 75: Hoare triple {34764#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {34765#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,687 INFO L273 TraceCheckUtils]: 76: Hoare triple {34765#(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); {34765#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,687 INFO L273 TraceCheckUtils]: 77: Hoare triple {34765#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {34765#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,689 INFO L273 TraceCheckUtils]: 78: Hoare triple {34765#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {34766#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,689 INFO L273 TraceCheckUtils]: 79: Hoare triple {34766#(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); {34766#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,691 INFO L273 TraceCheckUtils]: 80: Hoare triple {34766#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {34766#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,691 INFO L273 TraceCheckUtils]: 81: Hoare triple {34766#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {34767#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,693 INFO L273 TraceCheckUtils]: 82: Hoare triple {34767#(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); {34767#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,693 INFO L273 TraceCheckUtils]: 83: Hoare triple {34767#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {34767#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,696 INFO L273 TraceCheckUtils]: 84: Hoare triple {34767#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {34768#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,696 INFO L273 TraceCheckUtils]: 85: Hoare triple {34768#(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); {34768#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,699 INFO L273 TraceCheckUtils]: 86: Hoare triple {34768#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {34768#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,699 INFO L273 TraceCheckUtils]: 87: Hoare triple {34768#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {34769#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,701 INFO L273 TraceCheckUtils]: 88: Hoare triple {34769#(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); {34769#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,701 INFO L273 TraceCheckUtils]: 89: Hoare triple {34769#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {34769#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,703 INFO L273 TraceCheckUtils]: 90: Hoare triple {34769#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {34770#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,703 INFO L273 TraceCheckUtils]: 91: Hoare triple {34770#(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); {34770#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,705 INFO L273 TraceCheckUtils]: 92: Hoare triple {34770#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {34770#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,705 INFO L273 TraceCheckUtils]: 93: Hoare triple {34770#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {34771#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,706 INFO L273 TraceCheckUtils]: 94: Hoare triple {34771#(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); {34771#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,706 INFO L273 TraceCheckUtils]: 95: Hoare triple {34771#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {34771#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,711 INFO L273 TraceCheckUtils]: 96: Hoare triple {34771#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {34772#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,713 INFO L273 TraceCheckUtils]: 97: Hoare triple {34772#(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); {34772#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,713 INFO L273 TraceCheckUtils]: 98: Hoare triple {34772#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {34772#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,715 INFO L273 TraceCheckUtils]: 99: Hoare triple {34772#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {34773#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,716 INFO L273 TraceCheckUtils]: 100: Hoare triple {34773#(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); {34773#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,716 INFO L273 TraceCheckUtils]: 101: Hoare triple {34773#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {34773#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,717 INFO L273 TraceCheckUtils]: 102: Hoare triple {34773#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {34774#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:19,717 INFO L273 TraceCheckUtils]: 103: Hoare triple {34774#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} assume !(~k~0 < 100000); {34740#false} is VALID [2018-11-23 12:00:19,717 INFO L273 TraceCheckUtils]: 104: Hoare triple {34740#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); {34740#false} is VALID [2018-11-23 12:00:19,717 INFO L273 TraceCheckUtils]: 105: Hoare triple {34740#false} ~x~0 := 0; {34740#false} is VALID [2018-11-23 12:00:19,717 INFO L273 TraceCheckUtils]: 106: Hoare triple {34740#false} assume !(~x~0 < ~i~0); {34740#false} is VALID [2018-11-23 12:00:19,718 INFO L273 TraceCheckUtils]: 107: Hoare triple {34740#false} ~x~0 := ~i~0; {34740#false} is VALID [2018-11-23 12:00:19,718 INFO L273 TraceCheckUtils]: 108: Hoare triple {34740#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); {34740#false} is VALID [2018-11-23 12:00:19,718 INFO L256 TraceCheckUtils]: 109: Hoare triple {34740#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {34739#true} is VALID [2018-11-23 12:00:19,718 INFO L273 TraceCheckUtils]: 110: Hoare triple {34739#true} ~cond := #in~cond; {34739#true} is VALID [2018-11-23 12:00:19,718 INFO L273 TraceCheckUtils]: 111: Hoare triple {34739#true} assume !(0 == ~cond); {34739#true} is VALID [2018-11-23 12:00:19,718 INFO L273 TraceCheckUtils]: 112: Hoare triple {34739#true} assume true; {34739#true} is VALID [2018-11-23 12:00:19,718 INFO L268 TraceCheckUtils]: 113: Hoare quadruple {34739#true} {34740#false} #136#return; {34740#false} is VALID [2018-11-23 12:00:19,719 INFO L273 TraceCheckUtils]: 114: Hoare triple {34740#false} havoc #t~mem9;havoc #t~mem10; {34740#false} is VALID [2018-11-23 12:00:19,719 INFO L273 TraceCheckUtils]: 115: Hoare triple {34740#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {34740#false} is VALID [2018-11-23 12:00:19,719 INFO L273 TraceCheckUtils]: 116: Hoare triple {34740#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); {34740#false} is VALID [2018-11-23 12:00:19,719 INFO L256 TraceCheckUtils]: 117: Hoare triple {34740#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {34740#false} is VALID [2018-11-23 12:00:19,719 INFO L273 TraceCheckUtils]: 118: Hoare triple {34740#false} ~cond := #in~cond; {34740#false} is VALID [2018-11-23 12:00:19,720 INFO L273 TraceCheckUtils]: 119: Hoare triple {34740#false} assume 0 == ~cond; {34740#false} is VALID [2018-11-23 12:00:19,720 INFO L273 TraceCheckUtils]: 120: Hoare triple {34740#false} assume !false; {34740#false} is VALID [2018-11-23 12:00:19,741 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 12:00:19,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:19,741 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:00:19,749 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:00:19,815 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:00:19,815 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:00:19,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:19,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:20,879 INFO L256 TraceCheckUtils]: 0: Hoare triple {34739#true} call ULTIMATE.init(); {34739#true} is VALID [2018-11-23 12:00:20,880 INFO L273 TraceCheckUtils]: 1: Hoare triple {34739#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {34739#true} is VALID [2018-11-23 12:00:20,880 INFO L273 TraceCheckUtils]: 2: Hoare triple {34739#true} assume true; {34739#true} is VALID [2018-11-23 12:00:20,880 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34739#true} {34739#true} #130#return; {34739#true} is VALID [2018-11-23 12:00:20,880 INFO L256 TraceCheckUtils]: 4: Hoare triple {34739#true} call #t~ret15 := main(); {34739#true} is VALID [2018-11-23 12:00:20,881 INFO L273 TraceCheckUtils]: 5: Hoare triple {34739#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {34793#(<= main_~i~0 0)} is VALID [2018-11-23 12:00:20,882 INFO L273 TraceCheckUtils]: 6: Hoare triple {34793#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {34797#(<= main_~k~0 1)} is VALID [2018-11-23 12:00:20,882 INFO L273 TraceCheckUtils]: 7: Hoare triple {34797#(<= 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); {34797#(<= main_~k~0 1)} is VALID [2018-11-23 12:00:20,882 INFO L273 TraceCheckUtils]: 8: Hoare triple {34797#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {34797#(<= main_~k~0 1)} is VALID [2018-11-23 12:00:20,883 INFO L273 TraceCheckUtils]: 9: Hoare triple {34797#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {34807#(<= main_~k~0 2)} is VALID [2018-11-23 12:00:20,883 INFO L273 TraceCheckUtils]: 10: Hoare triple {34807#(<= 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); {34807#(<= main_~k~0 2)} is VALID [2018-11-23 12:00:20,883 INFO L273 TraceCheckUtils]: 11: Hoare triple {34807#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {34807#(<= main_~k~0 2)} is VALID [2018-11-23 12:00:20,884 INFO L273 TraceCheckUtils]: 12: Hoare triple {34807#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {34817#(<= main_~k~0 3)} is VALID [2018-11-23 12:00:20,885 INFO L273 TraceCheckUtils]: 13: Hoare triple {34817#(<= 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); {34817#(<= main_~k~0 3)} is VALID [2018-11-23 12:00:20,885 INFO L273 TraceCheckUtils]: 14: Hoare triple {34817#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {34817#(<= main_~k~0 3)} is VALID [2018-11-23 12:00:20,886 INFO L273 TraceCheckUtils]: 15: Hoare triple {34817#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {34827#(<= main_~k~0 4)} is VALID [2018-11-23 12:00:20,886 INFO L273 TraceCheckUtils]: 16: Hoare triple {34827#(<= 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); {34827#(<= main_~k~0 4)} is VALID [2018-11-23 12:00:20,887 INFO L273 TraceCheckUtils]: 17: Hoare triple {34827#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {34827#(<= main_~k~0 4)} is VALID [2018-11-23 12:00:20,888 INFO L273 TraceCheckUtils]: 18: Hoare triple {34827#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {34837#(<= main_~k~0 5)} is VALID [2018-11-23 12:00:20,888 INFO L273 TraceCheckUtils]: 19: Hoare triple {34837#(<= 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); {34837#(<= main_~k~0 5)} is VALID [2018-11-23 12:00:20,889 INFO L273 TraceCheckUtils]: 20: Hoare triple {34837#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {34837#(<= main_~k~0 5)} is VALID [2018-11-23 12:00:20,889 INFO L273 TraceCheckUtils]: 21: Hoare triple {34837#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {34847#(<= main_~k~0 6)} is VALID [2018-11-23 12:00:20,890 INFO L273 TraceCheckUtils]: 22: Hoare triple {34847#(<= 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); {34847#(<= main_~k~0 6)} is VALID [2018-11-23 12:00:20,890 INFO L273 TraceCheckUtils]: 23: Hoare triple {34847#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {34847#(<= main_~k~0 6)} is VALID [2018-11-23 12:00:20,891 INFO L273 TraceCheckUtils]: 24: Hoare triple {34847#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {34857#(<= main_~k~0 7)} is VALID [2018-11-23 12:00:20,892 INFO L273 TraceCheckUtils]: 25: Hoare triple {34857#(<= 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); {34857#(<= main_~k~0 7)} is VALID [2018-11-23 12:00:20,892 INFO L273 TraceCheckUtils]: 26: Hoare triple {34857#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {34857#(<= main_~k~0 7)} is VALID [2018-11-23 12:00:20,893 INFO L273 TraceCheckUtils]: 27: Hoare triple {34857#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {34867#(<= main_~k~0 8)} is VALID [2018-11-23 12:00:20,893 INFO L273 TraceCheckUtils]: 28: Hoare triple {34867#(<= 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); {34867#(<= main_~k~0 8)} is VALID [2018-11-23 12:00:20,894 INFO L273 TraceCheckUtils]: 29: Hoare triple {34867#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {34867#(<= main_~k~0 8)} is VALID [2018-11-23 12:00:20,895 INFO L273 TraceCheckUtils]: 30: Hoare triple {34867#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {34877#(<= main_~k~0 9)} is VALID [2018-11-23 12:00:20,895 INFO L273 TraceCheckUtils]: 31: Hoare triple {34877#(<= 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); {34877#(<= main_~k~0 9)} is VALID [2018-11-23 12:00:20,896 INFO L273 TraceCheckUtils]: 32: Hoare triple {34877#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {34877#(<= main_~k~0 9)} is VALID [2018-11-23 12:00:20,896 INFO L273 TraceCheckUtils]: 33: Hoare triple {34877#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {34887#(<= main_~k~0 10)} is VALID [2018-11-23 12:00:20,897 INFO L273 TraceCheckUtils]: 34: Hoare triple {34887#(<= 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); {34887#(<= main_~k~0 10)} is VALID [2018-11-23 12:00:20,898 INFO L273 TraceCheckUtils]: 35: Hoare triple {34887#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {34887#(<= main_~k~0 10)} is VALID [2018-11-23 12:00:20,898 INFO L273 TraceCheckUtils]: 36: Hoare triple {34887#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {34897#(<= main_~k~0 11)} is VALID [2018-11-23 12:00:20,899 INFO L273 TraceCheckUtils]: 37: Hoare triple {34897#(<= 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); {34897#(<= main_~k~0 11)} is VALID [2018-11-23 12:00:20,899 INFO L273 TraceCheckUtils]: 38: Hoare triple {34897#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {34897#(<= main_~k~0 11)} is VALID [2018-11-23 12:00:20,900 INFO L273 TraceCheckUtils]: 39: Hoare triple {34897#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {34907#(<= main_~k~0 12)} is VALID [2018-11-23 12:00:20,901 INFO L273 TraceCheckUtils]: 40: Hoare triple {34907#(<= 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); {34907#(<= main_~k~0 12)} is VALID [2018-11-23 12:00:20,901 INFO L273 TraceCheckUtils]: 41: Hoare triple {34907#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {34907#(<= main_~k~0 12)} is VALID [2018-11-23 12:00:20,902 INFO L273 TraceCheckUtils]: 42: Hoare triple {34907#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {34917#(<= main_~k~0 13)} is VALID [2018-11-23 12:00:20,902 INFO L273 TraceCheckUtils]: 43: Hoare triple {34917#(<= 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); {34917#(<= main_~k~0 13)} is VALID [2018-11-23 12:00:20,903 INFO L273 TraceCheckUtils]: 44: Hoare triple {34917#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {34917#(<= main_~k~0 13)} is VALID [2018-11-23 12:00:20,903 INFO L273 TraceCheckUtils]: 45: Hoare triple {34917#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {34927#(<= main_~k~0 14)} is VALID [2018-11-23 12:00:20,904 INFO L273 TraceCheckUtils]: 46: Hoare triple {34927#(<= 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); {34927#(<= main_~k~0 14)} is VALID [2018-11-23 12:00:20,905 INFO L273 TraceCheckUtils]: 47: Hoare triple {34927#(<= main_~k~0 14)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {34927#(<= main_~k~0 14)} is VALID [2018-11-23 12:00:20,905 INFO L273 TraceCheckUtils]: 48: Hoare triple {34927#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {34937#(<= main_~k~0 15)} is VALID [2018-11-23 12:00:20,906 INFO L273 TraceCheckUtils]: 49: Hoare triple {34937#(<= 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); {34937#(<= main_~k~0 15)} is VALID [2018-11-23 12:00:20,906 INFO L273 TraceCheckUtils]: 50: Hoare triple {34937#(<= main_~k~0 15)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {34937#(<= main_~k~0 15)} is VALID [2018-11-23 12:00:20,907 INFO L273 TraceCheckUtils]: 51: Hoare triple {34937#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {34947#(<= main_~k~0 16)} is VALID [2018-11-23 12:00:20,908 INFO L273 TraceCheckUtils]: 52: Hoare triple {34947#(<= 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); {34947#(<= main_~k~0 16)} is VALID [2018-11-23 12:00:20,908 INFO L273 TraceCheckUtils]: 53: Hoare triple {34947#(<= main_~k~0 16)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {34947#(<= main_~k~0 16)} is VALID [2018-11-23 12:00:20,909 INFO L273 TraceCheckUtils]: 54: Hoare triple {34947#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {34957#(<= main_~k~0 17)} is VALID [2018-11-23 12:00:20,909 INFO L273 TraceCheckUtils]: 55: Hoare triple {34957#(<= 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); {34957#(<= main_~k~0 17)} is VALID [2018-11-23 12:00:20,910 INFO L273 TraceCheckUtils]: 56: Hoare triple {34957#(<= main_~k~0 17)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {34957#(<= main_~k~0 17)} is VALID [2018-11-23 12:00:20,911 INFO L273 TraceCheckUtils]: 57: Hoare triple {34957#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {34967#(<= main_~k~0 18)} is VALID [2018-11-23 12:00:20,911 INFO L273 TraceCheckUtils]: 58: Hoare triple {34967#(<= 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); {34967#(<= main_~k~0 18)} is VALID [2018-11-23 12:00:20,912 INFO L273 TraceCheckUtils]: 59: Hoare triple {34967#(<= main_~k~0 18)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {34967#(<= main_~k~0 18)} is VALID [2018-11-23 12:00:20,912 INFO L273 TraceCheckUtils]: 60: Hoare triple {34967#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {34977#(<= main_~k~0 19)} is VALID [2018-11-23 12:00:20,913 INFO L273 TraceCheckUtils]: 61: Hoare triple {34977#(<= 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); {34977#(<= main_~k~0 19)} is VALID [2018-11-23 12:00:20,913 INFO L273 TraceCheckUtils]: 62: Hoare triple {34977#(<= main_~k~0 19)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {34977#(<= main_~k~0 19)} is VALID [2018-11-23 12:00:20,914 INFO L273 TraceCheckUtils]: 63: Hoare triple {34977#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {34987#(<= main_~k~0 20)} is VALID [2018-11-23 12:00:20,915 INFO L273 TraceCheckUtils]: 64: Hoare triple {34987#(<= 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); {34987#(<= main_~k~0 20)} is VALID [2018-11-23 12:00:20,915 INFO L273 TraceCheckUtils]: 65: Hoare triple {34987#(<= main_~k~0 20)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {34987#(<= main_~k~0 20)} is VALID [2018-11-23 12:00:20,916 INFO L273 TraceCheckUtils]: 66: Hoare triple {34987#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {34997#(<= main_~k~0 21)} is VALID [2018-11-23 12:00:20,916 INFO L273 TraceCheckUtils]: 67: Hoare triple {34997#(<= 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); {34997#(<= main_~k~0 21)} is VALID [2018-11-23 12:00:20,917 INFO L273 TraceCheckUtils]: 68: Hoare triple {34997#(<= main_~k~0 21)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {34997#(<= main_~k~0 21)} is VALID [2018-11-23 12:00:20,917 INFO L273 TraceCheckUtils]: 69: Hoare triple {34997#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {35007#(<= main_~k~0 22)} is VALID [2018-11-23 12:00:20,918 INFO L273 TraceCheckUtils]: 70: Hoare triple {35007#(<= 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); {35007#(<= main_~k~0 22)} is VALID [2018-11-23 12:00:20,919 INFO L273 TraceCheckUtils]: 71: Hoare triple {35007#(<= main_~k~0 22)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {35007#(<= main_~k~0 22)} is VALID [2018-11-23 12:00:20,919 INFO L273 TraceCheckUtils]: 72: Hoare triple {35007#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {35017#(<= main_~k~0 23)} is VALID [2018-11-23 12:00:20,920 INFO L273 TraceCheckUtils]: 73: Hoare triple {35017#(<= 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); {35017#(<= main_~k~0 23)} is VALID [2018-11-23 12:00:20,920 INFO L273 TraceCheckUtils]: 74: Hoare triple {35017#(<= main_~k~0 23)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {35017#(<= main_~k~0 23)} is VALID [2018-11-23 12:00:20,921 INFO L273 TraceCheckUtils]: 75: Hoare triple {35017#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {35027#(<= main_~k~0 24)} is VALID [2018-11-23 12:00:20,922 INFO L273 TraceCheckUtils]: 76: Hoare triple {35027#(<= 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); {35027#(<= main_~k~0 24)} is VALID [2018-11-23 12:00:20,922 INFO L273 TraceCheckUtils]: 77: Hoare triple {35027#(<= main_~k~0 24)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {35027#(<= main_~k~0 24)} is VALID [2018-11-23 12:00:20,923 INFO L273 TraceCheckUtils]: 78: Hoare triple {35027#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {35037#(<= main_~k~0 25)} is VALID [2018-11-23 12:00:20,923 INFO L273 TraceCheckUtils]: 79: Hoare triple {35037#(<= 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); {35037#(<= main_~k~0 25)} is VALID [2018-11-23 12:00:20,924 INFO L273 TraceCheckUtils]: 80: Hoare triple {35037#(<= main_~k~0 25)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {35037#(<= main_~k~0 25)} is VALID [2018-11-23 12:00:20,925 INFO L273 TraceCheckUtils]: 81: Hoare triple {35037#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {35047#(<= main_~k~0 26)} is VALID [2018-11-23 12:00:20,925 INFO L273 TraceCheckUtils]: 82: Hoare triple {35047#(<= 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); {35047#(<= main_~k~0 26)} is VALID [2018-11-23 12:00:20,926 INFO L273 TraceCheckUtils]: 83: Hoare triple {35047#(<= main_~k~0 26)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {35047#(<= main_~k~0 26)} is VALID [2018-11-23 12:00:20,926 INFO L273 TraceCheckUtils]: 84: Hoare triple {35047#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {35057#(<= main_~k~0 27)} is VALID [2018-11-23 12:00:20,927 INFO L273 TraceCheckUtils]: 85: Hoare triple {35057#(<= 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); {35057#(<= main_~k~0 27)} is VALID [2018-11-23 12:00:20,927 INFO L273 TraceCheckUtils]: 86: Hoare triple {35057#(<= main_~k~0 27)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {35057#(<= main_~k~0 27)} is VALID [2018-11-23 12:00:20,928 INFO L273 TraceCheckUtils]: 87: Hoare triple {35057#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {35067#(<= main_~k~0 28)} is VALID [2018-11-23 12:00:20,929 INFO L273 TraceCheckUtils]: 88: Hoare triple {35067#(<= 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); {35067#(<= main_~k~0 28)} is VALID [2018-11-23 12:00:20,929 INFO L273 TraceCheckUtils]: 89: Hoare triple {35067#(<= main_~k~0 28)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {35067#(<= main_~k~0 28)} is VALID [2018-11-23 12:00:20,930 INFO L273 TraceCheckUtils]: 90: Hoare triple {35067#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {35077#(<= main_~k~0 29)} is VALID [2018-11-23 12:00:20,930 INFO L273 TraceCheckUtils]: 91: Hoare triple {35077#(<= 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); {35077#(<= main_~k~0 29)} is VALID [2018-11-23 12:00:20,931 INFO L273 TraceCheckUtils]: 92: Hoare triple {35077#(<= main_~k~0 29)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {35077#(<= main_~k~0 29)} is VALID [2018-11-23 12:00:20,932 INFO L273 TraceCheckUtils]: 93: Hoare triple {35077#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {35087#(<= main_~k~0 30)} is VALID [2018-11-23 12:00:20,932 INFO L273 TraceCheckUtils]: 94: Hoare triple {35087#(<= 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); {35087#(<= main_~k~0 30)} is VALID [2018-11-23 12:00:20,933 INFO L273 TraceCheckUtils]: 95: Hoare triple {35087#(<= main_~k~0 30)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {35087#(<= main_~k~0 30)} is VALID [2018-11-23 12:00:20,933 INFO L273 TraceCheckUtils]: 96: Hoare triple {35087#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {35097#(<= main_~k~0 31)} is VALID [2018-11-23 12:00:20,934 INFO L273 TraceCheckUtils]: 97: Hoare triple {35097#(<= 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); {35097#(<= main_~k~0 31)} is VALID [2018-11-23 12:00:20,934 INFO L273 TraceCheckUtils]: 98: Hoare triple {35097#(<= main_~k~0 31)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {35097#(<= main_~k~0 31)} is VALID [2018-11-23 12:00:20,935 INFO L273 TraceCheckUtils]: 99: Hoare triple {35097#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {35107#(<= main_~k~0 32)} is VALID [2018-11-23 12:00:20,936 INFO L273 TraceCheckUtils]: 100: Hoare triple {35107#(<= 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); {35107#(<= main_~k~0 32)} is VALID [2018-11-23 12:00:20,936 INFO L273 TraceCheckUtils]: 101: Hoare triple {35107#(<= main_~k~0 32)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {35107#(<= main_~k~0 32)} is VALID [2018-11-23 12:00:20,937 INFO L273 TraceCheckUtils]: 102: Hoare triple {35107#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {35117#(<= main_~k~0 33)} is VALID [2018-11-23 12:00:20,938 INFO L273 TraceCheckUtils]: 103: Hoare triple {35117#(<= main_~k~0 33)} assume !(~k~0 < 100000); {34740#false} is VALID [2018-11-23 12:00:20,938 INFO L273 TraceCheckUtils]: 104: Hoare triple {34740#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); {34740#false} is VALID [2018-11-23 12:00:20,938 INFO L273 TraceCheckUtils]: 105: Hoare triple {34740#false} ~x~0 := 0; {34740#false} is VALID [2018-11-23 12:00:20,938 INFO L273 TraceCheckUtils]: 106: Hoare triple {34740#false} assume !(~x~0 < ~i~0); {34740#false} is VALID [2018-11-23 12:00:20,938 INFO L273 TraceCheckUtils]: 107: Hoare triple {34740#false} ~x~0 := ~i~0; {34740#false} is VALID [2018-11-23 12:00:20,939 INFO L273 TraceCheckUtils]: 108: Hoare triple {34740#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); {34740#false} is VALID [2018-11-23 12:00:20,939 INFO L256 TraceCheckUtils]: 109: Hoare triple {34740#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {34740#false} is VALID [2018-11-23 12:00:20,939 INFO L273 TraceCheckUtils]: 110: Hoare triple {34740#false} ~cond := #in~cond; {34740#false} is VALID [2018-11-23 12:00:20,939 INFO L273 TraceCheckUtils]: 111: Hoare triple {34740#false} assume !(0 == ~cond); {34740#false} is VALID [2018-11-23 12:00:20,939 INFO L273 TraceCheckUtils]: 112: Hoare triple {34740#false} assume true; {34740#false} is VALID [2018-11-23 12:00:20,939 INFO L268 TraceCheckUtils]: 113: Hoare quadruple {34740#false} {34740#false} #136#return; {34740#false} is VALID [2018-11-23 12:00:20,940 INFO L273 TraceCheckUtils]: 114: Hoare triple {34740#false} havoc #t~mem9;havoc #t~mem10; {34740#false} is VALID [2018-11-23 12:00:20,940 INFO L273 TraceCheckUtils]: 115: Hoare triple {34740#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {34740#false} is VALID [2018-11-23 12:00:20,940 INFO L273 TraceCheckUtils]: 116: Hoare triple {34740#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); {34740#false} is VALID [2018-11-23 12:00:20,940 INFO L256 TraceCheckUtils]: 117: Hoare triple {34740#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {34740#false} is VALID [2018-11-23 12:00:20,940 INFO L273 TraceCheckUtils]: 118: Hoare triple {34740#false} ~cond := #in~cond; {34740#false} is VALID [2018-11-23 12:00:20,941 INFO L273 TraceCheckUtils]: 119: Hoare triple {34740#false} assume 0 == ~cond; {34740#false} is VALID [2018-11-23 12:00:20,941 INFO L273 TraceCheckUtils]: 120: Hoare triple {34740#false} assume !false; {34740#false} is VALID [2018-11-23 12:00:20,950 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 12:00:20,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:20,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 70 [2018-11-23 12:00:20,970 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 121 [2018-11-23 12:00:20,971 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:20,971 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 70 states. [2018-11-23 12:00:21,199 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 222 edges. 222 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:21,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-11-23 12:00:21,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-11-23 12:00:21,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1821, Invalid=3009, Unknown=0, NotChecked=0, Total=4830 [2018-11-23 12:00:21,201 INFO L87 Difference]: Start difference. First operand 246 states and 325 transitions. Second operand 70 states. [2018-11-23 12:00:22,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:22,485 INFO L93 Difference]: Finished difference Result 309 states and 411 transitions. [2018-11-23 12:00:22,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-23 12:00:22,485 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 121 [2018-11-23 12:00:22,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:22,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 12:00:22,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 239 transitions. [2018-11-23 12:00:22,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 12:00:22,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 239 transitions. [2018-11-23 12:00:22,489 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 239 transitions. [2018-11-23 12:00:22,811 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 12:00:22,817 INFO L225 Difference]: With dead ends: 309 [2018-11-23 12:00:22,817 INFO L226 Difference]: Without dead ends: 262 [2018-11-23 12:00:22,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1684 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1821, Invalid=3009, Unknown=0, NotChecked=0, Total=4830 [2018-11-23 12:00:22,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-11-23 12:00:23,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 252. [2018-11-23 12:00:23,919 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:23,919 INFO L82 GeneralOperation]: Start isEquivalent. First operand 262 states. Second operand 252 states. [2018-11-23 12:00:23,919 INFO L74 IsIncluded]: Start isIncluded. First operand 262 states. Second operand 252 states. [2018-11-23 12:00:23,919 INFO L87 Difference]: Start difference. First operand 262 states. Second operand 252 states. [2018-11-23 12:00:23,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:23,924 INFO L93 Difference]: Finished difference Result 262 states and 348 transitions. [2018-11-23 12:00:23,924 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 348 transitions. [2018-11-23 12:00:23,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:23,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:23,924 INFO L74 IsIncluded]: Start isIncluded. First operand 252 states. Second operand 262 states. [2018-11-23 12:00:23,924 INFO L87 Difference]: Start difference. First operand 252 states. Second operand 262 states. [2018-11-23 12:00:23,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:23,929 INFO L93 Difference]: Finished difference Result 262 states and 348 transitions. [2018-11-23 12:00:23,930 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 348 transitions. [2018-11-23 12:00:23,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:23,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:23,930 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:23,930 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:23,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-11-23 12:00:23,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 333 transitions. [2018-11-23 12:00:23,936 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 333 transitions. Word has length 121 [2018-11-23 12:00:23,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:23,936 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 333 transitions. [2018-11-23 12:00:23,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-11-23 12:00:23,937 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 333 transitions. [2018-11-23 12:00:23,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-23 12:00:23,937 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:23,938 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 12:00:23,938 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:23,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:23,938 INFO L82 PathProgramCache]: Analyzing trace with hash -433813775, now seen corresponding path program 29 times [2018-11-23 12:00:23,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:23,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:23,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:23,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:00:23,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:25,408 INFO L256 TraceCheckUtils]: 0: Hoare triple {36454#true} call ULTIMATE.init(); {36454#true} is VALID [2018-11-23 12:00:25,408 INFO L273 TraceCheckUtils]: 1: Hoare triple {36454#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {36454#true} is VALID [2018-11-23 12:00:25,408 INFO L273 TraceCheckUtils]: 2: Hoare triple {36454#true} assume true; {36454#true} is VALID [2018-11-23 12:00:25,409 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36454#true} {36454#true} #130#return; {36454#true} is VALID [2018-11-23 12:00:25,409 INFO L256 TraceCheckUtils]: 4: Hoare triple {36454#true} call #t~ret15 := main(); {36454#true} is VALID [2018-11-23 12:00:25,409 INFO L273 TraceCheckUtils]: 5: Hoare triple {36454#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {36456#(= main_~i~0 0)} is VALID [2018-11-23 12:00:25,409 INFO L273 TraceCheckUtils]: 6: Hoare triple {36456#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {36457#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,410 INFO L273 TraceCheckUtils]: 7: Hoare triple {36457#(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); {36457#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,410 INFO L273 TraceCheckUtils]: 8: Hoare triple {36457#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36457#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,411 INFO L273 TraceCheckUtils]: 9: Hoare triple {36457#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {36458#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,412 INFO L273 TraceCheckUtils]: 10: Hoare triple {36458#(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); {36458#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,412 INFO L273 TraceCheckUtils]: 11: Hoare triple {36458#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36458#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,413 INFO L273 TraceCheckUtils]: 12: Hoare triple {36458#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {36459#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,414 INFO L273 TraceCheckUtils]: 13: Hoare triple {36459#(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); {36459#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,415 INFO L273 TraceCheckUtils]: 14: Hoare triple {36459#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36459#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,416 INFO L273 TraceCheckUtils]: 15: Hoare triple {36459#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {36460#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,417 INFO L273 TraceCheckUtils]: 16: Hoare triple {36460#(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); {36460#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,417 INFO L273 TraceCheckUtils]: 17: Hoare triple {36460#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36460#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,418 INFO L273 TraceCheckUtils]: 18: Hoare triple {36460#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {36461#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,419 INFO L273 TraceCheckUtils]: 19: Hoare triple {36461#(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); {36461#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,420 INFO L273 TraceCheckUtils]: 20: Hoare triple {36461#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36461#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,421 INFO L273 TraceCheckUtils]: 21: Hoare triple {36461#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {36462#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,422 INFO L273 TraceCheckUtils]: 22: Hoare triple {36462#(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); {36462#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,422 INFO L273 TraceCheckUtils]: 23: Hoare triple {36462#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36462#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,423 INFO L273 TraceCheckUtils]: 24: Hoare triple {36462#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {36463#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,424 INFO L273 TraceCheckUtils]: 25: Hoare triple {36463#(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); {36463#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,425 INFO L273 TraceCheckUtils]: 26: Hoare triple {36463#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36463#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,426 INFO L273 TraceCheckUtils]: 27: Hoare triple {36463#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {36464#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,426 INFO L273 TraceCheckUtils]: 28: Hoare triple {36464#(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); {36464#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,427 INFO L273 TraceCheckUtils]: 29: Hoare triple {36464#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36464#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,428 INFO L273 TraceCheckUtils]: 30: Hoare triple {36464#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {36465#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,429 INFO L273 TraceCheckUtils]: 31: Hoare triple {36465#(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); {36465#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,430 INFO L273 TraceCheckUtils]: 32: Hoare triple {36465#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36465#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,430 INFO L273 TraceCheckUtils]: 33: Hoare triple {36465#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {36466#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,431 INFO L273 TraceCheckUtils]: 34: Hoare triple {36466#(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); {36466#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,432 INFO L273 TraceCheckUtils]: 35: Hoare triple {36466#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36466#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,433 INFO L273 TraceCheckUtils]: 36: Hoare triple {36466#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {36467#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,434 INFO L273 TraceCheckUtils]: 37: Hoare triple {36467#(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); {36467#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,434 INFO L273 TraceCheckUtils]: 38: Hoare triple {36467#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36467#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,435 INFO L273 TraceCheckUtils]: 39: Hoare triple {36467#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {36468#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,436 INFO L273 TraceCheckUtils]: 40: Hoare triple {36468#(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); {36468#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,437 INFO L273 TraceCheckUtils]: 41: Hoare triple {36468#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36468#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,438 INFO L273 TraceCheckUtils]: 42: Hoare triple {36468#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {36469#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,439 INFO L273 TraceCheckUtils]: 43: Hoare triple {36469#(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); {36469#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,439 INFO L273 TraceCheckUtils]: 44: Hoare triple {36469#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36469#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,440 INFO L273 TraceCheckUtils]: 45: Hoare triple {36469#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {36470#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,441 INFO L273 TraceCheckUtils]: 46: Hoare triple {36470#(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); {36470#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,442 INFO L273 TraceCheckUtils]: 47: Hoare triple {36470#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36470#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,443 INFO L273 TraceCheckUtils]: 48: Hoare triple {36470#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {36471#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,443 INFO L273 TraceCheckUtils]: 49: Hoare triple {36471#(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); {36471#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,444 INFO L273 TraceCheckUtils]: 50: Hoare triple {36471#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36471#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,445 INFO L273 TraceCheckUtils]: 51: Hoare triple {36471#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {36472#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,446 INFO L273 TraceCheckUtils]: 52: Hoare triple {36472#(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); {36472#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,447 INFO L273 TraceCheckUtils]: 53: Hoare triple {36472#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36472#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,448 INFO L273 TraceCheckUtils]: 54: Hoare triple {36472#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {36473#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 12:00:25,448 INFO L273 TraceCheckUtils]: 55: Hoare triple {36473#(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); {36473#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 12:00:25,449 INFO L273 TraceCheckUtils]: 56: Hoare triple {36473#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36473#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 12:00:25,450 INFO L273 TraceCheckUtils]: 57: Hoare triple {36473#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} ~k~0 := 1 + ~k~0; {36474#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,451 INFO L273 TraceCheckUtils]: 58: Hoare triple {36474#(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); {36474#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,452 INFO L273 TraceCheckUtils]: 59: Hoare triple {36474#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36474#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,452 INFO L273 TraceCheckUtils]: 60: Hoare triple {36474#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {36475#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,453 INFO L273 TraceCheckUtils]: 61: Hoare triple {36475#(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); {36475#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,454 INFO L273 TraceCheckUtils]: 62: Hoare triple {36475#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36475#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,455 INFO L273 TraceCheckUtils]: 63: Hoare triple {36475#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {36476#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,456 INFO L273 TraceCheckUtils]: 64: Hoare triple {36476#(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); {36476#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,456 INFO L273 TraceCheckUtils]: 65: Hoare triple {36476#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36476#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,457 INFO L273 TraceCheckUtils]: 66: Hoare triple {36476#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {36477#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,458 INFO L273 TraceCheckUtils]: 67: Hoare triple {36477#(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); {36477#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,459 INFO L273 TraceCheckUtils]: 68: Hoare triple {36477#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36477#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,460 INFO L273 TraceCheckUtils]: 69: Hoare triple {36477#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {36478#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,460 INFO L273 TraceCheckUtils]: 70: Hoare triple {36478#(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); {36478#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,461 INFO L273 TraceCheckUtils]: 71: Hoare triple {36478#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36478#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,462 INFO L273 TraceCheckUtils]: 72: Hoare triple {36478#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {36479#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,463 INFO L273 TraceCheckUtils]: 73: Hoare triple {36479#(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); {36479#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,464 INFO L273 TraceCheckUtils]: 74: Hoare triple {36479#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36479#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,464 INFO L273 TraceCheckUtils]: 75: Hoare triple {36479#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {36480#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,465 INFO L273 TraceCheckUtils]: 76: Hoare triple {36480#(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); {36480#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,466 INFO L273 TraceCheckUtils]: 77: Hoare triple {36480#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36480#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,467 INFO L273 TraceCheckUtils]: 78: Hoare triple {36480#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {36481#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,468 INFO L273 TraceCheckUtils]: 79: Hoare triple {36481#(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); {36481#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,469 INFO L273 TraceCheckUtils]: 80: Hoare triple {36481#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36481#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,470 INFO L273 TraceCheckUtils]: 81: Hoare triple {36481#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {36482#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,470 INFO L273 TraceCheckUtils]: 82: Hoare triple {36482#(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); {36482#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,471 INFO L273 TraceCheckUtils]: 83: Hoare triple {36482#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36482#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,472 INFO L273 TraceCheckUtils]: 84: Hoare triple {36482#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {36483#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,473 INFO L273 TraceCheckUtils]: 85: Hoare triple {36483#(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); {36483#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,473 INFO L273 TraceCheckUtils]: 86: Hoare triple {36483#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36483#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,474 INFO L273 TraceCheckUtils]: 87: Hoare triple {36483#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {36484#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,475 INFO L273 TraceCheckUtils]: 88: Hoare triple {36484#(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); {36484#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,476 INFO L273 TraceCheckUtils]: 89: Hoare triple {36484#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36484#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,477 INFO L273 TraceCheckUtils]: 90: Hoare triple {36484#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {36485#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,478 INFO L273 TraceCheckUtils]: 91: Hoare triple {36485#(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); {36485#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,479 INFO L273 TraceCheckUtils]: 92: Hoare triple {36485#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36485#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,480 INFO L273 TraceCheckUtils]: 93: Hoare triple {36485#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {36486#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,481 INFO L273 TraceCheckUtils]: 94: Hoare triple {36486#(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); {36486#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,481 INFO L273 TraceCheckUtils]: 95: Hoare triple {36486#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36486#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,482 INFO L273 TraceCheckUtils]: 96: Hoare triple {36486#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {36487#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,483 INFO L273 TraceCheckUtils]: 97: Hoare triple {36487#(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); {36487#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,484 INFO L273 TraceCheckUtils]: 98: Hoare triple {36487#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36487#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,485 INFO L273 TraceCheckUtils]: 99: Hoare triple {36487#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {36488#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,486 INFO L273 TraceCheckUtils]: 100: Hoare triple {36488#(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); {36488#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,486 INFO L273 TraceCheckUtils]: 101: Hoare triple {36488#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36488#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,487 INFO L273 TraceCheckUtils]: 102: Hoare triple {36488#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {36489#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,488 INFO L273 TraceCheckUtils]: 103: Hoare triple {36489#(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); {36489#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,489 INFO L273 TraceCheckUtils]: 104: Hoare triple {36489#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36489#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,490 INFO L273 TraceCheckUtils]: 105: Hoare triple {36489#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {36490#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:25,491 INFO L273 TraceCheckUtils]: 106: Hoare triple {36490#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} assume !(~k~0 < 100000); {36455#false} is VALID [2018-11-23 12:00:25,491 INFO L273 TraceCheckUtils]: 107: Hoare triple {36455#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); {36455#false} is VALID [2018-11-23 12:00:25,491 INFO L273 TraceCheckUtils]: 108: Hoare triple {36455#false} ~x~0 := 0; {36455#false} is VALID [2018-11-23 12:00:25,491 INFO L273 TraceCheckUtils]: 109: Hoare triple {36455#false} assume !(~x~0 < ~i~0); {36455#false} is VALID [2018-11-23 12:00:25,491 INFO L273 TraceCheckUtils]: 110: Hoare triple {36455#false} ~x~0 := ~i~0; {36455#false} is VALID [2018-11-23 12:00:25,492 INFO L273 TraceCheckUtils]: 111: Hoare triple {36455#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); {36455#false} is VALID [2018-11-23 12:00:25,492 INFO L256 TraceCheckUtils]: 112: Hoare triple {36455#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {36454#true} is VALID [2018-11-23 12:00:25,492 INFO L273 TraceCheckUtils]: 113: Hoare triple {36454#true} ~cond := #in~cond; {36454#true} is VALID [2018-11-23 12:00:25,492 INFO L273 TraceCheckUtils]: 114: Hoare triple {36454#true} assume !(0 == ~cond); {36454#true} is VALID [2018-11-23 12:00:25,492 INFO L273 TraceCheckUtils]: 115: Hoare triple {36454#true} assume true; {36454#true} is VALID [2018-11-23 12:00:25,493 INFO L268 TraceCheckUtils]: 116: Hoare quadruple {36454#true} {36455#false} #136#return; {36455#false} is VALID [2018-11-23 12:00:25,493 INFO L273 TraceCheckUtils]: 117: Hoare triple {36455#false} havoc #t~mem9;havoc #t~mem10; {36455#false} is VALID [2018-11-23 12:00:25,493 INFO L273 TraceCheckUtils]: 118: Hoare triple {36455#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {36455#false} is VALID [2018-11-23 12:00:25,493 INFO L273 TraceCheckUtils]: 119: Hoare triple {36455#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); {36455#false} is VALID [2018-11-23 12:00:25,493 INFO L256 TraceCheckUtils]: 120: Hoare triple {36455#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {36455#false} is VALID [2018-11-23 12:00:25,493 INFO L273 TraceCheckUtils]: 121: Hoare triple {36455#false} ~cond := #in~cond; {36455#false} is VALID [2018-11-23 12:00:25,494 INFO L273 TraceCheckUtils]: 122: Hoare triple {36455#false} assume 0 == ~cond; {36455#false} is VALID [2018-11-23 12:00:25,494 INFO L273 TraceCheckUtils]: 123: Hoare triple {36455#false} assume !false; {36455#false} is VALID [2018-11-23 12:00:25,543 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 12:00:25,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:25,544 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:00:25,552 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:00:25,671 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 34 check-sat command(s) [2018-11-23 12:00:25,672 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:00:25,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:25,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:26,735 INFO L256 TraceCheckUtils]: 0: Hoare triple {36454#true} call ULTIMATE.init(); {36454#true} is VALID [2018-11-23 12:00:26,735 INFO L273 TraceCheckUtils]: 1: Hoare triple {36454#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {36454#true} is VALID [2018-11-23 12:00:26,735 INFO L273 TraceCheckUtils]: 2: Hoare triple {36454#true} assume true; {36454#true} is VALID [2018-11-23 12:00:26,736 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36454#true} {36454#true} #130#return; {36454#true} is VALID [2018-11-23 12:00:26,736 INFO L256 TraceCheckUtils]: 4: Hoare triple {36454#true} call #t~ret15 := main(); {36454#true} is VALID [2018-11-23 12:00:26,736 INFO L273 TraceCheckUtils]: 5: Hoare triple {36454#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {36509#(<= main_~i~0 0)} is VALID [2018-11-23 12:00:26,737 INFO L273 TraceCheckUtils]: 6: Hoare triple {36509#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {36513#(<= main_~k~0 1)} is VALID [2018-11-23 12:00:26,737 INFO L273 TraceCheckUtils]: 7: Hoare triple {36513#(<= 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); {36513#(<= main_~k~0 1)} is VALID [2018-11-23 12:00:26,738 INFO L273 TraceCheckUtils]: 8: Hoare triple {36513#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36513#(<= main_~k~0 1)} is VALID [2018-11-23 12:00:26,738 INFO L273 TraceCheckUtils]: 9: Hoare triple {36513#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {36523#(<= main_~k~0 2)} is VALID [2018-11-23 12:00:26,739 INFO L273 TraceCheckUtils]: 10: Hoare triple {36523#(<= 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); {36523#(<= main_~k~0 2)} is VALID [2018-11-23 12:00:26,739 INFO L273 TraceCheckUtils]: 11: Hoare triple {36523#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36523#(<= main_~k~0 2)} is VALID [2018-11-23 12:00:26,740 INFO L273 TraceCheckUtils]: 12: Hoare triple {36523#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {36533#(<= main_~k~0 3)} is VALID [2018-11-23 12:00:26,740 INFO L273 TraceCheckUtils]: 13: Hoare triple {36533#(<= 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); {36533#(<= main_~k~0 3)} is VALID [2018-11-23 12:00:26,741 INFO L273 TraceCheckUtils]: 14: Hoare triple {36533#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36533#(<= main_~k~0 3)} is VALID [2018-11-23 12:00:26,742 INFO L273 TraceCheckUtils]: 15: Hoare triple {36533#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {36543#(<= main_~k~0 4)} is VALID [2018-11-23 12:00:26,742 INFO L273 TraceCheckUtils]: 16: Hoare triple {36543#(<= 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); {36543#(<= main_~k~0 4)} is VALID [2018-11-23 12:00:26,743 INFO L273 TraceCheckUtils]: 17: Hoare triple {36543#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36543#(<= main_~k~0 4)} is VALID [2018-11-23 12:00:26,743 INFO L273 TraceCheckUtils]: 18: Hoare triple {36543#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {36553#(<= main_~k~0 5)} is VALID [2018-11-23 12:00:26,744 INFO L273 TraceCheckUtils]: 19: Hoare triple {36553#(<= 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); {36553#(<= main_~k~0 5)} is VALID [2018-11-23 12:00:26,744 INFO L273 TraceCheckUtils]: 20: Hoare triple {36553#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36553#(<= main_~k~0 5)} is VALID [2018-11-23 12:00:26,745 INFO L273 TraceCheckUtils]: 21: Hoare triple {36553#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {36563#(<= main_~k~0 6)} is VALID [2018-11-23 12:00:26,746 INFO L273 TraceCheckUtils]: 22: Hoare triple {36563#(<= 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); {36563#(<= main_~k~0 6)} is VALID [2018-11-23 12:00:26,746 INFO L273 TraceCheckUtils]: 23: Hoare triple {36563#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36563#(<= main_~k~0 6)} is VALID [2018-11-23 12:00:26,747 INFO L273 TraceCheckUtils]: 24: Hoare triple {36563#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {36573#(<= main_~k~0 7)} is VALID [2018-11-23 12:00:26,747 INFO L273 TraceCheckUtils]: 25: Hoare triple {36573#(<= 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); {36573#(<= main_~k~0 7)} is VALID [2018-11-23 12:00:26,748 INFO L273 TraceCheckUtils]: 26: Hoare triple {36573#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36573#(<= main_~k~0 7)} is VALID [2018-11-23 12:00:26,749 INFO L273 TraceCheckUtils]: 27: Hoare triple {36573#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {36583#(<= main_~k~0 8)} is VALID [2018-11-23 12:00:26,749 INFO L273 TraceCheckUtils]: 28: Hoare triple {36583#(<= 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); {36583#(<= main_~k~0 8)} is VALID [2018-11-23 12:00:26,750 INFO L273 TraceCheckUtils]: 29: Hoare triple {36583#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36583#(<= main_~k~0 8)} is VALID [2018-11-23 12:00:26,750 INFO L273 TraceCheckUtils]: 30: Hoare triple {36583#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {36593#(<= main_~k~0 9)} is VALID [2018-11-23 12:00:26,751 INFO L273 TraceCheckUtils]: 31: Hoare triple {36593#(<= 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); {36593#(<= main_~k~0 9)} is VALID [2018-11-23 12:00:26,751 INFO L273 TraceCheckUtils]: 32: Hoare triple {36593#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36593#(<= main_~k~0 9)} is VALID [2018-11-23 12:00:26,752 INFO L273 TraceCheckUtils]: 33: Hoare triple {36593#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {36603#(<= main_~k~0 10)} is VALID [2018-11-23 12:00:26,753 INFO L273 TraceCheckUtils]: 34: Hoare triple {36603#(<= 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); {36603#(<= main_~k~0 10)} is VALID [2018-11-23 12:00:26,753 INFO L273 TraceCheckUtils]: 35: Hoare triple {36603#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36603#(<= main_~k~0 10)} is VALID [2018-11-23 12:00:26,754 INFO L273 TraceCheckUtils]: 36: Hoare triple {36603#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {36613#(<= main_~k~0 11)} is VALID [2018-11-23 12:00:26,754 INFO L273 TraceCheckUtils]: 37: Hoare triple {36613#(<= 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); {36613#(<= main_~k~0 11)} is VALID [2018-11-23 12:00:26,755 INFO L273 TraceCheckUtils]: 38: Hoare triple {36613#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36613#(<= main_~k~0 11)} is VALID [2018-11-23 12:00:26,756 INFO L273 TraceCheckUtils]: 39: Hoare triple {36613#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {36623#(<= main_~k~0 12)} is VALID [2018-11-23 12:00:26,756 INFO L273 TraceCheckUtils]: 40: Hoare triple {36623#(<= 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); {36623#(<= main_~k~0 12)} is VALID [2018-11-23 12:00:26,757 INFO L273 TraceCheckUtils]: 41: Hoare triple {36623#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36623#(<= main_~k~0 12)} is VALID [2018-11-23 12:00:26,757 INFO L273 TraceCheckUtils]: 42: Hoare triple {36623#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {36633#(<= main_~k~0 13)} is VALID [2018-11-23 12:00:26,758 INFO L273 TraceCheckUtils]: 43: Hoare triple {36633#(<= 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); {36633#(<= main_~k~0 13)} is VALID [2018-11-23 12:00:26,758 INFO L273 TraceCheckUtils]: 44: Hoare triple {36633#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36633#(<= main_~k~0 13)} is VALID [2018-11-23 12:00:26,759 INFO L273 TraceCheckUtils]: 45: Hoare triple {36633#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {36643#(<= main_~k~0 14)} is VALID [2018-11-23 12:00:26,760 INFO L273 TraceCheckUtils]: 46: Hoare triple {36643#(<= 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); {36643#(<= main_~k~0 14)} is VALID [2018-11-23 12:00:26,760 INFO L273 TraceCheckUtils]: 47: Hoare triple {36643#(<= main_~k~0 14)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36643#(<= main_~k~0 14)} is VALID [2018-11-23 12:00:26,761 INFO L273 TraceCheckUtils]: 48: Hoare triple {36643#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {36653#(<= main_~k~0 15)} is VALID [2018-11-23 12:00:26,761 INFO L273 TraceCheckUtils]: 49: Hoare triple {36653#(<= 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); {36653#(<= main_~k~0 15)} is VALID [2018-11-23 12:00:26,782 INFO L273 TraceCheckUtils]: 50: Hoare triple {36653#(<= main_~k~0 15)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36653#(<= main_~k~0 15)} is VALID [2018-11-23 12:00:26,795 INFO L273 TraceCheckUtils]: 51: Hoare triple {36653#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {36663#(<= main_~k~0 16)} is VALID [2018-11-23 12:00:26,804 INFO L273 TraceCheckUtils]: 52: Hoare triple {36663#(<= 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); {36663#(<= main_~k~0 16)} is VALID [2018-11-23 12:00:26,807 INFO L273 TraceCheckUtils]: 53: Hoare triple {36663#(<= main_~k~0 16)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36663#(<= main_~k~0 16)} is VALID [2018-11-23 12:00:26,808 INFO L273 TraceCheckUtils]: 54: Hoare triple {36663#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {36673#(<= main_~k~0 17)} is VALID [2018-11-23 12:00:26,808 INFO L273 TraceCheckUtils]: 55: Hoare triple {36673#(<= 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); {36673#(<= main_~k~0 17)} is VALID [2018-11-23 12:00:26,808 INFO L273 TraceCheckUtils]: 56: Hoare triple {36673#(<= main_~k~0 17)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36673#(<= main_~k~0 17)} is VALID [2018-11-23 12:00:26,809 INFO L273 TraceCheckUtils]: 57: Hoare triple {36673#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {36683#(<= main_~k~0 18)} is VALID [2018-11-23 12:00:26,809 INFO L273 TraceCheckUtils]: 58: Hoare triple {36683#(<= 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); {36683#(<= main_~k~0 18)} is VALID [2018-11-23 12:00:26,809 INFO L273 TraceCheckUtils]: 59: Hoare triple {36683#(<= main_~k~0 18)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36683#(<= main_~k~0 18)} is VALID [2018-11-23 12:00:26,810 INFO L273 TraceCheckUtils]: 60: Hoare triple {36683#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {36693#(<= main_~k~0 19)} is VALID [2018-11-23 12:00:26,810 INFO L273 TraceCheckUtils]: 61: Hoare triple {36693#(<= 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); {36693#(<= main_~k~0 19)} is VALID [2018-11-23 12:00:26,810 INFO L273 TraceCheckUtils]: 62: Hoare triple {36693#(<= main_~k~0 19)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36693#(<= main_~k~0 19)} is VALID [2018-11-23 12:00:26,811 INFO L273 TraceCheckUtils]: 63: Hoare triple {36693#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {36703#(<= main_~k~0 20)} is VALID [2018-11-23 12:00:26,811 INFO L273 TraceCheckUtils]: 64: Hoare triple {36703#(<= 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); {36703#(<= main_~k~0 20)} is VALID [2018-11-23 12:00:26,811 INFO L273 TraceCheckUtils]: 65: Hoare triple {36703#(<= main_~k~0 20)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36703#(<= main_~k~0 20)} is VALID [2018-11-23 12:00:26,812 INFO L273 TraceCheckUtils]: 66: Hoare triple {36703#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {36713#(<= main_~k~0 21)} is VALID [2018-11-23 12:00:26,813 INFO L273 TraceCheckUtils]: 67: Hoare triple {36713#(<= 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); {36713#(<= main_~k~0 21)} is VALID [2018-11-23 12:00:26,813 INFO L273 TraceCheckUtils]: 68: Hoare triple {36713#(<= main_~k~0 21)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36713#(<= main_~k~0 21)} is VALID [2018-11-23 12:00:26,814 INFO L273 TraceCheckUtils]: 69: Hoare triple {36713#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {36723#(<= main_~k~0 22)} is VALID [2018-11-23 12:00:26,814 INFO L273 TraceCheckUtils]: 70: Hoare triple {36723#(<= 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); {36723#(<= main_~k~0 22)} is VALID [2018-11-23 12:00:26,815 INFO L273 TraceCheckUtils]: 71: Hoare triple {36723#(<= main_~k~0 22)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36723#(<= main_~k~0 22)} is VALID [2018-11-23 12:00:26,816 INFO L273 TraceCheckUtils]: 72: Hoare triple {36723#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {36733#(<= main_~k~0 23)} is VALID [2018-11-23 12:00:26,816 INFO L273 TraceCheckUtils]: 73: Hoare triple {36733#(<= 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); {36733#(<= main_~k~0 23)} is VALID [2018-11-23 12:00:26,817 INFO L273 TraceCheckUtils]: 74: Hoare triple {36733#(<= main_~k~0 23)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36733#(<= main_~k~0 23)} is VALID [2018-11-23 12:00:26,817 INFO L273 TraceCheckUtils]: 75: Hoare triple {36733#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {36743#(<= main_~k~0 24)} is VALID [2018-11-23 12:00:26,818 INFO L273 TraceCheckUtils]: 76: Hoare triple {36743#(<= 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); {36743#(<= main_~k~0 24)} is VALID [2018-11-23 12:00:26,818 INFO L273 TraceCheckUtils]: 77: Hoare triple {36743#(<= main_~k~0 24)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36743#(<= main_~k~0 24)} is VALID [2018-11-23 12:00:26,819 INFO L273 TraceCheckUtils]: 78: Hoare triple {36743#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {36753#(<= main_~k~0 25)} is VALID [2018-11-23 12:00:26,820 INFO L273 TraceCheckUtils]: 79: Hoare triple {36753#(<= 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); {36753#(<= main_~k~0 25)} is VALID [2018-11-23 12:00:26,820 INFO L273 TraceCheckUtils]: 80: Hoare triple {36753#(<= main_~k~0 25)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36753#(<= main_~k~0 25)} is VALID [2018-11-23 12:00:26,821 INFO L273 TraceCheckUtils]: 81: Hoare triple {36753#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {36763#(<= main_~k~0 26)} is VALID [2018-11-23 12:00:26,821 INFO L273 TraceCheckUtils]: 82: Hoare triple {36763#(<= 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); {36763#(<= main_~k~0 26)} is VALID [2018-11-23 12:00:26,822 INFO L273 TraceCheckUtils]: 83: Hoare triple {36763#(<= main_~k~0 26)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36763#(<= main_~k~0 26)} is VALID [2018-11-23 12:00:26,823 INFO L273 TraceCheckUtils]: 84: Hoare triple {36763#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {36773#(<= main_~k~0 27)} is VALID [2018-11-23 12:00:26,823 INFO L273 TraceCheckUtils]: 85: Hoare triple {36773#(<= 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); {36773#(<= main_~k~0 27)} is VALID [2018-11-23 12:00:26,824 INFO L273 TraceCheckUtils]: 86: Hoare triple {36773#(<= main_~k~0 27)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36773#(<= main_~k~0 27)} is VALID [2018-11-23 12:00:26,824 INFO L273 TraceCheckUtils]: 87: Hoare triple {36773#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {36783#(<= main_~k~0 28)} is VALID [2018-11-23 12:00:26,825 INFO L273 TraceCheckUtils]: 88: Hoare triple {36783#(<= 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); {36783#(<= main_~k~0 28)} is VALID [2018-11-23 12:00:26,825 INFO L273 TraceCheckUtils]: 89: Hoare triple {36783#(<= main_~k~0 28)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36783#(<= main_~k~0 28)} is VALID [2018-11-23 12:00:26,826 INFO L273 TraceCheckUtils]: 90: Hoare triple {36783#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {36793#(<= main_~k~0 29)} is VALID [2018-11-23 12:00:26,827 INFO L273 TraceCheckUtils]: 91: Hoare triple {36793#(<= 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); {36793#(<= main_~k~0 29)} is VALID [2018-11-23 12:00:26,827 INFO L273 TraceCheckUtils]: 92: Hoare triple {36793#(<= main_~k~0 29)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36793#(<= main_~k~0 29)} is VALID [2018-11-23 12:00:26,828 INFO L273 TraceCheckUtils]: 93: Hoare triple {36793#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {36803#(<= main_~k~0 30)} is VALID [2018-11-23 12:00:26,828 INFO L273 TraceCheckUtils]: 94: Hoare triple {36803#(<= 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); {36803#(<= main_~k~0 30)} is VALID [2018-11-23 12:00:26,829 INFO L273 TraceCheckUtils]: 95: Hoare triple {36803#(<= main_~k~0 30)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36803#(<= main_~k~0 30)} is VALID [2018-11-23 12:00:26,830 INFO L273 TraceCheckUtils]: 96: Hoare triple {36803#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {36813#(<= main_~k~0 31)} is VALID [2018-11-23 12:00:26,830 INFO L273 TraceCheckUtils]: 97: Hoare triple {36813#(<= 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); {36813#(<= main_~k~0 31)} is VALID [2018-11-23 12:00:26,831 INFO L273 TraceCheckUtils]: 98: Hoare triple {36813#(<= main_~k~0 31)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36813#(<= main_~k~0 31)} is VALID [2018-11-23 12:00:26,831 INFO L273 TraceCheckUtils]: 99: Hoare triple {36813#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {36823#(<= main_~k~0 32)} is VALID [2018-11-23 12:00:26,832 INFO L273 TraceCheckUtils]: 100: Hoare triple {36823#(<= 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); {36823#(<= main_~k~0 32)} is VALID [2018-11-23 12:00:26,832 INFO L273 TraceCheckUtils]: 101: Hoare triple {36823#(<= main_~k~0 32)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36823#(<= main_~k~0 32)} is VALID [2018-11-23 12:00:26,833 INFO L273 TraceCheckUtils]: 102: Hoare triple {36823#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {36833#(<= main_~k~0 33)} is VALID [2018-11-23 12:00:26,834 INFO L273 TraceCheckUtils]: 103: Hoare triple {36833#(<= 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); {36833#(<= main_~k~0 33)} is VALID [2018-11-23 12:00:26,834 INFO L273 TraceCheckUtils]: 104: Hoare triple {36833#(<= main_~k~0 33)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {36833#(<= main_~k~0 33)} is VALID [2018-11-23 12:00:26,835 INFO L273 TraceCheckUtils]: 105: Hoare triple {36833#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {36843#(<= main_~k~0 34)} is VALID [2018-11-23 12:00:26,836 INFO L273 TraceCheckUtils]: 106: Hoare triple {36843#(<= main_~k~0 34)} assume !(~k~0 < 100000); {36455#false} is VALID [2018-11-23 12:00:26,836 INFO L273 TraceCheckUtils]: 107: Hoare triple {36455#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); {36455#false} is VALID [2018-11-23 12:00:26,836 INFO L273 TraceCheckUtils]: 108: Hoare triple {36455#false} ~x~0 := 0; {36455#false} is VALID [2018-11-23 12:00:26,836 INFO L273 TraceCheckUtils]: 109: Hoare triple {36455#false} assume !(~x~0 < ~i~0); {36455#false} is VALID [2018-11-23 12:00:26,836 INFO L273 TraceCheckUtils]: 110: Hoare triple {36455#false} ~x~0 := ~i~0; {36455#false} is VALID [2018-11-23 12:00:26,837 INFO L273 TraceCheckUtils]: 111: Hoare triple {36455#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); {36455#false} is VALID [2018-11-23 12:00:26,837 INFO L256 TraceCheckUtils]: 112: Hoare triple {36455#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {36455#false} is VALID [2018-11-23 12:00:26,837 INFO L273 TraceCheckUtils]: 113: Hoare triple {36455#false} ~cond := #in~cond; {36455#false} is VALID [2018-11-23 12:00:26,837 INFO L273 TraceCheckUtils]: 114: Hoare triple {36455#false} assume !(0 == ~cond); {36455#false} is VALID [2018-11-23 12:00:26,837 INFO L273 TraceCheckUtils]: 115: Hoare triple {36455#false} assume true; {36455#false} is VALID [2018-11-23 12:00:26,837 INFO L268 TraceCheckUtils]: 116: Hoare quadruple {36455#false} {36455#false} #136#return; {36455#false} is VALID [2018-11-23 12:00:26,838 INFO L273 TraceCheckUtils]: 117: Hoare triple {36455#false} havoc #t~mem9;havoc #t~mem10; {36455#false} is VALID [2018-11-23 12:00:26,838 INFO L273 TraceCheckUtils]: 118: Hoare triple {36455#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {36455#false} is VALID [2018-11-23 12:00:26,838 INFO L273 TraceCheckUtils]: 119: Hoare triple {36455#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); {36455#false} is VALID [2018-11-23 12:00:26,838 INFO L256 TraceCheckUtils]: 120: Hoare triple {36455#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {36455#false} is VALID [2018-11-23 12:00:26,838 INFO L273 TraceCheckUtils]: 121: Hoare triple {36455#false} ~cond := #in~cond; {36455#false} is VALID [2018-11-23 12:00:26,839 INFO L273 TraceCheckUtils]: 122: Hoare triple {36455#false} assume 0 == ~cond; {36455#false} is VALID [2018-11-23 12:00:26,839 INFO L273 TraceCheckUtils]: 123: Hoare triple {36455#false} assume !false; {36455#false} is VALID [2018-11-23 12:00:26,848 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 12:00:26,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:26,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 72 [2018-11-23 12:00:26,868 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 124 [2018-11-23 12:00:26,868 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:26,868 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 72 states. [2018-11-23 12:00:27,106 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 12:00:27,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-11-23 12:00:27,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-11-23 12:00:27,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1927, Invalid=3185, Unknown=0, NotChecked=0, Total=5112 [2018-11-23 12:00:27,108 INFO L87 Difference]: Start difference. First operand 252 states and 333 transitions. Second operand 72 states. [2018-11-23 12:00:29,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:29,122 INFO L93 Difference]: Finished difference Result 315 states and 419 transitions. [2018-11-23 12:00:29,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-23 12:00:29,122 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 124 [2018-11-23 12:00:29,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:29,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-23 12:00:29,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 243 transitions. [2018-11-23 12:00:29,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-23 12:00:29,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 243 transitions. [2018-11-23 12:00:29,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 243 transitions. [2018-11-23 12:00:29,394 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 12:00:29,400 INFO L225 Difference]: With dead ends: 315 [2018-11-23 12:00:29,400 INFO L226 Difference]: Without dead ends: 268 [2018-11-23 12:00:29,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1786 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1927, Invalid=3185, Unknown=0, NotChecked=0, Total=5112 [2018-11-23 12:00:29,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-11-23 12:00:29,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 258. [2018-11-23 12:00:29,584 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:29,584 INFO L82 GeneralOperation]: Start isEquivalent. First operand 268 states. Second operand 258 states. [2018-11-23 12:00:29,584 INFO L74 IsIncluded]: Start isIncluded. First operand 268 states. Second operand 258 states. [2018-11-23 12:00:29,584 INFO L87 Difference]: Start difference. First operand 268 states. Second operand 258 states. [2018-11-23 12:00:29,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:29,590 INFO L93 Difference]: Finished difference Result 268 states and 356 transitions. [2018-11-23 12:00:29,590 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 356 transitions. [2018-11-23 12:00:29,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:29,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:29,591 INFO L74 IsIncluded]: Start isIncluded. First operand 258 states. Second operand 268 states. [2018-11-23 12:00:29,591 INFO L87 Difference]: Start difference. First operand 258 states. Second operand 268 states. [2018-11-23 12:00:29,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:29,595 INFO L93 Difference]: Finished difference Result 268 states and 356 transitions. [2018-11-23 12:00:29,596 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 356 transitions. [2018-11-23 12:00:29,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:29,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:29,596 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:29,596 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:29,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-11-23 12:00:29,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 341 transitions. [2018-11-23 12:00:29,601 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 341 transitions. Word has length 124 [2018-11-23 12:00:29,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:29,601 INFO L480 AbstractCegarLoop]: Abstraction has 258 states and 341 transitions. [2018-11-23 12:00:29,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-11-23 12:00:29,601 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 341 transitions. [2018-11-23 12:00:29,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-23 12:00:29,602 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:29,602 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 12:00:29,602 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:29,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:29,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1353341972, now seen corresponding path program 30 times [2018-11-23 12:00:29,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:29,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:29,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:29,604 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:00:29,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:29,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:31,615 INFO L256 TraceCheckUtils]: 0: Hoare triple {38208#true} call ULTIMATE.init(); {38208#true} is VALID [2018-11-23 12:00:31,615 INFO L273 TraceCheckUtils]: 1: Hoare triple {38208#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {38208#true} is VALID [2018-11-23 12:00:31,615 INFO L273 TraceCheckUtils]: 2: Hoare triple {38208#true} assume true; {38208#true} is VALID [2018-11-23 12:00:31,615 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {38208#true} {38208#true} #130#return; {38208#true} is VALID [2018-11-23 12:00:31,615 INFO L256 TraceCheckUtils]: 4: Hoare triple {38208#true} call #t~ret15 := main(); {38208#true} is VALID [2018-11-23 12:00:31,616 INFO L273 TraceCheckUtils]: 5: Hoare triple {38208#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {38210#(= main_~i~0 0)} is VALID [2018-11-23 12:00:31,616 INFO L273 TraceCheckUtils]: 6: Hoare triple {38210#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {38211#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,617 INFO L273 TraceCheckUtils]: 7: Hoare triple {38211#(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); {38211#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,617 INFO L273 TraceCheckUtils]: 8: Hoare triple {38211#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38211#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,618 INFO L273 TraceCheckUtils]: 9: Hoare triple {38211#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {38212#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,619 INFO L273 TraceCheckUtils]: 10: Hoare triple {38212#(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); {38212#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,620 INFO L273 TraceCheckUtils]: 11: Hoare triple {38212#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38212#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,621 INFO L273 TraceCheckUtils]: 12: Hoare triple {38212#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {38213#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,621 INFO L273 TraceCheckUtils]: 13: Hoare triple {38213#(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); {38213#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,622 INFO L273 TraceCheckUtils]: 14: Hoare triple {38213#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38213#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,623 INFO L273 TraceCheckUtils]: 15: Hoare triple {38213#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {38214#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,624 INFO L273 TraceCheckUtils]: 16: Hoare triple {38214#(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); {38214#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,624 INFO L273 TraceCheckUtils]: 17: Hoare triple {38214#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38214#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,625 INFO L273 TraceCheckUtils]: 18: Hoare triple {38214#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {38215#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,626 INFO L273 TraceCheckUtils]: 19: Hoare triple {38215#(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); {38215#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,627 INFO L273 TraceCheckUtils]: 20: Hoare triple {38215#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38215#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,628 INFO L273 TraceCheckUtils]: 21: Hoare triple {38215#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {38216#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,629 INFO L273 TraceCheckUtils]: 22: Hoare triple {38216#(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); {38216#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,630 INFO L273 TraceCheckUtils]: 23: Hoare triple {38216#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38216#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,630 INFO L273 TraceCheckUtils]: 24: Hoare triple {38216#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {38217#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,631 INFO L273 TraceCheckUtils]: 25: Hoare triple {38217#(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); {38217#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,632 INFO L273 TraceCheckUtils]: 26: Hoare triple {38217#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38217#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,633 INFO L273 TraceCheckUtils]: 27: Hoare triple {38217#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {38218#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,634 INFO L273 TraceCheckUtils]: 28: Hoare triple {38218#(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); {38218#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,634 INFO L273 TraceCheckUtils]: 29: Hoare triple {38218#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38218#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,635 INFO L273 TraceCheckUtils]: 30: Hoare triple {38218#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {38219#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,636 INFO L273 TraceCheckUtils]: 31: Hoare triple {38219#(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); {38219#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,637 INFO L273 TraceCheckUtils]: 32: Hoare triple {38219#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38219#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,638 INFO L273 TraceCheckUtils]: 33: Hoare triple {38219#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {38220#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,638 INFO L273 TraceCheckUtils]: 34: Hoare triple {38220#(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); {38220#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,639 INFO L273 TraceCheckUtils]: 35: Hoare triple {38220#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38220#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,640 INFO L273 TraceCheckUtils]: 36: Hoare triple {38220#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {38221#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,641 INFO L273 TraceCheckUtils]: 37: Hoare triple {38221#(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); {38221#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,642 INFO L273 TraceCheckUtils]: 38: Hoare triple {38221#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38221#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,643 INFO L273 TraceCheckUtils]: 39: Hoare triple {38221#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {38222#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,644 INFO L273 TraceCheckUtils]: 40: Hoare triple {38222#(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); {38222#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,644 INFO L273 TraceCheckUtils]: 41: Hoare triple {38222#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38222#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,645 INFO L273 TraceCheckUtils]: 42: Hoare triple {38222#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {38223#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,646 INFO L273 TraceCheckUtils]: 43: Hoare triple {38223#(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); {38223#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,647 INFO L273 TraceCheckUtils]: 44: Hoare triple {38223#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38223#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,647 INFO L273 TraceCheckUtils]: 45: Hoare triple {38223#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {38224#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,648 INFO L273 TraceCheckUtils]: 46: Hoare triple {38224#(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); {38224#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,649 INFO L273 TraceCheckUtils]: 47: Hoare triple {38224#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38224#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,650 INFO L273 TraceCheckUtils]: 48: Hoare triple {38224#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {38225#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,651 INFO L273 TraceCheckUtils]: 49: Hoare triple {38225#(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); {38225#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,651 INFO L273 TraceCheckUtils]: 50: Hoare triple {38225#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38225#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,652 INFO L273 TraceCheckUtils]: 51: Hoare triple {38225#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {38226#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,653 INFO L273 TraceCheckUtils]: 52: Hoare triple {38226#(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); {38226#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,654 INFO L273 TraceCheckUtils]: 53: Hoare triple {38226#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38226#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,655 INFO L273 TraceCheckUtils]: 54: Hoare triple {38226#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {38227#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 12:00:31,656 INFO L273 TraceCheckUtils]: 55: Hoare triple {38227#(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); {38227#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 12:00:31,656 INFO L273 TraceCheckUtils]: 56: Hoare triple {38227#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38227#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 12:00:31,657 INFO L273 TraceCheckUtils]: 57: Hoare triple {38227#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} ~k~0 := 1 + ~k~0; {38228#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,658 INFO L273 TraceCheckUtils]: 58: Hoare triple {38228#(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); {38228#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,659 INFO L273 TraceCheckUtils]: 59: Hoare triple {38228#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38228#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,660 INFO L273 TraceCheckUtils]: 60: Hoare triple {38228#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {38229#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,660 INFO L273 TraceCheckUtils]: 61: Hoare triple {38229#(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); {38229#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,661 INFO L273 TraceCheckUtils]: 62: Hoare triple {38229#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38229#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,662 INFO L273 TraceCheckUtils]: 63: Hoare triple {38229#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {38230#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,663 INFO L273 TraceCheckUtils]: 64: Hoare triple {38230#(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); {38230#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,664 INFO L273 TraceCheckUtils]: 65: Hoare triple {38230#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38230#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,664 INFO L273 TraceCheckUtils]: 66: Hoare triple {38230#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {38231#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,665 INFO L273 TraceCheckUtils]: 67: Hoare triple {38231#(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); {38231#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,666 INFO L273 TraceCheckUtils]: 68: Hoare triple {38231#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38231#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,667 INFO L273 TraceCheckUtils]: 69: Hoare triple {38231#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {38232#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,668 INFO L273 TraceCheckUtils]: 70: Hoare triple {38232#(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); {38232#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,668 INFO L273 TraceCheckUtils]: 71: Hoare triple {38232#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38232#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,669 INFO L273 TraceCheckUtils]: 72: Hoare triple {38232#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {38233#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,670 INFO L273 TraceCheckUtils]: 73: Hoare triple {38233#(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); {38233#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,671 INFO L273 TraceCheckUtils]: 74: Hoare triple {38233#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38233#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,672 INFO L273 TraceCheckUtils]: 75: Hoare triple {38233#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {38234#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,672 INFO L273 TraceCheckUtils]: 76: Hoare triple {38234#(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); {38234#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,673 INFO L273 TraceCheckUtils]: 77: Hoare triple {38234#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38234#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,674 INFO L273 TraceCheckUtils]: 78: Hoare triple {38234#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {38235#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,675 INFO L273 TraceCheckUtils]: 79: Hoare triple {38235#(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); {38235#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,676 INFO L273 TraceCheckUtils]: 80: Hoare triple {38235#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38235#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,677 INFO L273 TraceCheckUtils]: 81: Hoare triple {38235#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {38236#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,678 INFO L273 TraceCheckUtils]: 82: Hoare triple {38236#(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); {38236#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,678 INFO L273 TraceCheckUtils]: 83: Hoare triple {38236#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38236#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,679 INFO L273 TraceCheckUtils]: 84: Hoare triple {38236#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {38237#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,680 INFO L273 TraceCheckUtils]: 85: Hoare triple {38237#(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); {38237#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,681 INFO L273 TraceCheckUtils]: 86: Hoare triple {38237#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38237#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,681 INFO L273 TraceCheckUtils]: 87: Hoare triple {38237#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {38238#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,682 INFO L273 TraceCheckUtils]: 88: Hoare triple {38238#(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); {38238#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,683 INFO L273 TraceCheckUtils]: 89: Hoare triple {38238#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38238#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,684 INFO L273 TraceCheckUtils]: 90: Hoare triple {38238#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {38239#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,685 INFO L273 TraceCheckUtils]: 91: Hoare triple {38239#(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); {38239#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,686 INFO L273 TraceCheckUtils]: 92: Hoare triple {38239#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38239#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,687 INFO L273 TraceCheckUtils]: 93: Hoare triple {38239#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {38240#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,688 INFO L273 TraceCheckUtils]: 94: Hoare triple {38240#(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); {38240#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,688 INFO L273 TraceCheckUtils]: 95: Hoare triple {38240#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38240#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,689 INFO L273 TraceCheckUtils]: 96: Hoare triple {38240#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {38241#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,690 INFO L273 TraceCheckUtils]: 97: Hoare triple {38241#(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); {38241#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,691 INFO L273 TraceCheckUtils]: 98: Hoare triple {38241#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38241#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,692 INFO L273 TraceCheckUtils]: 99: Hoare triple {38241#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {38242#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,693 INFO L273 TraceCheckUtils]: 100: Hoare triple {38242#(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); {38242#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,693 INFO L273 TraceCheckUtils]: 101: Hoare triple {38242#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38242#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,694 INFO L273 TraceCheckUtils]: 102: Hoare triple {38242#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {38243#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,695 INFO L273 TraceCheckUtils]: 103: Hoare triple {38243#(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); {38243#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,696 INFO L273 TraceCheckUtils]: 104: Hoare triple {38243#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38243#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,697 INFO L273 TraceCheckUtils]: 105: Hoare triple {38243#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {38244#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,698 INFO L273 TraceCheckUtils]: 106: Hoare triple {38244#(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); {38244#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,699 INFO L273 TraceCheckUtils]: 107: Hoare triple {38244#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38244#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,700 INFO L273 TraceCheckUtils]: 108: Hoare triple {38244#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {38245#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:31,700 INFO L273 TraceCheckUtils]: 109: Hoare triple {38245#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} assume !(~k~0 < 100000); {38209#false} is VALID [2018-11-23 12:00:31,701 INFO L273 TraceCheckUtils]: 110: Hoare triple {38209#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); {38209#false} is VALID [2018-11-23 12:00:31,701 INFO L273 TraceCheckUtils]: 111: Hoare triple {38209#false} ~x~0 := 0; {38209#false} is VALID [2018-11-23 12:00:31,701 INFO L273 TraceCheckUtils]: 112: Hoare triple {38209#false} assume !(~x~0 < ~i~0); {38209#false} is VALID [2018-11-23 12:00:31,701 INFO L273 TraceCheckUtils]: 113: Hoare triple {38209#false} ~x~0 := ~i~0; {38209#false} is VALID [2018-11-23 12:00:31,701 INFO L273 TraceCheckUtils]: 114: Hoare triple {38209#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); {38209#false} is VALID [2018-11-23 12:00:31,702 INFO L256 TraceCheckUtils]: 115: Hoare triple {38209#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {38208#true} is VALID [2018-11-23 12:00:31,702 INFO L273 TraceCheckUtils]: 116: Hoare triple {38208#true} ~cond := #in~cond; {38208#true} is VALID [2018-11-23 12:00:31,702 INFO L273 TraceCheckUtils]: 117: Hoare triple {38208#true} assume !(0 == ~cond); {38208#true} is VALID [2018-11-23 12:00:31,702 INFO L273 TraceCheckUtils]: 118: Hoare triple {38208#true} assume true; {38208#true} is VALID [2018-11-23 12:00:31,702 INFO L268 TraceCheckUtils]: 119: Hoare quadruple {38208#true} {38209#false} #136#return; {38209#false} is VALID [2018-11-23 12:00:31,703 INFO L273 TraceCheckUtils]: 120: Hoare triple {38209#false} havoc #t~mem9;havoc #t~mem10; {38209#false} is VALID [2018-11-23 12:00:31,703 INFO L273 TraceCheckUtils]: 121: Hoare triple {38209#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {38209#false} is VALID [2018-11-23 12:00:31,703 INFO L273 TraceCheckUtils]: 122: Hoare triple {38209#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); {38209#false} is VALID [2018-11-23 12:00:31,703 INFO L256 TraceCheckUtils]: 123: Hoare triple {38209#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {38209#false} is VALID [2018-11-23 12:00:31,703 INFO L273 TraceCheckUtils]: 124: Hoare triple {38209#false} ~cond := #in~cond; {38209#false} is VALID [2018-11-23 12:00:31,703 INFO L273 TraceCheckUtils]: 125: Hoare triple {38209#false} assume 0 == ~cond; {38209#false} is VALID [2018-11-23 12:00:31,704 INFO L273 TraceCheckUtils]: 126: Hoare triple {38209#false} assume !false; {38209#false} is VALID [2018-11-23 12:00:31,727 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 12:00:31,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:31,727 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:00:31,735 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:00:32,021 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 35 check-sat command(s) [2018-11-23 12:00:32,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:00:32,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:32,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:33,689 INFO L256 TraceCheckUtils]: 0: Hoare triple {38208#true} call ULTIMATE.init(); {38208#true} is VALID [2018-11-23 12:00:33,689 INFO L273 TraceCheckUtils]: 1: Hoare triple {38208#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {38208#true} is VALID [2018-11-23 12:00:33,690 INFO L273 TraceCheckUtils]: 2: Hoare triple {38208#true} assume true; {38208#true} is VALID [2018-11-23 12:00:33,690 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {38208#true} {38208#true} #130#return; {38208#true} is VALID [2018-11-23 12:00:33,690 INFO L256 TraceCheckUtils]: 4: Hoare triple {38208#true} call #t~ret15 := main(); {38208#true} is VALID [2018-11-23 12:00:33,691 INFO L273 TraceCheckUtils]: 5: Hoare triple {38208#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {38264#(<= main_~i~0 0)} is VALID [2018-11-23 12:00:33,692 INFO L273 TraceCheckUtils]: 6: Hoare triple {38264#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {38268#(<= main_~k~0 1)} is VALID [2018-11-23 12:00:33,692 INFO L273 TraceCheckUtils]: 7: Hoare triple {38268#(<= 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); {38268#(<= main_~k~0 1)} is VALID [2018-11-23 12:00:33,692 INFO L273 TraceCheckUtils]: 8: Hoare triple {38268#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38268#(<= main_~k~0 1)} is VALID [2018-11-23 12:00:33,693 INFO L273 TraceCheckUtils]: 9: Hoare triple {38268#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {38278#(<= main_~k~0 2)} is VALID [2018-11-23 12:00:33,693 INFO L273 TraceCheckUtils]: 10: Hoare triple {38278#(<= 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); {38278#(<= main_~k~0 2)} is VALID [2018-11-23 12:00:33,693 INFO L273 TraceCheckUtils]: 11: Hoare triple {38278#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38278#(<= main_~k~0 2)} is VALID [2018-11-23 12:00:33,694 INFO L273 TraceCheckUtils]: 12: Hoare triple {38278#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {38288#(<= main_~k~0 3)} is VALID [2018-11-23 12:00:33,694 INFO L273 TraceCheckUtils]: 13: Hoare triple {38288#(<= 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); {38288#(<= main_~k~0 3)} is VALID [2018-11-23 12:00:33,695 INFO L273 TraceCheckUtils]: 14: Hoare triple {38288#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38288#(<= main_~k~0 3)} is VALID [2018-11-23 12:00:33,696 INFO L273 TraceCheckUtils]: 15: Hoare triple {38288#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {38298#(<= main_~k~0 4)} is VALID [2018-11-23 12:00:33,696 INFO L273 TraceCheckUtils]: 16: Hoare triple {38298#(<= 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); {38298#(<= main_~k~0 4)} is VALID [2018-11-23 12:00:33,697 INFO L273 TraceCheckUtils]: 17: Hoare triple {38298#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38298#(<= main_~k~0 4)} is VALID [2018-11-23 12:00:33,697 INFO L273 TraceCheckUtils]: 18: Hoare triple {38298#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {38308#(<= main_~k~0 5)} is VALID [2018-11-23 12:00:33,698 INFO L273 TraceCheckUtils]: 19: Hoare triple {38308#(<= 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); {38308#(<= main_~k~0 5)} is VALID [2018-11-23 12:00:33,698 INFO L273 TraceCheckUtils]: 20: Hoare triple {38308#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38308#(<= main_~k~0 5)} is VALID [2018-11-23 12:00:33,699 INFO L273 TraceCheckUtils]: 21: Hoare triple {38308#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {38318#(<= main_~k~0 6)} is VALID [2018-11-23 12:00:33,700 INFO L273 TraceCheckUtils]: 22: Hoare triple {38318#(<= 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); {38318#(<= main_~k~0 6)} is VALID [2018-11-23 12:00:33,700 INFO L273 TraceCheckUtils]: 23: Hoare triple {38318#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38318#(<= main_~k~0 6)} is VALID [2018-11-23 12:00:33,701 INFO L273 TraceCheckUtils]: 24: Hoare triple {38318#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {38328#(<= main_~k~0 7)} is VALID [2018-11-23 12:00:33,701 INFO L273 TraceCheckUtils]: 25: Hoare triple {38328#(<= 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); {38328#(<= main_~k~0 7)} is VALID [2018-11-23 12:00:33,702 INFO L273 TraceCheckUtils]: 26: Hoare triple {38328#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38328#(<= main_~k~0 7)} is VALID [2018-11-23 12:00:33,703 INFO L273 TraceCheckUtils]: 27: Hoare triple {38328#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {38338#(<= main_~k~0 8)} is VALID [2018-11-23 12:00:33,703 INFO L273 TraceCheckUtils]: 28: Hoare triple {38338#(<= 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); {38338#(<= main_~k~0 8)} is VALID [2018-11-23 12:00:33,704 INFO L273 TraceCheckUtils]: 29: Hoare triple {38338#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38338#(<= main_~k~0 8)} is VALID [2018-11-23 12:00:33,704 INFO L273 TraceCheckUtils]: 30: Hoare triple {38338#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {38348#(<= main_~k~0 9)} is VALID [2018-11-23 12:00:33,705 INFO L273 TraceCheckUtils]: 31: Hoare triple {38348#(<= 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); {38348#(<= main_~k~0 9)} is VALID [2018-11-23 12:00:33,705 INFO L273 TraceCheckUtils]: 32: Hoare triple {38348#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38348#(<= main_~k~0 9)} is VALID [2018-11-23 12:00:33,706 INFO L273 TraceCheckUtils]: 33: Hoare triple {38348#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {38358#(<= main_~k~0 10)} is VALID [2018-11-23 12:00:33,707 INFO L273 TraceCheckUtils]: 34: Hoare triple {38358#(<= 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); {38358#(<= main_~k~0 10)} is VALID [2018-11-23 12:00:33,707 INFO L273 TraceCheckUtils]: 35: Hoare triple {38358#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38358#(<= main_~k~0 10)} is VALID [2018-11-23 12:00:33,708 INFO L273 TraceCheckUtils]: 36: Hoare triple {38358#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {38368#(<= main_~k~0 11)} is VALID [2018-11-23 12:00:33,708 INFO L273 TraceCheckUtils]: 37: Hoare triple {38368#(<= 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); {38368#(<= main_~k~0 11)} is VALID [2018-11-23 12:00:33,709 INFO L273 TraceCheckUtils]: 38: Hoare triple {38368#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38368#(<= main_~k~0 11)} is VALID [2018-11-23 12:00:33,710 INFO L273 TraceCheckUtils]: 39: Hoare triple {38368#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {38378#(<= main_~k~0 12)} is VALID [2018-11-23 12:00:33,710 INFO L273 TraceCheckUtils]: 40: Hoare triple {38378#(<= 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); {38378#(<= main_~k~0 12)} is VALID [2018-11-23 12:00:33,711 INFO L273 TraceCheckUtils]: 41: Hoare triple {38378#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38378#(<= main_~k~0 12)} is VALID [2018-11-23 12:00:33,711 INFO L273 TraceCheckUtils]: 42: Hoare triple {38378#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {38388#(<= main_~k~0 13)} is VALID [2018-11-23 12:00:33,712 INFO L273 TraceCheckUtils]: 43: Hoare triple {38388#(<= 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); {38388#(<= main_~k~0 13)} is VALID [2018-11-23 12:00:33,712 INFO L273 TraceCheckUtils]: 44: Hoare triple {38388#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38388#(<= main_~k~0 13)} is VALID [2018-11-23 12:00:33,713 INFO L273 TraceCheckUtils]: 45: Hoare triple {38388#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {38398#(<= main_~k~0 14)} is VALID [2018-11-23 12:00:33,714 INFO L273 TraceCheckUtils]: 46: Hoare triple {38398#(<= 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); {38398#(<= main_~k~0 14)} is VALID [2018-11-23 12:00:33,714 INFO L273 TraceCheckUtils]: 47: Hoare triple {38398#(<= main_~k~0 14)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38398#(<= main_~k~0 14)} is VALID [2018-11-23 12:00:33,715 INFO L273 TraceCheckUtils]: 48: Hoare triple {38398#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {38408#(<= main_~k~0 15)} is VALID [2018-11-23 12:00:33,715 INFO L273 TraceCheckUtils]: 49: Hoare triple {38408#(<= 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); {38408#(<= main_~k~0 15)} is VALID [2018-11-23 12:00:33,716 INFO L273 TraceCheckUtils]: 50: Hoare triple {38408#(<= main_~k~0 15)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38408#(<= main_~k~0 15)} is VALID [2018-11-23 12:00:33,717 INFO L273 TraceCheckUtils]: 51: Hoare triple {38408#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {38418#(<= main_~k~0 16)} is VALID [2018-11-23 12:00:33,717 INFO L273 TraceCheckUtils]: 52: Hoare triple {38418#(<= 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); {38418#(<= main_~k~0 16)} is VALID [2018-11-23 12:00:33,718 INFO L273 TraceCheckUtils]: 53: Hoare triple {38418#(<= main_~k~0 16)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38418#(<= main_~k~0 16)} is VALID [2018-11-23 12:00:33,718 INFO L273 TraceCheckUtils]: 54: Hoare triple {38418#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {38428#(<= main_~k~0 17)} is VALID [2018-11-23 12:00:33,719 INFO L273 TraceCheckUtils]: 55: Hoare triple {38428#(<= 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); {38428#(<= main_~k~0 17)} is VALID [2018-11-23 12:00:33,719 INFO L273 TraceCheckUtils]: 56: Hoare triple {38428#(<= main_~k~0 17)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38428#(<= main_~k~0 17)} is VALID [2018-11-23 12:00:33,720 INFO L273 TraceCheckUtils]: 57: Hoare triple {38428#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {38438#(<= main_~k~0 18)} is VALID [2018-11-23 12:00:33,721 INFO L273 TraceCheckUtils]: 58: Hoare triple {38438#(<= 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); {38438#(<= main_~k~0 18)} is VALID [2018-11-23 12:00:33,721 INFO L273 TraceCheckUtils]: 59: Hoare triple {38438#(<= main_~k~0 18)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38438#(<= main_~k~0 18)} is VALID [2018-11-23 12:00:33,722 INFO L273 TraceCheckUtils]: 60: Hoare triple {38438#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {38448#(<= main_~k~0 19)} is VALID [2018-11-23 12:00:33,723 INFO L273 TraceCheckUtils]: 61: Hoare triple {38448#(<= 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); {38448#(<= main_~k~0 19)} is VALID [2018-11-23 12:00:33,723 INFO L273 TraceCheckUtils]: 62: Hoare triple {38448#(<= main_~k~0 19)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38448#(<= main_~k~0 19)} is VALID [2018-11-23 12:00:33,724 INFO L273 TraceCheckUtils]: 63: Hoare triple {38448#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {38458#(<= main_~k~0 20)} is VALID [2018-11-23 12:00:33,724 INFO L273 TraceCheckUtils]: 64: Hoare triple {38458#(<= 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); {38458#(<= main_~k~0 20)} is VALID [2018-11-23 12:00:33,725 INFO L273 TraceCheckUtils]: 65: Hoare triple {38458#(<= main_~k~0 20)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38458#(<= main_~k~0 20)} is VALID [2018-11-23 12:00:33,726 INFO L273 TraceCheckUtils]: 66: Hoare triple {38458#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {38468#(<= main_~k~0 21)} is VALID [2018-11-23 12:00:33,726 INFO L273 TraceCheckUtils]: 67: Hoare triple {38468#(<= 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); {38468#(<= main_~k~0 21)} is VALID [2018-11-23 12:00:33,727 INFO L273 TraceCheckUtils]: 68: Hoare triple {38468#(<= main_~k~0 21)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38468#(<= main_~k~0 21)} is VALID [2018-11-23 12:00:33,727 INFO L273 TraceCheckUtils]: 69: Hoare triple {38468#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {38478#(<= main_~k~0 22)} is VALID [2018-11-23 12:00:33,728 INFO L273 TraceCheckUtils]: 70: Hoare triple {38478#(<= 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); {38478#(<= main_~k~0 22)} is VALID [2018-11-23 12:00:33,728 INFO L273 TraceCheckUtils]: 71: Hoare triple {38478#(<= main_~k~0 22)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38478#(<= main_~k~0 22)} is VALID [2018-11-23 12:00:33,729 INFO L273 TraceCheckUtils]: 72: Hoare triple {38478#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {38488#(<= main_~k~0 23)} is VALID [2018-11-23 12:00:33,730 INFO L273 TraceCheckUtils]: 73: Hoare triple {38488#(<= 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); {38488#(<= main_~k~0 23)} is VALID [2018-11-23 12:00:33,730 INFO L273 TraceCheckUtils]: 74: Hoare triple {38488#(<= main_~k~0 23)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38488#(<= main_~k~0 23)} is VALID [2018-11-23 12:00:33,731 INFO L273 TraceCheckUtils]: 75: Hoare triple {38488#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {38498#(<= main_~k~0 24)} is VALID [2018-11-23 12:00:33,731 INFO L273 TraceCheckUtils]: 76: Hoare triple {38498#(<= 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); {38498#(<= main_~k~0 24)} is VALID [2018-11-23 12:00:33,732 INFO L273 TraceCheckUtils]: 77: Hoare triple {38498#(<= main_~k~0 24)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38498#(<= main_~k~0 24)} is VALID [2018-11-23 12:00:33,733 INFO L273 TraceCheckUtils]: 78: Hoare triple {38498#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {38508#(<= main_~k~0 25)} is VALID [2018-11-23 12:00:33,733 INFO L273 TraceCheckUtils]: 79: Hoare triple {38508#(<= 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); {38508#(<= main_~k~0 25)} is VALID [2018-11-23 12:00:33,734 INFO L273 TraceCheckUtils]: 80: Hoare triple {38508#(<= main_~k~0 25)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38508#(<= main_~k~0 25)} is VALID [2018-11-23 12:00:33,734 INFO L273 TraceCheckUtils]: 81: Hoare triple {38508#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {38518#(<= main_~k~0 26)} is VALID [2018-11-23 12:00:33,735 INFO L273 TraceCheckUtils]: 82: Hoare triple {38518#(<= 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); {38518#(<= main_~k~0 26)} is VALID [2018-11-23 12:00:33,735 INFO L273 TraceCheckUtils]: 83: Hoare triple {38518#(<= main_~k~0 26)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38518#(<= main_~k~0 26)} is VALID [2018-11-23 12:00:33,736 INFO L273 TraceCheckUtils]: 84: Hoare triple {38518#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {38528#(<= main_~k~0 27)} is VALID [2018-11-23 12:00:33,737 INFO L273 TraceCheckUtils]: 85: Hoare triple {38528#(<= 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); {38528#(<= main_~k~0 27)} is VALID [2018-11-23 12:00:33,737 INFO L273 TraceCheckUtils]: 86: Hoare triple {38528#(<= main_~k~0 27)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38528#(<= main_~k~0 27)} is VALID [2018-11-23 12:00:33,738 INFO L273 TraceCheckUtils]: 87: Hoare triple {38528#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {38538#(<= main_~k~0 28)} is VALID [2018-11-23 12:00:33,738 INFO L273 TraceCheckUtils]: 88: Hoare triple {38538#(<= 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); {38538#(<= main_~k~0 28)} is VALID [2018-11-23 12:00:33,739 INFO L273 TraceCheckUtils]: 89: Hoare triple {38538#(<= main_~k~0 28)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38538#(<= main_~k~0 28)} is VALID [2018-11-23 12:00:33,740 INFO L273 TraceCheckUtils]: 90: Hoare triple {38538#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {38548#(<= main_~k~0 29)} is VALID [2018-11-23 12:00:33,740 INFO L273 TraceCheckUtils]: 91: Hoare triple {38548#(<= 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); {38548#(<= main_~k~0 29)} is VALID [2018-11-23 12:00:33,741 INFO L273 TraceCheckUtils]: 92: Hoare triple {38548#(<= main_~k~0 29)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38548#(<= main_~k~0 29)} is VALID [2018-11-23 12:00:33,741 INFO L273 TraceCheckUtils]: 93: Hoare triple {38548#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {38558#(<= main_~k~0 30)} is VALID [2018-11-23 12:00:33,742 INFO L273 TraceCheckUtils]: 94: Hoare triple {38558#(<= 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); {38558#(<= main_~k~0 30)} is VALID [2018-11-23 12:00:33,742 INFO L273 TraceCheckUtils]: 95: Hoare triple {38558#(<= main_~k~0 30)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38558#(<= main_~k~0 30)} is VALID [2018-11-23 12:00:33,743 INFO L273 TraceCheckUtils]: 96: Hoare triple {38558#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {38568#(<= main_~k~0 31)} is VALID [2018-11-23 12:00:33,744 INFO L273 TraceCheckUtils]: 97: Hoare triple {38568#(<= 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); {38568#(<= main_~k~0 31)} is VALID [2018-11-23 12:00:33,744 INFO L273 TraceCheckUtils]: 98: Hoare triple {38568#(<= main_~k~0 31)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38568#(<= main_~k~0 31)} is VALID [2018-11-23 12:00:33,745 INFO L273 TraceCheckUtils]: 99: Hoare triple {38568#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {38578#(<= main_~k~0 32)} is VALID [2018-11-23 12:00:33,745 INFO L273 TraceCheckUtils]: 100: Hoare triple {38578#(<= 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); {38578#(<= main_~k~0 32)} is VALID [2018-11-23 12:00:33,746 INFO L273 TraceCheckUtils]: 101: Hoare triple {38578#(<= main_~k~0 32)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38578#(<= main_~k~0 32)} is VALID [2018-11-23 12:00:33,747 INFO L273 TraceCheckUtils]: 102: Hoare triple {38578#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {38588#(<= main_~k~0 33)} is VALID [2018-11-23 12:00:33,747 INFO L273 TraceCheckUtils]: 103: Hoare triple {38588#(<= 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); {38588#(<= main_~k~0 33)} is VALID [2018-11-23 12:00:33,748 INFO L273 TraceCheckUtils]: 104: Hoare triple {38588#(<= main_~k~0 33)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38588#(<= main_~k~0 33)} is VALID [2018-11-23 12:00:33,748 INFO L273 TraceCheckUtils]: 105: Hoare triple {38588#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {38598#(<= main_~k~0 34)} is VALID [2018-11-23 12:00:33,749 INFO L273 TraceCheckUtils]: 106: Hoare triple {38598#(<= 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); {38598#(<= main_~k~0 34)} is VALID [2018-11-23 12:00:33,749 INFO L273 TraceCheckUtils]: 107: Hoare triple {38598#(<= main_~k~0 34)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {38598#(<= main_~k~0 34)} is VALID [2018-11-23 12:00:33,750 INFO L273 TraceCheckUtils]: 108: Hoare triple {38598#(<= main_~k~0 34)} ~k~0 := 1 + ~k~0; {38608#(<= main_~k~0 35)} is VALID [2018-11-23 12:00:33,751 INFO L273 TraceCheckUtils]: 109: Hoare triple {38608#(<= main_~k~0 35)} assume !(~k~0 < 100000); {38209#false} is VALID [2018-11-23 12:00:33,751 INFO L273 TraceCheckUtils]: 110: Hoare triple {38209#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); {38209#false} is VALID [2018-11-23 12:00:33,751 INFO L273 TraceCheckUtils]: 111: Hoare triple {38209#false} ~x~0 := 0; {38209#false} is VALID [2018-11-23 12:00:33,752 INFO L273 TraceCheckUtils]: 112: Hoare triple {38209#false} assume !(~x~0 < ~i~0); {38209#false} is VALID [2018-11-23 12:00:33,752 INFO L273 TraceCheckUtils]: 113: Hoare triple {38209#false} ~x~0 := ~i~0; {38209#false} is VALID [2018-11-23 12:00:33,752 INFO L273 TraceCheckUtils]: 114: Hoare triple {38209#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); {38209#false} is VALID [2018-11-23 12:00:33,752 INFO L256 TraceCheckUtils]: 115: Hoare triple {38209#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {38209#false} is VALID [2018-11-23 12:00:33,752 INFO L273 TraceCheckUtils]: 116: Hoare triple {38209#false} ~cond := #in~cond; {38209#false} is VALID [2018-11-23 12:00:33,752 INFO L273 TraceCheckUtils]: 117: Hoare triple {38209#false} assume !(0 == ~cond); {38209#false} is VALID [2018-11-23 12:00:33,753 INFO L273 TraceCheckUtils]: 118: Hoare triple {38209#false} assume true; {38209#false} is VALID [2018-11-23 12:00:33,753 INFO L268 TraceCheckUtils]: 119: Hoare quadruple {38209#false} {38209#false} #136#return; {38209#false} is VALID [2018-11-23 12:00:33,753 INFO L273 TraceCheckUtils]: 120: Hoare triple {38209#false} havoc #t~mem9;havoc #t~mem10; {38209#false} is VALID [2018-11-23 12:00:33,753 INFO L273 TraceCheckUtils]: 121: Hoare triple {38209#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {38209#false} is VALID [2018-11-23 12:00:33,753 INFO L273 TraceCheckUtils]: 122: Hoare triple {38209#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); {38209#false} is VALID [2018-11-23 12:00:33,754 INFO L256 TraceCheckUtils]: 123: Hoare triple {38209#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {38209#false} is VALID [2018-11-23 12:00:33,754 INFO L273 TraceCheckUtils]: 124: Hoare triple {38209#false} ~cond := #in~cond; {38209#false} is VALID [2018-11-23 12:00:33,754 INFO L273 TraceCheckUtils]: 125: Hoare triple {38209#false} assume 0 == ~cond; {38209#false} is VALID [2018-11-23 12:00:33,754 INFO L273 TraceCheckUtils]: 126: Hoare triple {38209#false} assume !false; {38209#false} is VALID [2018-11-23 12:00:33,764 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 12:00:33,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:33,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 74 [2018-11-23 12:00:33,786 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 127 [2018-11-23 12:00:33,787 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:33,787 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 74 states. [2018-11-23 12:00:34,031 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 234 edges. 234 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:34,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-11-23 12:00:34,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-11-23 12:00:34,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2036, Invalid=3366, Unknown=0, NotChecked=0, Total=5402 [2018-11-23 12:00:34,033 INFO L87 Difference]: Start difference. First operand 258 states and 341 transitions. Second operand 74 states. [2018-11-23 12:00:35,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:35,511 INFO L93 Difference]: Finished difference Result 321 states and 427 transitions. [2018-11-23 12:00:35,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-23 12:00:35,512 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 127 [2018-11-23 12:00:35,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:35,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-23 12:00:35,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 247 transitions. [2018-11-23 12:00:35,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-23 12:00:35,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 247 transitions. [2018-11-23 12:00:35,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 247 transitions. [2018-11-23 12:00:35,760 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 12:00:35,765 INFO L225 Difference]: With dead ends: 321 [2018-11-23 12:00:35,766 INFO L226 Difference]: Without dead ends: 274 [2018-11-23 12:00:35,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1891 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2036, Invalid=3366, Unknown=0, NotChecked=0, Total=5402 [2018-11-23 12:00:35,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-11-23 12:00:35,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 264. [2018-11-23 12:00:35,965 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:35,965 INFO L82 GeneralOperation]: Start isEquivalent. First operand 274 states. Second operand 264 states. [2018-11-23 12:00:35,965 INFO L74 IsIncluded]: Start isIncluded. First operand 274 states. Second operand 264 states. [2018-11-23 12:00:35,966 INFO L87 Difference]: Start difference. First operand 274 states. Second operand 264 states. [2018-11-23 12:00:35,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:35,971 INFO L93 Difference]: Finished difference Result 274 states and 364 transitions. [2018-11-23 12:00:35,971 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 364 transitions. [2018-11-23 12:00:35,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:35,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:35,972 INFO L74 IsIncluded]: Start isIncluded. First operand 264 states. Second operand 274 states. [2018-11-23 12:00:35,972 INFO L87 Difference]: Start difference. First operand 264 states. Second operand 274 states. [2018-11-23 12:00:35,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:35,977 INFO L93 Difference]: Finished difference Result 274 states and 364 transitions. [2018-11-23 12:00:35,977 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 364 transitions. [2018-11-23 12:00:35,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:35,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:35,977 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:35,977 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:35,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-11-23 12:00:35,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 349 transitions. [2018-11-23 12:00:35,982 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 349 transitions. Word has length 127 [2018-11-23 12:00:35,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:35,982 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 349 transitions. [2018-11-23 12:00:35,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-11-23 12:00:35,982 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 349 transitions. [2018-11-23 12:00:35,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-23 12:00:35,983 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:35,983 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 12:00:35,983 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:35,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:35,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1716444911, now seen corresponding path program 31 times [2018-11-23 12:00:35,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:35,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:35,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:35,985 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:00:35,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:36,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:37,213 INFO L256 TraceCheckUtils]: 0: Hoare triple {40001#true} call ULTIMATE.init(); {40001#true} is VALID [2018-11-23 12:00:37,214 INFO L273 TraceCheckUtils]: 1: Hoare triple {40001#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {40001#true} is VALID [2018-11-23 12:00:37,214 INFO L273 TraceCheckUtils]: 2: Hoare triple {40001#true} assume true; {40001#true} is VALID [2018-11-23 12:00:37,214 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {40001#true} {40001#true} #130#return; {40001#true} is VALID [2018-11-23 12:00:37,214 INFO L256 TraceCheckUtils]: 4: Hoare triple {40001#true} call #t~ret15 := main(); {40001#true} is VALID [2018-11-23 12:00:37,214 INFO L273 TraceCheckUtils]: 5: Hoare triple {40001#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {40003#(= main_~i~0 0)} is VALID [2018-11-23 12:00:37,215 INFO L273 TraceCheckUtils]: 6: Hoare triple {40003#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {40004#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,216 INFO L273 TraceCheckUtils]: 7: Hoare triple {40004#(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); {40004#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,217 INFO L273 TraceCheckUtils]: 8: Hoare triple {40004#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40004#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,218 INFO L273 TraceCheckUtils]: 9: Hoare triple {40004#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {40005#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,218 INFO L273 TraceCheckUtils]: 10: Hoare triple {40005#(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); {40005#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,219 INFO L273 TraceCheckUtils]: 11: Hoare triple {40005#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40005#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,220 INFO L273 TraceCheckUtils]: 12: Hoare triple {40005#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {40006#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,221 INFO L273 TraceCheckUtils]: 13: Hoare triple {40006#(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); {40006#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,222 INFO L273 TraceCheckUtils]: 14: Hoare triple {40006#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40006#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,222 INFO L273 TraceCheckUtils]: 15: Hoare triple {40006#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {40007#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,223 INFO L273 TraceCheckUtils]: 16: Hoare triple {40007#(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); {40007#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,224 INFO L273 TraceCheckUtils]: 17: Hoare triple {40007#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40007#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,225 INFO L273 TraceCheckUtils]: 18: Hoare triple {40007#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {40008#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,226 INFO L273 TraceCheckUtils]: 19: Hoare triple {40008#(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); {40008#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,227 INFO L273 TraceCheckUtils]: 20: Hoare triple {40008#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40008#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,227 INFO L273 TraceCheckUtils]: 21: Hoare triple {40008#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {40009#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,228 INFO L273 TraceCheckUtils]: 22: Hoare triple {40009#(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); {40009#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,229 INFO L273 TraceCheckUtils]: 23: Hoare triple {40009#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40009#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,230 INFO L273 TraceCheckUtils]: 24: Hoare triple {40009#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {40010#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,231 INFO L273 TraceCheckUtils]: 25: Hoare triple {40010#(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); {40010#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,231 INFO L273 TraceCheckUtils]: 26: Hoare triple {40010#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40010#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,232 INFO L273 TraceCheckUtils]: 27: Hoare triple {40010#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {40011#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,233 INFO L273 TraceCheckUtils]: 28: Hoare triple {40011#(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); {40011#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,234 INFO L273 TraceCheckUtils]: 29: Hoare triple {40011#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40011#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,235 INFO L273 TraceCheckUtils]: 30: Hoare triple {40011#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {40012#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,235 INFO L273 TraceCheckUtils]: 31: Hoare triple {40012#(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); {40012#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,236 INFO L273 TraceCheckUtils]: 32: Hoare triple {40012#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40012#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,237 INFO L273 TraceCheckUtils]: 33: Hoare triple {40012#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {40013#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,238 INFO L273 TraceCheckUtils]: 34: Hoare triple {40013#(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); {40013#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,239 INFO L273 TraceCheckUtils]: 35: Hoare triple {40013#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40013#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,239 INFO L273 TraceCheckUtils]: 36: Hoare triple {40013#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {40014#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,240 INFO L273 TraceCheckUtils]: 37: Hoare triple {40014#(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); {40014#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,241 INFO L273 TraceCheckUtils]: 38: Hoare triple {40014#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40014#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,242 INFO L273 TraceCheckUtils]: 39: Hoare triple {40014#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {40015#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,243 INFO L273 TraceCheckUtils]: 40: Hoare triple {40015#(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); {40015#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,244 INFO L273 TraceCheckUtils]: 41: Hoare triple {40015#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40015#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,244 INFO L273 TraceCheckUtils]: 42: Hoare triple {40015#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {40016#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,245 INFO L273 TraceCheckUtils]: 43: Hoare triple {40016#(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); {40016#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,246 INFO L273 TraceCheckUtils]: 44: Hoare triple {40016#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40016#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,247 INFO L273 TraceCheckUtils]: 45: Hoare triple {40016#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {40017#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,248 INFO L273 TraceCheckUtils]: 46: Hoare triple {40017#(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); {40017#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,248 INFO L273 TraceCheckUtils]: 47: Hoare triple {40017#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40017#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,249 INFO L273 TraceCheckUtils]: 48: Hoare triple {40017#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {40018#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,250 INFO L273 TraceCheckUtils]: 49: Hoare triple {40018#(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); {40018#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,251 INFO L273 TraceCheckUtils]: 50: Hoare triple {40018#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40018#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,252 INFO L273 TraceCheckUtils]: 51: Hoare triple {40018#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {40019#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,253 INFO L273 TraceCheckUtils]: 52: Hoare triple {40019#(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); {40019#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,253 INFO L273 TraceCheckUtils]: 53: Hoare triple {40019#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40019#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,254 INFO L273 TraceCheckUtils]: 54: Hoare triple {40019#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {40020#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 12:00:37,255 INFO L273 TraceCheckUtils]: 55: Hoare triple {40020#(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); {40020#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 12:00:37,256 INFO L273 TraceCheckUtils]: 56: Hoare triple {40020#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40020#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 12:00:37,257 INFO L273 TraceCheckUtils]: 57: Hoare triple {40020#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} ~k~0 := 1 + ~k~0; {40021#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,257 INFO L273 TraceCheckUtils]: 58: Hoare triple {40021#(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); {40021#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,258 INFO L273 TraceCheckUtils]: 59: Hoare triple {40021#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40021#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,259 INFO L273 TraceCheckUtils]: 60: Hoare triple {40021#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {40022#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,260 INFO L273 TraceCheckUtils]: 61: Hoare triple {40022#(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); {40022#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,261 INFO L273 TraceCheckUtils]: 62: Hoare triple {40022#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40022#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,261 INFO L273 TraceCheckUtils]: 63: Hoare triple {40022#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {40023#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,262 INFO L273 TraceCheckUtils]: 64: Hoare triple {40023#(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); {40023#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,263 INFO L273 TraceCheckUtils]: 65: Hoare triple {40023#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40023#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,264 INFO L273 TraceCheckUtils]: 66: Hoare triple {40023#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {40024#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,265 INFO L273 TraceCheckUtils]: 67: Hoare triple {40024#(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); {40024#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,265 INFO L273 TraceCheckUtils]: 68: Hoare triple {40024#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40024#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,266 INFO L273 TraceCheckUtils]: 69: Hoare triple {40024#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {40025#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,267 INFO L273 TraceCheckUtils]: 70: Hoare triple {40025#(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); {40025#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,268 INFO L273 TraceCheckUtils]: 71: Hoare triple {40025#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40025#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,270 INFO L273 TraceCheckUtils]: 72: Hoare triple {40025#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {40026#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,271 INFO L273 TraceCheckUtils]: 73: Hoare triple {40026#(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); {40026#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,272 INFO L273 TraceCheckUtils]: 74: Hoare triple {40026#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40026#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,272 INFO L273 TraceCheckUtils]: 75: Hoare triple {40026#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {40027#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,273 INFO L273 TraceCheckUtils]: 76: Hoare triple {40027#(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); {40027#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,273 INFO L273 TraceCheckUtils]: 77: Hoare triple {40027#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40027#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,274 INFO L273 TraceCheckUtils]: 78: Hoare triple {40027#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {40028#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,275 INFO L273 TraceCheckUtils]: 79: Hoare triple {40028#(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); {40028#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,276 INFO L273 TraceCheckUtils]: 80: Hoare triple {40028#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40028#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,277 INFO L273 TraceCheckUtils]: 81: Hoare triple {40028#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {40029#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,278 INFO L273 TraceCheckUtils]: 82: Hoare triple {40029#(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); {40029#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,278 INFO L273 TraceCheckUtils]: 83: Hoare triple {40029#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40029#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,279 INFO L273 TraceCheckUtils]: 84: Hoare triple {40029#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {40030#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,280 INFO L273 TraceCheckUtils]: 85: Hoare triple {40030#(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); {40030#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,281 INFO L273 TraceCheckUtils]: 86: Hoare triple {40030#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40030#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,282 INFO L273 TraceCheckUtils]: 87: Hoare triple {40030#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {40031#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,283 INFO L273 TraceCheckUtils]: 88: Hoare triple {40031#(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); {40031#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,283 INFO L273 TraceCheckUtils]: 89: Hoare triple {40031#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40031#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,284 INFO L273 TraceCheckUtils]: 90: Hoare triple {40031#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {40032#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,285 INFO L273 TraceCheckUtils]: 91: Hoare triple {40032#(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); {40032#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,286 INFO L273 TraceCheckUtils]: 92: Hoare triple {40032#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40032#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,287 INFO L273 TraceCheckUtils]: 93: Hoare triple {40032#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {40033#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,288 INFO L273 TraceCheckUtils]: 94: Hoare triple {40033#(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); {40033#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,288 INFO L273 TraceCheckUtils]: 95: Hoare triple {40033#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40033#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,289 INFO L273 TraceCheckUtils]: 96: Hoare triple {40033#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {40034#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,290 INFO L273 TraceCheckUtils]: 97: Hoare triple {40034#(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); {40034#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,291 INFO L273 TraceCheckUtils]: 98: Hoare triple {40034#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40034#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,292 INFO L273 TraceCheckUtils]: 99: Hoare triple {40034#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {40035#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,293 INFO L273 TraceCheckUtils]: 100: Hoare triple {40035#(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); {40035#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,293 INFO L273 TraceCheckUtils]: 101: Hoare triple {40035#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40035#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,294 INFO L273 TraceCheckUtils]: 102: Hoare triple {40035#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {40036#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,295 INFO L273 TraceCheckUtils]: 103: Hoare triple {40036#(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); {40036#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,296 INFO L273 TraceCheckUtils]: 104: Hoare triple {40036#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40036#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,297 INFO L273 TraceCheckUtils]: 105: Hoare triple {40036#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {40037#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,298 INFO L273 TraceCheckUtils]: 106: Hoare triple {40037#(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); {40037#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,299 INFO L273 TraceCheckUtils]: 107: Hoare triple {40037#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40037#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,300 INFO L273 TraceCheckUtils]: 108: Hoare triple {40037#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {40038#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,301 INFO L273 TraceCheckUtils]: 109: Hoare triple {40038#(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); {40038#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,301 INFO L273 TraceCheckUtils]: 110: Hoare triple {40038#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40038#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,302 INFO L273 TraceCheckUtils]: 111: Hoare triple {40038#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {40039#(and (<= main_~k~0 (+ main_~i~0 36)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:37,303 INFO L273 TraceCheckUtils]: 112: Hoare triple {40039#(and (<= main_~k~0 (+ main_~i~0 36)) (= main_~i~0 0))} assume !(~k~0 < 100000); {40002#false} is VALID [2018-11-23 12:00:37,303 INFO L273 TraceCheckUtils]: 113: Hoare triple {40002#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); {40002#false} is VALID [2018-11-23 12:00:37,303 INFO L273 TraceCheckUtils]: 114: Hoare triple {40002#false} ~x~0 := 0; {40002#false} is VALID [2018-11-23 12:00:37,303 INFO L273 TraceCheckUtils]: 115: Hoare triple {40002#false} assume !(~x~0 < ~i~0); {40002#false} is VALID [2018-11-23 12:00:37,304 INFO L273 TraceCheckUtils]: 116: Hoare triple {40002#false} ~x~0 := ~i~0; {40002#false} is VALID [2018-11-23 12:00:37,304 INFO L273 TraceCheckUtils]: 117: Hoare triple {40002#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); {40002#false} is VALID [2018-11-23 12:00:37,304 INFO L256 TraceCheckUtils]: 118: Hoare triple {40002#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {40001#true} is VALID [2018-11-23 12:00:37,304 INFO L273 TraceCheckUtils]: 119: Hoare triple {40001#true} ~cond := #in~cond; {40001#true} is VALID [2018-11-23 12:00:37,304 INFO L273 TraceCheckUtils]: 120: Hoare triple {40001#true} assume !(0 == ~cond); {40001#true} is VALID [2018-11-23 12:00:37,305 INFO L273 TraceCheckUtils]: 121: Hoare triple {40001#true} assume true; {40001#true} is VALID [2018-11-23 12:00:37,305 INFO L268 TraceCheckUtils]: 122: Hoare quadruple {40001#true} {40002#false} #136#return; {40002#false} is VALID [2018-11-23 12:00:37,305 INFO L273 TraceCheckUtils]: 123: Hoare triple {40002#false} havoc #t~mem9;havoc #t~mem10; {40002#false} is VALID [2018-11-23 12:00:37,305 INFO L273 TraceCheckUtils]: 124: Hoare triple {40002#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {40002#false} is VALID [2018-11-23 12:00:37,305 INFO L273 TraceCheckUtils]: 125: Hoare triple {40002#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); {40002#false} is VALID [2018-11-23 12:00:37,305 INFO L256 TraceCheckUtils]: 126: Hoare triple {40002#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {40002#false} is VALID [2018-11-23 12:00:37,306 INFO L273 TraceCheckUtils]: 127: Hoare triple {40002#false} ~cond := #in~cond; {40002#false} is VALID [2018-11-23 12:00:37,306 INFO L273 TraceCheckUtils]: 128: Hoare triple {40002#false} assume 0 == ~cond; {40002#false} is VALID [2018-11-23 12:00:37,306 INFO L273 TraceCheckUtils]: 129: Hoare triple {40002#false} assume !false; {40002#false} is VALID [2018-11-23 12:00:37,331 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 12:00:37,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:37,331 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:00:37,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:00:37,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:37,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:37,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:38,587 INFO L256 TraceCheckUtils]: 0: Hoare triple {40001#true} call ULTIMATE.init(); {40001#true} is VALID [2018-11-23 12:00:38,587 INFO L273 TraceCheckUtils]: 1: Hoare triple {40001#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {40001#true} is VALID [2018-11-23 12:00:38,588 INFO L273 TraceCheckUtils]: 2: Hoare triple {40001#true} assume true; {40001#true} is VALID [2018-11-23 12:00:38,588 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {40001#true} {40001#true} #130#return; {40001#true} is VALID [2018-11-23 12:00:38,588 INFO L256 TraceCheckUtils]: 4: Hoare triple {40001#true} call #t~ret15 := main(); {40001#true} is VALID [2018-11-23 12:00:38,589 INFO L273 TraceCheckUtils]: 5: Hoare triple {40001#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {40058#(<= main_~i~0 0)} is VALID [2018-11-23 12:00:38,589 INFO L273 TraceCheckUtils]: 6: Hoare triple {40058#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {40062#(<= main_~k~0 1)} is VALID [2018-11-23 12:00:38,590 INFO L273 TraceCheckUtils]: 7: Hoare triple {40062#(<= 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); {40062#(<= main_~k~0 1)} is VALID [2018-11-23 12:00:38,590 INFO L273 TraceCheckUtils]: 8: Hoare triple {40062#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40062#(<= main_~k~0 1)} is VALID [2018-11-23 12:00:38,590 INFO L273 TraceCheckUtils]: 9: Hoare triple {40062#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {40072#(<= main_~k~0 2)} is VALID [2018-11-23 12:00:38,591 INFO L273 TraceCheckUtils]: 10: Hoare triple {40072#(<= 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); {40072#(<= main_~k~0 2)} is VALID [2018-11-23 12:00:38,591 INFO L273 TraceCheckUtils]: 11: Hoare triple {40072#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40072#(<= main_~k~0 2)} is VALID [2018-11-23 12:00:38,592 INFO L273 TraceCheckUtils]: 12: Hoare triple {40072#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {40082#(<= main_~k~0 3)} is VALID [2018-11-23 12:00:38,592 INFO L273 TraceCheckUtils]: 13: Hoare triple {40082#(<= 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); {40082#(<= main_~k~0 3)} is VALID [2018-11-23 12:00:38,593 INFO L273 TraceCheckUtils]: 14: Hoare triple {40082#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40082#(<= main_~k~0 3)} is VALID [2018-11-23 12:00:38,594 INFO L273 TraceCheckUtils]: 15: Hoare triple {40082#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {40092#(<= main_~k~0 4)} is VALID [2018-11-23 12:00:38,594 INFO L273 TraceCheckUtils]: 16: Hoare triple {40092#(<= 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); {40092#(<= main_~k~0 4)} is VALID [2018-11-23 12:00:38,595 INFO L273 TraceCheckUtils]: 17: Hoare triple {40092#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40092#(<= main_~k~0 4)} is VALID [2018-11-23 12:00:38,595 INFO L273 TraceCheckUtils]: 18: Hoare triple {40092#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {40102#(<= main_~k~0 5)} is VALID [2018-11-23 12:00:38,596 INFO L273 TraceCheckUtils]: 19: Hoare triple {40102#(<= 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); {40102#(<= main_~k~0 5)} is VALID [2018-11-23 12:00:38,596 INFO L273 TraceCheckUtils]: 20: Hoare triple {40102#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40102#(<= main_~k~0 5)} is VALID [2018-11-23 12:00:38,597 INFO L273 TraceCheckUtils]: 21: Hoare triple {40102#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {40112#(<= main_~k~0 6)} is VALID [2018-11-23 12:00:38,598 INFO L273 TraceCheckUtils]: 22: Hoare triple {40112#(<= 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); {40112#(<= main_~k~0 6)} is VALID [2018-11-23 12:00:38,598 INFO L273 TraceCheckUtils]: 23: Hoare triple {40112#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40112#(<= main_~k~0 6)} is VALID [2018-11-23 12:00:38,599 INFO L273 TraceCheckUtils]: 24: Hoare triple {40112#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {40122#(<= main_~k~0 7)} is VALID [2018-11-23 12:00:38,599 INFO L273 TraceCheckUtils]: 25: Hoare triple {40122#(<= 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); {40122#(<= main_~k~0 7)} is VALID [2018-11-23 12:00:38,600 INFO L273 TraceCheckUtils]: 26: Hoare triple {40122#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40122#(<= main_~k~0 7)} is VALID [2018-11-23 12:00:38,601 INFO L273 TraceCheckUtils]: 27: Hoare triple {40122#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {40132#(<= main_~k~0 8)} is VALID [2018-11-23 12:00:38,601 INFO L273 TraceCheckUtils]: 28: Hoare triple {40132#(<= 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); {40132#(<= main_~k~0 8)} is VALID [2018-11-23 12:00:38,602 INFO L273 TraceCheckUtils]: 29: Hoare triple {40132#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40132#(<= main_~k~0 8)} is VALID [2018-11-23 12:00:38,602 INFO L273 TraceCheckUtils]: 30: Hoare triple {40132#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {40142#(<= main_~k~0 9)} is VALID [2018-11-23 12:00:38,603 INFO L273 TraceCheckUtils]: 31: Hoare triple {40142#(<= 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); {40142#(<= main_~k~0 9)} is VALID [2018-11-23 12:00:38,603 INFO L273 TraceCheckUtils]: 32: Hoare triple {40142#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40142#(<= main_~k~0 9)} is VALID [2018-11-23 12:00:38,604 INFO L273 TraceCheckUtils]: 33: Hoare triple {40142#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {40152#(<= main_~k~0 10)} is VALID [2018-11-23 12:00:38,605 INFO L273 TraceCheckUtils]: 34: Hoare triple {40152#(<= 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); {40152#(<= main_~k~0 10)} is VALID [2018-11-23 12:00:38,605 INFO L273 TraceCheckUtils]: 35: Hoare triple {40152#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40152#(<= main_~k~0 10)} is VALID [2018-11-23 12:00:38,606 INFO L273 TraceCheckUtils]: 36: Hoare triple {40152#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {40162#(<= main_~k~0 11)} is VALID [2018-11-23 12:00:38,606 INFO L273 TraceCheckUtils]: 37: Hoare triple {40162#(<= 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); {40162#(<= main_~k~0 11)} is VALID [2018-11-23 12:00:38,607 INFO L273 TraceCheckUtils]: 38: Hoare triple {40162#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40162#(<= main_~k~0 11)} is VALID [2018-11-23 12:00:38,608 INFO L273 TraceCheckUtils]: 39: Hoare triple {40162#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {40172#(<= main_~k~0 12)} is VALID [2018-11-23 12:00:38,608 INFO L273 TraceCheckUtils]: 40: Hoare triple {40172#(<= 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); {40172#(<= main_~k~0 12)} is VALID [2018-11-23 12:00:38,609 INFO L273 TraceCheckUtils]: 41: Hoare triple {40172#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40172#(<= main_~k~0 12)} is VALID [2018-11-23 12:00:38,609 INFO L273 TraceCheckUtils]: 42: Hoare triple {40172#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {40182#(<= main_~k~0 13)} is VALID [2018-11-23 12:00:38,610 INFO L273 TraceCheckUtils]: 43: Hoare triple {40182#(<= 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); {40182#(<= main_~k~0 13)} is VALID [2018-11-23 12:00:38,610 INFO L273 TraceCheckUtils]: 44: Hoare triple {40182#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40182#(<= main_~k~0 13)} is VALID [2018-11-23 12:00:38,611 INFO L273 TraceCheckUtils]: 45: Hoare triple {40182#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {40192#(<= main_~k~0 14)} is VALID [2018-11-23 12:00:38,612 INFO L273 TraceCheckUtils]: 46: Hoare triple {40192#(<= 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); {40192#(<= main_~k~0 14)} is VALID [2018-11-23 12:00:38,612 INFO L273 TraceCheckUtils]: 47: Hoare triple {40192#(<= main_~k~0 14)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40192#(<= main_~k~0 14)} is VALID [2018-11-23 12:00:38,613 INFO L273 TraceCheckUtils]: 48: Hoare triple {40192#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {40202#(<= main_~k~0 15)} is VALID [2018-11-23 12:00:38,613 INFO L273 TraceCheckUtils]: 49: Hoare triple {40202#(<= 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); {40202#(<= main_~k~0 15)} is VALID [2018-11-23 12:00:38,614 INFO L273 TraceCheckUtils]: 50: Hoare triple {40202#(<= main_~k~0 15)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40202#(<= main_~k~0 15)} is VALID [2018-11-23 12:00:38,615 INFO L273 TraceCheckUtils]: 51: Hoare triple {40202#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {40212#(<= main_~k~0 16)} is VALID [2018-11-23 12:00:38,615 INFO L273 TraceCheckUtils]: 52: Hoare triple {40212#(<= 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); {40212#(<= main_~k~0 16)} is VALID [2018-11-23 12:00:38,616 INFO L273 TraceCheckUtils]: 53: Hoare triple {40212#(<= main_~k~0 16)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40212#(<= main_~k~0 16)} is VALID [2018-11-23 12:00:38,616 INFO L273 TraceCheckUtils]: 54: Hoare triple {40212#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {40222#(<= main_~k~0 17)} is VALID [2018-11-23 12:00:38,617 INFO L273 TraceCheckUtils]: 55: Hoare triple {40222#(<= 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); {40222#(<= main_~k~0 17)} is VALID [2018-11-23 12:00:38,617 INFO L273 TraceCheckUtils]: 56: Hoare triple {40222#(<= main_~k~0 17)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40222#(<= main_~k~0 17)} is VALID [2018-11-23 12:00:38,618 INFO L273 TraceCheckUtils]: 57: Hoare triple {40222#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {40232#(<= main_~k~0 18)} is VALID [2018-11-23 12:00:38,619 INFO L273 TraceCheckUtils]: 58: Hoare triple {40232#(<= 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); {40232#(<= main_~k~0 18)} is VALID [2018-11-23 12:00:38,619 INFO L273 TraceCheckUtils]: 59: Hoare triple {40232#(<= main_~k~0 18)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40232#(<= main_~k~0 18)} is VALID [2018-11-23 12:00:38,620 INFO L273 TraceCheckUtils]: 60: Hoare triple {40232#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {40242#(<= main_~k~0 19)} is VALID [2018-11-23 12:00:38,620 INFO L273 TraceCheckUtils]: 61: Hoare triple {40242#(<= 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); {40242#(<= main_~k~0 19)} is VALID [2018-11-23 12:00:38,621 INFO L273 TraceCheckUtils]: 62: Hoare triple {40242#(<= main_~k~0 19)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40242#(<= main_~k~0 19)} is VALID [2018-11-23 12:00:38,622 INFO L273 TraceCheckUtils]: 63: Hoare triple {40242#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {40252#(<= main_~k~0 20)} is VALID [2018-11-23 12:00:38,622 INFO L273 TraceCheckUtils]: 64: Hoare triple {40252#(<= 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); {40252#(<= main_~k~0 20)} is VALID [2018-11-23 12:00:38,623 INFO L273 TraceCheckUtils]: 65: Hoare triple {40252#(<= main_~k~0 20)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40252#(<= main_~k~0 20)} is VALID [2018-11-23 12:00:38,623 INFO L273 TraceCheckUtils]: 66: Hoare triple {40252#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {40262#(<= main_~k~0 21)} is VALID [2018-11-23 12:00:38,624 INFO L273 TraceCheckUtils]: 67: Hoare triple {40262#(<= 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); {40262#(<= main_~k~0 21)} is VALID [2018-11-23 12:00:38,624 INFO L273 TraceCheckUtils]: 68: Hoare triple {40262#(<= main_~k~0 21)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40262#(<= main_~k~0 21)} is VALID [2018-11-23 12:00:38,625 INFO L273 TraceCheckUtils]: 69: Hoare triple {40262#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {40272#(<= main_~k~0 22)} is VALID [2018-11-23 12:00:38,626 INFO L273 TraceCheckUtils]: 70: Hoare triple {40272#(<= 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); {40272#(<= main_~k~0 22)} is VALID [2018-11-23 12:00:38,626 INFO L273 TraceCheckUtils]: 71: Hoare triple {40272#(<= main_~k~0 22)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40272#(<= main_~k~0 22)} is VALID [2018-11-23 12:00:38,627 INFO L273 TraceCheckUtils]: 72: Hoare triple {40272#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {40282#(<= main_~k~0 23)} is VALID [2018-11-23 12:00:38,627 INFO L273 TraceCheckUtils]: 73: Hoare triple {40282#(<= 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); {40282#(<= main_~k~0 23)} is VALID [2018-11-23 12:00:38,628 INFO L273 TraceCheckUtils]: 74: Hoare triple {40282#(<= main_~k~0 23)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40282#(<= main_~k~0 23)} is VALID [2018-11-23 12:00:38,629 INFO L273 TraceCheckUtils]: 75: Hoare triple {40282#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {40292#(<= main_~k~0 24)} is VALID [2018-11-23 12:00:38,629 INFO L273 TraceCheckUtils]: 76: Hoare triple {40292#(<= 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); {40292#(<= main_~k~0 24)} is VALID [2018-11-23 12:00:38,630 INFO L273 TraceCheckUtils]: 77: Hoare triple {40292#(<= main_~k~0 24)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40292#(<= main_~k~0 24)} is VALID [2018-11-23 12:00:38,630 INFO L273 TraceCheckUtils]: 78: Hoare triple {40292#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {40302#(<= main_~k~0 25)} is VALID [2018-11-23 12:00:38,631 INFO L273 TraceCheckUtils]: 79: Hoare triple {40302#(<= 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); {40302#(<= main_~k~0 25)} is VALID [2018-11-23 12:00:38,631 INFO L273 TraceCheckUtils]: 80: Hoare triple {40302#(<= main_~k~0 25)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40302#(<= main_~k~0 25)} is VALID [2018-11-23 12:00:38,632 INFO L273 TraceCheckUtils]: 81: Hoare triple {40302#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {40312#(<= main_~k~0 26)} is VALID [2018-11-23 12:00:38,633 INFO L273 TraceCheckUtils]: 82: Hoare triple {40312#(<= 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); {40312#(<= main_~k~0 26)} is VALID [2018-11-23 12:00:38,633 INFO L273 TraceCheckUtils]: 83: Hoare triple {40312#(<= main_~k~0 26)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40312#(<= main_~k~0 26)} is VALID [2018-11-23 12:00:38,634 INFO L273 TraceCheckUtils]: 84: Hoare triple {40312#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {40322#(<= main_~k~0 27)} is VALID [2018-11-23 12:00:38,634 INFO L273 TraceCheckUtils]: 85: Hoare triple {40322#(<= 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); {40322#(<= main_~k~0 27)} is VALID [2018-11-23 12:00:38,635 INFO L273 TraceCheckUtils]: 86: Hoare triple {40322#(<= main_~k~0 27)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40322#(<= main_~k~0 27)} is VALID [2018-11-23 12:00:38,636 INFO L273 TraceCheckUtils]: 87: Hoare triple {40322#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {40332#(<= main_~k~0 28)} is VALID [2018-11-23 12:00:38,636 INFO L273 TraceCheckUtils]: 88: Hoare triple {40332#(<= 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); {40332#(<= main_~k~0 28)} is VALID [2018-11-23 12:00:38,637 INFO L273 TraceCheckUtils]: 89: Hoare triple {40332#(<= main_~k~0 28)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40332#(<= main_~k~0 28)} is VALID [2018-11-23 12:00:38,637 INFO L273 TraceCheckUtils]: 90: Hoare triple {40332#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {40342#(<= main_~k~0 29)} is VALID [2018-11-23 12:00:38,638 INFO L273 TraceCheckUtils]: 91: Hoare triple {40342#(<= 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); {40342#(<= main_~k~0 29)} is VALID [2018-11-23 12:00:38,638 INFO L273 TraceCheckUtils]: 92: Hoare triple {40342#(<= main_~k~0 29)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40342#(<= main_~k~0 29)} is VALID [2018-11-23 12:00:38,639 INFO L273 TraceCheckUtils]: 93: Hoare triple {40342#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {40352#(<= main_~k~0 30)} is VALID [2018-11-23 12:00:38,640 INFO L273 TraceCheckUtils]: 94: Hoare triple {40352#(<= 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); {40352#(<= main_~k~0 30)} is VALID [2018-11-23 12:00:38,640 INFO L273 TraceCheckUtils]: 95: Hoare triple {40352#(<= main_~k~0 30)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40352#(<= main_~k~0 30)} is VALID [2018-11-23 12:00:38,641 INFO L273 TraceCheckUtils]: 96: Hoare triple {40352#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {40362#(<= main_~k~0 31)} is VALID [2018-11-23 12:00:38,642 INFO L273 TraceCheckUtils]: 97: Hoare triple {40362#(<= 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); {40362#(<= main_~k~0 31)} is VALID [2018-11-23 12:00:38,642 INFO L273 TraceCheckUtils]: 98: Hoare triple {40362#(<= main_~k~0 31)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40362#(<= main_~k~0 31)} is VALID [2018-11-23 12:00:38,643 INFO L273 TraceCheckUtils]: 99: Hoare triple {40362#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {40372#(<= main_~k~0 32)} is VALID [2018-11-23 12:00:38,643 INFO L273 TraceCheckUtils]: 100: Hoare triple {40372#(<= 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); {40372#(<= main_~k~0 32)} is VALID [2018-11-23 12:00:38,644 INFO L273 TraceCheckUtils]: 101: Hoare triple {40372#(<= main_~k~0 32)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40372#(<= main_~k~0 32)} is VALID [2018-11-23 12:00:38,644 INFO L273 TraceCheckUtils]: 102: Hoare triple {40372#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {40382#(<= main_~k~0 33)} is VALID [2018-11-23 12:00:38,645 INFO L273 TraceCheckUtils]: 103: Hoare triple {40382#(<= 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); {40382#(<= main_~k~0 33)} is VALID [2018-11-23 12:00:38,645 INFO L273 TraceCheckUtils]: 104: Hoare triple {40382#(<= main_~k~0 33)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40382#(<= main_~k~0 33)} is VALID [2018-11-23 12:00:38,646 INFO L273 TraceCheckUtils]: 105: Hoare triple {40382#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {40392#(<= main_~k~0 34)} is VALID [2018-11-23 12:00:38,647 INFO L273 TraceCheckUtils]: 106: Hoare triple {40392#(<= 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); {40392#(<= main_~k~0 34)} is VALID [2018-11-23 12:00:38,647 INFO L273 TraceCheckUtils]: 107: Hoare triple {40392#(<= main_~k~0 34)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40392#(<= main_~k~0 34)} is VALID [2018-11-23 12:00:38,648 INFO L273 TraceCheckUtils]: 108: Hoare triple {40392#(<= main_~k~0 34)} ~k~0 := 1 + ~k~0; {40402#(<= main_~k~0 35)} is VALID [2018-11-23 12:00:38,648 INFO L273 TraceCheckUtils]: 109: Hoare triple {40402#(<= 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); {40402#(<= main_~k~0 35)} is VALID [2018-11-23 12:00:38,649 INFO L273 TraceCheckUtils]: 110: Hoare triple {40402#(<= main_~k~0 35)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {40402#(<= main_~k~0 35)} is VALID [2018-11-23 12:00:38,669 INFO L273 TraceCheckUtils]: 111: Hoare triple {40402#(<= main_~k~0 35)} ~k~0 := 1 + ~k~0; {40412#(<= main_~k~0 36)} is VALID [2018-11-23 12:00:38,678 INFO L273 TraceCheckUtils]: 112: Hoare triple {40412#(<= main_~k~0 36)} assume !(~k~0 < 100000); {40002#false} is VALID [2018-11-23 12:00:38,679 INFO L273 TraceCheckUtils]: 113: Hoare triple {40002#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); {40002#false} is VALID [2018-11-23 12:00:38,679 INFO L273 TraceCheckUtils]: 114: Hoare triple {40002#false} ~x~0 := 0; {40002#false} is VALID [2018-11-23 12:00:38,679 INFO L273 TraceCheckUtils]: 115: Hoare triple {40002#false} assume !(~x~0 < ~i~0); {40002#false} is VALID [2018-11-23 12:00:38,679 INFO L273 TraceCheckUtils]: 116: Hoare triple {40002#false} ~x~0 := ~i~0; {40002#false} is VALID [2018-11-23 12:00:38,679 INFO L273 TraceCheckUtils]: 117: Hoare triple {40002#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); {40002#false} is VALID [2018-11-23 12:00:38,679 INFO L256 TraceCheckUtils]: 118: Hoare triple {40002#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {40002#false} is VALID [2018-11-23 12:00:38,679 INFO L273 TraceCheckUtils]: 119: Hoare triple {40002#false} ~cond := #in~cond; {40002#false} is VALID [2018-11-23 12:00:38,680 INFO L273 TraceCheckUtils]: 120: Hoare triple {40002#false} assume !(0 == ~cond); {40002#false} is VALID [2018-11-23 12:00:38,680 INFO L273 TraceCheckUtils]: 121: Hoare triple {40002#false} assume true; {40002#false} is VALID [2018-11-23 12:00:38,680 INFO L268 TraceCheckUtils]: 122: Hoare quadruple {40002#false} {40002#false} #136#return; {40002#false} is VALID [2018-11-23 12:00:38,680 INFO L273 TraceCheckUtils]: 123: Hoare triple {40002#false} havoc #t~mem9;havoc #t~mem10; {40002#false} is VALID [2018-11-23 12:00:38,680 INFO L273 TraceCheckUtils]: 124: Hoare triple {40002#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {40002#false} is VALID [2018-11-23 12:00:38,680 INFO L273 TraceCheckUtils]: 125: Hoare triple {40002#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); {40002#false} is VALID [2018-11-23 12:00:38,681 INFO L256 TraceCheckUtils]: 126: Hoare triple {40002#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {40002#false} is VALID [2018-11-23 12:00:38,681 INFO L273 TraceCheckUtils]: 127: Hoare triple {40002#false} ~cond := #in~cond; {40002#false} is VALID [2018-11-23 12:00:38,681 INFO L273 TraceCheckUtils]: 128: Hoare triple {40002#false} assume 0 == ~cond; {40002#false} is VALID [2018-11-23 12:00:38,681 INFO L273 TraceCheckUtils]: 129: Hoare triple {40002#false} assume !false; {40002#false} is VALID [2018-11-23 12:00:38,695 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 12:00:38,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:38,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 76 [2018-11-23 12:00:38,725 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 130 [2018-11-23 12:00:38,726 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:38,726 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 76 states. [2018-11-23 12:00:39,064 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 12:00:39,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-11-23 12:00:39,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-11-23 12:00:39,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2148, Invalid=3552, Unknown=0, NotChecked=0, Total=5700 [2018-11-23 12:00:39,066 INFO L87 Difference]: Start difference. First operand 264 states and 349 transitions. Second operand 76 states. [2018-11-23 12:00:40,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:40,820 INFO L93 Difference]: Finished difference Result 327 states and 435 transitions. [2018-11-23 12:00:40,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-23 12:00:40,820 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 130 [2018-11-23 12:00:40,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:40,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-23 12:00:40,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 251 transitions. [2018-11-23 12:00:40,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-23 12:00:40,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 251 transitions. [2018-11-23 12:00:40,824 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 251 transitions. [2018-11-23 12:00:41,076 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 12:00:41,081 INFO L225 Difference]: With dead ends: 327 [2018-11-23 12:00:41,082 INFO L226 Difference]: Without dead ends: 280 [2018-11-23 12:00:41,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1999 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2148, Invalid=3552, Unknown=0, NotChecked=0, Total=5700 [2018-11-23 12:00:41,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-11-23 12:00:41,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 270. [2018-11-23 12:00:41,238 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:41,239 INFO L82 GeneralOperation]: Start isEquivalent. First operand 280 states. Second operand 270 states. [2018-11-23 12:00:41,239 INFO L74 IsIncluded]: Start isIncluded. First operand 280 states. Second operand 270 states. [2018-11-23 12:00:41,239 INFO L87 Difference]: Start difference. First operand 280 states. Second operand 270 states. [2018-11-23 12:00:41,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:41,246 INFO L93 Difference]: Finished difference Result 280 states and 372 transitions. [2018-11-23 12:00:41,246 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 372 transitions. [2018-11-23 12:00:41,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:41,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:41,247 INFO L74 IsIncluded]: Start isIncluded. First operand 270 states. Second operand 280 states. [2018-11-23 12:00:41,247 INFO L87 Difference]: Start difference. First operand 270 states. Second operand 280 states. [2018-11-23 12:00:41,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:41,252 INFO L93 Difference]: Finished difference Result 280 states and 372 transitions. [2018-11-23 12:00:41,252 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 372 transitions. [2018-11-23 12:00:41,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:41,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:41,252 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:41,252 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:41,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-11-23 12:00:41,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 357 transitions. [2018-11-23 12:00:41,258 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 357 transitions. Word has length 130 [2018-11-23 12:00:41,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:41,258 INFO L480 AbstractCegarLoop]: Abstraction has 270 states and 357 transitions. [2018-11-23 12:00:41,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-11-23 12:00:41,259 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 357 transitions. [2018-11-23 12:00:41,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-23 12:00:41,259 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:41,259 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 12:00:41,260 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:41,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:41,260 INFO L82 PathProgramCache]: Analyzing trace with hash 106517964, now seen corresponding path program 32 times [2018-11-23 12:00:41,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:41,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:41,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:41,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:00:41,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:41,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:42,454 INFO L256 TraceCheckUtils]: 0: Hoare triple {41833#true} call ULTIMATE.init(); {41833#true} is VALID [2018-11-23 12:00:42,454 INFO L273 TraceCheckUtils]: 1: Hoare triple {41833#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {41833#true} is VALID [2018-11-23 12:00:42,454 INFO L273 TraceCheckUtils]: 2: Hoare triple {41833#true} assume true; {41833#true} is VALID [2018-11-23 12:00:42,455 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {41833#true} {41833#true} #130#return; {41833#true} is VALID [2018-11-23 12:00:42,455 INFO L256 TraceCheckUtils]: 4: Hoare triple {41833#true} call #t~ret15 := main(); {41833#true} is VALID [2018-11-23 12:00:42,455 INFO L273 TraceCheckUtils]: 5: Hoare triple {41833#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {41835#(= main_~i~0 0)} is VALID [2018-11-23 12:00:42,456 INFO L273 TraceCheckUtils]: 6: Hoare triple {41835#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {41836#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,457 INFO L273 TraceCheckUtils]: 7: Hoare triple {41836#(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); {41836#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,457 INFO L273 TraceCheckUtils]: 8: Hoare triple {41836#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {41836#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,458 INFO L273 TraceCheckUtils]: 9: Hoare triple {41836#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {41837#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,458 INFO L273 TraceCheckUtils]: 10: Hoare triple {41837#(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); {41837#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,459 INFO L273 TraceCheckUtils]: 11: Hoare triple {41837#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {41837#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,460 INFO L273 TraceCheckUtils]: 12: Hoare triple {41837#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {41838#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,460 INFO L273 TraceCheckUtils]: 13: Hoare triple {41838#(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); {41838#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,461 INFO L273 TraceCheckUtils]: 14: Hoare triple {41838#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {41838#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,462 INFO L273 TraceCheckUtils]: 15: Hoare triple {41838#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {41839#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,463 INFO L273 TraceCheckUtils]: 16: Hoare triple {41839#(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); {41839#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,464 INFO L273 TraceCheckUtils]: 17: Hoare triple {41839#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {41839#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,464 INFO L273 TraceCheckUtils]: 18: Hoare triple {41839#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {41840#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,465 INFO L273 TraceCheckUtils]: 19: Hoare triple {41840#(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); {41840#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,466 INFO L273 TraceCheckUtils]: 20: Hoare triple {41840#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {41840#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,467 INFO L273 TraceCheckUtils]: 21: Hoare triple {41840#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {41841#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,468 INFO L273 TraceCheckUtils]: 22: Hoare triple {41841#(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); {41841#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,469 INFO L273 TraceCheckUtils]: 23: Hoare triple {41841#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {41841#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,470 INFO L273 TraceCheckUtils]: 24: Hoare triple {41841#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {41842#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,470 INFO L273 TraceCheckUtils]: 25: Hoare triple {41842#(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); {41842#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,471 INFO L273 TraceCheckUtils]: 26: Hoare triple {41842#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {41842#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,472 INFO L273 TraceCheckUtils]: 27: Hoare triple {41842#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {41843#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,473 INFO L273 TraceCheckUtils]: 28: Hoare triple {41843#(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); {41843#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,473 INFO L273 TraceCheckUtils]: 29: Hoare triple {41843#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {41843#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,474 INFO L273 TraceCheckUtils]: 30: Hoare triple {41843#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {41844#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,475 INFO L273 TraceCheckUtils]: 31: Hoare triple {41844#(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); {41844#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,476 INFO L273 TraceCheckUtils]: 32: Hoare triple {41844#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {41844#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,477 INFO L273 TraceCheckUtils]: 33: Hoare triple {41844#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {41845#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,477 INFO L273 TraceCheckUtils]: 34: Hoare triple {41845#(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); {41845#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,478 INFO L273 TraceCheckUtils]: 35: Hoare triple {41845#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {41845#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,479 INFO L273 TraceCheckUtils]: 36: Hoare triple {41845#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {41846#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,480 INFO L273 TraceCheckUtils]: 37: Hoare triple {41846#(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); {41846#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,481 INFO L273 TraceCheckUtils]: 38: Hoare triple {41846#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {41846#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,482 INFO L273 TraceCheckUtils]: 39: Hoare triple {41846#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {41847#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,482 INFO L273 TraceCheckUtils]: 40: Hoare triple {41847#(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); {41847#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,483 INFO L273 TraceCheckUtils]: 41: Hoare triple {41847#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {41847#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,484 INFO L273 TraceCheckUtils]: 42: Hoare triple {41847#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {41848#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,485 INFO L273 TraceCheckUtils]: 43: Hoare triple {41848#(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); {41848#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,486 INFO L273 TraceCheckUtils]: 44: Hoare triple {41848#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {41848#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,486 INFO L273 TraceCheckUtils]: 45: Hoare triple {41848#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {41849#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,487 INFO L273 TraceCheckUtils]: 46: Hoare triple {41849#(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); {41849#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,488 INFO L273 TraceCheckUtils]: 47: Hoare triple {41849#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {41849#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,489 INFO L273 TraceCheckUtils]: 48: Hoare triple {41849#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {41850#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,490 INFO L273 TraceCheckUtils]: 49: Hoare triple {41850#(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); {41850#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,490 INFO L273 TraceCheckUtils]: 50: Hoare triple {41850#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {41850#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,491 INFO L273 TraceCheckUtils]: 51: Hoare triple {41850#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {41851#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,492 INFO L273 TraceCheckUtils]: 52: Hoare triple {41851#(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); {41851#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,493 INFO L273 TraceCheckUtils]: 53: Hoare triple {41851#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {41851#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,494 INFO L273 TraceCheckUtils]: 54: Hoare triple {41851#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {41852#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 12:00:42,495 INFO L273 TraceCheckUtils]: 55: Hoare triple {41852#(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); {41852#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 12:00:42,495 INFO L273 TraceCheckUtils]: 56: Hoare triple {41852#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {41852#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 12:00:42,496 INFO L273 TraceCheckUtils]: 57: Hoare triple {41852#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} ~k~0 := 1 + ~k~0; {41853#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,497 INFO L273 TraceCheckUtils]: 58: Hoare triple {41853#(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); {41853#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,498 INFO L273 TraceCheckUtils]: 59: Hoare triple {41853#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {41853#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,499 INFO L273 TraceCheckUtils]: 60: Hoare triple {41853#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {41854#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,499 INFO L273 TraceCheckUtils]: 61: Hoare triple {41854#(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); {41854#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,500 INFO L273 TraceCheckUtils]: 62: Hoare triple {41854#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {41854#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,501 INFO L273 TraceCheckUtils]: 63: Hoare triple {41854#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {41855#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,502 INFO L273 TraceCheckUtils]: 64: Hoare triple {41855#(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); {41855#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,502 INFO L273 TraceCheckUtils]: 65: Hoare triple {41855#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {41855#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,503 INFO L273 TraceCheckUtils]: 66: Hoare triple {41855#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {41856#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,504 INFO L273 TraceCheckUtils]: 67: Hoare triple {41856#(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); {41856#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,505 INFO L273 TraceCheckUtils]: 68: Hoare triple {41856#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {41856#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,506 INFO L273 TraceCheckUtils]: 69: Hoare triple {41856#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {41857#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,507 INFO L273 TraceCheckUtils]: 70: Hoare triple {41857#(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); {41857#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,507 INFO L273 TraceCheckUtils]: 71: Hoare triple {41857#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {41857#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,508 INFO L273 TraceCheckUtils]: 72: Hoare triple {41857#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {41858#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,509 INFO L273 TraceCheckUtils]: 73: Hoare triple {41858#(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); {41858#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,510 INFO L273 TraceCheckUtils]: 74: Hoare triple {41858#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {41858#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,510 INFO L273 TraceCheckUtils]: 75: Hoare triple {41858#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {41859#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,511 INFO L273 TraceCheckUtils]: 76: Hoare triple {41859#(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); {41859#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,512 INFO L273 TraceCheckUtils]: 77: Hoare triple {41859#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {41859#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,513 INFO L273 TraceCheckUtils]: 78: Hoare triple {41859#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {41860#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,514 INFO L273 TraceCheckUtils]: 79: Hoare triple {41860#(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); {41860#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,515 INFO L273 TraceCheckUtils]: 80: Hoare triple {41860#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {41860#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,515 INFO L273 TraceCheckUtils]: 81: Hoare triple {41860#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {41861#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,516 INFO L273 TraceCheckUtils]: 82: Hoare triple {41861#(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); {41861#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,517 INFO L273 TraceCheckUtils]: 83: Hoare triple {41861#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {41861#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,518 INFO L273 TraceCheckUtils]: 84: Hoare triple {41861#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {41862#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,519 INFO L273 TraceCheckUtils]: 85: Hoare triple {41862#(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); {41862#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,519 INFO L273 TraceCheckUtils]: 86: Hoare triple {41862#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {41862#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,520 INFO L273 TraceCheckUtils]: 87: Hoare triple {41862#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {41863#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,521 INFO L273 TraceCheckUtils]: 88: Hoare triple {41863#(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); {41863#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,522 INFO L273 TraceCheckUtils]: 89: Hoare triple {41863#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {41863#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,523 INFO L273 TraceCheckUtils]: 90: Hoare triple {41863#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {41864#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,524 INFO L273 TraceCheckUtils]: 91: Hoare triple {41864#(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); {41864#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,525 INFO L273 TraceCheckUtils]: 92: Hoare triple {41864#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {41864#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,526 INFO L273 TraceCheckUtils]: 93: Hoare triple {41864#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {41865#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,526 INFO L273 TraceCheckUtils]: 94: Hoare triple {41865#(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); {41865#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,527 INFO L273 TraceCheckUtils]: 95: Hoare triple {41865#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {41865#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,528 INFO L273 TraceCheckUtils]: 96: Hoare triple {41865#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {41866#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,529 INFO L273 TraceCheckUtils]: 97: Hoare triple {41866#(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); {41866#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,530 INFO L273 TraceCheckUtils]: 98: Hoare triple {41866#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {41866#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,531 INFO L273 TraceCheckUtils]: 99: Hoare triple {41866#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {41867#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,532 INFO L273 TraceCheckUtils]: 100: Hoare triple {41867#(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); {41867#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,532 INFO L273 TraceCheckUtils]: 101: Hoare triple {41867#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {41867#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,533 INFO L273 TraceCheckUtils]: 102: Hoare triple {41867#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {41868#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,534 INFO L273 TraceCheckUtils]: 103: Hoare triple {41868#(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); {41868#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,535 INFO L273 TraceCheckUtils]: 104: Hoare triple {41868#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {41868#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,536 INFO L273 TraceCheckUtils]: 105: Hoare triple {41868#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {41869#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,537 INFO L273 TraceCheckUtils]: 106: Hoare triple {41869#(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); {41869#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,538 INFO L273 TraceCheckUtils]: 107: Hoare triple {41869#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {41869#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,538 INFO L273 TraceCheckUtils]: 108: Hoare triple {41869#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {41870#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,539 INFO L273 TraceCheckUtils]: 109: Hoare triple {41870#(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); {41870#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,542 INFO L273 TraceCheckUtils]: 110: Hoare triple {41870#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {41870#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,543 INFO L273 TraceCheckUtils]: 111: Hoare triple {41870#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {41871#(and (<= main_~k~0 (+ main_~i~0 36)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,543 INFO L273 TraceCheckUtils]: 112: Hoare triple {41871#(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); {41871#(and (<= main_~k~0 (+ main_~i~0 36)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,543 INFO L273 TraceCheckUtils]: 113: Hoare triple {41871#(and (<= main_~k~0 (+ main_~i~0 36)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {41871#(and (<= main_~k~0 (+ main_~i~0 36)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,544 INFO L273 TraceCheckUtils]: 114: Hoare triple {41871#(and (<= main_~k~0 (+ main_~i~0 36)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {41872#(and (<= main_~k~0 (+ main_~i~0 37)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:42,544 INFO L273 TraceCheckUtils]: 115: Hoare triple {41872#(and (<= main_~k~0 (+ main_~i~0 37)) (= main_~i~0 0))} assume !(~k~0 < 100000); {41834#false} is VALID [2018-11-23 12:00:42,545 INFO L273 TraceCheckUtils]: 116: Hoare triple {41834#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); {41834#false} is VALID [2018-11-23 12:00:42,545 INFO L273 TraceCheckUtils]: 117: Hoare triple {41834#false} ~x~0 := 0; {41834#false} is VALID [2018-11-23 12:00:42,545 INFO L273 TraceCheckUtils]: 118: Hoare triple {41834#false} assume !(~x~0 < ~i~0); {41834#false} is VALID [2018-11-23 12:00:42,545 INFO L273 TraceCheckUtils]: 119: Hoare triple {41834#false} ~x~0 := ~i~0; {41834#false} is VALID [2018-11-23 12:00:42,545 INFO L273 TraceCheckUtils]: 120: Hoare triple {41834#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); {41834#false} is VALID [2018-11-23 12:00:42,545 INFO L256 TraceCheckUtils]: 121: Hoare triple {41834#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {41833#true} is VALID [2018-11-23 12:00:42,545 INFO L273 TraceCheckUtils]: 122: Hoare triple {41833#true} ~cond := #in~cond; {41833#true} is VALID [2018-11-23 12:00:42,545 INFO L273 TraceCheckUtils]: 123: Hoare triple {41833#true} assume !(0 == ~cond); {41833#true} is VALID [2018-11-23 12:00:42,546 INFO L273 TraceCheckUtils]: 124: Hoare triple {41833#true} assume true; {41833#true} is VALID [2018-11-23 12:00:42,546 INFO L268 TraceCheckUtils]: 125: Hoare quadruple {41833#true} {41834#false} #136#return; {41834#false} is VALID [2018-11-23 12:00:42,546 INFO L273 TraceCheckUtils]: 126: Hoare triple {41834#false} havoc #t~mem9;havoc #t~mem10; {41834#false} is VALID [2018-11-23 12:00:42,546 INFO L273 TraceCheckUtils]: 127: Hoare triple {41834#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {41834#false} is VALID [2018-11-23 12:00:42,546 INFO L273 TraceCheckUtils]: 128: Hoare triple {41834#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); {41834#false} is VALID [2018-11-23 12:00:42,547 INFO L256 TraceCheckUtils]: 129: Hoare triple {41834#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {41834#false} is VALID [2018-11-23 12:00:42,547 INFO L273 TraceCheckUtils]: 130: Hoare triple {41834#false} ~cond := #in~cond; {41834#false} is VALID [2018-11-23 12:00:42,547 INFO L273 TraceCheckUtils]: 131: Hoare triple {41834#false} assume 0 == ~cond; {41834#false} is VALID [2018-11-23 12:00:42,547 INFO L273 TraceCheckUtils]: 132: Hoare triple {41834#false} assume !false; {41834#false} is VALID [2018-11-23 12:00:42,573 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 12:00:42,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:42,574 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:00:42,583 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:00:42,652 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:00:42,653 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:00:42,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:42,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:43,884 INFO L256 TraceCheckUtils]: 0: Hoare triple {41833#true} call ULTIMATE.init(); {41833#true} is VALID [2018-11-23 12:00:43,884 INFO L273 TraceCheckUtils]: 1: Hoare triple {41833#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {41833#true} is VALID [2018-11-23 12:00:43,885 INFO L273 TraceCheckUtils]: 2: Hoare triple {41833#true} assume true; {41833#true} is VALID [2018-11-23 12:00:43,885 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {41833#true} {41833#true} #130#return; {41833#true} is VALID [2018-11-23 12:00:43,885 INFO L256 TraceCheckUtils]: 4: Hoare triple {41833#true} call #t~ret15 := main(); {41833#true} is VALID [2018-11-23 12:00:43,886 INFO L273 TraceCheckUtils]: 5: Hoare triple {41833#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {41891#(<= main_~i~0 0)} is VALID [2018-11-23 12:00:43,886 INFO L273 TraceCheckUtils]: 6: Hoare triple {41891#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {41895#(<= main_~k~0 1)} is VALID [2018-11-23 12:00:43,887 INFO L273 TraceCheckUtils]: 7: Hoare triple {41895#(<= 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); {41895#(<= main_~k~0 1)} is VALID [2018-11-23 12:00:43,887 INFO L273 TraceCheckUtils]: 8: Hoare triple {41895#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {41895#(<= main_~k~0 1)} is VALID [2018-11-23 12:00:43,887 INFO L273 TraceCheckUtils]: 9: Hoare triple {41895#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {41905#(<= main_~k~0 2)} is VALID [2018-11-23 12:00:43,888 INFO L273 TraceCheckUtils]: 10: Hoare triple {41905#(<= 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); {41905#(<= main_~k~0 2)} is VALID [2018-11-23 12:00:43,888 INFO L273 TraceCheckUtils]: 11: Hoare triple {41905#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {41905#(<= main_~k~0 2)} is VALID [2018-11-23 12:00:43,889 INFO L273 TraceCheckUtils]: 12: Hoare triple {41905#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {41915#(<= main_~k~0 3)} is VALID [2018-11-23 12:00:43,889 INFO L273 TraceCheckUtils]: 13: Hoare triple {41915#(<= 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); {41915#(<= main_~k~0 3)} is VALID [2018-11-23 12:00:43,890 INFO L273 TraceCheckUtils]: 14: Hoare triple {41915#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {41915#(<= main_~k~0 3)} is VALID [2018-11-23 12:00:43,891 INFO L273 TraceCheckUtils]: 15: Hoare triple {41915#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {41925#(<= main_~k~0 4)} is VALID [2018-11-23 12:00:43,891 INFO L273 TraceCheckUtils]: 16: Hoare triple {41925#(<= 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); {41925#(<= main_~k~0 4)} is VALID [2018-11-23 12:00:43,892 INFO L273 TraceCheckUtils]: 17: Hoare triple {41925#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {41925#(<= main_~k~0 4)} is VALID [2018-11-23 12:00:43,892 INFO L273 TraceCheckUtils]: 18: Hoare triple {41925#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {41935#(<= main_~k~0 5)} is VALID [2018-11-23 12:00:43,893 INFO L273 TraceCheckUtils]: 19: Hoare triple {41935#(<= 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); {41935#(<= main_~k~0 5)} is VALID [2018-11-23 12:00:43,893 INFO L273 TraceCheckUtils]: 20: Hoare triple {41935#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {41935#(<= main_~k~0 5)} is VALID [2018-11-23 12:00:43,894 INFO L273 TraceCheckUtils]: 21: Hoare triple {41935#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {41945#(<= main_~k~0 6)} is VALID [2018-11-23 12:00:43,895 INFO L273 TraceCheckUtils]: 22: Hoare triple {41945#(<= 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); {41945#(<= main_~k~0 6)} is VALID [2018-11-23 12:00:43,895 INFO L273 TraceCheckUtils]: 23: Hoare triple {41945#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {41945#(<= main_~k~0 6)} is VALID [2018-11-23 12:00:43,896 INFO L273 TraceCheckUtils]: 24: Hoare triple {41945#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {41955#(<= main_~k~0 7)} is VALID [2018-11-23 12:00:43,897 INFO L273 TraceCheckUtils]: 25: Hoare triple {41955#(<= 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); {41955#(<= main_~k~0 7)} is VALID [2018-11-23 12:00:43,897 INFO L273 TraceCheckUtils]: 26: Hoare triple {41955#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {41955#(<= main_~k~0 7)} is VALID [2018-11-23 12:00:43,898 INFO L273 TraceCheckUtils]: 27: Hoare triple {41955#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {41965#(<= main_~k~0 8)} is VALID [2018-11-23 12:00:43,898 INFO L273 TraceCheckUtils]: 28: Hoare triple {41965#(<= 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); {41965#(<= main_~k~0 8)} is VALID [2018-11-23 12:00:43,899 INFO L273 TraceCheckUtils]: 29: Hoare triple {41965#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {41965#(<= main_~k~0 8)} is VALID [2018-11-23 12:00:43,900 INFO L273 TraceCheckUtils]: 30: Hoare triple {41965#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {41975#(<= main_~k~0 9)} is VALID [2018-11-23 12:00:43,900 INFO L273 TraceCheckUtils]: 31: Hoare triple {41975#(<= 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); {41975#(<= main_~k~0 9)} is VALID [2018-11-23 12:00:43,901 INFO L273 TraceCheckUtils]: 32: Hoare triple {41975#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {41975#(<= main_~k~0 9)} is VALID [2018-11-23 12:00:43,901 INFO L273 TraceCheckUtils]: 33: Hoare triple {41975#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {41985#(<= main_~k~0 10)} is VALID [2018-11-23 12:00:43,902 INFO L273 TraceCheckUtils]: 34: Hoare triple {41985#(<= 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); {41985#(<= main_~k~0 10)} is VALID [2018-11-23 12:00:43,902 INFO L273 TraceCheckUtils]: 35: Hoare triple {41985#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {41985#(<= main_~k~0 10)} is VALID [2018-11-23 12:00:43,903 INFO L273 TraceCheckUtils]: 36: Hoare triple {41985#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {41995#(<= main_~k~0 11)} is VALID [2018-11-23 12:00:43,904 INFO L273 TraceCheckUtils]: 37: Hoare triple {41995#(<= 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); {41995#(<= main_~k~0 11)} is VALID [2018-11-23 12:00:43,904 INFO L273 TraceCheckUtils]: 38: Hoare triple {41995#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {41995#(<= main_~k~0 11)} is VALID [2018-11-23 12:00:43,905 INFO L273 TraceCheckUtils]: 39: Hoare triple {41995#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {42005#(<= main_~k~0 12)} is VALID [2018-11-23 12:00:43,905 INFO L273 TraceCheckUtils]: 40: Hoare triple {42005#(<= 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); {42005#(<= main_~k~0 12)} is VALID [2018-11-23 12:00:43,906 INFO L273 TraceCheckUtils]: 41: Hoare triple {42005#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {42005#(<= main_~k~0 12)} is VALID [2018-11-23 12:00:43,907 INFO L273 TraceCheckUtils]: 42: Hoare triple {42005#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {42015#(<= main_~k~0 13)} is VALID [2018-11-23 12:00:43,907 INFO L273 TraceCheckUtils]: 43: Hoare triple {42015#(<= 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); {42015#(<= main_~k~0 13)} is VALID [2018-11-23 12:00:43,908 INFO L273 TraceCheckUtils]: 44: Hoare triple {42015#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {42015#(<= main_~k~0 13)} is VALID [2018-11-23 12:00:43,908 INFO L273 TraceCheckUtils]: 45: Hoare triple {42015#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {42025#(<= main_~k~0 14)} is VALID [2018-11-23 12:00:43,909 INFO L273 TraceCheckUtils]: 46: Hoare triple {42025#(<= 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); {42025#(<= main_~k~0 14)} is VALID [2018-11-23 12:00:43,909 INFO L273 TraceCheckUtils]: 47: Hoare triple {42025#(<= main_~k~0 14)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {42025#(<= main_~k~0 14)} is VALID [2018-11-23 12:00:43,910 INFO L273 TraceCheckUtils]: 48: Hoare triple {42025#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {42035#(<= main_~k~0 15)} is VALID [2018-11-23 12:00:43,911 INFO L273 TraceCheckUtils]: 49: Hoare triple {42035#(<= 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); {42035#(<= main_~k~0 15)} is VALID [2018-11-23 12:00:43,911 INFO L273 TraceCheckUtils]: 50: Hoare triple {42035#(<= main_~k~0 15)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {42035#(<= main_~k~0 15)} is VALID [2018-11-23 12:00:43,912 INFO L273 TraceCheckUtils]: 51: Hoare triple {42035#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {42045#(<= main_~k~0 16)} is VALID [2018-11-23 12:00:43,912 INFO L273 TraceCheckUtils]: 52: Hoare triple {42045#(<= 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); {42045#(<= main_~k~0 16)} is VALID [2018-11-23 12:00:43,913 INFO L273 TraceCheckUtils]: 53: Hoare triple {42045#(<= main_~k~0 16)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {42045#(<= main_~k~0 16)} is VALID [2018-11-23 12:00:43,914 INFO L273 TraceCheckUtils]: 54: Hoare triple {42045#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {42055#(<= main_~k~0 17)} is VALID [2018-11-23 12:00:43,914 INFO L273 TraceCheckUtils]: 55: Hoare triple {42055#(<= 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); {42055#(<= main_~k~0 17)} is VALID [2018-11-23 12:00:43,915 INFO L273 TraceCheckUtils]: 56: Hoare triple {42055#(<= main_~k~0 17)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {42055#(<= main_~k~0 17)} is VALID [2018-11-23 12:00:43,915 INFO L273 TraceCheckUtils]: 57: Hoare triple {42055#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {42065#(<= main_~k~0 18)} is VALID [2018-11-23 12:00:43,916 INFO L273 TraceCheckUtils]: 58: Hoare triple {42065#(<= 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); {42065#(<= main_~k~0 18)} is VALID [2018-11-23 12:00:43,916 INFO L273 TraceCheckUtils]: 59: Hoare triple {42065#(<= main_~k~0 18)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {42065#(<= main_~k~0 18)} is VALID [2018-11-23 12:00:43,917 INFO L273 TraceCheckUtils]: 60: Hoare triple {42065#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {42075#(<= main_~k~0 19)} is VALID [2018-11-23 12:00:43,918 INFO L273 TraceCheckUtils]: 61: Hoare triple {42075#(<= 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); {42075#(<= main_~k~0 19)} is VALID [2018-11-23 12:00:43,918 INFO L273 TraceCheckUtils]: 62: Hoare triple {42075#(<= main_~k~0 19)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {42075#(<= main_~k~0 19)} is VALID [2018-11-23 12:00:43,919 INFO L273 TraceCheckUtils]: 63: Hoare triple {42075#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {42085#(<= main_~k~0 20)} is VALID [2018-11-23 12:00:43,919 INFO L273 TraceCheckUtils]: 64: Hoare triple {42085#(<= 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); {42085#(<= main_~k~0 20)} is VALID [2018-11-23 12:00:43,920 INFO L273 TraceCheckUtils]: 65: Hoare triple {42085#(<= main_~k~0 20)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {42085#(<= main_~k~0 20)} is VALID [2018-11-23 12:00:43,921 INFO L273 TraceCheckUtils]: 66: Hoare triple {42085#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {42095#(<= main_~k~0 21)} is VALID [2018-11-23 12:00:43,921 INFO L273 TraceCheckUtils]: 67: Hoare triple {42095#(<= 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); {42095#(<= main_~k~0 21)} is VALID [2018-11-23 12:00:43,922 INFO L273 TraceCheckUtils]: 68: Hoare triple {42095#(<= main_~k~0 21)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {42095#(<= main_~k~0 21)} is VALID [2018-11-23 12:00:43,922 INFO L273 TraceCheckUtils]: 69: Hoare triple {42095#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {42105#(<= main_~k~0 22)} is VALID [2018-11-23 12:00:43,923 INFO L273 TraceCheckUtils]: 70: Hoare triple {42105#(<= 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); {42105#(<= main_~k~0 22)} is VALID [2018-11-23 12:00:43,923 INFO L273 TraceCheckUtils]: 71: Hoare triple {42105#(<= main_~k~0 22)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {42105#(<= main_~k~0 22)} is VALID [2018-11-23 12:00:43,924 INFO L273 TraceCheckUtils]: 72: Hoare triple {42105#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {42115#(<= main_~k~0 23)} is VALID [2018-11-23 12:00:43,925 INFO L273 TraceCheckUtils]: 73: Hoare triple {42115#(<= 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); {42115#(<= main_~k~0 23)} is VALID [2018-11-23 12:00:43,925 INFO L273 TraceCheckUtils]: 74: Hoare triple {42115#(<= main_~k~0 23)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {42115#(<= main_~k~0 23)} is VALID [2018-11-23 12:00:43,926 INFO L273 TraceCheckUtils]: 75: Hoare triple {42115#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {42125#(<= main_~k~0 24)} is VALID [2018-11-23 12:00:43,926 INFO L273 TraceCheckUtils]: 76: Hoare triple {42125#(<= 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); {42125#(<= main_~k~0 24)} is VALID [2018-11-23 12:00:43,927 INFO L273 TraceCheckUtils]: 77: Hoare triple {42125#(<= main_~k~0 24)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {42125#(<= main_~k~0 24)} is VALID [2018-11-23 12:00:43,928 INFO L273 TraceCheckUtils]: 78: Hoare triple {42125#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {42135#(<= main_~k~0 25)} is VALID [2018-11-23 12:00:43,928 INFO L273 TraceCheckUtils]: 79: Hoare triple {42135#(<= 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); {42135#(<= main_~k~0 25)} is VALID [2018-11-23 12:00:43,929 INFO L273 TraceCheckUtils]: 80: Hoare triple {42135#(<= main_~k~0 25)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {42135#(<= main_~k~0 25)} is VALID [2018-11-23 12:00:43,929 INFO L273 TraceCheckUtils]: 81: Hoare triple {42135#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {42145#(<= main_~k~0 26)} is VALID [2018-11-23 12:00:43,930 INFO L273 TraceCheckUtils]: 82: Hoare triple {42145#(<= 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); {42145#(<= main_~k~0 26)} is VALID [2018-11-23 12:00:43,931 INFO L273 TraceCheckUtils]: 83: Hoare triple {42145#(<= main_~k~0 26)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {42145#(<= main_~k~0 26)} is VALID [2018-11-23 12:00:43,931 INFO L273 TraceCheckUtils]: 84: Hoare triple {42145#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {42155#(<= main_~k~0 27)} is VALID [2018-11-23 12:00:43,932 INFO L273 TraceCheckUtils]: 85: Hoare triple {42155#(<= 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); {42155#(<= main_~k~0 27)} is VALID [2018-11-23 12:00:43,932 INFO L273 TraceCheckUtils]: 86: Hoare triple {42155#(<= main_~k~0 27)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {42155#(<= main_~k~0 27)} is VALID [2018-11-23 12:00:43,933 INFO L273 TraceCheckUtils]: 87: Hoare triple {42155#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {42165#(<= main_~k~0 28)} is VALID [2018-11-23 12:00:43,934 INFO L273 TraceCheckUtils]: 88: Hoare triple {42165#(<= 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); {42165#(<= main_~k~0 28)} is VALID [2018-11-23 12:00:43,934 INFO L273 TraceCheckUtils]: 89: Hoare triple {42165#(<= main_~k~0 28)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {42165#(<= main_~k~0 28)} is VALID [2018-11-23 12:00:43,935 INFO L273 TraceCheckUtils]: 90: Hoare triple {42165#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {42175#(<= main_~k~0 29)} is VALID [2018-11-23 12:00:43,935 INFO L273 TraceCheckUtils]: 91: Hoare triple {42175#(<= 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); {42175#(<= main_~k~0 29)} is VALID [2018-11-23 12:00:43,936 INFO L273 TraceCheckUtils]: 92: Hoare triple {42175#(<= main_~k~0 29)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {42175#(<= main_~k~0 29)} is VALID [2018-11-23 12:00:43,937 INFO L273 TraceCheckUtils]: 93: Hoare triple {42175#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {42185#(<= main_~k~0 30)} is VALID [2018-11-23 12:00:43,937 INFO L273 TraceCheckUtils]: 94: Hoare triple {42185#(<= 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); {42185#(<= main_~k~0 30)} is VALID [2018-11-23 12:00:43,938 INFO L273 TraceCheckUtils]: 95: Hoare triple {42185#(<= main_~k~0 30)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {42185#(<= main_~k~0 30)} is VALID [2018-11-23 12:00:43,938 INFO L273 TraceCheckUtils]: 96: Hoare triple {42185#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {42195#(<= main_~k~0 31)} is VALID [2018-11-23 12:00:43,939 INFO L273 TraceCheckUtils]: 97: Hoare triple {42195#(<= 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); {42195#(<= main_~k~0 31)} is VALID [2018-11-23 12:00:43,939 INFO L273 TraceCheckUtils]: 98: Hoare triple {42195#(<= main_~k~0 31)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {42195#(<= main_~k~0 31)} is VALID [2018-11-23 12:00:43,940 INFO L273 TraceCheckUtils]: 99: Hoare triple {42195#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {42205#(<= main_~k~0 32)} is VALID [2018-11-23 12:00:43,941 INFO L273 TraceCheckUtils]: 100: Hoare triple {42205#(<= 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); {42205#(<= main_~k~0 32)} is VALID [2018-11-23 12:00:43,941 INFO L273 TraceCheckUtils]: 101: Hoare triple {42205#(<= main_~k~0 32)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {42205#(<= main_~k~0 32)} is VALID [2018-11-23 12:00:43,942 INFO L273 TraceCheckUtils]: 102: Hoare triple {42205#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {42215#(<= main_~k~0 33)} is VALID [2018-11-23 12:00:43,942 INFO L273 TraceCheckUtils]: 103: Hoare triple {42215#(<= 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); {42215#(<= main_~k~0 33)} is VALID [2018-11-23 12:00:43,943 INFO L273 TraceCheckUtils]: 104: Hoare triple {42215#(<= main_~k~0 33)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {42215#(<= main_~k~0 33)} is VALID [2018-11-23 12:00:43,944 INFO L273 TraceCheckUtils]: 105: Hoare triple {42215#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {42225#(<= main_~k~0 34)} is VALID [2018-11-23 12:00:43,944 INFO L273 TraceCheckUtils]: 106: Hoare triple {42225#(<= 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); {42225#(<= main_~k~0 34)} is VALID [2018-11-23 12:00:43,945 INFO L273 TraceCheckUtils]: 107: Hoare triple {42225#(<= main_~k~0 34)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {42225#(<= main_~k~0 34)} is VALID [2018-11-23 12:00:43,945 INFO L273 TraceCheckUtils]: 108: Hoare triple {42225#(<= main_~k~0 34)} ~k~0 := 1 + ~k~0; {42235#(<= main_~k~0 35)} is VALID [2018-11-23 12:00:43,946 INFO L273 TraceCheckUtils]: 109: Hoare triple {42235#(<= 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); {42235#(<= main_~k~0 35)} is VALID [2018-11-23 12:00:43,946 INFO L273 TraceCheckUtils]: 110: Hoare triple {42235#(<= main_~k~0 35)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {42235#(<= main_~k~0 35)} is VALID [2018-11-23 12:00:43,947 INFO L273 TraceCheckUtils]: 111: Hoare triple {42235#(<= main_~k~0 35)} ~k~0 := 1 + ~k~0; {42245#(<= main_~k~0 36)} is VALID [2018-11-23 12:00:43,948 INFO L273 TraceCheckUtils]: 112: Hoare triple {42245#(<= 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); {42245#(<= main_~k~0 36)} is VALID [2018-11-23 12:00:43,948 INFO L273 TraceCheckUtils]: 113: Hoare triple {42245#(<= main_~k~0 36)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {42245#(<= main_~k~0 36)} is VALID [2018-11-23 12:00:43,949 INFO L273 TraceCheckUtils]: 114: Hoare triple {42245#(<= main_~k~0 36)} ~k~0 := 1 + ~k~0; {42255#(<= main_~k~0 37)} is VALID [2018-11-23 12:00:43,950 INFO L273 TraceCheckUtils]: 115: Hoare triple {42255#(<= main_~k~0 37)} assume !(~k~0 < 100000); {41834#false} is VALID [2018-11-23 12:00:43,950 INFO L273 TraceCheckUtils]: 116: Hoare triple {41834#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); {41834#false} is VALID [2018-11-23 12:00:43,950 INFO L273 TraceCheckUtils]: 117: Hoare triple {41834#false} ~x~0 := 0; {41834#false} is VALID [2018-11-23 12:00:43,950 INFO L273 TraceCheckUtils]: 118: Hoare triple {41834#false} assume !(~x~0 < ~i~0); {41834#false} is VALID [2018-11-23 12:00:43,950 INFO L273 TraceCheckUtils]: 119: Hoare triple {41834#false} ~x~0 := ~i~0; {41834#false} is VALID [2018-11-23 12:00:43,951 INFO L273 TraceCheckUtils]: 120: Hoare triple {41834#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); {41834#false} is VALID [2018-11-23 12:00:43,951 INFO L256 TraceCheckUtils]: 121: Hoare triple {41834#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {41834#false} is VALID [2018-11-23 12:00:43,951 INFO L273 TraceCheckUtils]: 122: Hoare triple {41834#false} ~cond := #in~cond; {41834#false} is VALID [2018-11-23 12:00:43,951 INFO L273 TraceCheckUtils]: 123: Hoare triple {41834#false} assume !(0 == ~cond); {41834#false} is VALID [2018-11-23 12:00:43,951 INFO L273 TraceCheckUtils]: 124: Hoare triple {41834#false} assume true; {41834#false} is VALID [2018-11-23 12:00:43,952 INFO L268 TraceCheckUtils]: 125: Hoare quadruple {41834#false} {41834#false} #136#return; {41834#false} is VALID [2018-11-23 12:00:43,952 INFO L273 TraceCheckUtils]: 126: Hoare triple {41834#false} havoc #t~mem9;havoc #t~mem10; {41834#false} is VALID [2018-11-23 12:00:43,952 INFO L273 TraceCheckUtils]: 127: Hoare triple {41834#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {41834#false} is VALID [2018-11-23 12:00:43,952 INFO L273 TraceCheckUtils]: 128: Hoare triple {41834#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); {41834#false} is VALID [2018-11-23 12:00:43,952 INFO L256 TraceCheckUtils]: 129: Hoare triple {41834#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {41834#false} is VALID [2018-11-23 12:00:43,952 INFO L273 TraceCheckUtils]: 130: Hoare triple {41834#false} ~cond := #in~cond; {41834#false} is VALID [2018-11-23 12:00:43,953 INFO L273 TraceCheckUtils]: 131: Hoare triple {41834#false} assume 0 == ~cond; {41834#false} is VALID [2018-11-23 12:00:43,953 INFO L273 TraceCheckUtils]: 132: Hoare triple {41834#false} assume !false; {41834#false} is VALID [2018-11-23 12:00:43,965 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 12:00:43,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:43,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 78 [2018-11-23 12:00:43,985 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 133 [2018-11-23 12:00:43,985 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:43,985 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 78 states. [2018-11-23 12:00:44,241 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 246 edges. 246 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:44,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-11-23 12:00:44,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-11-23 12:00:44,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2263, Invalid=3743, Unknown=0, NotChecked=0, Total=6006 [2018-11-23 12:00:44,243 INFO L87 Difference]: Start difference. First operand 270 states and 357 transitions. Second operand 78 states. [2018-11-23 12:00:45,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:45,914 INFO L93 Difference]: Finished difference Result 333 states and 443 transitions. [2018-11-23 12:00:45,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-23 12:00:45,914 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 133 [2018-11-23 12:00:45,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:45,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-23 12:00:45,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 255 transitions. [2018-11-23 12:00:45,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-23 12:00:45,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 255 transitions. [2018-11-23 12:00:45,918 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 255 transitions. [2018-11-23 12:00:46,173 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 255 edges. 255 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:46,179 INFO L225 Difference]: With dead ends: 333 [2018-11-23 12:00:46,179 INFO L226 Difference]: Without dead ends: 286 [2018-11-23 12:00:46,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2110 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2263, Invalid=3743, Unknown=0, NotChecked=0, Total=6006 [2018-11-23 12:00:46,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-11-23 12:00:46,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 276. [2018-11-23 12:00:46,418 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:46,418 INFO L82 GeneralOperation]: Start isEquivalent. First operand 286 states. Second operand 276 states. [2018-11-23 12:00:46,418 INFO L74 IsIncluded]: Start isIncluded. First operand 286 states. Second operand 276 states. [2018-11-23 12:00:46,418 INFO L87 Difference]: Start difference. First operand 286 states. Second operand 276 states. [2018-11-23 12:00:46,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:46,424 INFO L93 Difference]: Finished difference Result 286 states and 380 transitions. [2018-11-23 12:00:46,424 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 380 transitions. [2018-11-23 12:00:46,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:46,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:46,425 INFO L74 IsIncluded]: Start isIncluded. First operand 276 states. Second operand 286 states. [2018-11-23 12:00:46,425 INFO L87 Difference]: Start difference. First operand 276 states. Second operand 286 states. [2018-11-23 12:00:46,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:46,430 INFO L93 Difference]: Finished difference Result 286 states and 380 transitions. [2018-11-23 12:00:46,430 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 380 transitions. [2018-11-23 12:00:46,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:46,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:46,431 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:46,431 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:46,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-11-23 12:00:46,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 365 transitions. [2018-11-23 12:00:46,436 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 365 transitions. Word has length 133 [2018-11-23 12:00:46,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:46,436 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 365 transitions. [2018-11-23 12:00:46,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-11-23 12:00:46,436 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 365 transitions. [2018-11-23 12:00:46,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-23 12:00:46,436 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:46,437 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 37, 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 12:00:46,437 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:46,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:46,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1867930831, now seen corresponding path program 33 times [2018-11-23 12:00:46,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:46,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:46,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:46,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:00:46,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:46,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:47,779 INFO L256 TraceCheckUtils]: 0: Hoare triple {43704#true} call ULTIMATE.init(); {43704#true} is VALID [2018-11-23 12:00:47,780 INFO L273 TraceCheckUtils]: 1: Hoare triple {43704#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {43704#true} is VALID [2018-11-23 12:00:47,780 INFO L273 TraceCheckUtils]: 2: Hoare triple {43704#true} assume true; {43704#true} is VALID [2018-11-23 12:00:47,780 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {43704#true} {43704#true} #130#return; {43704#true} is VALID [2018-11-23 12:00:47,780 INFO L256 TraceCheckUtils]: 4: Hoare triple {43704#true} call #t~ret15 := main(); {43704#true} is VALID [2018-11-23 12:00:47,781 INFO L273 TraceCheckUtils]: 5: Hoare triple {43704#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {43706#(= main_~i~0 0)} is VALID [2018-11-23 12:00:47,781 INFO L273 TraceCheckUtils]: 6: Hoare triple {43706#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {43707#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,782 INFO L273 TraceCheckUtils]: 7: Hoare triple {43707#(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); {43707#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,782 INFO L273 TraceCheckUtils]: 8: Hoare triple {43707#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43707#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,783 INFO L273 TraceCheckUtils]: 9: Hoare triple {43707#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {43708#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,783 INFO L273 TraceCheckUtils]: 10: Hoare triple {43708#(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); {43708#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,784 INFO L273 TraceCheckUtils]: 11: Hoare triple {43708#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43708#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,785 INFO L273 TraceCheckUtils]: 12: Hoare triple {43708#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {43709#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,786 INFO L273 TraceCheckUtils]: 13: Hoare triple {43709#(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); {43709#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,786 INFO L273 TraceCheckUtils]: 14: Hoare triple {43709#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43709#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,787 INFO L273 TraceCheckUtils]: 15: Hoare triple {43709#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {43710#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,788 INFO L273 TraceCheckUtils]: 16: Hoare triple {43710#(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); {43710#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,789 INFO L273 TraceCheckUtils]: 17: Hoare triple {43710#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43710#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,790 INFO L273 TraceCheckUtils]: 18: Hoare triple {43710#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {43711#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,791 INFO L273 TraceCheckUtils]: 19: Hoare triple {43711#(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); {43711#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,791 INFO L273 TraceCheckUtils]: 20: Hoare triple {43711#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43711#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,792 INFO L273 TraceCheckUtils]: 21: Hoare triple {43711#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {43712#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,793 INFO L273 TraceCheckUtils]: 22: Hoare triple {43712#(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); {43712#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,795 INFO L273 TraceCheckUtils]: 23: Hoare triple {43712#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43712#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,796 INFO L273 TraceCheckUtils]: 24: Hoare triple {43712#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {43713#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,797 INFO L273 TraceCheckUtils]: 25: Hoare triple {43713#(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); {43713#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,797 INFO L273 TraceCheckUtils]: 26: Hoare triple {43713#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43713#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,798 INFO L273 TraceCheckUtils]: 27: Hoare triple {43713#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {43714#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,798 INFO L273 TraceCheckUtils]: 28: Hoare triple {43714#(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); {43714#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,799 INFO L273 TraceCheckUtils]: 29: Hoare triple {43714#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43714#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,799 INFO L273 TraceCheckUtils]: 30: Hoare triple {43714#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {43715#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,800 INFO L273 TraceCheckUtils]: 31: Hoare triple {43715#(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); {43715#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,800 INFO L273 TraceCheckUtils]: 32: Hoare triple {43715#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43715#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,801 INFO L273 TraceCheckUtils]: 33: Hoare triple {43715#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {43716#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,802 INFO L273 TraceCheckUtils]: 34: Hoare triple {43716#(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); {43716#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,803 INFO L273 TraceCheckUtils]: 35: Hoare triple {43716#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43716#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,804 INFO L273 TraceCheckUtils]: 36: Hoare triple {43716#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {43717#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,805 INFO L273 TraceCheckUtils]: 37: Hoare triple {43717#(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); {43717#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,805 INFO L273 TraceCheckUtils]: 38: Hoare triple {43717#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43717#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,806 INFO L273 TraceCheckUtils]: 39: Hoare triple {43717#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {43718#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,807 INFO L273 TraceCheckUtils]: 40: Hoare triple {43718#(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); {43718#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,808 INFO L273 TraceCheckUtils]: 41: Hoare triple {43718#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43718#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,809 INFO L273 TraceCheckUtils]: 42: Hoare triple {43718#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {43719#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,810 INFO L273 TraceCheckUtils]: 43: Hoare triple {43719#(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); {43719#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,810 INFO L273 TraceCheckUtils]: 44: Hoare triple {43719#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43719#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,811 INFO L273 TraceCheckUtils]: 45: Hoare triple {43719#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {43720#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,812 INFO L273 TraceCheckUtils]: 46: Hoare triple {43720#(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); {43720#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,813 INFO L273 TraceCheckUtils]: 47: Hoare triple {43720#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43720#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,813 INFO L273 TraceCheckUtils]: 48: Hoare triple {43720#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {43721#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,814 INFO L273 TraceCheckUtils]: 49: Hoare triple {43721#(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); {43721#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,815 INFO L273 TraceCheckUtils]: 50: Hoare triple {43721#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43721#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,816 INFO L273 TraceCheckUtils]: 51: Hoare triple {43721#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {43722#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,817 INFO L273 TraceCheckUtils]: 52: Hoare triple {43722#(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); {43722#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,818 INFO L273 TraceCheckUtils]: 53: Hoare triple {43722#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43722#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,818 INFO L273 TraceCheckUtils]: 54: Hoare triple {43722#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {43723#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 12:00:47,819 INFO L273 TraceCheckUtils]: 55: Hoare triple {43723#(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); {43723#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 12:00:47,820 INFO L273 TraceCheckUtils]: 56: Hoare triple {43723#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43723#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 12:00:47,821 INFO L273 TraceCheckUtils]: 57: Hoare triple {43723#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} ~k~0 := 1 + ~k~0; {43724#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,822 INFO L273 TraceCheckUtils]: 58: Hoare triple {43724#(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); {43724#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,822 INFO L273 TraceCheckUtils]: 59: Hoare triple {43724#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43724#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,823 INFO L273 TraceCheckUtils]: 60: Hoare triple {43724#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {43725#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,824 INFO L273 TraceCheckUtils]: 61: Hoare triple {43725#(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); {43725#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,825 INFO L273 TraceCheckUtils]: 62: Hoare triple {43725#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43725#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,826 INFO L273 TraceCheckUtils]: 63: Hoare triple {43725#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {43726#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,826 INFO L273 TraceCheckUtils]: 64: Hoare triple {43726#(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); {43726#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,827 INFO L273 TraceCheckUtils]: 65: Hoare triple {43726#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43726#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,828 INFO L273 TraceCheckUtils]: 66: Hoare triple {43726#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {43727#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,829 INFO L273 TraceCheckUtils]: 67: Hoare triple {43727#(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); {43727#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,829 INFO L273 TraceCheckUtils]: 68: Hoare triple {43727#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43727#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,830 INFO L273 TraceCheckUtils]: 69: Hoare triple {43727#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {43728#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,831 INFO L273 TraceCheckUtils]: 70: Hoare triple {43728#(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); {43728#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,832 INFO L273 TraceCheckUtils]: 71: Hoare triple {43728#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43728#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,833 INFO L273 TraceCheckUtils]: 72: Hoare triple {43728#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {43729#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,834 INFO L273 TraceCheckUtils]: 73: Hoare triple {43729#(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); {43729#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,834 INFO L273 TraceCheckUtils]: 74: Hoare triple {43729#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43729#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,835 INFO L273 TraceCheckUtils]: 75: Hoare triple {43729#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {43730#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,836 INFO L273 TraceCheckUtils]: 76: Hoare triple {43730#(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); {43730#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,837 INFO L273 TraceCheckUtils]: 77: Hoare triple {43730#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43730#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,837 INFO L273 TraceCheckUtils]: 78: Hoare triple {43730#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {43731#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,838 INFO L273 TraceCheckUtils]: 79: Hoare triple {43731#(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); {43731#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,839 INFO L273 TraceCheckUtils]: 80: Hoare triple {43731#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43731#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,840 INFO L273 TraceCheckUtils]: 81: Hoare triple {43731#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {43732#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,841 INFO L273 TraceCheckUtils]: 82: Hoare triple {43732#(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); {43732#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,842 INFO L273 TraceCheckUtils]: 83: Hoare triple {43732#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43732#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,843 INFO L273 TraceCheckUtils]: 84: Hoare triple {43732#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {43733#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,843 INFO L273 TraceCheckUtils]: 85: Hoare triple {43733#(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); {43733#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,844 INFO L273 TraceCheckUtils]: 86: Hoare triple {43733#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43733#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,845 INFO L273 TraceCheckUtils]: 87: Hoare triple {43733#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {43734#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,846 INFO L273 TraceCheckUtils]: 88: Hoare triple {43734#(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); {43734#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,847 INFO L273 TraceCheckUtils]: 89: Hoare triple {43734#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43734#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,848 INFO L273 TraceCheckUtils]: 90: Hoare triple {43734#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {43735#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,849 INFO L273 TraceCheckUtils]: 91: Hoare triple {43735#(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); {43735#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,849 INFO L273 TraceCheckUtils]: 92: Hoare triple {43735#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43735#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,850 INFO L273 TraceCheckUtils]: 93: Hoare triple {43735#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {43736#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,851 INFO L273 TraceCheckUtils]: 94: Hoare triple {43736#(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); {43736#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,852 INFO L273 TraceCheckUtils]: 95: Hoare triple {43736#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43736#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,853 INFO L273 TraceCheckUtils]: 96: Hoare triple {43736#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {43737#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,854 INFO L273 TraceCheckUtils]: 97: Hoare triple {43737#(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); {43737#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,854 INFO L273 TraceCheckUtils]: 98: Hoare triple {43737#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43737#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,855 INFO L273 TraceCheckUtils]: 99: Hoare triple {43737#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {43738#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,856 INFO L273 TraceCheckUtils]: 100: Hoare triple {43738#(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); {43738#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,857 INFO L273 TraceCheckUtils]: 101: Hoare triple {43738#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43738#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,858 INFO L273 TraceCheckUtils]: 102: Hoare triple {43738#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {43739#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,859 INFO L273 TraceCheckUtils]: 103: Hoare triple {43739#(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); {43739#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,859 INFO L273 TraceCheckUtils]: 104: Hoare triple {43739#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43739#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,860 INFO L273 TraceCheckUtils]: 105: Hoare triple {43739#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {43740#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,861 INFO L273 TraceCheckUtils]: 106: Hoare triple {43740#(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); {43740#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,862 INFO L273 TraceCheckUtils]: 107: Hoare triple {43740#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43740#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,863 INFO L273 TraceCheckUtils]: 108: Hoare triple {43740#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {43741#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,864 INFO L273 TraceCheckUtils]: 109: Hoare triple {43741#(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); {43741#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,865 INFO L273 TraceCheckUtils]: 110: Hoare triple {43741#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43741#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,865 INFO L273 TraceCheckUtils]: 111: Hoare triple {43741#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {43742#(and (<= main_~k~0 (+ main_~i~0 36)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,866 INFO L273 TraceCheckUtils]: 112: Hoare triple {43742#(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); {43742#(and (<= main_~k~0 (+ main_~i~0 36)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,867 INFO L273 TraceCheckUtils]: 113: Hoare triple {43742#(and (<= main_~k~0 (+ main_~i~0 36)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43742#(and (<= main_~k~0 (+ main_~i~0 36)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,868 INFO L273 TraceCheckUtils]: 114: Hoare triple {43742#(and (<= main_~k~0 (+ main_~i~0 36)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {43743#(and (<= main_~k~0 (+ main_~i~0 37)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,869 INFO L273 TraceCheckUtils]: 115: Hoare triple {43743#(and (<= main_~k~0 (+ main_~i~0 37)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43743#(and (<= main_~k~0 (+ main_~i~0 37)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,870 INFO L273 TraceCheckUtils]: 116: Hoare triple {43743#(and (<= main_~k~0 (+ main_~i~0 37)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43743#(and (<= main_~k~0 (+ main_~i~0 37)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,870 INFO L273 TraceCheckUtils]: 117: Hoare triple {43743#(and (<= main_~k~0 (+ main_~i~0 37)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {43744#(and (<= main_~k~0 (+ main_~i~0 38)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:47,871 INFO L273 TraceCheckUtils]: 118: Hoare triple {43744#(and (<= main_~k~0 (+ main_~i~0 38)) (= main_~i~0 0))} assume !(~k~0 < 100000); {43705#false} is VALID [2018-11-23 12:00:47,871 INFO L273 TraceCheckUtils]: 119: Hoare triple {43705#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); {43705#false} is VALID [2018-11-23 12:00:47,872 INFO L273 TraceCheckUtils]: 120: Hoare triple {43705#false} ~x~0 := 0; {43705#false} is VALID [2018-11-23 12:00:47,872 INFO L273 TraceCheckUtils]: 121: Hoare triple {43705#false} assume !(~x~0 < ~i~0); {43705#false} is VALID [2018-11-23 12:00:47,872 INFO L273 TraceCheckUtils]: 122: Hoare triple {43705#false} ~x~0 := ~i~0; {43705#false} is VALID [2018-11-23 12:00:47,872 INFO L273 TraceCheckUtils]: 123: Hoare triple {43705#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); {43705#false} is VALID [2018-11-23 12:00:47,872 INFO L256 TraceCheckUtils]: 124: Hoare triple {43705#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {43704#true} is VALID [2018-11-23 12:00:47,872 INFO L273 TraceCheckUtils]: 125: Hoare triple {43704#true} ~cond := #in~cond; {43704#true} is VALID [2018-11-23 12:00:47,873 INFO L273 TraceCheckUtils]: 126: Hoare triple {43704#true} assume !(0 == ~cond); {43704#true} is VALID [2018-11-23 12:00:47,873 INFO L273 TraceCheckUtils]: 127: Hoare triple {43704#true} assume true; {43704#true} is VALID [2018-11-23 12:00:47,873 INFO L268 TraceCheckUtils]: 128: Hoare quadruple {43704#true} {43705#false} #136#return; {43705#false} is VALID [2018-11-23 12:00:47,873 INFO L273 TraceCheckUtils]: 129: Hoare triple {43705#false} havoc #t~mem9;havoc #t~mem10; {43705#false} is VALID [2018-11-23 12:00:47,873 INFO L273 TraceCheckUtils]: 130: Hoare triple {43705#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {43705#false} is VALID [2018-11-23 12:00:47,874 INFO L273 TraceCheckUtils]: 131: Hoare triple {43705#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); {43705#false} is VALID [2018-11-23 12:00:47,874 INFO L256 TraceCheckUtils]: 132: Hoare triple {43705#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {43705#false} is VALID [2018-11-23 12:00:47,874 INFO L273 TraceCheckUtils]: 133: Hoare triple {43705#false} ~cond := #in~cond; {43705#false} is VALID [2018-11-23 12:00:47,874 INFO L273 TraceCheckUtils]: 134: Hoare triple {43705#false} assume 0 == ~cond; {43705#false} is VALID [2018-11-23 12:00:47,874 INFO L273 TraceCheckUtils]: 135: Hoare triple {43705#false} assume !false; {43705#false} is VALID [2018-11-23 12:00:47,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2039 backedges. 2 proven. 2035 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 12:00:47,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:47,902 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:00:47,911 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:00:48,136 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-11-23 12:00:48,136 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:00:48,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:48,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:49,552 INFO L256 TraceCheckUtils]: 0: Hoare triple {43704#true} call ULTIMATE.init(); {43704#true} is VALID [2018-11-23 12:00:49,552 INFO L273 TraceCheckUtils]: 1: Hoare triple {43704#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {43704#true} is VALID [2018-11-23 12:00:49,553 INFO L273 TraceCheckUtils]: 2: Hoare triple {43704#true} assume true; {43704#true} is VALID [2018-11-23 12:00:49,553 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {43704#true} {43704#true} #130#return; {43704#true} is VALID [2018-11-23 12:00:49,553 INFO L256 TraceCheckUtils]: 4: Hoare triple {43704#true} call #t~ret15 := main(); {43704#true} is VALID [2018-11-23 12:00:49,554 INFO L273 TraceCheckUtils]: 5: Hoare triple {43704#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {43763#(<= main_~i~0 0)} is VALID [2018-11-23 12:00:49,555 INFO L273 TraceCheckUtils]: 6: Hoare triple {43763#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {43767#(<= main_~k~0 1)} is VALID [2018-11-23 12:00:49,555 INFO L273 TraceCheckUtils]: 7: Hoare triple {43767#(<= 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); {43767#(<= main_~k~0 1)} is VALID [2018-11-23 12:00:49,555 INFO L273 TraceCheckUtils]: 8: Hoare triple {43767#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43767#(<= main_~k~0 1)} is VALID [2018-11-23 12:00:49,556 INFO L273 TraceCheckUtils]: 9: Hoare triple {43767#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {43777#(<= main_~k~0 2)} is VALID [2018-11-23 12:00:49,556 INFO L273 TraceCheckUtils]: 10: Hoare triple {43777#(<= 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); {43777#(<= main_~k~0 2)} is VALID [2018-11-23 12:00:49,556 INFO L273 TraceCheckUtils]: 11: Hoare triple {43777#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43777#(<= main_~k~0 2)} is VALID [2018-11-23 12:00:49,557 INFO L273 TraceCheckUtils]: 12: Hoare triple {43777#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {43787#(<= main_~k~0 3)} is VALID [2018-11-23 12:00:49,557 INFO L273 TraceCheckUtils]: 13: Hoare triple {43787#(<= 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); {43787#(<= main_~k~0 3)} is VALID [2018-11-23 12:00:49,557 INFO L273 TraceCheckUtils]: 14: Hoare triple {43787#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43787#(<= main_~k~0 3)} is VALID [2018-11-23 12:00:49,558 INFO L273 TraceCheckUtils]: 15: Hoare triple {43787#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {43797#(<= main_~k~0 4)} is VALID [2018-11-23 12:00:49,558 INFO L273 TraceCheckUtils]: 16: Hoare triple {43797#(<= 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); {43797#(<= main_~k~0 4)} is VALID [2018-11-23 12:00:49,559 INFO L273 TraceCheckUtils]: 17: Hoare triple {43797#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43797#(<= main_~k~0 4)} is VALID [2018-11-23 12:00:49,560 INFO L273 TraceCheckUtils]: 18: Hoare triple {43797#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {43807#(<= main_~k~0 5)} is VALID [2018-11-23 12:00:49,560 INFO L273 TraceCheckUtils]: 19: Hoare triple {43807#(<= 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); {43807#(<= main_~k~0 5)} is VALID [2018-11-23 12:00:49,561 INFO L273 TraceCheckUtils]: 20: Hoare triple {43807#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43807#(<= main_~k~0 5)} is VALID [2018-11-23 12:00:49,561 INFO L273 TraceCheckUtils]: 21: Hoare triple {43807#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {43817#(<= main_~k~0 6)} is VALID [2018-11-23 12:00:49,562 INFO L273 TraceCheckUtils]: 22: Hoare triple {43817#(<= 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); {43817#(<= main_~k~0 6)} is VALID [2018-11-23 12:00:49,562 INFO L273 TraceCheckUtils]: 23: Hoare triple {43817#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43817#(<= main_~k~0 6)} is VALID [2018-11-23 12:00:49,563 INFO L273 TraceCheckUtils]: 24: Hoare triple {43817#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {43827#(<= main_~k~0 7)} is VALID [2018-11-23 12:00:49,564 INFO L273 TraceCheckUtils]: 25: Hoare triple {43827#(<= 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); {43827#(<= main_~k~0 7)} is VALID [2018-11-23 12:00:49,564 INFO L273 TraceCheckUtils]: 26: Hoare triple {43827#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43827#(<= main_~k~0 7)} is VALID [2018-11-23 12:00:49,565 INFO L273 TraceCheckUtils]: 27: Hoare triple {43827#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {43837#(<= main_~k~0 8)} is VALID [2018-11-23 12:00:49,565 INFO L273 TraceCheckUtils]: 28: Hoare triple {43837#(<= 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); {43837#(<= main_~k~0 8)} is VALID [2018-11-23 12:00:49,566 INFO L273 TraceCheckUtils]: 29: Hoare triple {43837#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43837#(<= main_~k~0 8)} is VALID [2018-11-23 12:00:49,567 INFO L273 TraceCheckUtils]: 30: Hoare triple {43837#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {43847#(<= main_~k~0 9)} is VALID [2018-11-23 12:00:49,567 INFO L273 TraceCheckUtils]: 31: Hoare triple {43847#(<= 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); {43847#(<= main_~k~0 9)} is VALID [2018-11-23 12:00:49,568 INFO L273 TraceCheckUtils]: 32: Hoare triple {43847#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43847#(<= main_~k~0 9)} is VALID [2018-11-23 12:00:49,568 INFO L273 TraceCheckUtils]: 33: Hoare triple {43847#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {43857#(<= main_~k~0 10)} is VALID [2018-11-23 12:00:49,569 INFO L273 TraceCheckUtils]: 34: Hoare triple {43857#(<= 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); {43857#(<= main_~k~0 10)} is VALID [2018-11-23 12:00:49,569 INFO L273 TraceCheckUtils]: 35: Hoare triple {43857#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43857#(<= main_~k~0 10)} is VALID [2018-11-23 12:00:49,570 INFO L273 TraceCheckUtils]: 36: Hoare triple {43857#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {43867#(<= main_~k~0 11)} is VALID [2018-11-23 12:00:49,571 INFO L273 TraceCheckUtils]: 37: Hoare triple {43867#(<= 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); {43867#(<= main_~k~0 11)} is VALID [2018-11-23 12:00:49,571 INFO L273 TraceCheckUtils]: 38: Hoare triple {43867#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43867#(<= main_~k~0 11)} is VALID [2018-11-23 12:00:49,572 INFO L273 TraceCheckUtils]: 39: Hoare triple {43867#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {43877#(<= main_~k~0 12)} is VALID [2018-11-23 12:00:49,572 INFO L273 TraceCheckUtils]: 40: Hoare triple {43877#(<= 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); {43877#(<= main_~k~0 12)} is VALID [2018-11-23 12:00:49,573 INFO L273 TraceCheckUtils]: 41: Hoare triple {43877#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43877#(<= main_~k~0 12)} is VALID [2018-11-23 12:00:49,574 INFO L273 TraceCheckUtils]: 42: Hoare triple {43877#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {43887#(<= main_~k~0 13)} is VALID [2018-11-23 12:00:49,574 INFO L273 TraceCheckUtils]: 43: Hoare triple {43887#(<= 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); {43887#(<= main_~k~0 13)} is VALID [2018-11-23 12:00:49,575 INFO L273 TraceCheckUtils]: 44: Hoare triple {43887#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43887#(<= main_~k~0 13)} is VALID [2018-11-23 12:00:49,575 INFO L273 TraceCheckUtils]: 45: Hoare triple {43887#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {43897#(<= main_~k~0 14)} is VALID [2018-11-23 12:00:49,576 INFO L273 TraceCheckUtils]: 46: Hoare triple {43897#(<= 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); {43897#(<= main_~k~0 14)} is VALID [2018-11-23 12:00:49,576 INFO L273 TraceCheckUtils]: 47: Hoare triple {43897#(<= main_~k~0 14)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43897#(<= main_~k~0 14)} is VALID [2018-11-23 12:00:49,577 INFO L273 TraceCheckUtils]: 48: Hoare triple {43897#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {43907#(<= main_~k~0 15)} is VALID [2018-11-23 12:00:49,578 INFO L273 TraceCheckUtils]: 49: Hoare triple {43907#(<= 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); {43907#(<= main_~k~0 15)} is VALID [2018-11-23 12:00:49,578 INFO L273 TraceCheckUtils]: 50: Hoare triple {43907#(<= main_~k~0 15)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43907#(<= main_~k~0 15)} is VALID [2018-11-23 12:00:49,579 INFO L273 TraceCheckUtils]: 51: Hoare triple {43907#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {43917#(<= main_~k~0 16)} is VALID [2018-11-23 12:00:49,579 INFO L273 TraceCheckUtils]: 52: Hoare triple {43917#(<= 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); {43917#(<= main_~k~0 16)} is VALID [2018-11-23 12:00:49,580 INFO L273 TraceCheckUtils]: 53: Hoare triple {43917#(<= main_~k~0 16)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43917#(<= main_~k~0 16)} is VALID [2018-11-23 12:00:49,581 INFO L273 TraceCheckUtils]: 54: Hoare triple {43917#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {43927#(<= main_~k~0 17)} is VALID [2018-11-23 12:00:49,581 INFO L273 TraceCheckUtils]: 55: Hoare triple {43927#(<= 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); {43927#(<= main_~k~0 17)} is VALID [2018-11-23 12:00:49,582 INFO L273 TraceCheckUtils]: 56: Hoare triple {43927#(<= main_~k~0 17)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43927#(<= main_~k~0 17)} is VALID [2018-11-23 12:00:49,582 INFO L273 TraceCheckUtils]: 57: Hoare triple {43927#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {43937#(<= main_~k~0 18)} is VALID [2018-11-23 12:00:49,583 INFO L273 TraceCheckUtils]: 58: Hoare triple {43937#(<= 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); {43937#(<= main_~k~0 18)} is VALID [2018-11-23 12:00:49,583 INFO L273 TraceCheckUtils]: 59: Hoare triple {43937#(<= main_~k~0 18)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43937#(<= main_~k~0 18)} is VALID [2018-11-23 12:00:49,584 INFO L273 TraceCheckUtils]: 60: Hoare triple {43937#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {43947#(<= main_~k~0 19)} is VALID [2018-11-23 12:00:49,585 INFO L273 TraceCheckUtils]: 61: Hoare triple {43947#(<= 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); {43947#(<= main_~k~0 19)} is VALID [2018-11-23 12:00:49,585 INFO L273 TraceCheckUtils]: 62: Hoare triple {43947#(<= main_~k~0 19)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43947#(<= main_~k~0 19)} is VALID [2018-11-23 12:00:49,586 INFO L273 TraceCheckUtils]: 63: Hoare triple {43947#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {43957#(<= main_~k~0 20)} is VALID [2018-11-23 12:00:49,586 INFO L273 TraceCheckUtils]: 64: Hoare triple {43957#(<= 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); {43957#(<= main_~k~0 20)} is VALID [2018-11-23 12:00:49,587 INFO L273 TraceCheckUtils]: 65: Hoare triple {43957#(<= main_~k~0 20)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43957#(<= main_~k~0 20)} is VALID [2018-11-23 12:00:49,588 INFO L273 TraceCheckUtils]: 66: Hoare triple {43957#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {43967#(<= main_~k~0 21)} is VALID [2018-11-23 12:00:49,588 INFO L273 TraceCheckUtils]: 67: Hoare triple {43967#(<= 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); {43967#(<= main_~k~0 21)} is VALID [2018-11-23 12:00:49,589 INFO L273 TraceCheckUtils]: 68: Hoare triple {43967#(<= main_~k~0 21)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43967#(<= main_~k~0 21)} is VALID [2018-11-23 12:00:49,589 INFO L273 TraceCheckUtils]: 69: Hoare triple {43967#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {43977#(<= main_~k~0 22)} is VALID [2018-11-23 12:00:49,590 INFO L273 TraceCheckUtils]: 70: Hoare triple {43977#(<= 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); {43977#(<= main_~k~0 22)} is VALID [2018-11-23 12:00:49,590 INFO L273 TraceCheckUtils]: 71: Hoare triple {43977#(<= main_~k~0 22)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43977#(<= main_~k~0 22)} is VALID [2018-11-23 12:00:49,591 INFO L273 TraceCheckUtils]: 72: Hoare triple {43977#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {43987#(<= main_~k~0 23)} is VALID [2018-11-23 12:00:49,592 INFO L273 TraceCheckUtils]: 73: Hoare triple {43987#(<= 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); {43987#(<= main_~k~0 23)} is VALID [2018-11-23 12:00:49,592 INFO L273 TraceCheckUtils]: 74: Hoare triple {43987#(<= main_~k~0 23)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43987#(<= main_~k~0 23)} is VALID [2018-11-23 12:00:49,593 INFO L273 TraceCheckUtils]: 75: Hoare triple {43987#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {43997#(<= main_~k~0 24)} is VALID [2018-11-23 12:00:49,593 INFO L273 TraceCheckUtils]: 76: Hoare triple {43997#(<= 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); {43997#(<= main_~k~0 24)} is VALID [2018-11-23 12:00:49,594 INFO L273 TraceCheckUtils]: 77: Hoare triple {43997#(<= main_~k~0 24)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {43997#(<= main_~k~0 24)} is VALID [2018-11-23 12:00:49,595 INFO L273 TraceCheckUtils]: 78: Hoare triple {43997#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {44007#(<= main_~k~0 25)} is VALID [2018-11-23 12:00:49,595 INFO L273 TraceCheckUtils]: 79: Hoare triple {44007#(<= 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); {44007#(<= main_~k~0 25)} is VALID [2018-11-23 12:00:49,596 INFO L273 TraceCheckUtils]: 80: Hoare triple {44007#(<= main_~k~0 25)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {44007#(<= main_~k~0 25)} is VALID [2018-11-23 12:00:49,596 INFO L273 TraceCheckUtils]: 81: Hoare triple {44007#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {44017#(<= main_~k~0 26)} is VALID [2018-11-23 12:00:49,597 INFO L273 TraceCheckUtils]: 82: Hoare triple {44017#(<= 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); {44017#(<= main_~k~0 26)} is VALID [2018-11-23 12:00:49,597 INFO L273 TraceCheckUtils]: 83: Hoare triple {44017#(<= main_~k~0 26)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {44017#(<= main_~k~0 26)} is VALID [2018-11-23 12:00:49,598 INFO L273 TraceCheckUtils]: 84: Hoare triple {44017#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {44027#(<= main_~k~0 27)} is VALID [2018-11-23 12:00:49,599 INFO L273 TraceCheckUtils]: 85: Hoare triple {44027#(<= 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); {44027#(<= main_~k~0 27)} is VALID [2018-11-23 12:00:49,599 INFO L273 TraceCheckUtils]: 86: Hoare triple {44027#(<= main_~k~0 27)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {44027#(<= main_~k~0 27)} is VALID [2018-11-23 12:00:49,600 INFO L273 TraceCheckUtils]: 87: Hoare triple {44027#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {44037#(<= main_~k~0 28)} is VALID [2018-11-23 12:00:49,600 INFO L273 TraceCheckUtils]: 88: Hoare triple {44037#(<= 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); {44037#(<= main_~k~0 28)} is VALID [2018-11-23 12:00:49,601 INFO L273 TraceCheckUtils]: 89: Hoare triple {44037#(<= main_~k~0 28)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {44037#(<= main_~k~0 28)} is VALID [2018-11-23 12:00:49,602 INFO L273 TraceCheckUtils]: 90: Hoare triple {44037#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {44047#(<= main_~k~0 29)} is VALID [2018-11-23 12:00:49,602 INFO L273 TraceCheckUtils]: 91: Hoare triple {44047#(<= 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); {44047#(<= main_~k~0 29)} is VALID [2018-11-23 12:00:49,603 INFO L273 TraceCheckUtils]: 92: Hoare triple {44047#(<= main_~k~0 29)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {44047#(<= main_~k~0 29)} is VALID [2018-11-23 12:00:49,603 INFO L273 TraceCheckUtils]: 93: Hoare triple {44047#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {44057#(<= main_~k~0 30)} is VALID [2018-11-23 12:00:49,604 INFO L273 TraceCheckUtils]: 94: Hoare triple {44057#(<= 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); {44057#(<= main_~k~0 30)} is VALID [2018-11-23 12:00:49,604 INFO L273 TraceCheckUtils]: 95: Hoare triple {44057#(<= main_~k~0 30)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {44057#(<= main_~k~0 30)} is VALID [2018-11-23 12:00:49,605 INFO L273 TraceCheckUtils]: 96: Hoare triple {44057#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {44067#(<= main_~k~0 31)} is VALID [2018-11-23 12:00:49,606 INFO L273 TraceCheckUtils]: 97: Hoare triple {44067#(<= 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); {44067#(<= main_~k~0 31)} is VALID [2018-11-23 12:00:49,606 INFO L273 TraceCheckUtils]: 98: Hoare triple {44067#(<= main_~k~0 31)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {44067#(<= main_~k~0 31)} is VALID [2018-11-23 12:00:49,607 INFO L273 TraceCheckUtils]: 99: Hoare triple {44067#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {44077#(<= main_~k~0 32)} is VALID [2018-11-23 12:00:49,607 INFO L273 TraceCheckUtils]: 100: Hoare triple {44077#(<= 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); {44077#(<= main_~k~0 32)} is VALID [2018-11-23 12:00:49,608 INFO L273 TraceCheckUtils]: 101: Hoare triple {44077#(<= main_~k~0 32)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {44077#(<= main_~k~0 32)} is VALID [2018-11-23 12:00:49,609 INFO L273 TraceCheckUtils]: 102: Hoare triple {44077#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {44087#(<= main_~k~0 33)} is VALID [2018-11-23 12:00:49,609 INFO L273 TraceCheckUtils]: 103: Hoare triple {44087#(<= 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); {44087#(<= main_~k~0 33)} is VALID [2018-11-23 12:00:49,610 INFO L273 TraceCheckUtils]: 104: Hoare triple {44087#(<= main_~k~0 33)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {44087#(<= main_~k~0 33)} is VALID [2018-11-23 12:00:49,610 INFO L273 TraceCheckUtils]: 105: Hoare triple {44087#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {44097#(<= main_~k~0 34)} is VALID [2018-11-23 12:00:49,611 INFO L273 TraceCheckUtils]: 106: Hoare triple {44097#(<= 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); {44097#(<= main_~k~0 34)} is VALID [2018-11-23 12:00:49,611 INFO L273 TraceCheckUtils]: 107: Hoare triple {44097#(<= main_~k~0 34)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {44097#(<= main_~k~0 34)} is VALID [2018-11-23 12:00:49,612 INFO L273 TraceCheckUtils]: 108: Hoare triple {44097#(<= main_~k~0 34)} ~k~0 := 1 + ~k~0; {44107#(<= main_~k~0 35)} is VALID [2018-11-23 12:00:49,613 INFO L273 TraceCheckUtils]: 109: Hoare triple {44107#(<= 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); {44107#(<= main_~k~0 35)} is VALID [2018-11-23 12:00:49,613 INFO L273 TraceCheckUtils]: 110: Hoare triple {44107#(<= main_~k~0 35)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {44107#(<= main_~k~0 35)} is VALID [2018-11-23 12:00:49,614 INFO L273 TraceCheckUtils]: 111: Hoare triple {44107#(<= main_~k~0 35)} ~k~0 := 1 + ~k~0; {44117#(<= main_~k~0 36)} is VALID [2018-11-23 12:00:49,614 INFO L273 TraceCheckUtils]: 112: Hoare triple {44117#(<= 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); {44117#(<= main_~k~0 36)} is VALID [2018-11-23 12:00:49,615 INFO L273 TraceCheckUtils]: 113: Hoare triple {44117#(<= main_~k~0 36)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {44117#(<= main_~k~0 36)} is VALID [2018-11-23 12:00:49,616 INFO L273 TraceCheckUtils]: 114: Hoare triple {44117#(<= main_~k~0 36)} ~k~0 := 1 + ~k~0; {44127#(<= main_~k~0 37)} is VALID [2018-11-23 12:00:49,616 INFO L273 TraceCheckUtils]: 115: Hoare triple {44127#(<= main_~k~0 37)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {44127#(<= main_~k~0 37)} is VALID [2018-11-23 12:00:49,617 INFO L273 TraceCheckUtils]: 116: Hoare triple {44127#(<= main_~k~0 37)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {44127#(<= main_~k~0 37)} is VALID [2018-11-23 12:00:49,617 INFO L273 TraceCheckUtils]: 117: Hoare triple {44127#(<= main_~k~0 37)} ~k~0 := 1 + ~k~0; {44137#(<= main_~k~0 38)} is VALID [2018-11-23 12:00:49,618 INFO L273 TraceCheckUtils]: 118: Hoare triple {44137#(<= main_~k~0 38)} assume !(~k~0 < 100000); {43705#false} is VALID [2018-11-23 12:00:49,618 INFO L273 TraceCheckUtils]: 119: Hoare triple {43705#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); {43705#false} is VALID [2018-11-23 12:00:49,618 INFO L273 TraceCheckUtils]: 120: Hoare triple {43705#false} ~x~0 := 0; {43705#false} is VALID [2018-11-23 12:00:49,619 INFO L273 TraceCheckUtils]: 121: Hoare triple {43705#false} assume !(~x~0 < ~i~0); {43705#false} is VALID [2018-11-23 12:00:49,619 INFO L273 TraceCheckUtils]: 122: Hoare triple {43705#false} ~x~0 := ~i~0; {43705#false} is VALID [2018-11-23 12:00:49,619 INFO L273 TraceCheckUtils]: 123: Hoare triple {43705#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); {43705#false} is VALID [2018-11-23 12:00:49,619 INFO L256 TraceCheckUtils]: 124: Hoare triple {43705#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {43705#false} is VALID [2018-11-23 12:00:49,619 INFO L273 TraceCheckUtils]: 125: Hoare triple {43705#false} ~cond := #in~cond; {43705#false} is VALID [2018-11-23 12:00:49,619 INFO L273 TraceCheckUtils]: 126: Hoare triple {43705#false} assume !(0 == ~cond); {43705#false} is VALID [2018-11-23 12:00:49,620 INFO L273 TraceCheckUtils]: 127: Hoare triple {43705#false} assume true; {43705#false} is VALID [2018-11-23 12:00:49,620 INFO L268 TraceCheckUtils]: 128: Hoare quadruple {43705#false} {43705#false} #136#return; {43705#false} is VALID [2018-11-23 12:00:49,620 INFO L273 TraceCheckUtils]: 129: Hoare triple {43705#false} havoc #t~mem9;havoc #t~mem10; {43705#false} is VALID [2018-11-23 12:00:49,620 INFO L273 TraceCheckUtils]: 130: Hoare triple {43705#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {43705#false} is VALID [2018-11-23 12:00:49,620 INFO L273 TraceCheckUtils]: 131: Hoare triple {43705#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); {43705#false} is VALID [2018-11-23 12:00:49,621 INFO L256 TraceCheckUtils]: 132: Hoare triple {43705#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {43705#false} is VALID [2018-11-23 12:00:49,621 INFO L273 TraceCheckUtils]: 133: Hoare triple {43705#false} ~cond := #in~cond; {43705#false} is VALID [2018-11-23 12:00:49,621 INFO L273 TraceCheckUtils]: 134: Hoare triple {43705#false} assume 0 == ~cond; {43705#false} is VALID [2018-11-23 12:00:49,621 INFO L273 TraceCheckUtils]: 135: Hoare triple {43705#false} assume !false; {43705#false} is VALID [2018-11-23 12:00:49,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2039 backedges. 0 proven. 2035 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 12:00:49,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:49,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 80 [2018-11-23 12:00:49,655 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 136 [2018-11-23 12:00:49,655 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:49,655 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 80 states. [2018-11-23 12:00:49,917 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 252 edges. 252 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:49,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-11-23 12:00:49,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-11-23 12:00:49,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2381, Invalid=3939, Unknown=0, NotChecked=0, Total=6320 [2018-11-23 12:00:49,920 INFO L87 Difference]: Start difference. First operand 276 states and 365 transitions. Second operand 80 states. [2018-11-23 12:00:51,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:51,643 INFO L93 Difference]: Finished difference Result 339 states and 451 transitions. [2018-11-23 12:00:51,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-23 12:00:51,643 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 136 [2018-11-23 12:00:51,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:51,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-23 12:00:51,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 259 transitions. [2018-11-23 12:00:51,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-23 12:00:51,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 259 transitions. [2018-11-23 12:00:51,648 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 259 transitions. [2018-11-23 12:00:51,905 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 259 edges. 259 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:51,912 INFO L225 Difference]: With dead ends: 339 [2018-11-23 12:00:51,912 INFO L226 Difference]: Without dead ends: 292 [2018-11-23 12:00:51,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2224 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2381, Invalid=3939, Unknown=0, NotChecked=0, Total=6320 [2018-11-23 12:00:51,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-11-23 12:00:52,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 282. [2018-11-23 12:00:52,115 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:52,115 INFO L82 GeneralOperation]: Start isEquivalent. First operand 292 states. Second operand 282 states. [2018-11-23 12:00:52,115 INFO L74 IsIncluded]: Start isIncluded. First operand 292 states. Second operand 282 states. [2018-11-23 12:00:52,115 INFO L87 Difference]: Start difference. First operand 292 states. Second operand 282 states. [2018-11-23 12:00:52,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:52,120 INFO L93 Difference]: Finished difference Result 292 states and 388 transitions. [2018-11-23 12:00:52,121 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 388 transitions. [2018-11-23 12:00:52,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:52,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:52,121 INFO L74 IsIncluded]: Start isIncluded. First operand 282 states. Second operand 292 states. [2018-11-23 12:00:52,121 INFO L87 Difference]: Start difference. First operand 282 states. Second operand 292 states. [2018-11-23 12:00:52,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:52,126 INFO L93 Difference]: Finished difference Result 292 states and 388 transitions. [2018-11-23 12:00:52,127 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 388 transitions. [2018-11-23 12:00:52,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:52,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:52,127 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:52,127 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:52,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-11-23 12:00:52,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 373 transitions. [2018-11-23 12:00:52,132 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 373 transitions. Word has length 136 [2018-11-23 12:00:52,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:52,132 INFO L480 AbstractCegarLoop]: Abstraction has 282 states and 373 transitions. [2018-11-23 12:00:52,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-11-23 12:00:52,132 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 373 transitions. [2018-11-23 12:00:52,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-23 12:00:52,133 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:52,133 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 38, 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 12:00:52,133 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:52,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:52,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1200103340, now seen corresponding path program 34 times [2018-11-23 12:00:52,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:52,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:52,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:52,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:00:52,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:52,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:54,129 INFO L256 TraceCheckUtils]: 0: Hoare triple {45614#true} call ULTIMATE.init(); {45614#true} is VALID [2018-11-23 12:00:54,129 INFO L273 TraceCheckUtils]: 1: Hoare triple {45614#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {45614#true} is VALID [2018-11-23 12:00:54,129 INFO L273 TraceCheckUtils]: 2: Hoare triple {45614#true} assume true; {45614#true} is VALID [2018-11-23 12:00:54,130 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {45614#true} {45614#true} #130#return; {45614#true} is VALID [2018-11-23 12:00:54,130 INFO L256 TraceCheckUtils]: 4: Hoare triple {45614#true} call #t~ret15 := main(); {45614#true} is VALID [2018-11-23 12:00:54,130 INFO L273 TraceCheckUtils]: 5: Hoare triple {45614#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {45616#(= main_~i~0 0)} is VALID [2018-11-23 12:00:54,131 INFO L273 TraceCheckUtils]: 6: Hoare triple {45616#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {45617#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,132 INFO L273 TraceCheckUtils]: 7: Hoare triple {45617#(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); {45617#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,133 INFO L273 TraceCheckUtils]: 8: Hoare triple {45617#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45617#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,133 INFO L273 TraceCheckUtils]: 9: Hoare triple {45617#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45618#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,134 INFO L273 TraceCheckUtils]: 10: Hoare triple {45618#(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); {45618#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,135 INFO L273 TraceCheckUtils]: 11: Hoare triple {45618#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45618#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,136 INFO L273 TraceCheckUtils]: 12: Hoare triple {45618#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45619#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,137 INFO L273 TraceCheckUtils]: 13: Hoare triple {45619#(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); {45619#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,137 INFO L273 TraceCheckUtils]: 14: Hoare triple {45619#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45619#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,138 INFO L273 TraceCheckUtils]: 15: Hoare triple {45619#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45620#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,139 INFO L273 TraceCheckUtils]: 16: Hoare triple {45620#(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); {45620#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,140 INFO L273 TraceCheckUtils]: 17: Hoare triple {45620#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45620#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,141 INFO L273 TraceCheckUtils]: 18: Hoare triple {45620#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45621#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,142 INFO L273 TraceCheckUtils]: 19: Hoare triple {45621#(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); {45621#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,142 INFO L273 TraceCheckUtils]: 20: Hoare triple {45621#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45621#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,143 INFO L273 TraceCheckUtils]: 21: Hoare triple {45621#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45622#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,144 INFO L273 TraceCheckUtils]: 22: Hoare triple {45622#(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); {45622#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,145 INFO L273 TraceCheckUtils]: 23: Hoare triple {45622#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45622#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,146 INFO L273 TraceCheckUtils]: 24: Hoare triple {45622#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45623#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,146 INFO L273 TraceCheckUtils]: 25: Hoare triple {45623#(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); {45623#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,147 INFO L273 TraceCheckUtils]: 26: Hoare triple {45623#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45623#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,148 INFO L273 TraceCheckUtils]: 27: Hoare triple {45623#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45624#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,149 INFO L273 TraceCheckUtils]: 28: Hoare triple {45624#(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); {45624#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,150 INFO L273 TraceCheckUtils]: 29: Hoare triple {45624#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45624#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,150 INFO L273 TraceCheckUtils]: 30: Hoare triple {45624#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45625#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,151 INFO L273 TraceCheckUtils]: 31: Hoare triple {45625#(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); {45625#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,152 INFO L273 TraceCheckUtils]: 32: Hoare triple {45625#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45625#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,153 INFO L273 TraceCheckUtils]: 33: Hoare triple {45625#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45626#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,154 INFO L273 TraceCheckUtils]: 34: Hoare triple {45626#(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); {45626#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,154 INFO L273 TraceCheckUtils]: 35: Hoare triple {45626#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45626#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,155 INFO L273 TraceCheckUtils]: 36: Hoare triple {45626#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45627#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,156 INFO L273 TraceCheckUtils]: 37: Hoare triple {45627#(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); {45627#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,157 INFO L273 TraceCheckUtils]: 38: Hoare triple {45627#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45627#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,158 INFO L273 TraceCheckUtils]: 39: Hoare triple {45627#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45628#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,159 INFO L273 TraceCheckUtils]: 40: Hoare triple {45628#(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); {45628#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,159 INFO L273 TraceCheckUtils]: 41: Hoare triple {45628#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45628#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,160 INFO L273 TraceCheckUtils]: 42: Hoare triple {45628#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45629#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,161 INFO L273 TraceCheckUtils]: 43: Hoare triple {45629#(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); {45629#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,162 INFO L273 TraceCheckUtils]: 44: Hoare triple {45629#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45629#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,163 INFO L273 TraceCheckUtils]: 45: Hoare triple {45629#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45630#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,163 INFO L273 TraceCheckUtils]: 46: Hoare triple {45630#(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); {45630#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,164 INFO L273 TraceCheckUtils]: 47: Hoare triple {45630#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45630#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,165 INFO L273 TraceCheckUtils]: 48: Hoare triple {45630#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45631#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,166 INFO L273 TraceCheckUtils]: 49: Hoare triple {45631#(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); {45631#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,166 INFO L273 TraceCheckUtils]: 50: Hoare triple {45631#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45631#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,167 INFO L273 TraceCheckUtils]: 51: Hoare triple {45631#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45632#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,168 INFO L273 TraceCheckUtils]: 52: Hoare triple {45632#(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); {45632#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,169 INFO L273 TraceCheckUtils]: 53: Hoare triple {45632#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45632#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,170 INFO L273 TraceCheckUtils]: 54: Hoare triple {45632#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45633#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 12:00:54,171 INFO L273 TraceCheckUtils]: 55: Hoare triple {45633#(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); {45633#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 12:00:54,171 INFO L273 TraceCheckUtils]: 56: Hoare triple {45633#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45633#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 12:00:54,172 INFO L273 TraceCheckUtils]: 57: Hoare triple {45633#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} ~k~0 := 1 + ~k~0; {45634#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,173 INFO L273 TraceCheckUtils]: 58: Hoare triple {45634#(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); {45634#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,174 INFO L273 TraceCheckUtils]: 59: Hoare triple {45634#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45634#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,175 INFO L273 TraceCheckUtils]: 60: Hoare triple {45634#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45635#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,176 INFO L273 TraceCheckUtils]: 61: Hoare triple {45635#(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); {45635#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,176 INFO L273 TraceCheckUtils]: 62: Hoare triple {45635#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45635#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,177 INFO L273 TraceCheckUtils]: 63: Hoare triple {45635#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45636#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,178 INFO L273 TraceCheckUtils]: 64: Hoare triple {45636#(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); {45636#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,179 INFO L273 TraceCheckUtils]: 65: Hoare triple {45636#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45636#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,179 INFO L273 TraceCheckUtils]: 66: Hoare triple {45636#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45637#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,180 INFO L273 TraceCheckUtils]: 67: Hoare triple {45637#(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); {45637#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,181 INFO L273 TraceCheckUtils]: 68: Hoare triple {45637#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45637#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,182 INFO L273 TraceCheckUtils]: 69: Hoare triple {45637#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45638#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,183 INFO L273 TraceCheckUtils]: 70: Hoare triple {45638#(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); {45638#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,183 INFO L273 TraceCheckUtils]: 71: Hoare triple {45638#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45638#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,184 INFO L273 TraceCheckUtils]: 72: Hoare triple {45638#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45639#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,185 INFO L273 TraceCheckUtils]: 73: Hoare triple {45639#(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); {45639#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,186 INFO L273 TraceCheckUtils]: 74: Hoare triple {45639#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45639#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,187 INFO L273 TraceCheckUtils]: 75: Hoare triple {45639#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45640#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,188 INFO L273 TraceCheckUtils]: 76: Hoare triple {45640#(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); {45640#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,188 INFO L273 TraceCheckUtils]: 77: Hoare triple {45640#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45640#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,189 INFO L273 TraceCheckUtils]: 78: Hoare triple {45640#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45641#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,190 INFO L273 TraceCheckUtils]: 79: Hoare triple {45641#(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); {45641#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,191 INFO L273 TraceCheckUtils]: 80: Hoare triple {45641#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45641#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,192 INFO L273 TraceCheckUtils]: 81: Hoare triple {45641#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45642#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,193 INFO L273 TraceCheckUtils]: 82: Hoare triple {45642#(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); {45642#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,193 INFO L273 TraceCheckUtils]: 83: Hoare triple {45642#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45642#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,194 INFO L273 TraceCheckUtils]: 84: Hoare triple {45642#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45643#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,195 INFO L273 TraceCheckUtils]: 85: Hoare triple {45643#(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); {45643#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,196 INFO L273 TraceCheckUtils]: 86: Hoare triple {45643#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45643#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,196 INFO L273 TraceCheckUtils]: 87: Hoare triple {45643#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45644#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,197 INFO L273 TraceCheckUtils]: 88: Hoare triple {45644#(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); {45644#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,198 INFO L273 TraceCheckUtils]: 89: Hoare triple {45644#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45644#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,199 INFO L273 TraceCheckUtils]: 90: Hoare triple {45644#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45645#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,200 INFO L273 TraceCheckUtils]: 91: Hoare triple {45645#(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); {45645#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,201 INFO L273 TraceCheckUtils]: 92: Hoare triple {45645#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45645#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,202 INFO L273 TraceCheckUtils]: 93: Hoare triple {45645#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45646#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,203 INFO L273 TraceCheckUtils]: 94: Hoare triple {45646#(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); {45646#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,203 INFO L273 TraceCheckUtils]: 95: Hoare triple {45646#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45646#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,204 INFO L273 TraceCheckUtils]: 96: Hoare triple {45646#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45647#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,205 INFO L273 TraceCheckUtils]: 97: Hoare triple {45647#(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); {45647#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,206 INFO L273 TraceCheckUtils]: 98: Hoare triple {45647#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45647#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,207 INFO L273 TraceCheckUtils]: 99: Hoare triple {45647#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45648#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,208 INFO L273 TraceCheckUtils]: 100: Hoare triple {45648#(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); {45648#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,208 INFO L273 TraceCheckUtils]: 101: Hoare triple {45648#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45648#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,209 INFO L273 TraceCheckUtils]: 102: Hoare triple {45648#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45649#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,210 INFO L273 TraceCheckUtils]: 103: Hoare triple {45649#(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); {45649#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,211 INFO L273 TraceCheckUtils]: 104: Hoare triple {45649#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45649#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,212 INFO L273 TraceCheckUtils]: 105: Hoare triple {45649#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45650#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,213 INFO L273 TraceCheckUtils]: 106: Hoare triple {45650#(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); {45650#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,214 INFO L273 TraceCheckUtils]: 107: Hoare triple {45650#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45650#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,215 INFO L273 TraceCheckUtils]: 108: Hoare triple {45650#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45651#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,215 INFO L273 TraceCheckUtils]: 109: Hoare triple {45651#(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); {45651#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,216 INFO L273 TraceCheckUtils]: 110: Hoare triple {45651#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45651#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,217 INFO L273 TraceCheckUtils]: 111: Hoare triple {45651#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45652#(and (<= main_~k~0 (+ main_~i~0 36)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,218 INFO L273 TraceCheckUtils]: 112: Hoare triple {45652#(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); {45652#(and (<= main_~k~0 (+ main_~i~0 36)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,219 INFO L273 TraceCheckUtils]: 113: Hoare triple {45652#(and (<= main_~k~0 (+ main_~i~0 36)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45652#(and (<= main_~k~0 (+ main_~i~0 36)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,219 INFO L273 TraceCheckUtils]: 114: Hoare triple {45652#(and (<= main_~k~0 (+ main_~i~0 36)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45653#(and (<= main_~k~0 (+ main_~i~0 37)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,220 INFO L273 TraceCheckUtils]: 115: Hoare triple {45653#(and (<= main_~k~0 (+ main_~i~0 37)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45653#(and (<= main_~k~0 (+ main_~i~0 37)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,221 INFO L273 TraceCheckUtils]: 116: Hoare triple {45653#(and (<= main_~k~0 (+ main_~i~0 37)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45653#(and (<= main_~k~0 (+ main_~i~0 37)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,222 INFO L273 TraceCheckUtils]: 117: Hoare triple {45653#(and (<= main_~k~0 (+ main_~i~0 37)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45654#(and (<= main_~k~0 (+ main_~i~0 38)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,223 INFO L273 TraceCheckUtils]: 118: Hoare triple {45654#(and (<= main_~k~0 (+ main_~i~0 38)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45654#(and (<= main_~k~0 (+ main_~i~0 38)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,224 INFO L273 TraceCheckUtils]: 119: Hoare triple {45654#(and (<= main_~k~0 (+ main_~i~0 38)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45654#(and (<= main_~k~0 (+ main_~i~0 38)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,224 INFO L273 TraceCheckUtils]: 120: Hoare triple {45654#(and (<= main_~k~0 (+ main_~i~0 38)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {45655#(and (<= main_~k~0 (+ main_~i~0 39)) (= main_~i~0 0))} is VALID [2018-11-23 12:00:54,225 INFO L273 TraceCheckUtils]: 121: Hoare triple {45655#(and (<= main_~k~0 (+ main_~i~0 39)) (= main_~i~0 0))} assume !(~k~0 < 100000); {45615#false} is VALID [2018-11-23 12:00:54,225 INFO L273 TraceCheckUtils]: 122: Hoare triple {45615#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); {45615#false} is VALID [2018-11-23 12:00:54,226 INFO L273 TraceCheckUtils]: 123: Hoare triple {45615#false} ~x~0 := 0; {45615#false} is VALID [2018-11-23 12:00:54,226 INFO L273 TraceCheckUtils]: 124: Hoare triple {45615#false} assume !(~x~0 < ~i~0); {45615#false} is VALID [2018-11-23 12:00:54,226 INFO L273 TraceCheckUtils]: 125: Hoare triple {45615#false} ~x~0 := ~i~0; {45615#false} is VALID [2018-11-23 12:00:54,226 INFO L273 TraceCheckUtils]: 126: Hoare triple {45615#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); {45615#false} is VALID [2018-11-23 12:00:54,226 INFO L256 TraceCheckUtils]: 127: Hoare triple {45615#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {45614#true} is VALID [2018-11-23 12:00:54,226 INFO L273 TraceCheckUtils]: 128: Hoare triple {45614#true} ~cond := #in~cond; {45614#true} is VALID [2018-11-23 12:00:54,227 INFO L273 TraceCheckUtils]: 129: Hoare triple {45614#true} assume !(0 == ~cond); {45614#true} is VALID [2018-11-23 12:00:54,227 INFO L273 TraceCheckUtils]: 130: Hoare triple {45614#true} assume true; {45614#true} is VALID [2018-11-23 12:00:54,227 INFO L268 TraceCheckUtils]: 131: Hoare quadruple {45614#true} {45615#false} #136#return; {45615#false} is VALID [2018-11-23 12:00:54,227 INFO L273 TraceCheckUtils]: 132: Hoare triple {45615#false} havoc #t~mem9;havoc #t~mem10; {45615#false} is VALID [2018-11-23 12:00:54,227 INFO L273 TraceCheckUtils]: 133: Hoare triple {45615#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {45615#false} is VALID [2018-11-23 12:00:54,228 INFO L273 TraceCheckUtils]: 134: Hoare triple {45615#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); {45615#false} is VALID [2018-11-23 12:00:54,228 INFO L256 TraceCheckUtils]: 135: Hoare triple {45615#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {45615#false} is VALID [2018-11-23 12:00:54,228 INFO L273 TraceCheckUtils]: 136: Hoare triple {45615#false} ~cond := #in~cond; {45615#false} is VALID [2018-11-23 12:00:54,228 INFO L273 TraceCheckUtils]: 137: Hoare triple {45615#false} assume 0 == ~cond; {45615#false} is VALID [2018-11-23 12:00:54,228 INFO L273 TraceCheckUtils]: 138: Hoare triple {45615#false} assume !false; {45615#false} is VALID [2018-11-23 12:00:54,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2151 backedges. 2 proven. 2147 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 12:00:54,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:54,257 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:00:54,269 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:00:54,345 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:00:54,345 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:00:54,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:54,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:56,099 INFO L256 TraceCheckUtils]: 0: Hoare triple {45614#true} call ULTIMATE.init(); {45614#true} is VALID [2018-11-23 12:00:56,100 INFO L273 TraceCheckUtils]: 1: Hoare triple {45614#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {45614#true} is VALID [2018-11-23 12:00:56,100 INFO L273 TraceCheckUtils]: 2: Hoare triple {45614#true} assume true; {45614#true} is VALID [2018-11-23 12:00:56,100 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {45614#true} {45614#true} #130#return; {45614#true} is VALID [2018-11-23 12:00:56,100 INFO L256 TraceCheckUtils]: 4: Hoare triple {45614#true} call #t~ret15 := main(); {45614#true} is VALID [2018-11-23 12:00:56,101 INFO L273 TraceCheckUtils]: 5: Hoare triple {45614#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {45674#(<= main_~i~0 0)} is VALID [2018-11-23 12:00:56,102 INFO L273 TraceCheckUtils]: 6: Hoare triple {45674#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {45678#(<= main_~k~0 1)} is VALID [2018-11-23 12:00:56,102 INFO L273 TraceCheckUtils]: 7: Hoare triple {45678#(<= 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); {45678#(<= main_~k~0 1)} is VALID [2018-11-23 12:00:56,103 INFO L273 TraceCheckUtils]: 8: Hoare triple {45678#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45678#(<= main_~k~0 1)} is VALID [2018-11-23 12:00:56,103 INFO L273 TraceCheckUtils]: 9: Hoare triple {45678#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {45688#(<= main_~k~0 2)} is VALID [2018-11-23 12:00:56,103 INFO L273 TraceCheckUtils]: 10: Hoare triple {45688#(<= 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); {45688#(<= main_~k~0 2)} is VALID [2018-11-23 12:00:56,104 INFO L273 TraceCheckUtils]: 11: Hoare triple {45688#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45688#(<= main_~k~0 2)} is VALID [2018-11-23 12:00:56,104 INFO L273 TraceCheckUtils]: 12: Hoare triple {45688#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {45698#(<= main_~k~0 3)} is VALID [2018-11-23 12:00:56,105 INFO L273 TraceCheckUtils]: 13: Hoare triple {45698#(<= 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); {45698#(<= main_~k~0 3)} is VALID [2018-11-23 12:00:56,105 INFO L273 TraceCheckUtils]: 14: Hoare triple {45698#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45698#(<= main_~k~0 3)} is VALID [2018-11-23 12:00:56,106 INFO L273 TraceCheckUtils]: 15: Hoare triple {45698#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {45708#(<= main_~k~0 4)} is VALID [2018-11-23 12:00:56,107 INFO L273 TraceCheckUtils]: 16: Hoare triple {45708#(<= 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); {45708#(<= main_~k~0 4)} is VALID [2018-11-23 12:00:56,107 INFO L273 TraceCheckUtils]: 17: Hoare triple {45708#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45708#(<= main_~k~0 4)} is VALID [2018-11-23 12:00:56,108 INFO L273 TraceCheckUtils]: 18: Hoare triple {45708#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {45718#(<= main_~k~0 5)} is VALID [2018-11-23 12:00:56,108 INFO L273 TraceCheckUtils]: 19: Hoare triple {45718#(<= 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); {45718#(<= main_~k~0 5)} is VALID [2018-11-23 12:00:56,109 INFO L273 TraceCheckUtils]: 20: Hoare triple {45718#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45718#(<= main_~k~0 5)} is VALID [2018-11-23 12:00:56,109 INFO L273 TraceCheckUtils]: 21: Hoare triple {45718#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {45728#(<= main_~k~0 6)} is VALID [2018-11-23 12:00:56,110 INFO L273 TraceCheckUtils]: 22: Hoare triple {45728#(<= 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); {45728#(<= main_~k~0 6)} is VALID [2018-11-23 12:00:56,111 INFO L273 TraceCheckUtils]: 23: Hoare triple {45728#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45728#(<= main_~k~0 6)} is VALID [2018-11-23 12:00:56,111 INFO L273 TraceCheckUtils]: 24: Hoare triple {45728#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {45738#(<= main_~k~0 7)} is VALID [2018-11-23 12:00:56,112 INFO L273 TraceCheckUtils]: 25: Hoare triple {45738#(<= 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); {45738#(<= main_~k~0 7)} is VALID [2018-11-23 12:00:56,112 INFO L273 TraceCheckUtils]: 26: Hoare triple {45738#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45738#(<= main_~k~0 7)} is VALID [2018-11-23 12:00:56,113 INFO L273 TraceCheckUtils]: 27: Hoare triple {45738#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {45748#(<= main_~k~0 8)} is VALID [2018-11-23 12:00:56,114 INFO L273 TraceCheckUtils]: 28: Hoare triple {45748#(<= 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); {45748#(<= main_~k~0 8)} is VALID [2018-11-23 12:00:56,114 INFO L273 TraceCheckUtils]: 29: Hoare triple {45748#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45748#(<= main_~k~0 8)} is VALID [2018-11-23 12:00:56,115 INFO L273 TraceCheckUtils]: 30: Hoare triple {45748#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {45758#(<= main_~k~0 9)} is VALID [2018-11-23 12:00:56,115 INFO L273 TraceCheckUtils]: 31: Hoare triple {45758#(<= 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); {45758#(<= main_~k~0 9)} is VALID [2018-11-23 12:00:56,116 INFO L273 TraceCheckUtils]: 32: Hoare triple {45758#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45758#(<= main_~k~0 9)} is VALID [2018-11-23 12:00:56,117 INFO L273 TraceCheckUtils]: 33: Hoare triple {45758#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {45768#(<= main_~k~0 10)} is VALID [2018-11-23 12:00:56,117 INFO L273 TraceCheckUtils]: 34: Hoare triple {45768#(<= 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); {45768#(<= main_~k~0 10)} is VALID [2018-11-23 12:00:56,118 INFO L273 TraceCheckUtils]: 35: Hoare triple {45768#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45768#(<= main_~k~0 10)} is VALID [2018-11-23 12:00:56,118 INFO L273 TraceCheckUtils]: 36: Hoare triple {45768#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {45778#(<= main_~k~0 11)} is VALID [2018-11-23 12:00:56,119 INFO L273 TraceCheckUtils]: 37: Hoare triple {45778#(<= 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); {45778#(<= main_~k~0 11)} is VALID [2018-11-23 12:00:56,119 INFO L273 TraceCheckUtils]: 38: Hoare triple {45778#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45778#(<= main_~k~0 11)} is VALID [2018-11-23 12:00:56,120 INFO L273 TraceCheckUtils]: 39: Hoare triple {45778#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {45788#(<= main_~k~0 12)} is VALID [2018-11-23 12:00:56,121 INFO L273 TraceCheckUtils]: 40: Hoare triple {45788#(<= 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); {45788#(<= main_~k~0 12)} is VALID [2018-11-23 12:00:56,121 INFO L273 TraceCheckUtils]: 41: Hoare triple {45788#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45788#(<= main_~k~0 12)} is VALID [2018-11-23 12:00:56,122 INFO L273 TraceCheckUtils]: 42: Hoare triple {45788#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {45798#(<= main_~k~0 13)} is VALID [2018-11-23 12:00:56,122 INFO L273 TraceCheckUtils]: 43: Hoare triple {45798#(<= 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); {45798#(<= main_~k~0 13)} is VALID [2018-11-23 12:00:56,123 INFO L273 TraceCheckUtils]: 44: Hoare triple {45798#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45798#(<= main_~k~0 13)} is VALID [2018-11-23 12:00:56,124 INFO L273 TraceCheckUtils]: 45: Hoare triple {45798#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {45808#(<= main_~k~0 14)} is VALID [2018-11-23 12:00:56,124 INFO L273 TraceCheckUtils]: 46: Hoare triple {45808#(<= 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); {45808#(<= main_~k~0 14)} is VALID [2018-11-23 12:00:56,125 INFO L273 TraceCheckUtils]: 47: Hoare triple {45808#(<= main_~k~0 14)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45808#(<= main_~k~0 14)} is VALID [2018-11-23 12:00:56,125 INFO L273 TraceCheckUtils]: 48: Hoare triple {45808#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {45818#(<= main_~k~0 15)} is VALID [2018-11-23 12:00:56,126 INFO L273 TraceCheckUtils]: 49: Hoare triple {45818#(<= 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); {45818#(<= main_~k~0 15)} is VALID [2018-11-23 12:00:56,126 INFO L273 TraceCheckUtils]: 50: Hoare triple {45818#(<= main_~k~0 15)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45818#(<= main_~k~0 15)} is VALID [2018-11-23 12:00:56,127 INFO L273 TraceCheckUtils]: 51: Hoare triple {45818#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {45828#(<= main_~k~0 16)} is VALID [2018-11-23 12:00:56,128 INFO L273 TraceCheckUtils]: 52: Hoare triple {45828#(<= 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); {45828#(<= main_~k~0 16)} is VALID [2018-11-23 12:00:56,128 INFO L273 TraceCheckUtils]: 53: Hoare triple {45828#(<= main_~k~0 16)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45828#(<= main_~k~0 16)} is VALID [2018-11-23 12:00:56,129 INFO L273 TraceCheckUtils]: 54: Hoare triple {45828#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {45838#(<= main_~k~0 17)} is VALID [2018-11-23 12:00:56,129 INFO L273 TraceCheckUtils]: 55: Hoare triple {45838#(<= 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); {45838#(<= main_~k~0 17)} is VALID [2018-11-23 12:00:56,130 INFO L273 TraceCheckUtils]: 56: Hoare triple {45838#(<= main_~k~0 17)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45838#(<= main_~k~0 17)} is VALID [2018-11-23 12:00:56,131 INFO L273 TraceCheckUtils]: 57: Hoare triple {45838#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {45848#(<= main_~k~0 18)} is VALID [2018-11-23 12:00:56,131 INFO L273 TraceCheckUtils]: 58: Hoare triple {45848#(<= 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); {45848#(<= main_~k~0 18)} is VALID [2018-11-23 12:00:56,132 INFO L273 TraceCheckUtils]: 59: Hoare triple {45848#(<= main_~k~0 18)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45848#(<= main_~k~0 18)} is VALID [2018-11-23 12:00:56,132 INFO L273 TraceCheckUtils]: 60: Hoare triple {45848#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {45858#(<= main_~k~0 19)} is VALID [2018-11-23 12:00:56,133 INFO L273 TraceCheckUtils]: 61: Hoare triple {45858#(<= 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); {45858#(<= main_~k~0 19)} is VALID [2018-11-23 12:00:56,133 INFO L273 TraceCheckUtils]: 62: Hoare triple {45858#(<= main_~k~0 19)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45858#(<= main_~k~0 19)} is VALID [2018-11-23 12:00:56,134 INFO L273 TraceCheckUtils]: 63: Hoare triple {45858#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {45868#(<= main_~k~0 20)} is VALID [2018-11-23 12:00:56,135 INFO L273 TraceCheckUtils]: 64: Hoare triple {45868#(<= 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); {45868#(<= main_~k~0 20)} is VALID [2018-11-23 12:00:56,135 INFO L273 TraceCheckUtils]: 65: Hoare triple {45868#(<= main_~k~0 20)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45868#(<= main_~k~0 20)} is VALID [2018-11-23 12:00:56,136 INFO L273 TraceCheckUtils]: 66: Hoare triple {45868#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {45878#(<= main_~k~0 21)} is VALID [2018-11-23 12:00:56,136 INFO L273 TraceCheckUtils]: 67: Hoare triple {45878#(<= 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); {45878#(<= main_~k~0 21)} is VALID [2018-11-23 12:00:56,137 INFO L273 TraceCheckUtils]: 68: Hoare triple {45878#(<= main_~k~0 21)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45878#(<= main_~k~0 21)} is VALID [2018-11-23 12:00:56,138 INFO L273 TraceCheckUtils]: 69: Hoare triple {45878#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {45888#(<= main_~k~0 22)} is VALID [2018-11-23 12:00:56,138 INFO L273 TraceCheckUtils]: 70: Hoare triple {45888#(<= 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); {45888#(<= main_~k~0 22)} is VALID [2018-11-23 12:00:56,139 INFO L273 TraceCheckUtils]: 71: Hoare triple {45888#(<= main_~k~0 22)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45888#(<= main_~k~0 22)} is VALID [2018-11-23 12:00:56,139 INFO L273 TraceCheckUtils]: 72: Hoare triple {45888#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {45898#(<= main_~k~0 23)} is VALID [2018-11-23 12:00:56,140 INFO L273 TraceCheckUtils]: 73: Hoare triple {45898#(<= 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); {45898#(<= main_~k~0 23)} is VALID [2018-11-23 12:00:56,140 INFO L273 TraceCheckUtils]: 74: Hoare triple {45898#(<= main_~k~0 23)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45898#(<= main_~k~0 23)} is VALID [2018-11-23 12:00:56,141 INFO L273 TraceCheckUtils]: 75: Hoare triple {45898#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {45908#(<= main_~k~0 24)} is VALID [2018-11-23 12:00:56,142 INFO L273 TraceCheckUtils]: 76: Hoare triple {45908#(<= 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); {45908#(<= main_~k~0 24)} is VALID [2018-11-23 12:00:56,142 INFO L273 TraceCheckUtils]: 77: Hoare triple {45908#(<= main_~k~0 24)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45908#(<= main_~k~0 24)} is VALID [2018-11-23 12:00:56,143 INFO L273 TraceCheckUtils]: 78: Hoare triple {45908#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {45918#(<= main_~k~0 25)} is VALID [2018-11-23 12:00:56,143 INFO L273 TraceCheckUtils]: 79: Hoare triple {45918#(<= 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); {45918#(<= main_~k~0 25)} is VALID [2018-11-23 12:00:56,144 INFO L273 TraceCheckUtils]: 80: Hoare triple {45918#(<= main_~k~0 25)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45918#(<= main_~k~0 25)} is VALID [2018-11-23 12:00:56,145 INFO L273 TraceCheckUtils]: 81: Hoare triple {45918#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {45928#(<= main_~k~0 26)} is VALID [2018-11-23 12:00:56,145 INFO L273 TraceCheckUtils]: 82: Hoare triple {45928#(<= 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); {45928#(<= main_~k~0 26)} is VALID [2018-11-23 12:00:56,146 INFO L273 TraceCheckUtils]: 83: Hoare triple {45928#(<= main_~k~0 26)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45928#(<= main_~k~0 26)} is VALID [2018-11-23 12:00:56,146 INFO L273 TraceCheckUtils]: 84: Hoare triple {45928#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {45938#(<= main_~k~0 27)} is VALID [2018-11-23 12:00:56,147 INFO L273 TraceCheckUtils]: 85: Hoare triple {45938#(<= 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); {45938#(<= main_~k~0 27)} is VALID [2018-11-23 12:00:56,147 INFO L273 TraceCheckUtils]: 86: Hoare triple {45938#(<= main_~k~0 27)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45938#(<= main_~k~0 27)} is VALID [2018-11-23 12:00:56,148 INFO L273 TraceCheckUtils]: 87: Hoare triple {45938#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {45948#(<= main_~k~0 28)} is VALID [2018-11-23 12:00:56,149 INFO L273 TraceCheckUtils]: 88: Hoare triple {45948#(<= 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); {45948#(<= main_~k~0 28)} is VALID [2018-11-23 12:00:56,149 INFO L273 TraceCheckUtils]: 89: Hoare triple {45948#(<= main_~k~0 28)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45948#(<= main_~k~0 28)} is VALID [2018-11-23 12:00:56,150 INFO L273 TraceCheckUtils]: 90: Hoare triple {45948#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {45958#(<= main_~k~0 29)} is VALID [2018-11-23 12:00:56,150 INFO L273 TraceCheckUtils]: 91: Hoare triple {45958#(<= 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); {45958#(<= main_~k~0 29)} is VALID [2018-11-23 12:00:56,151 INFO L273 TraceCheckUtils]: 92: Hoare triple {45958#(<= main_~k~0 29)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45958#(<= main_~k~0 29)} is VALID [2018-11-23 12:00:56,152 INFO L273 TraceCheckUtils]: 93: Hoare triple {45958#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {45968#(<= main_~k~0 30)} is VALID [2018-11-23 12:00:56,152 INFO L273 TraceCheckUtils]: 94: Hoare triple {45968#(<= 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); {45968#(<= main_~k~0 30)} is VALID [2018-11-23 12:00:56,153 INFO L273 TraceCheckUtils]: 95: Hoare triple {45968#(<= main_~k~0 30)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45968#(<= main_~k~0 30)} is VALID [2018-11-23 12:00:56,153 INFO L273 TraceCheckUtils]: 96: Hoare triple {45968#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {45978#(<= main_~k~0 31)} is VALID [2018-11-23 12:00:56,154 INFO L273 TraceCheckUtils]: 97: Hoare triple {45978#(<= 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); {45978#(<= main_~k~0 31)} is VALID [2018-11-23 12:00:56,154 INFO L273 TraceCheckUtils]: 98: Hoare triple {45978#(<= main_~k~0 31)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45978#(<= main_~k~0 31)} is VALID [2018-11-23 12:00:56,155 INFO L273 TraceCheckUtils]: 99: Hoare triple {45978#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {45988#(<= main_~k~0 32)} is VALID [2018-11-23 12:00:56,156 INFO L273 TraceCheckUtils]: 100: Hoare triple {45988#(<= 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); {45988#(<= main_~k~0 32)} is VALID [2018-11-23 12:00:56,156 INFO L273 TraceCheckUtils]: 101: Hoare triple {45988#(<= main_~k~0 32)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45988#(<= main_~k~0 32)} is VALID [2018-11-23 12:00:56,157 INFO L273 TraceCheckUtils]: 102: Hoare triple {45988#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {45998#(<= main_~k~0 33)} is VALID [2018-11-23 12:00:56,157 INFO L273 TraceCheckUtils]: 103: Hoare triple {45998#(<= 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); {45998#(<= main_~k~0 33)} is VALID [2018-11-23 12:00:56,158 INFO L273 TraceCheckUtils]: 104: Hoare triple {45998#(<= main_~k~0 33)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {45998#(<= main_~k~0 33)} is VALID [2018-11-23 12:00:56,159 INFO L273 TraceCheckUtils]: 105: Hoare triple {45998#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {46008#(<= main_~k~0 34)} is VALID [2018-11-23 12:00:56,159 INFO L273 TraceCheckUtils]: 106: Hoare triple {46008#(<= 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); {46008#(<= main_~k~0 34)} is VALID [2018-11-23 12:00:56,160 INFO L273 TraceCheckUtils]: 107: Hoare triple {46008#(<= main_~k~0 34)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {46008#(<= main_~k~0 34)} is VALID [2018-11-23 12:00:56,160 INFO L273 TraceCheckUtils]: 108: Hoare triple {46008#(<= main_~k~0 34)} ~k~0 := 1 + ~k~0; {46018#(<= main_~k~0 35)} is VALID [2018-11-23 12:00:56,161 INFO L273 TraceCheckUtils]: 109: Hoare triple {46018#(<= 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); {46018#(<= main_~k~0 35)} is VALID [2018-11-23 12:00:56,161 INFO L273 TraceCheckUtils]: 110: Hoare triple {46018#(<= main_~k~0 35)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {46018#(<= main_~k~0 35)} is VALID [2018-11-23 12:00:56,162 INFO L273 TraceCheckUtils]: 111: Hoare triple {46018#(<= main_~k~0 35)} ~k~0 := 1 + ~k~0; {46028#(<= main_~k~0 36)} is VALID [2018-11-23 12:00:56,163 INFO L273 TraceCheckUtils]: 112: Hoare triple {46028#(<= 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); {46028#(<= main_~k~0 36)} is VALID [2018-11-23 12:00:56,163 INFO L273 TraceCheckUtils]: 113: Hoare triple {46028#(<= main_~k~0 36)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {46028#(<= main_~k~0 36)} is VALID [2018-11-23 12:00:56,164 INFO L273 TraceCheckUtils]: 114: Hoare triple {46028#(<= main_~k~0 36)} ~k~0 := 1 + ~k~0; {46038#(<= main_~k~0 37)} is VALID [2018-11-23 12:00:56,164 INFO L273 TraceCheckUtils]: 115: Hoare triple {46038#(<= main_~k~0 37)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {46038#(<= main_~k~0 37)} is VALID [2018-11-23 12:00:56,165 INFO L273 TraceCheckUtils]: 116: Hoare triple {46038#(<= main_~k~0 37)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {46038#(<= main_~k~0 37)} is VALID [2018-11-23 12:00:56,166 INFO L273 TraceCheckUtils]: 117: Hoare triple {46038#(<= main_~k~0 37)} ~k~0 := 1 + ~k~0; {46048#(<= main_~k~0 38)} is VALID [2018-11-23 12:00:56,166 INFO L273 TraceCheckUtils]: 118: Hoare triple {46048#(<= main_~k~0 38)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {46048#(<= main_~k~0 38)} is VALID [2018-11-23 12:00:56,167 INFO L273 TraceCheckUtils]: 119: Hoare triple {46048#(<= main_~k~0 38)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {46048#(<= main_~k~0 38)} is VALID [2018-11-23 12:00:56,167 INFO L273 TraceCheckUtils]: 120: Hoare triple {46048#(<= main_~k~0 38)} ~k~0 := 1 + ~k~0; {46058#(<= main_~k~0 39)} is VALID [2018-11-23 12:00:56,168 INFO L273 TraceCheckUtils]: 121: Hoare triple {46058#(<= main_~k~0 39)} assume !(~k~0 < 100000); {45615#false} is VALID [2018-11-23 12:00:56,168 INFO L273 TraceCheckUtils]: 122: Hoare triple {45615#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); {45615#false} is VALID [2018-11-23 12:00:56,168 INFO L273 TraceCheckUtils]: 123: Hoare triple {45615#false} ~x~0 := 0; {45615#false} is VALID [2018-11-23 12:00:56,169 INFO L273 TraceCheckUtils]: 124: Hoare triple {45615#false} assume !(~x~0 < ~i~0); {45615#false} is VALID [2018-11-23 12:00:56,169 INFO L273 TraceCheckUtils]: 125: Hoare triple {45615#false} ~x~0 := ~i~0; {45615#false} is VALID [2018-11-23 12:00:56,169 INFO L273 TraceCheckUtils]: 126: Hoare triple {45615#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); {45615#false} is VALID [2018-11-23 12:00:56,169 INFO L256 TraceCheckUtils]: 127: Hoare triple {45615#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {45615#false} is VALID [2018-11-23 12:00:56,169 INFO L273 TraceCheckUtils]: 128: Hoare triple {45615#false} ~cond := #in~cond; {45615#false} is VALID [2018-11-23 12:00:56,170 INFO L273 TraceCheckUtils]: 129: Hoare triple {45615#false} assume !(0 == ~cond); {45615#false} is VALID [2018-11-23 12:00:56,170 INFO L273 TraceCheckUtils]: 130: Hoare triple {45615#false} assume true; {45615#false} is VALID [2018-11-23 12:00:56,170 INFO L268 TraceCheckUtils]: 131: Hoare quadruple {45615#false} {45615#false} #136#return; {45615#false} is VALID [2018-11-23 12:00:56,170 INFO L273 TraceCheckUtils]: 132: Hoare triple {45615#false} havoc #t~mem9;havoc #t~mem10; {45615#false} is VALID [2018-11-23 12:00:56,170 INFO L273 TraceCheckUtils]: 133: Hoare triple {45615#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {45615#false} is VALID [2018-11-23 12:00:56,170 INFO L273 TraceCheckUtils]: 134: Hoare triple {45615#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); {45615#false} is VALID [2018-11-23 12:00:56,171 INFO L256 TraceCheckUtils]: 135: Hoare triple {45615#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {45615#false} is VALID [2018-11-23 12:00:56,171 INFO L273 TraceCheckUtils]: 136: Hoare triple {45615#false} ~cond := #in~cond; {45615#false} is VALID [2018-11-23 12:00:56,171 INFO L273 TraceCheckUtils]: 137: Hoare triple {45615#false} assume 0 == ~cond; {45615#false} is VALID [2018-11-23 12:00:56,171 INFO L273 TraceCheckUtils]: 138: Hoare triple {45615#false} assume !false; {45615#false} is VALID [2018-11-23 12:00:56,183 INFO L134 CoverageAnalysis]: Checked inductivity of 2151 backedges. 0 proven. 2147 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 12:00:56,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:56,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 82 [2018-11-23 12:00:56,204 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 139 [2018-11-23 12:00:56,205 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:56,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 82 states. [2018-11-23 12:00:56,474 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 258 edges. 258 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:56,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-11-23 12:00:56,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-11-23 12:00:56,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2502, Invalid=4140, Unknown=0, NotChecked=0, Total=6642 [2018-11-23 12:00:56,476 INFO L87 Difference]: Start difference. First operand 282 states and 373 transitions. Second operand 82 states. [2018-11-23 12:00:58,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:58,095 INFO L93 Difference]: Finished difference Result 345 states and 459 transitions. [2018-11-23 12:00:58,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-23 12:00:58,095 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 139 [2018-11-23 12:00:58,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:58,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-23 12:00:58,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 263 transitions. [2018-11-23 12:00:58,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-23 12:00:58,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 263 transitions. [2018-11-23 12:00:58,099 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 263 transitions. [2018-11-23 12:00:58,362 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 263 edges. 263 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:58,368 INFO L225 Difference]: With dead ends: 345 [2018-11-23 12:00:58,368 INFO L226 Difference]: Without dead ends: 298 [2018-11-23 12:00:58,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2341 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2502, Invalid=4140, Unknown=0, NotChecked=0, Total=6642 [2018-11-23 12:00:58,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-11-23 12:00:58,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 288. [2018-11-23 12:00:58,562 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:58,562 INFO L82 GeneralOperation]: Start isEquivalent. First operand 298 states. Second operand 288 states. [2018-11-23 12:00:58,562 INFO L74 IsIncluded]: Start isIncluded. First operand 298 states. Second operand 288 states. [2018-11-23 12:00:58,562 INFO L87 Difference]: Start difference. First operand 298 states. Second operand 288 states. [2018-11-23 12:00:58,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:58,568 INFO L93 Difference]: Finished difference Result 298 states and 396 transitions. [2018-11-23 12:00:58,568 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 396 transitions. [2018-11-23 12:00:58,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:58,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:58,568 INFO L74 IsIncluded]: Start isIncluded. First operand 288 states. Second operand 298 states. [2018-11-23 12:00:58,569 INFO L87 Difference]: Start difference. First operand 288 states. Second operand 298 states. [2018-11-23 12:00:58,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:58,574 INFO L93 Difference]: Finished difference Result 298 states and 396 transitions. [2018-11-23 12:00:58,574 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 396 transitions. [2018-11-23 12:00:58,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:58,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:58,575 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:58,575 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:58,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-11-23 12:00:58,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 381 transitions. [2018-11-23 12:00:58,580 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 381 transitions. Word has length 139 [2018-11-23 12:00:58,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:58,580 INFO L480 AbstractCegarLoop]: Abstraction has 288 states and 381 transitions. [2018-11-23 12:00:58,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-11-23 12:00:58,580 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 381 transitions. [2018-11-23 12:00:58,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-23 12:00:58,581 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:58,581 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 39, 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 12:00:58,581 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:58,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:58,581 INFO L82 PathProgramCache]: Analyzing trace with hash -192934575, now seen corresponding path program 35 times [2018-11-23 12:00:58,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:58,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:58,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:58,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:00:58,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:58,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:00,027 INFO L256 TraceCheckUtils]: 0: Hoare triple {47563#true} call ULTIMATE.init(); {47563#true} is VALID [2018-11-23 12:01:00,027 INFO L273 TraceCheckUtils]: 1: Hoare triple {47563#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {47563#true} is VALID [2018-11-23 12:01:00,027 INFO L273 TraceCheckUtils]: 2: Hoare triple {47563#true} assume true; {47563#true} is VALID [2018-11-23 12:01:00,027 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {47563#true} {47563#true} #130#return; {47563#true} is VALID [2018-11-23 12:01:00,027 INFO L256 TraceCheckUtils]: 4: Hoare triple {47563#true} call #t~ret15 := main(); {47563#true} is VALID [2018-11-23 12:01:00,036 INFO L273 TraceCheckUtils]: 5: Hoare triple {47563#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {47565#(= main_~i~0 0)} is VALID [2018-11-23 12:01:00,037 INFO L273 TraceCheckUtils]: 6: Hoare triple {47565#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {47566#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,037 INFO L273 TraceCheckUtils]: 7: Hoare triple {47566#(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); {47566#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,038 INFO L273 TraceCheckUtils]: 8: Hoare triple {47566#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47566#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,038 INFO L273 TraceCheckUtils]: 9: Hoare triple {47566#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {47567#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,039 INFO L273 TraceCheckUtils]: 10: Hoare triple {47567#(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); {47567#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,039 INFO L273 TraceCheckUtils]: 11: Hoare triple {47567#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47567#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,040 INFO L273 TraceCheckUtils]: 12: Hoare triple {47567#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {47568#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,040 INFO L273 TraceCheckUtils]: 13: Hoare triple {47568#(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); {47568#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,041 INFO L273 TraceCheckUtils]: 14: Hoare triple {47568#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47568#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,042 INFO L273 TraceCheckUtils]: 15: Hoare triple {47568#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {47569#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,043 INFO L273 TraceCheckUtils]: 16: Hoare triple {47569#(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); {47569#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,044 INFO L273 TraceCheckUtils]: 17: Hoare triple {47569#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47569#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,044 INFO L273 TraceCheckUtils]: 18: Hoare triple {47569#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {47570#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,045 INFO L273 TraceCheckUtils]: 19: Hoare triple {47570#(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); {47570#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,046 INFO L273 TraceCheckUtils]: 20: Hoare triple {47570#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47570#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,047 INFO L273 TraceCheckUtils]: 21: Hoare triple {47570#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {47571#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,048 INFO L273 TraceCheckUtils]: 22: Hoare triple {47571#(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); {47571#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,049 INFO L273 TraceCheckUtils]: 23: Hoare triple {47571#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47571#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,050 INFO L273 TraceCheckUtils]: 24: Hoare triple {47571#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {47572#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,050 INFO L273 TraceCheckUtils]: 25: Hoare triple {47572#(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); {47572#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,051 INFO L273 TraceCheckUtils]: 26: Hoare triple {47572#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47572#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,052 INFO L273 TraceCheckUtils]: 27: Hoare triple {47572#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {47573#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,053 INFO L273 TraceCheckUtils]: 28: Hoare triple {47573#(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); {47573#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,053 INFO L273 TraceCheckUtils]: 29: Hoare triple {47573#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47573#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,054 INFO L273 TraceCheckUtils]: 30: Hoare triple {47573#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {47574#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,055 INFO L273 TraceCheckUtils]: 31: Hoare triple {47574#(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); {47574#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,056 INFO L273 TraceCheckUtils]: 32: Hoare triple {47574#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47574#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,057 INFO L273 TraceCheckUtils]: 33: Hoare triple {47574#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {47575#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,057 INFO L273 TraceCheckUtils]: 34: Hoare triple {47575#(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); {47575#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,058 INFO L273 TraceCheckUtils]: 35: Hoare triple {47575#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47575#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,059 INFO L273 TraceCheckUtils]: 36: Hoare triple {47575#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {47576#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,060 INFO L273 TraceCheckUtils]: 37: Hoare triple {47576#(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); {47576#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,061 INFO L273 TraceCheckUtils]: 38: Hoare triple {47576#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47576#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,062 INFO L273 TraceCheckUtils]: 39: Hoare triple {47576#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {47577#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,063 INFO L273 TraceCheckUtils]: 40: Hoare triple {47577#(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); {47577#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,063 INFO L273 TraceCheckUtils]: 41: Hoare triple {47577#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47577#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,064 INFO L273 TraceCheckUtils]: 42: Hoare triple {47577#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {47578#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,065 INFO L273 TraceCheckUtils]: 43: Hoare triple {47578#(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); {47578#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,066 INFO L273 TraceCheckUtils]: 44: Hoare triple {47578#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47578#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,067 INFO L273 TraceCheckUtils]: 45: Hoare triple {47578#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {47579#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,067 INFO L273 TraceCheckUtils]: 46: Hoare triple {47579#(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); {47579#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,068 INFO L273 TraceCheckUtils]: 47: Hoare triple {47579#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47579#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,069 INFO L273 TraceCheckUtils]: 48: Hoare triple {47579#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {47580#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,070 INFO L273 TraceCheckUtils]: 49: Hoare triple {47580#(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); {47580#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,070 INFO L273 TraceCheckUtils]: 50: Hoare triple {47580#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47580#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,071 INFO L273 TraceCheckUtils]: 51: Hoare triple {47580#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {47581#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,072 INFO L273 TraceCheckUtils]: 52: Hoare triple {47581#(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); {47581#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,073 INFO L273 TraceCheckUtils]: 53: Hoare triple {47581#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47581#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,074 INFO L273 TraceCheckUtils]: 54: Hoare triple {47581#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {47582#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 12:01:00,075 INFO L273 TraceCheckUtils]: 55: Hoare triple {47582#(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); {47582#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 12:01:00,075 INFO L273 TraceCheckUtils]: 56: Hoare triple {47582#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47582#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 12:01:00,076 INFO L273 TraceCheckUtils]: 57: Hoare triple {47582#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} ~k~0 := 1 + ~k~0; {47583#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,077 INFO L273 TraceCheckUtils]: 58: Hoare triple {47583#(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); {47583#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,078 INFO L273 TraceCheckUtils]: 59: Hoare triple {47583#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47583#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,079 INFO L273 TraceCheckUtils]: 60: Hoare triple {47583#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {47584#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,080 INFO L273 TraceCheckUtils]: 61: Hoare triple {47584#(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); {47584#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,080 INFO L273 TraceCheckUtils]: 62: Hoare triple {47584#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47584#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,081 INFO L273 TraceCheckUtils]: 63: Hoare triple {47584#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {47585#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,082 INFO L273 TraceCheckUtils]: 64: Hoare triple {47585#(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); {47585#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,083 INFO L273 TraceCheckUtils]: 65: Hoare triple {47585#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47585#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,084 INFO L273 TraceCheckUtils]: 66: Hoare triple {47585#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {47586#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,084 INFO L273 TraceCheckUtils]: 67: Hoare triple {47586#(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); {47586#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,085 INFO L273 TraceCheckUtils]: 68: Hoare triple {47586#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47586#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,086 INFO L273 TraceCheckUtils]: 69: Hoare triple {47586#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {47587#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,087 INFO L273 TraceCheckUtils]: 70: Hoare triple {47587#(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); {47587#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,087 INFO L273 TraceCheckUtils]: 71: Hoare triple {47587#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47587#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,088 INFO L273 TraceCheckUtils]: 72: Hoare triple {47587#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {47588#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,089 INFO L273 TraceCheckUtils]: 73: Hoare triple {47588#(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); {47588#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,090 INFO L273 TraceCheckUtils]: 74: Hoare triple {47588#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47588#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,091 INFO L273 TraceCheckUtils]: 75: Hoare triple {47588#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {47589#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,092 INFO L273 TraceCheckUtils]: 76: Hoare triple {47589#(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); {47589#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,092 INFO L273 TraceCheckUtils]: 77: Hoare triple {47589#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47589#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,093 INFO L273 TraceCheckUtils]: 78: Hoare triple {47589#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {47590#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,094 INFO L273 TraceCheckUtils]: 79: Hoare triple {47590#(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); {47590#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,095 INFO L273 TraceCheckUtils]: 80: Hoare triple {47590#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47590#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,096 INFO L273 TraceCheckUtils]: 81: Hoare triple {47590#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {47591#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,097 INFO L273 TraceCheckUtils]: 82: Hoare triple {47591#(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); {47591#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,097 INFO L273 TraceCheckUtils]: 83: Hoare triple {47591#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47591#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,098 INFO L273 TraceCheckUtils]: 84: Hoare triple {47591#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {47592#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,099 INFO L273 TraceCheckUtils]: 85: Hoare triple {47592#(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); {47592#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,100 INFO L273 TraceCheckUtils]: 86: Hoare triple {47592#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47592#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,101 INFO L273 TraceCheckUtils]: 87: Hoare triple {47592#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {47593#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,102 INFO L273 TraceCheckUtils]: 88: Hoare triple {47593#(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); {47593#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,102 INFO L273 TraceCheckUtils]: 89: Hoare triple {47593#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47593#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,103 INFO L273 TraceCheckUtils]: 90: Hoare triple {47593#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {47594#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,104 INFO L273 TraceCheckUtils]: 91: Hoare triple {47594#(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); {47594#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,105 INFO L273 TraceCheckUtils]: 92: Hoare triple {47594#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47594#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,106 INFO L273 TraceCheckUtils]: 93: Hoare triple {47594#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {47595#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,107 INFO L273 TraceCheckUtils]: 94: Hoare triple {47595#(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); {47595#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,107 INFO L273 TraceCheckUtils]: 95: Hoare triple {47595#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47595#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,108 INFO L273 TraceCheckUtils]: 96: Hoare triple {47595#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {47596#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,109 INFO L273 TraceCheckUtils]: 97: Hoare triple {47596#(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); {47596#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,110 INFO L273 TraceCheckUtils]: 98: Hoare triple {47596#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47596#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,111 INFO L273 TraceCheckUtils]: 99: Hoare triple {47596#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {47597#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,112 INFO L273 TraceCheckUtils]: 100: Hoare triple {47597#(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); {47597#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,113 INFO L273 TraceCheckUtils]: 101: Hoare triple {47597#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47597#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,113 INFO L273 TraceCheckUtils]: 102: Hoare triple {47597#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {47598#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,114 INFO L273 TraceCheckUtils]: 103: Hoare triple {47598#(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); {47598#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,115 INFO L273 TraceCheckUtils]: 104: Hoare triple {47598#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47598#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,116 INFO L273 TraceCheckUtils]: 105: Hoare triple {47598#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {47599#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,117 INFO L273 TraceCheckUtils]: 106: Hoare triple {47599#(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); {47599#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,118 INFO L273 TraceCheckUtils]: 107: Hoare triple {47599#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47599#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,119 INFO L273 TraceCheckUtils]: 108: Hoare triple {47599#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {47600#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,120 INFO L273 TraceCheckUtils]: 109: Hoare triple {47600#(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); {47600#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,120 INFO L273 TraceCheckUtils]: 110: Hoare triple {47600#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47600#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,121 INFO L273 TraceCheckUtils]: 111: Hoare triple {47600#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {47601#(and (<= main_~k~0 (+ main_~i~0 36)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,122 INFO L273 TraceCheckUtils]: 112: Hoare triple {47601#(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); {47601#(and (<= main_~k~0 (+ main_~i~0 36)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,123 INFO L273 TraceCheckUtils]: 113: Hoare triple {47601#(and (<= main_~k~0 (+ main_~i~0 36)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47601#(and (<= main_~k~0 (+ main_~i~0 36)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,123 INFO L273 TraceCheckUtils]: 114: Hoare triple {47601#(and (<= main_~k~0 (+ main_~i~0 36)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {47602#(and (<= main_~k~0 (+ main_~i~0 37)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,124 INFO L273 TraceCheckUtils]: 115: Hoare triple {47602#(and (<= main_~k~0 (+ main_~i~0 37)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47602#(and (<= main_~k~0 (+ main_~i~0 37)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,125 INFO L273 TraceCheckUtils]: 116: Hoare triple {47602#(and (<= main_~k~0 (+ main_~i~0 37)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47602#(and (<= main_~k~0 (+ main_~i~0 37)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,126 INFO L273 TraceCheckUtils]: 117: Hoare triple {47602#(and (<= main_~k~0 (+ main_~i~0 37)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {47603#(and (<= main_~k~0 (+ main_~i~0 38)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,127 INFO L273 TraceCheckUtils]: 118: Hoare triple {47603#(and (<= main_~k~0 (+ main_~i~0 38)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47603#(and (<= main_~k~0 (+ main_~i~0 38)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,128 INFO L273 TraceCheckUtils]: 119: Hoare triple {47603#(and (<= main_~k~0 (+ main_~i~0 38)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47603#(and (<= main_~k~0 (+ main_~i~0 38)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,129 INFO L273 TraceCheckUtils]: 120: Hoare triple {47603#(and (<= main_~k~0 (+ main_~i~0 38)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {47604#(and (<= main_~k~0 (+ main_~i~0 39)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,129 INFO L273 TraceCheckUtils]: 121: Hoare triple {47604#(and (<= main_~k~0 (+ main_~i~0 39)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47604#(and (<= main_~k~0 (+ main_~i~0 39)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,130 INFO L273 TraceCheckUtils]: 122: Hoare triple {47604#(and (<= main_~k~0 (+ main_~i~0 39)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47604#(and (<= main_~k~0 (+ main_~i~0 39)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,131 INFO L273 TraceCheckUtils]: 123: Hoare triple {47604#(and (<= main_~k~0 (+ main_~i~0 39)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {47605#(and (<= main_~k~0 (+ main_~i~0 40)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:00,132 INFO L273 TraceCheckUtils]: 124: Hoare triple {47605#(and (<= main_~k~0 (+ main_~i~0 40)) (= main_~i~0 0))} assume !(~k~0 < 100000); {47564#false} is VALID [2018-11-23 12:01:00,132 INFO L273 TraceCheckUtils]: 125: Hoare triple {47564#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); {47564#false} is VALID [2018-11-23 12:01:00,132 INFO L273 TraceCheckUtils]: 126: Hoare triple {47564#false} ~x~0 := 0; {47564#false} is VALID [2018-11-23 12:01:00,132 INFO L273 TraceCheckUtils]: 127: Hoare triple {47564#false} assume !(~x~0 < ~i~0); {47564#false} is VALID [2018-11-23 12:01:00,133 INFO L273 TraceCheckUtils]: 128: Hoare triple {47564#false} ~x~0 := ~i~0; {47564#false} is VALID [2018-11-23 12:01:00,133 INFO L273 TraceCheckUtils]: 129: Hoare triple {47564#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); {47564#false} is VALID [2018-11-23 12:01:00,133 INFO L256 TraceCheckUtils]: 130: Hoare triple {47564#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {47563#true} is VALID [2018-11-23 12:01:00,133 INFO L273 TraceCheckUtils]: 131: Hoare triple {47563#true} ~cond := #in~cond; {47563#true} is VALID [2018-11-23 12:01:00,133 INFO L273 TraceCheckUtils]: 132: Hoare triple {47563#true} assume !(0 == ~cond); {47563#true} is VALID [2018-11-23 12:01:00,133 INFO L273 TraceCheckUtils]: 133: Hoare triple {47563#true} assume true; {47563#true} is VALID [2018-11-23 12:01:00,134 INFO L268 TraceCheckUtils]: 134: Hoare quadruple {47563#true} {47564#false} #136#return; {47564#false} is VALID [2018-11-23 12:01:00,134 INFO L273 TraceCheckUtils]: 135: Hoare triple {47564#false} havoc #t~mem9;havoc #t~mem10; {47564#false} is VALID [2018-11-23 12:01:00,134 INFO L273 TraceCheckUtils]: 136: Hoare triple {47564#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {47564#false} is VALID [2018-11-23 12:01:00,134 INFO L273 TraceCheckUtils]: 137: Hoare triple {47564#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); {47564#false} is VALID [2018-11-23 12:01:00,134 INFO L256 TraceCheckUtils]: 138: Hoare triple {47564#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {47564#false} is VALID [2018-11-23 12:01:00,134 INFO L273 TraceCheckUtils]: 139: Hoare triple {47564#false} ~cond := #in~cond; {47564#false} is VALID [2018-11-23 12:01:00,135 INFO L273 TraceCheckUtils]: 140: Hoare triple {47564#false} assume 0 == ~cond; {47564#false} is VALID [2018-11-23 12:01:00,135 INFO L273 TraceCheckUtils]: 141: Hoare triple {47564#false} assume !false; {47564#false} is VALID [2018-11-23 12:01:00,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2266 backedges. 2 proven. 2262 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 12:01:00,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:00,164 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:01:00,193 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:01:00,350 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 40 check-sat command(s) [2018-11-23 12:01:00,350 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:01:00,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:00,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:01:01,936 INFO L256 TraceCheckUtils]: 0: Hoare triple {47563#true} call ULTIMATE.init(); {47563#true} is VALID [2018-11-23 12:01:01,936 INFO L273 TraceCheckUtils]: 1: Hoare triple {47563#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {47563#true} is VALID [2018-11-23 12:01:01,936 INFO L273 TraceCheckUtils]: 2: Hoare triple {47563#true} assume true; {47563#true} is VALID [2018-11-23 12:01:01,937 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {47563#true} {47563#true} #130#return; {47563#true} is VALID [2018-11-23 12:01:01,937 INFO L256 TraceCheckUtils]: 4: Hoare triple {47563#true} call #t~ret15 := main(); {47563#true} is VALID [2018-11-23 12:01:01,938 INFO L273 TraceCheckUtils]: 5: Hoare triple {47563#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {47624#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:01,938 INFO L273 TraceCheckUtils]: 6: Hoare triple {47624#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {47628#(<= main_~k~0 1)} is VALID [2018-11-23 12:01:01,939 INFO L273 TraceCheckUtils]: 7: Hoare triple {47628#(<= 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); {47628#(<= main_~k~0 1)} is VALID [2018-11-23 12:01:01,939 INFO L273 TraceCheckUtils]: 8: Hoare triple {47628#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47628#(<= main_~k~0 1)} is VALID [2018-11-23 12:01:01,939 INFO L273 TraceCheckUtils]: 9: Hoare triple {47628#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {47638#(<= main_~k~0 2)} is VALID [2018-11-23 12:01:01,940 INFO L273 TraceCheckUtils]: 10: Hoare triple {47638#(<= 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); {47638#(<= main_~k~0 2)} is VALID [2018-11-23 12:01:01,940 INFO L273 TraceCheckUtils]: 11: Hoare triple {47638#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47638#(<= main_~k~0 2)} is VALID [2018-11-23 12:01:01,941 INFO L273 TraceCheckUtils]: 12: Hoare triple {47638#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {47648#(<= main_~k~0 3)} is VALID [2018-11-23 12:01:01,941 INFO L273 TraceCheckUtils]: 13: Hoare triple {47648#(<= 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); {47648#(<= main_~k~0 3)} is VALID [2018-11-23 12:01:01,942 INFO L273 TraceCheckUtils]: 14: Hoare triple {47648#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47648#(<= main_~k~0 3)} is VALID [2018-11-23 12:01:01,942 INFO L273 TraceCheckUtils]: 15: Hoare triple {47648#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {47658#(<= main_~k~0 4)} is VALID [2018-11-23 12:01:01,943 INFO L273 TraceCheckUtils]: 16: Hoare triple {47658#(<= 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); {47658#(<= main_~k~0 4)} is VALID [2018-11-23 12:01:01,943 INFO L273 TraceCheckUtils]: 17: Hoare triple {47658#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47658#(<= main_~k~0 4)} is VALID [2018-11-23 12:01:01,944 INFO L273 TraceCheckUtils]: 18: Hoare triple {47658#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {47668#(<= main_~k~0 5)} is VALID [2018-11-23 12:01:01,945 INFO L273 TraceCheckUtils]: 19: Hoare triple {47668#(<= 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); {47668#(<= main_~k~0 5)} is VALID [2018-11-23 12:01:01,945 INFO L273 TraceCheckUtils]: 20: Hoare triple {47668#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47668#(<= main_~k~0 5)} is VALID [2018-11-23 12:01:01,946 INFO L273 TraceCheckUtils]: 21: Hoare triple {47668#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {47678#(<= main_~k~0 6)} is VALID [2018-11-23 12:01:01,946 INFO L273 TraceCheckUtils]: 22: Hoare triple {47678#(<= 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); {47678#(<= main_~k~0 6)} is VALID [2018-11-23 12:01:01,947 INFO L273 TraceCheckUtils]: 23: Hoare triple {47678#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47678#(<= main_~k~0 6)} is VALID [2018-11-23 12:01:01,948 INFO L273 TraceCheckUtils]: 24: Hoare triple {47678#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {47688#(<= main_~k~0 7)} is VALID [2018-11-23 12:01:01,948 INFO L273 TraceCheckUtils]: 25: Hoare triple {47688#(<= 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); {47688#(<= main_~k~0 7)} is VALID [2018-11-23 12:01:01,949 INFO L273 TraceCheckUtils]: 26: Hoare triple {47688#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47688#(<= main_~k~0 7)} is VALID [2018-11-23 12:01:01,949 INFO L273 TraceCheckUtils]: 27: Hoare triple {47688#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {47698#(<= main_~k~0 8)} is VALID [2018-11-23 12:01:01,950 INFO L273 TraceCheckUtils]: 28: Hoare triple {47698#(<= 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); {47698#(<= main_~k~0 8)} is VALID [2018-11-23 12:01:01,950 INFO L273 TraceCheckUtils]: 29: Hoare triple {47698#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47698#(<= main_~k~0 8)} is VALID [2018-11-23 12:01:01,951 INFO L273 TraceCheckUtils]: 30: Hoare triple {47698#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {47708#(<= main_~k~0 9)} is VALID [2018-11-23 12:01:01,952 INFO L273 TraceCheckUtils]: 31: Hoare triple {47708#(<= 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); {47708#(<= main_~k~0 9)} is VALID [2018-11-23 12:01:01,952 INFO L273 TraceCheckUtils]: 32: Hoare triple {47708#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47708#(<= main_~k~0 9)} is VALID [2018-11-23 12:01:01,953 INFO L273 TraceCheckUtils]: 33: Hoare triple {47708#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {47718#(<= main_~k~0 10)} is VALID [2018-11-23 12:01:01,953 INFO L273 TraceCheckUtils]: 34: Hoare triple {47718#(<= 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); {47718#(<= main_~k~0 10)} is VALID [2018-11-23 12:01:01,954 INFO L273 TraceCheckUtils]: 35: Hoare triple {47718#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47718#(<= main_~k~0 10)} is VALID [2018-11-23 12:01:01,955 INFO L273 TraceCheckUtils]: 36: Hoare triple {47718#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {47728#(<= main_~k~0 11)} is VALID [2018-11-23 12:01:01,955 INFO L273 TraceCheckUtils]: 37: Hoare triple {47728#(<= 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); {47728#(<= main_~k~0 11)} is VALID [2018-11-23 12:01:01,956 INFO L273 TraceCheckUtils]: 38: Hoare triple {47728#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47728#(<= main_~k~0 11)} is VALID [2018-11-23 12:01:01,956 INFO L273 TraceCheckUtils]: 39: Hoare triple {47728#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {47738#(<= main_~k~0 12)} is VALID [2018-11-23 12:01:01,957 INFO L273 TraceCheckUtils]: 40: Hoare triple {47738#(<= 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); {47738#(<= main_~k~0 12)} is VALID [2018-11-23 12:01:01,957 INFO L273 TraceCheckUtils]: 41: Hoare triple {47738#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47738#(<= main_~k~0 12)} is VALID [2018-11-23 12:01:01,958 INFO L273 TraceCheckUtils]: 42: Hoare triple {47738#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {47748#(<= main_~k~0 13)} is VALID [2018-11-23 12:01:01,959 INFO L273 TraceCheckUtils]: 43: Hoare triple {47748#(<= 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); {47748#(<= main_~k~0 13)} is VALID [2018-11-23 12:01:01,959 INFO L273 TraceCheckUtils]: 44: Hoare triple {47748#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47748#(<= main_~k~0 13)} is VALID [2018-11-23 12:01:01,960 INFO L273 TraceCheckUtils]: 45: Hoare triple {47748#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {47758#(<= main_~k~0 14)} is VALID [2018-11-23 12:01:01,960 INFO L273 TraceCheckUtils]: 46: Hoare triple {47758#(<= 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); {47758#(<= main_~k~0 14)} is VALID [2018-11-23 12:01:01,961 INFO L273 TraceCheckUtils]: 47: Hoare triple {47758#(<= main_~k~0 14)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47758#(<= main_~k~0 14)} is VALID [2018-11-23 12:01:01,982 INFO L273 TraceCheckUtils]: 48: Hoare triple {47758#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {47768#(<= main_~k~0 15)} is VALID [2018-11-23 12:01:02,001 INFO L273 TraceCheckUtils]: 49: Hoare triple {47768#(<= 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); {47768#(<= main_~k~0 15)} is VALID [2018-11-23 12:01:02,010 INFO L273 TraceCheckUtils]: 50: Hoare triple {47768#(<= main_~k~0 15)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47768#(<= main_~k~0 15)} is VALID [2018-11-23 12:01:02,014 INFO L273 TraceCheckUtils]: 51: Hoare triple {47768#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {47778#(<= main_~k~0 16)} is VALID [2018-11-23 12:01:02,014 INFO L273 TraceCheckUtils]: 52: Hoare triple {47778#(<= 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); {47778#(<= main_~k~0 16)} is VALID [2018-11-23 12:01:02,015 INFO L273 TraceCheckUtils]: 53: Hoare triple {47778#(<= main_~k~0 16)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47778#(<= main_~k~0 16)} is VALID [2018-11-23 12:01:02,015 INFO L273 TraceCheckUtils]: 54: Hoare triple {47778#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {47788#(<= main_~k~0 17)} is VALID [2018-11-23 12:01:02,016 INFO L273 TraceCheckUtils]: 55: Hoare triple {47788#(<= 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); {47788#(<= main_~k~0 17)} is VALID [2018-11-23 12:01:02,016 INFO L273 TraceCheckUtils]: 56: Hoare triple {47788#(<= main_~k~0 17)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47788#(<= main_~k~0 17)} is VALID [2018-11-23 12:01:02,016 INFO L273 TraceCheckUtils]: 57: Hoare triple {47788#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {47798#(<= main_~k~0 18)} is VALID [2018-11-23 12:01:02,017 INFO L273 TraceCheckUtils]: 58: Hoare triple {47798#(<= 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); {47798#(<= main_~k~0 18)} is VALID [2018-11-23 12:01:02,017 INFO L273 TraceCheckUtils]: 59: Hoare triple {47798#(<= main_~k~0 18)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47798#(<= main_~k~0 18)} is VALID [2018-11-23 12:01:02,017 INFO L273 TraceCheckUtils]: 60: Hoare triple {47798#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {47808#(<= main_~k~0 19)} is VALID [2018-11-23 12:01:02,018 INFO L273 TraceCheckUtils]: 61: Hoare triple {47808#(<= 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); {47808#(<= main_~k~0 19)} is VALID [2018-11-23 12:01:02,018 INFO L273 TraceCheckUtils]: 62: Hoare triple {47808#(<= main_~k~0 19)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47808#(<= main_~k~0 19)} is VALID [2018-11-23 12:01:02,019 INFO L273 TraceCheckUtils]: 63: Hoare triple {47808#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {47818#(<= main_~k~0 20)} is VALID [2018-11-23 12:01:02,019 INFO L273 TraceCheckUtils]: 64: Hoare triple {47818#(<= 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); {47818#(<= main_~k~0 20)} is VALID [2018-11-23 12:01:02,020 INFO L273 TraceCheckUtils]: 65: Hoare triple {47818#(<= main_~k~0 20)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47818#(<= main_~k~0 20)} is VALID [2018-11-23 12:01:02,020 INFO L273 TraceCheckUtils]: 66: Hoare triple {47818#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {47828#(<= main_~k~0 21)} is VALID [2018-11-23 12:01:02,021 INFO L273 TraceCheckUtils]: 67: Hoare triple {47828#(<= 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); {47828#(<= main_~k~0 21)} is VALID [2018-11-23 12:01:02,021 INFO L273 TraceCheckUtils]: 68: Hoare triple {47828#(<= main_~k~0 21)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47828#(<= main_~k~0 21)} is VALID [2018-11-23 12:01:02,022 INFO L273 TraceCheckUtils]: 69: Hoare triple {47828#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {47838#(<= main_~k~0 22)} is VALID [2018-11-23 12:01:02,023 INFO L273 TraceCheckUtils]: 70: Hoare triple {47838#(<= 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); {47838#(<= main_~k~0 22)} is VALID [2018-11-23 12:01:02,023 INFO L273 TraceCheckUtils]: 71: Hoare triple {47838#(<= main_~k~0 22)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47838#(<= main_~k~0 22)} is VALID [2018-11-23 12:01:02,024 INFO L273 TraceCheckUtils]: 72: Hoare triple {47838#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {47848#(<= main_~k~0 23)} is VALID [2018-11-23 12:01:02,024 INFO L273 TraceCheckUtils]: 73: Hoare triple {47848#(<= 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); {47848#(<= main_~k~0 23)} is VALID [2018-11-23 12:01:02,025 INFO L273 TraceCheckUtils]: 74: Hoare triple {47848#(<= main_~k~0 23)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47848#(<= main_~k~0 23)} is VALID [2018-11-23 12:01:02,026 INFO L273 TraceCheckUtils]: 75: Hoare triple {47848#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {47858#(<= main_~k~0 24)} is VALID [2018-11-23 12:01:02,026 INFO L273 TraceCheckUtils]: 76: Hoare triple {47858#(<= 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); {47858#(<= main_~k~0 24)} is VALID [2018-11-23 12:01:02,027 INFO L273 TraceCheckUtils]: 77: Hoare triple {47858#(<= main_~k~0 24)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47858#(<= main_~k~0 24)} is VALID [2018-11-23 12:01:02,027 INFO L273 TraceCheckUtils]: 78: Hoare triple {47858#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {47868#(<= main_~k~0 25)} is VALID [2018-11-23 12:01:02,028 INFO L273 TraceCheckUtils]: 79: Hoare triple {47868#(<= 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); {47868#(<= main_~k~0 25)} is VALID [2018-11-23 12:01:02,028 INFO L273 TraceCheckUtils]: 80: Hoare triple {47868#(<= main_~k~0 25)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47868#(<= main_~k~0 25)} is VALID [2018-11-23 12:01:02,029 INFO L273 TraceCheckUtils]: 81: Hoare triple {47868#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {47878#(<= main_~k~0 26)} is VALID [2018-11-23 12:01:02,030 INFO L273 TraceCheckUtils]: 82: Hoare triple {47878#(<= 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); {47878#(<= main_~k~0 26)} is VALID [2018-11-23 12:01:02,030 INFO L273 TraceCheckUtils]: 83: Hoare triple {47878#(<= main_~k~0 26)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47878#(<= main_~k~0 26)} is VALID [2018-11-23 12:01:02,031 INFO L273 TraceCheckUtils]: 84: Hoare triple {47878#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {47888#(<= main_~k~0 27)} is VALID [2018-11-23 12:01:02,031 INFO L273 TraceCheckUtils]: 85: Hoare triple {47888#(<= 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); {47888#(<= main_~k~0 27)} is VALID [2018-11-23 12:01:02,032 INFO L273 TraceCheckUtils]: 86: Hoare triple {47888#(<= main_~k~0 27)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47888#(<= main_~k~0 27)} is VALID [2018-11-23 12:01:02,033 INFO L273 TraceCheckUtils]: 87: Hoare triple {47888#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {47898#(<= main_~k~0 28)} is VALID [2018-11-23 12:01:02,033 INFO L273 TraceCheckUtils]: 88: Hoare triple {47898#(<= 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); {47898#(<= main_~k~0 28)} is VALID [2018-11-23 12:01:02,034 INFO L273 TraceCheckUtils]: 89: Hoare triple {47898#(<= main_~k~0 28)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47898#(<= main_~k~0 28)} is VALID [2018-11-23 12:01:02,034 INFO L273 TraceCheckUtils]: 90: Hoare triple {47898#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {47908#(<= main_~k~0 29)} is VALID [2018-11-23 12:01:02,035 INFO L273 TraceCheckUtils]: 91: Hoare triple {47908#(<= 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); {47908#(<= main_~k~0 29)} is VALID [2018-11-23 12:01:02,035 INFO L273 TraceCheckUtils]: 92: Hoare triple {47908#(<= main_~k~0 29)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47908#(<= main_~k~0 29)} is VALID [2018-11-23 12:01:02,036 INFO L273 TraceCheckUtils]: 93: Hoare triple {47908#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {47918#(<= main_~k~0 30)} is VALID [2018-11-23 12:01:02,037 INFO L273 TraceCheckUtils]: 94: Hoare triple {47918#(<= 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); {47918#(<= main_~k~0 30)} is VALID [2018-11-23 12:01:02,037 INFO L273 TraceCheckUtils]: 95: Hoare triple {47918#(<= main_~k~0 30)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47918#(<= main_~k~0 30)} is VALID [2018-11-23 12:01:02,038 INFO L273 TraceCheckUtils]: 96: Hoare triple {47918#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {47928#(<= main_~k~0 31)} is VALID [2018-11-23 12:01:02,038 INFO L273 TraceCheckUtils]: 97: Hoare triple {47928#(<= 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); {47928#(<= main_~k~0 31)} is VALID [2018-11-23 12:01:02,039 INFO L273 TraceCheckUtils]: 98: Hoare triple {47928#(<= main_~k~0 31)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47928#(<= main_~k~0 31)} is VALID [2018-11-23 12:01:02,040 INFO L273 TraceCheckUtils]: 99: Hoare triple {47928#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {47938#(<= main_~k~0 32)} is VALID [2018-11-23 12:01:02,040 INFO L273 TraceCheckUtils]: 100: Hoare triple {47938#(<= 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); {47938#(<= main_~k~0 32)} is VALID [2018-11-23 12:01:02,041 INFO L273 TraceCheckUtils]: 101: Hoare triple {47938#(<= main_~k~0 32)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47938#(<= main_~k~0 32)} is VALID [2018-11-23 12:01:02,041 INFO L273 TraceCheckUtils]: 102: Hoare triple {47938#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {47948#(<= main_~k~0 33)} is VALID [2018-11-23 12:01:02,042 INFO L273 TraceCheckUtils]: 103: Hoare triple {47948#(<= 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); {47948#(<= main_~k~0 33)} is VALID [2018-11-23 12:01:02,042 INFO L273 TraceCheckUtils]: 104: Hoare triple {47948#(<= main_~k~0 33)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47948#(<= main_~k~0 33)} is VALID [2018-11-23 12:01:02,043 INFO L273 TraceCheckUtils]: 105: Hoare triple {47948#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {47958#(<= main_~k~0 34)} is VALID [2018-11-23 12:01:02,044 INFO L273 TraceCheckUtils]: 106: Hoare triple {47958#(<= 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); {47958#(<= main_~k~0 34)} is VALID [2018-11-23 12:01:02,044 INFO L273 TraceCheckUtils]: 107: Hoare triple {47958#(<= main_~k~0 34)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47958#(<= main_~k~0 34)} is VALID [2018-11-23 12:01:02,045 INFO L273 TraceCheckUtils]: 108: Hoare triple {47958#(<= main_~k~0 34)} ~k~0 := 1 + ~k~0; {47968#(<= main_~k~0 35)} is VALID [2018-11-23 12:01:02,045 INFO L273 TraceCheckUtils]: 109: Hoare triple {47968#(<= 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); {47968#(<= main_~k~0 35)} is VALID [2018-11-23 12:01:02,046 INFO L273 TraceCheckUtils]: 110: Hoare triple {47968#(<= main_~k~0 35)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47968#(<= main_~k~0 35)} is VALID [2018-11-23 12:01:02,047 INFO L273 TraceCheckUtils]: 111: Hoare triple {47968#(<= main_~k~0 35)} ~k~0 := 1 + ~k~0; {47978#(<= main_~k~0 36)} is VALID [2018-11-23 12:01:02,047 INFO L273 TraceCheckUtils]: 112: Hoare triple {47978#(<= 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); {47978#(<= main_~k~0 36)} is VALID [2018-11-23 12:01:02,048 INFO L273 TraceCheckUtils]: 113: Hoare triple {47978#(<= main_~k~0 36)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47978#(<= main_~k~0 36)} is VALID [2018-11-23 12:01:02,049 INFO L273 TraceCheckUtils]: 114: Hoare triple {47978#(<= main_~k~0 36)} ~k~0 := 1 + ~k~0; {47988#(<= main_~k~0 37)} is VALID [2018-11-23 12:01:02,049 INFO L273 TraceCheckUtils]: 115: Hoare triple {47988#(<= main_~k~0 37)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47988#(<= main_~k~0 37)} is VALID [2018-11-23 12:01:02,050 INFO L273 TraceCheckUtils]: 116: Hoare triple {47988#(<= main_~k~0 37)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47988#(<= main_~k~0 37)} is VALID [2018-11-23 12:01:02,050 INFO L273 TraceCheckUtils]: 117: Hoare triple {47988#(<= main_~k~0 37)} ~k~0 := 1 + ~k~0; {47998#(<= main_~k~0 38)} is VALID [2018-11-23 12:01:02,051 INFO L273 TraceCheckUtils]: 118: Hoare triple {47998#(<= main_~k~0 38)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47998#(<= main_~k~0 38)} is VALID [2018-11-23 12:01:02,051 INFO L273 TraceCheckUtils]: 119: Hoare triple {47998#(<= main_~k~0 38)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {47998#(<= main_~k~0 38)} is VALID [2018-11-23 12:01:02,052 INFO L273 TraceCheckUtils]: 120: Hoare triple {47998#(<= main_~k~0 38)} ~k~0 := 1 + ~k~0; {48008#(<= main_~k~0 39)} is VALID [2018-11-23 12:01:02,053 INFO L273 TraceCheckUtils]: 121: Hoare triple {48008#(<= main_~k~0 39)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48008#(<= main_~k~0 39)} is VALID [2018-11-23 12:01:02,053 INFO L273 TraceCheckUtils]: 122: Hoare triple {48008#(<= main_~k~0 39)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {48008#(<= main_~k~0 39)} is VALID [2018-11-23 12:01:02,054 INFO L273 TraceCheckUtils]: 123: Hoare triple {48008#(<= main_~k~0 39)} ~k~0 := 1 + ~k~0; {48018#(<= main_~k~0 40)} is VALID [2018-11-23 12:01:02,054 INFO L273 TraceCheckUtils]: 124: Hoare triple {48018#(<= main_~k~0 40)} assume !(~k~0 < 100000); {47564#false} is VALID [2018-11-23 12:01:02,055 INFO L273 TraceCheckUtils]: 125: Hoare triple {47564#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); {47564#false} is VALID [2018-11-23 12:01:02,055 INFO L273 TraceCheckUtils]: 126: Hoare triple {47564#false} ~x~0 := 0; {47564#false} is VALID [2018-11-23 12:01:02,055 INFO L273 TraceCheckUtils]: 127: Hoare triple {47564#false} assume !(~x~0 < ~i~0); {47564#false} is VALID [2018-11-23 12:01:02,055 INFO L273 TraceCheckUtils]: 128: Hoare triple {47564#false} ~x~0 := ~i~0; {47564#false} is VALID [2018-11-23 12:01:02,055 INFO L273 TraceCheckUtils]: 129: Hoare triple {47564#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); {47564#false} is VALID [2018-11-23 12:01:02,056 INFO L256 TraceCheckUtils]: 130: Hoare triple {47564#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {47564#false} is VALID [2018-11-23 12:01:02,056 INFO L273 TraceCheckUtils]: 131: Hoare triple {47564#false} ~cond := #in~cond; {47564#false} is VALID [2018-11-23 12:01:02,056 INFO L273 TraceCheckUtils]: 132: Hoare triple {47564#false} assume !(0 == ~cond); {47564#false} is VALID [2018-11-23 12:01:02,056 INFO L273 TraceCheckUtils]: 133: Hoare triple {47564#false} assume true; {47564#false} is VALID [2018-11-23 12:01:02,056 INFO L268 TraceCheckUtils]: 134: Hoare quadruple {47564#false} {47564#false} #136#return; {47564#false} is VALID [2018-11-23 12:01:02,056 INFO L273 TraceCheckUtils]: 135: Hoare triple {47564#false} havoc #t~mem9;havoc #t~mem10; {47564#false} is VALID [2018-11-23 12:01:02,057 INFO L273 TraceCheckUtils]: 136: Hoare triple {47564#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {47564#false} is VALID [2018-11-23 12:01:02,057 INFO L273 TraceCheckUtils]: 137: Hoare triple {47564#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); {47564#false} is VALID [2018-11-23 12:01:02,057 INFO L256 TraceCheckUtils]: 138: Hoare triple {47564#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {47564#false} is VALID [2018-11-23 12:01:02,057 INFO L273 TraceCheckUtils]: 139: Hoare triple {47564#false} ~cond := #in~cond; {47564#false} is VALID [2018-11-23 12:01:02,057 INFO L273 TraceCheckUtils]: 140: Hoare triple {47564#false} assume 0 == ~cond; {47564#false} is VALID [2018-11-23 12:01:02,057 INFO L273 TraceCheckUtils]: 141: Hoare triple {47564#false} assume !false; {47564#false} is VALID [2018-11-23 12:01:02,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2266 backedges. 0 proven. 2262 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 12:01:02,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:01:02,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 84 [2018-11-23 12:01:02,089 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 142 [2018-11-23 12:01:02,090 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:02,090 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 84 states. [2018-11-23 12:01:02,367 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 264 edges. 264 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:02,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-11-23 12:01:02,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-11-23 12:01:02,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2626, Invalid=4346, Unknown=0, NotChecked=0, Total=6972 [2018-11-23 12:01:02,369 INFO L87 Difference]: Start difference. First operand 288 states and 381 transitions. Second operand 84 states. [2018-11-23 12:01:03,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:03,739 INFO L93 Difference]: Finished difference Result 351 states and 467 transitions. [2018-11-23 12:01:03,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-23 12:01:03,739 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 142 [2018-11-23 12:01:03,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:03,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-23 12:01:03,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 267 transitions. [2018-11-23 12:01:03,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-23 12:01:03,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 267 transitions. [2018-11-23 12:01:03,743 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 267 transitions. [2018-11-23 12:01:04,011 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 267 edges. 267 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:04,018 INFO L225 Difference]: With dead ends: 351 [2018-11-23 12:01:04,018 INFO L226 Difference]: Without dead ends: 304 [2018-11-23 12:01:04,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2461 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2626, Invalid=4346, Unknown=0, NotChecked=0, Total=6972 [2018-11-23 12:01:04,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-11-23 12:01:04,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 294. [2018-11-23 12:01:04,644 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:04,644 INFO L82 GeneralOperation]: Start isEquivalent. First operand 304 states. Second operand 294 states. [2018-11-23 12:01:04,644 INFO L74 IsIncluded]: Start isIncluded. First operand 304 states. Second operand 294 states. [2018-11-23 12:01:04,644 INFO L87 Difference]: Start difference. First operand 304 states. Second operand 294 states. [2018-11-23 12:01:04,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:04,651 INFO L93 Difference]: Finished difference Result 304 states and 404 transitions. [2018-11-23 12:01:04,651 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 404 transitions. [2018-11-23 12:01:04,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:04,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:04,652 INFO L74 IsIncluded]: Start isIncluded. First operand 294 states. Second operand 304 states. [2018-11-23 12:01:04,652 INFO L87 Difference]: Start difference. First operand 294 states. Second operand 304 states. [2018-11-23 12:01:04,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:04,658 INFO L93 Difference]: Finished difference Result 304 states and 404 transitions. [2018-11-23 12:01:04,658 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 404 transitions. [2018-11-23 12:01:04,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:04,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:04,658 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:04,658 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:04,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-11-23 12:01:04,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 389 transitions. [2018-11-23 12:01:04,664 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 389 transitions. Word has length 142 [2018-11-23 12:01:04,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:04,664 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 389 transitions. [2018-11-23 12:01:04,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-11-23 12:01:04,664 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 389 transitions. [2018-11-23 12:01:04,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-23 12:01:04,665 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:04,665 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 40, 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 12:01:04,665 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:04,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:04,665 INFO L82 PathProgramCache]: Analyzing trace with hash 2083520908, now seen corresponding path program 36 times [2018-11-23 12:01:04,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:04,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:04,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:04,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:01:04,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:04,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:06,385 INFO L256 TraceCheckUtils]: 0: Hoare triple {49551#true} call ULTIMATE.init(); {49551#true} is VALID [2018-11-23 12:01:06,385 INFO L273 TraceCheckUtils]: 1: Hoare triple {49551#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {49551#true} is VALID [2018-11-23 12:01:06,385 INFO L273 TraceCheckUtils]: 2: Hoare triple {49551#true} assume true; {49551#true} is VALID [2018-11-23 12:01:06,386 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {49551#true} {49551#true} #130#return; {49551#true} is VALID [2018-11-23 12:01:06,386 INFO L256 TraceCheckUtils]: 4: Hoare triple {49551#true} call #t~ret15 := main(); {49551#true} is VALID [2018-11-23 12:01:06,386 INFO L273 TraceCheckUtils]: 5: Hoare triple {49551#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {49553#(= main_~i~0 0)} is VALID [2018-11-23 12:01:06,387 INFO L273 TraceCheckUtils]: 6: Hoare triple {49553#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {49554#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,387 INFO L273 TraceCheckUtils]: 7: Hoare triple {49554#(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); {49554#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,388 INFO L273 TraceCheckUtils]: 8: Hoare triple {49554#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49554#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,389 INFO L273 TraceCheckUtils]: 9: Hoare triple {49554#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {49555#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,390 INFO L273 TraceCheckUtils]: 10: Hoare triple {49555#(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); {49555#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,391 INFO L273 TraceCheckUtils]: 11: Hoare triple {49555#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49555#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,391 INFO L273 TraceCheckUtils]: 12: Hoare triple {49555#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {49556#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,392 INFO L273 TraceCheckUtils]: 13: Hoare triple {49556#(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); {49556#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,393 INFO L273 TraceCheckUtils]: 14: Hoare triple {49556#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49556#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,394 INFO L273 TraceCheckUtils]: 15: Hoare triple {49556#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {49557#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,395 INFO L273 TraceCheckUtils]: 16: Hoare triple {49557#(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); {49557#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,395 INFO L273 TraceCheckUtils]: 17: Hoare triple {49557#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49557#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,396 INFO L273 TraceCheckUtils]: 18: Hoare triple {49557#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {49558#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,397 INFO L273 TraceCheckUtils]: 19: Hoare triple {49558#(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); {49558#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,398 INFO L273 TraceCheckUtils]: 20: Hoare triple {49558#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49558#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,399 INFO L273 TraceCheckUtils]: 21: Hoare triple {49558#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {49559#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,400 INFO L273 TraceCheckUtils]: 22: Hoare triple {49559#(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); {49559#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,400 INFO L273 TraceCheckUtils]: 23: Hoare triple {49559#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49559#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,401 INFO L273 TraceCheckUtils]: 24: Hoare triple {49559#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {49560#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,402 INFO L273 TraceCheckUtils]: 25: Hoare triple {49560#(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); {49560#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,403 INFO L273 TraceCheckUtils]: 26: Hoare triple {49560#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49560#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,403 INFO L273 TraceCheckUtils]: 27: Hoare triple {49560#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {49561#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,404 INFO L273 TraceCheckUtils]: 28: Hoare triple {49561#(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); {49561#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,405 INFO L273 TraceCheckUtils]: 29: Hoare triple {49561#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49561#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,406 INFO L273 TraceCheckUtils]: 30: Hoare triple {49561#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {49562#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,407 INFO L273 TraceCheckUtils]: 31: Hoare triple {49562#(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); {49562#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,407 INFO L273 TraceCheckUtils]: 32: Hoare triple {49562#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49562#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,408 INFO L273 TraceCheckUtils]: 33: Hoare triple {49562#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {49563#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,409 INFO L273 TraceCheckUtils]: 34: Hoare triple {49563#(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); {49563#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,410 INFO L273 TraceCheckUtils]: 35: Hoare triple {49563#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49563#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,411 INFO L273 TraceCheckUtils]: 36: Hoare triple {49563#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {49564#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,412 INFO L273 TraceCheckUtils]: 37: Hoare triple {49564#(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); {49564#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,412 INFO L273 TraceCheckUtils]: 38: Hoare triple {49564#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49564#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,413 INFO L273 TraceCheckUtils]: 39: Hoare triple {49564#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {49565#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,414 INFO L273 TraceCheckUtils]: 40: Hoare triple {49565#(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); {49565#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,415 INFO L273 TraceCheckUtils]: 41: Hoare triple {49565#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49565#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,416 INFO L273 TraceCheckUtils]: 42: Hoare triple {49565#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {49566#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,416 INFO L273 TraceCheckUtils]: 43: Hoare triple {49566#(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); {49566#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,417 INFO L273 TraceCheckUtils]: 44: Hoare triple {49566#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49566#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,418 INFO L273 TraceCheckUtils]: 45: Hoare triple {49566#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {49567#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,419 INFO L273 TraceCheckUtils]: 46: Hoare triple {49567#(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); {49567#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,419 INFO L273 TraceCheckUtils]: 47: Hoare triple {49567#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49567#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,420 INFO L273 TraceCheckUtils]: 48: Hoare triple {49567#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {49568#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,421 INFO L273 TraceCheckUtils]: 49: Hoare triple {49568#(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); {49568#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,422 INFO L273 TraceCheckUtils]: 50: Hoare triple {49568#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49568#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,423 INFO L273 TraceCheckUtils]: 51: Hoare triple {49568#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {49569#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,424 INFO L273 TraceCheckUtils]: 52: Hoare triple {49569#(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); {49569#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,424 INFO L273 TraceCheckUtils]: 53: Hoare triple {49569#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49569#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,425 INFO L273 TraceCheckUtils]: 54: Hoare triple {49569#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {49570#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 12:01:06,426 INFO L273 TraceCheckUtils]: 55: Hoare triple {49570#(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); {49570#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 12:01:06,427 INFO L273 TraceCheckUtils]: 56: Hoare triple {49570#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49570#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 12:01:06,428 INFO L273 TraceCheckUtils]: 57: Hoare triple {49570#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} ~k~0 := 1 + ~k~0; {49571#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,429 INFO L273 TraceCheckUtils]: 58: Hoare triple {49571#(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); {49571#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,429 INFO L273 TraceCheckUtils]: 59: Hoare triple {49571#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49571#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,430 INFO L273 TraceCheckUtils]: 60: Hoare triple {49571#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {49572#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,431 INFO L273 TraceCheckUtils]: 61: Hoare triple {49572#(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); {49572#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,432 INFO L273 TraceCheckUtils]: 62: Hoare triple {49572#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49572#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,433 INFO L273 TraceCheckUtils]: 63: Hoare triple {49572#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {49573#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,433 INFO L273 TraceCheckUtils]: 64: Hoare triple {49573#(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); {49573#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,434 INFO L273 TraceCheckUtils]: 65: Hoare triple {49573#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49573#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,435 INFO L273 TraceCheckUtils]: 66: Hoare triple {49573#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {49574#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,436 INFO L273 TraceCheckUtils]: 67: Hoare triple {49574#(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); {49574#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,436 INFO L273 TraceCheckUtils]: 68: Hoare triple {49574#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49574#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,437 INFO L273 TraceCheckUtils]: 69: Hoare triple {49574#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {49575#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,438 INFO L273 TraceCheckUtils]: 70: Hoare triple {49575#(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); {49575#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,439 INFO L273 TraceCheckUtils]: 71: Hoare triple {49575#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49575#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,440 INFO L273 TraceCheckUtils]: 72: Hoare triple {49575#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {49576#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,440 INFO L273 TraceCheckUtils]: 73: Hoare triple {49576#(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); {49576#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,441 INFO L273 TraceCheckUtils]: 74: Hoare triple {49576#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49576#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,442 INFO L273 TraceCheckUtils]: 75: Hoare triple {49576#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {49577#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,443 INFO L273 TraceCheckUtils]: 76: Hoare triple {49577#(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); {49577#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,443 INFO L273 TraceCheckUtils]: 77: Hoare triple {49577#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49577#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,444 INFO L273 TraceCheckUtils]: 78: Hoare triple {49577#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {49578#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,445 INFO L273 TraceCheckUtils]: 79: Hoare triple {49578#(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); {49578#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,446 INFO L273 TraceCheckUtils]: 80: Hoare triple {49578#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49578#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,447 INFO L273 TraceCheckUtils]: 81: Hoare triple {49578#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {49579#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,448 INFO L273 TraceCheckUtils]: 82: Hoare triple {49579#(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); {49579#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,449 INFO L273 TraceCheckUtils]: 83: Hoare triple {49579#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49579#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,449 INFO L273 TraceCheckUtils]: 84: Hoare triple {49579#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {49580#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,450 INFO L273 TraceCheckUtils]: 85: Hoare triple {49580#(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); {49580#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,451 INFO L273 TraceCheckUtils]: 86: Hoare triple {49580#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49580#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,452 INFO L273 TraceCheckUtils]: 87: Hoare triple {49580#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {49581#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,453 INFO L273 TraceCheckUtils]: 88: Hoare triple {49581#(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); {49581#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,454 INFO L273 TraceCheckUtils]: 89: Hoare triple {49581#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49581#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,455 INFO L273 TraceCheckUtils]: 90: Hoare triple {49581#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {49582#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,455 INFO L273 TraceCheckUtils]: 91: Hoare triple {49582#(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); {49582#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,456 INFO L273 TraceCheckUtils]: 92: Hoare triple {49582#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49582#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,457 INFO L273 TraceCheckUtils]: 93: Hoare triple {49582#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {49583#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,458 INFO L273 TraceCheckUtils]: 94: Hoare triple {49583#(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); {49583#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,459 INFO L273 TraceCheckUtils]: 95: Hoare triple {49583#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49583#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,460 INFO L273 TraceCheckUtils]: 96: Hoare triple {49583#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {49584#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,461 INFO L273 TraceCheckUtils]: 97: Hoare triple {49584#(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); {49584#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,461 INFO L273 TraceCheckUtils]: 98: Hoare triple {49584#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49584#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,462 INFO L273 TraceCheckUtils]: 99: Hoare triple {49584#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {49585#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,463 INFO L273 TraceCheckUtils]: 100: Hoare triple {49585#(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); {49585#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,464 INFO L273 TraceCheckUtils]: 101: Hoare triple {49585#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49585#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,465 INFO L273 TraceCheckUtils]: 102: Hoare triple {49585#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {49586#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,466 INFO L273 TraceCheckUtils]: 103: Hoare triple {49586#(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); {49586#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,466 INFO L273 TraceCheckUtils]: 104: Hoare triple {49586#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49586#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,467 INFO L273 TraceCheckUtils]: 105: Hoare triple {49586#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {49587#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,468 INFO L273 TraceCheckUtils]: 106: Hoare triple {49587#(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); {49587#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,469 INFO L273 TraceCheckUtils]: 107: Hoare triple {49587#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49587#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,470 INFO L273 TraceCheckUtils]: 108: Hoare triple {49587#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {49588#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,471 INFO L273 TraceCheckUtils]: 109: Hoare triple {49588#(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); {49588#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,471 INFO L273 TraceCheckUtils]: 110: Hoare triple {49588#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49588#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,472 INFO L273 TraceCheckUtils]: 111: Hoare triple {49588#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {49589#(and (<= main_~k~0 (+ main_~i~0 36)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,473 INFO L273 TraceCheckUtils]: 112: Hoare triple {49589#(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); {49589#(and (<= main_~k~0 (+ main_~i~0 36)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,474 INFO L273 TraceCheckUtils]: 113: Hoare triple {49589#(and (<= main_~k~0 (+ main_~i~0 36)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49589#(and (<= main_~k~0 (+ main_~i~0 36)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,475 INFO L273 TraceCheckUtils]: 114: Hoare triple {49589#(and (<= main_~k~0 (+ main_~i~0 36)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {49590#(and (<= main_~k~0 (+ main_~i~0 37)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,476 INFO L273 TraceCheckUtils]: 115: Hoare triple {49590#(and (<= main_~k~0 (+ main_~i~0 37)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {49590#(and (<= main_~k~0 (+ main_~i~0 37)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,476 INFO L273 TraceCheckUtils]: 116: Hoare triple {49590#(and (<= main_~k~0 (+ main_~i~0 37)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49590#(and (<= main_~k~0 (+ main_~i~0 37)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,477 INFO L273 TraceCheckUtils]: 117: Hoare triple {49590#(and (<= main_~k~0 (+ main_~i~0 37)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {49591#(and (<= main_~k~0 (+ main_~i~0 38)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,478 INFO L273 TraceCheckUtils]: 118: Hoare triple {49591#(and (<= main_~k~0 (+ main_~i~0 38)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {49591#(and (<= main_~k~0 (+ main_~i~0 38)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,479 INFO L273 TraceCheckUtils]: 119: Hoare triple {49591#(and (<= main_~k~0 (+ main_~i~0 38)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49591#(and (<= main_~k~0 (+ main_~i~0 38)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,480 INFO L273 TraceCheckUtils]: 120: Hoare triple {49591#(and (<= main_~k~0 (+ main_~i~0 38)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {49592#(and (<= main_~k~0 (+ main_~i~0 39)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,480 INFO L273 TraceCheckUtils]: 121: Hoare triple {49592#(and (<= main_~k~0 (+ main_~i~0 39)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {49592#(and (<= main_~k~0 (+ main_~i~0 39)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,481 INFO L273 TraceCheckUtils]: 122: Hoare triple {49592#(and (<= main_~k~0 (+ main_~i~0 39)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49592#(and (<= main_~k~0 (+ main_~i~0 39)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,482 INFO L273 TraceCheckUtils]: 123: Hoare triple {49592#(and (<= main_~k~0 (+ main_~i~0 39)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {49593#(and (<= main_~k~0 (+ main_~i~0 40)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,483 INFO L273 TraceCheckUtils]: 124: Hoare triple {49593#(and (<= main_~k~0 (+ main_~i~0 40)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {49593#(and (<= main_~k~0 (+ main_~i~0 40)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,484 INFO L273 TraceCheckUtils]: 125: Hoare triple {49593#(and (<= main_~k~0 (+ main_~i~0 40)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49593#(and (<= main_~k~0 (+ main_~i~0 40)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,484 INFO L273 TraceCheckUtils]: 126: Hoare triple {49593#(and (<= main_~k~0 (+ main_~i~0 40)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {49594#(and (<= main_~k~0 (+ main_~i~0 41)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:06,485 INFO L273 TraceCheckUtils]: 127: Hoare triple {49594#(and (<= main_~k~0 (+ main_~i~0 41)) (= main_~i~0 0))} assume !(~k~0 < 100000); {49552#false} is VALID [2018-11-23 12:01:06,485 INFO L273 TraceCheckUtils]: 128: Hoare triple {49552#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); {49552#false} is VALID [2018-11-23 12:01:06,486 INFO L273 TraceCheckUtils]: 129: Hoare triple {49552#false} ~x~0 := 0; {49552#false} is VALID [2018-11-23 12:01:06,486 INFO L273 TraceCheckUtils]: 130: Hoare triple {49552#false} assume !(~x~0 < ~i~0); {49552#false} is VALID [2018-11-23 12:01:06,486 INFO L273 TraceCheckUtils]: 131: Hoare triple {49552#false} ~x~0 := ~i~0; {49552#false} is VALID [2018-11-23 12:01:06,486 INFO L273 TraceCheckUtils]: 132: Hoare triple {49552#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); {49552#false} is VALID [2018-11-23 12:01:06,486 INFO L256 TraceCheckUtils]: 133: Hoare triple {49552#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {49551#true} is VALID [2018-11-23 12:01:06,486 INFO L273 TraceCheckUtils]: 134: Hoare triple {49551#true} ~cond := #in~cond; {49551#true} is VALID [2018-11-23 12:01:06,487 INFO L273 TraceCheckUtils]: 135: Hoare triple {49551#true} assume !(0 == ~cond); {49551#true} is VALID [2018-11-23 12:01:06,487 INFO L273 TraceCheckUtils]: 136: Hoare triple {49551#true} assume true; {49551#true} is VALID [2018-11-23 12:01:06,487 INFO L268 TraceCheckUtils]: 137: Hoare quadruple {49551#true} {49552#false} #136#return; {49552#false} is VALID [2018-11-23 12:01:06,487 INFO L273 TraceCheckUtils]: 138: Hoare triple {49552#false} havoc #t~mem9;havoc #t~mem10; {49552#false} is VALID [2018-11-23 12:01:06,487 INFO L273 TraceCheckUtils]: 139: Hoare triple {49552#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {49552#false} is VALID [2018-11-23 12:01:06,488 INFO L273 TraceCheckUtils]: 140: Hoare triple {49552#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); {49552#false} is VALID [2018-11-23 12:01:06,488 INFO L256 TraceCheckUtils]: 141: Hoare triple {49552#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {49552#false} is VALID [2018-11-23 12:01:06,488 INFO L273 TraceCheckUtils]: 142: Hoare triple {49552#false} ~cond := #in~cond; {49552#false} is VALID [2018-11-23 12:01:06,488 INFO L273 TraceCheckUtils]: 143: Hoare triple {49552#false} assume 0 == ~cond; {49552#false} is VALID [2018-11-23 12:01:06,488 INFO L273 TraceCheckUtils]: 144: Hoare triple {49552#false} assume !false; {49552#false} is VALID [2018-11-23 12:01:06,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2384 backedges. 2 proven. 2380 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 12:01:06,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:06,518 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:01:06,527 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:01:06,879 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 41 check-sat command(s) [2018-11-23 12:01:06,879 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:01:06,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:06,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:01:08,420 INFO L256 TraceCheckUtils]: 0: Hoare triple {49551#true} call ULTIMATE.init(); {49551#true} is VALID [2018-11-23 12:01:08,421 INFO L273 TraceCheckUtils]: 1: Hoare triple {49551#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {49551#true} is VALID [2018-11-23 12:01:08,421 INFO L273 TraceCheckUtils]: 2: Hoare triple {49551#true} assume true; {49551#true} is VALID [2018-11-23 12:01:08,421 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {49551#true} {49551#true} #130#return; {49551#true} is VALID [2018-11-23 12:01:08,421 INFO L256 TraceCheckUtils]: 4: Hoare triple {49551#true} call #t~ret15 := main(); {49551#true} is VALID [2018-11-23 12:01:08,423 INFO L273 TraceCheckUtils]: 5: Hoare triple {49551#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {49613#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:08,423 INFO L273 TraceCheckUtils]: 6: Hoare triple {49613#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {49617#(<= main_~k~0 1)} is VALID [2018-11-23 12:01:08,424 INFO L273 TraceCheckUtils]: 7: Hoare triple {49617#(<= 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); {49617#(<= main_~k~0 1)} is VALID [2018-11-23 12:01:08,424 INFO L273 TraceCheckUtils]: 8: Hoare triple {49617#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49617#(<= main_~k~0 1)} is VALID [2018-11-23 12:01:08,424 INFO L273 TraceCheckUtils]: 9: Hoare triple {49617#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {49627#(<= main_~k~0 2)} is VALID [2018-11-23 12:01:08,425 INFO L273 TraceCheckUtils]: 10: Hoare triple {49627#(<= 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); {49627#(<= main_~k~0 2)} is VALID [2018-11-23 12:01:08,425 INFO L273 TraceCheckUtils]: 11: Hoare triple {49627#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49627#(<= main_~k~0 2)} is VALID [2018-11-23 12:01:08,426 INFO L273 TraceCheckUtils]: 12: Hoare triple {49627#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {49637#(<= main_~k~0 3)} is VALID [2018-11-23 12:01:08,426 INFO L273 TraceCheckUtils]: 13: Hoare triple {49637#(<= 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); {49637#(<= main_~k~0 3)} is VALID [2018-11-23 12:01:08,427 INFO L273 TraceCheckUtils]: 14: Hoare triple {49637#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49637#(<= main_~k~0 3)} is VALID [2018-11-23 12:01:08,427 INFO L273 TraceCheckUtils]: 15: Hoare triple {49637#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {49647#(<= main_~k~0 4)} is VALID [2018-11-23 12:01:08,428 INFO L273 TraceCheckUtils]: 16: Hoare triple {49647#(<= 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); {49647#(<= main_~k~0 4)} is VALID [2018-11-23 12:01:08,428 INFO L273 TraceCheckUtils]: 17: Hoare triple {49647#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49647#(<= main_~k~0 4)} is VALID [2018-11-23 12:01:08,429 INFO L273 TraceCheckUtils]: 18: Hoare triple {49647#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {49657#(<= main_~k~0 5)} is VALID [2018-11-23 12:01:08,430 INFO L273 TraceCheckUtils]: 19: Hoare triple {49657#(<= 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); {49657#(<= main_~k~0 5)} is VALID [2018-11-23 12:01:08,430 INFO L273 TraceCheckUtils]: 20: Hoare triple {49657#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49657#(<= main_~k~0 5)} is VALID [2018-11-23 12:01:08,431 INFO L273 TraceCheckUtils]: 21: Hoare triple {49657#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {49667#(<= main_~k~0 6)} is VALID [2018-11-23 12:01:08,431 INFO L273 TraceCheckUtils]: 22: Hoare triple {49667#(<= 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); {49667#(<= main_~k~0 6)} is VALID [2018-11-23 12:01:08,432 INFO L273 TraceCheckUtils]: 23: Hoare triple {49667#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49667#(<= main_~k~0 6)} is VALID [2018-11-23 12:01:08,433 INFO L273 TraceCheckUtils]: 24: Hoare triple {49667#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {49677#(<= main_~k~0 7)} is VALID [2018-11-23 12:01:08,433 INFO L273 TraceCheckUtils]: 25: Hoare triple {49677#(<= 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); {49677#(<= main_~k~0 7)} is VALID [2018-11-23 12:01:08,434 INFO L273 TraceCheckUtils]: 26: Hoare triple {49677#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49677#(<= main_~k~0 7)} is VALID [2018-11-23 12:01:08,434 INFO L273 TraceCheckUtils]: 27: Hoare triple {49677#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {49687#(<= main_~k~0 8)} is VALID [2018-11-23 12:01:08,435 INFO L273 TraceCheckUtils]: 28: Hoare triple {49687#(<= 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); {49687#(<= main_~k~0 8)} is VALID [2018-11-23 12:01:08,435 INFO L273 TraceCheckUtils]: 29: Hoare triple {49687#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49687#(<= main_~k~0 8)} is VALID [2018-11-23 12:01:08,436 INFO L273 TraceCheckUtils]: 30: Hoare triple {49687#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {49697#(<= main_~k~0 9)} is VALID [2018-11-23 12:01:08,437 INFO L273 TraceCheckUtils]: 31: Hoare triple {49697#(<= 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); {49697#(<= main_~k~0 9)} is VALID [2018-11-23 12:01:08,437 INFO L273 TraceCheckUtils]: 32: Hoare triple {49697#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49697#(<= main_~k~0 9)} is VALID [2018-11-23 12:01:08,438 INFO L273 TraceCheckUtils]: 33: Hoare triple {49697#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {49707#(<= main_~k~0 10)} is VALID [2018-11-23 12:01:08,439 INFO L273 TraceCheckUtils]: 34: Hoare triple {49707#(<= 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); {49707#(<= main_~k~0 10)} is VALID [2018-11-23 12:01:08,439 INFO L273 TraceCheckUtils]: 35: Hoare triple {49707#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49707#(<= main_~k~0 10)} is VALID [2018-11-23 12:01:08,440 INFO L273 TraceCheckUtils]: 36: Hoare triple {49707#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {49717#(<= main_~k~0 11)} is VALID [2018-11-23 12:01:08,440 INFO L273 TraceCheckUtils]: 37: Hoare triple {49717#(<= 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); {49717#(<= main_~k~0 11)} is VALID [2018-11-23 12:01:08,441 INFO L273 TraceCheckUtils]: 38: Hoare triple {49717#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49717#(<= main_~k~0 11)} is VALID [2018-11-23 12:01:08,442 INFO L273 TraceCheckUtils]: 39: Hoare triple {49717#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {49727#(<= main_~k~0 12)} is VALID [2018-11-23 12:01:08,442 INFO L273 TraceCheckUtils]: 40: Hoare triple {49727#(<= 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); {49727#(<= main_~k~0 12)} is VALID [2018-11-23 12:01:08,443 INFO L273 TraceCheckUtils]: 41: Hoare triple {49727#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49727#(<= main_~k~0 12)} is VALID [2018-11-23 12:01:08,443 INFO L273 TraceCheckUtils]: 42: Hoare triple {49727#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {49737#(<= main_~k~0 13)} is VALID [2018-11-23 12:01:08,444 INFO L273 TraceCheckUtils]: 43: Hoare triple {49737#(<= 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); {49737#(<= main_~k~0 13)} is VALID [2018-11-23 12:01:08,444 INFO L273 TraceCheckUtils]: 44: Hoare triple {49737#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49737#(<= main_~k~0 13)} is VALID [2018-11-23 12:01:08,445 INFO L273 TraceCheckUtils]: 45: Hoare triple {49737#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {49747#(<= main_~k~0 14)} is VALID [2018-11-23 12:01:08,446 INFO L273 TraceCheckUtils]: 46: Hoare triple {49747#(<= 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); {49747#(<= main_~k~0 14)} is VALID [2018-11-23 12:01:08,446 INFO L273 TraceCheckUtils]: 47: Hoare triple {49747#(<= main_~k~0 14)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49747#(<= main_~k~0 14)} is VALID [2018-11-23 12:01:08,447 INFO L273 TraceCheckUtils]: 48: Hoare triple {49747#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {49757#(<= main_~k~0 15)} is VALID [2018-11-23 12:01:08,447 INFO L273 TraceCheckUtils]: 49: Hoare triple {49757#(<= 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); {49757#(<= main_~k~0 15)} is VALID [2018-11-23 12:01:08,448 INFO L273 TraceCheckUtils]: 50: Hoare triple {49757#(<= main_~k~0 15)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49757#(<= main_~k~0 15)} is VALID [2018-11-23 12:01:08,449 INFO L273 TraceCheckUtils]: 51: Hoare triple {49757#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {49767#(<= main_~k~0 16)} is VALID [2018-11-23 12:01:08,449 INFO L273 TraceCheckUtils]: 52: Hoare triple {49767#(<= 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); {49767#(<= main_~k~0 16)} is VALID [2018-11-23 12:01:08,450 INFO L273 TraceCheckUtils]: 53: Hoare triple {49767#(<= main_~k~0 16)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49767#(<= main_~k~0 16)} is VALID [2018-11-23 12:01:08,450 INFO L273 TraceCheckUtils]: 54: Hoare triple {49767#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {49777#(<= main_~k~0 17)} is VALID [2018-11-23 12:01:08,451 INFO L273 TraceCheckUtils]: 55: Hoare triple {49777#(<= 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); {49777#(<= main_~k~0 17)} is VALID [2018-11-23 12:01:08,451 INFO L273 TraceCheckUtils]: 56: Hoare triple {49777#(<= main_~k~0 17)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49777#(<= main_~k~0 17)} is VALID [2018-11-23 12:01:08,452 INFO L273 TraceCheckUtils]: 57: Hoare triple {49777#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {49787#(<= main_~k~0 18)} is VALID [2018-11-23 12:01:08,453 INFO L273 TraceCheckUtils]: 58: Hoare triple {49787#(<= 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); {49787#(<= main_~k~0 18)} is VALID [2018-11-23 12:01:08,453 INFO L273 TraceCheckUtils]: 59: Hoare triple {49787#(<= main_~k~0 18)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49787#(<= main_~k~0 18)} is VALID [2018-11-23 12:01:08,454 INFO L273 TraceCheckUtils]: 60: Hoare triple {49787#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {49797#(<= main_~k~0 19)} is VALID [2018-11-23 12:01:08,454 INFO L273 TraceCheckUtils]: 61: Hoare triple {49797#(<= 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); {49797#(<= main_~k~0 19)} is VALID [2018-11-23 12:01:08,455 INFO L273 TraceCheckUtils]: 62: Hoare triple {49797#(<= main_~k~0 19)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49797#(<= main_~k~0 19)} is VALID [2018-11-23 12:01:08,456 INFO L273 TraceCheckUtils]: 63: Hoare triple {49797#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {49807#(<= main_~k~0 20)} is VALID [2018-11-23 12:01:08,456 INFO L273 TraceCheckUtils]: 64: Hoare triple {49807#(<= 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); {49807#(<= main_~k~0 20)} is VALID [2018-11-23 12:01:08,457 INFO L273 TraceCheckUtils]: 65: Hoare triple {49807#(<= main_~k~0 20)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49807#(<= main_~k~0 20)} is VALID [2018-11-23 12:01:08,457 INFO L273 TraceCheckUtils]: 66: Hoare triple {49807#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {49817#(<= main_~k~0 21)} is VALID [2018-11-23 12:01:08,458 INFO L273 TraceCheckUtils]: 67: Hoare triple {49817#(<= 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); {49817#(<= main_~k~0 21)} is VALID [2018-11-23 12:01:08,459 INFO L273 TraceCheckUtils]: 68: Hoare triple {49817#(<= main_~k~0 21)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49817#(<= main_~k~0 21)} is VALID [2018-11-23 12:01:08,459 INFO L273 TraceCheckUtils]: 69: Hoare triple {49817#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {49827#(<= main_~k~0 22)} is VALID [2018-11-23 12:01:08,460 INFO L273 TraceCheckUtils]: 70: Hoare triple {49827#(<= 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); {49827#(<= main_~k~0 22)} is VALID [2018-11-23 12:01:08,460 INFO L273 TraceCheckUtils]: 71: Hoare triple {49827#(<= main_~k~0 22)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49827#(<= main_~k~0 22)} is VALID [2018-11-23 12:01:08,461 INFO L273 TraceCheckUtils]: 72: Hoare triple {49827#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {49837#(<= main_~k~0 23)} is VALID [2018-11-23 12:01:08,462 INFO L273 TraceCheckUtils]: 73: Hoare triple {49837#(<= 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); {49837#(<= main_~k~0 23)} is VALID [2018-11-23 12:01:08,462 INFO L273 TraceCheckUtils]: 74: Hoare triple {49837#(<= main_~k~0 23)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49837#(<= main_~k~0 23)} is VALID [2018-11-23 12:01:08,463 INFO L273 TraceCheckUtils]: 75: Hoare triple {49837#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {49847#(<= main_~k~0 24)} is VALID [2018-11-23 12:01:08,463 INFO L273 TraceCheckUtils]: 76: Hoare triple {49847#(<= 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); {49847#(<= main_~k~0 24)} is VALID [2018-11-23 12:01:08,464 INFO L273 TraceCheckUtils]: 77: Hoare triple {49847#(<= main_~k~0 24)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49847#(<= main_~k~0 24)} is VALID [2018-11-23 12:01:08,465 INFO L273 TraceCheckUtils]: 78: Hoare triple {49847#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {49857#(<= main_~k~0 25)} is VALID [2018-11-23 12:01:08,465 INFO L273 TraceCheckUtils]: 79: Hoare triple {49857#(<= 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); {49857#(<= main_~k~0 25)} is VALID [2018-11-23 12:01:08,466 INFO L273 TraceCheckUtils]: 80: Hoare triple {49857#(<= main_~k~0 25)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49857#(<= main_~k~0 25)} is VALID [2018-11-23 12:01:08,466 INFO L273 TraceCheckUtils]: 81: Hoare triple {49857#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {49867#(<= main_~k~0 26)} is VALID [2018-11-23 12:01:08,467 INFO L273 TraceCheckUtils]: 82: Hoare triple {49867#(<= 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); {49867#(<= main_~k~0 26)} is VALID [2018-11-23 12:01:08,467 INFO L273 TraceCheckUtils]: 83: Hoare triple {49867#(<= main_~k~0 26)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49867#(<= main_~k~0 26)} is VALID [2018-11-23 12:01:08,468 INFO L273 TraceCheckUtils]: 84: Hoare triple {49867#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {49877#(<= main_~k~0 27)} is VALID [2018-11-23 12:01:08,469 INFO L273 TraceCheckUtils]: 85: Hoare triple {49877#(<= 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); {49877#(<= main_~k~0 27)} is VALID [2018-11-23 12:01:08,469 INFO L273 TraceCheckUtils]: 86: Hoare triple {49877#(<= main_~k~0 27)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49877#(<= main_~k~0 27)} is VALID [2018-11-23 12:01:08,470 INFO L273 TraceCheckUtils]: 87: Hoare triple {49877#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {49887#(<= main_~k~0 28)} is VALID [2018-11-23 12:01:08,470 INFO L273 TraceCheckUtils]: 88: Hoare triple {49887#(<= 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); {49887#(<= main_~k~0 28)} is VALID [2018-11-23 12:01:08,471 INFO L273 TraceCheckUtils]: 89: Hoare triple {49887#(<= main_~k~0 28)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49887#(<= main_~k~0 28)} is VALID [2018-11-23 12:01:08,472 INFO L273 TraceCheckUtils]: 90: Hoare triple {49887#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {49897#(<= main_~k~0 29)} is VALID [2018-11-23 12:01:08,472 INFO L273 TraceCheckUtils]: 91: Hoare triple {49897#(<= 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); {49897#(<= main_~k~0 29)} is VALID [2018-11-23 12:01:08,473 INFO L273 TraceCheckUtils]: 92: Hoare triple {49897#(<= main_~k~0 29)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49897#(<= main_~k~0 29)} is VALID [2018-11-23 12:01:08,473 INFO L273 TraceCheckUtils]: 93: Hoare triple {49897#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {49907#(<= main_~k~0 30)} is VALID [2018-11-23 12:01:08,474 INFO L273 TraceCheckUtils]: 94: Hoare triple {49907#(<= 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); {49907#(<= main_~k~0 30)} is VALID [2018-11-23 12:01:08,474 INFO L273 TraceCheckUtils]: 95: Hoare triple {49907#(<= main_~k~0 30)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49907#(<= main_~k~0 30)} is VALID [2018-11-23 12:01:08,475 INFO L273 TraceCheckUtils]: 96: Hoare triple {49907#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {49917#(<= main_~k~0 31)} is VALID [2018-11-23 12:01:08,476 INFO L273 TraceCheckUtils]: 97: Hoare triple {49917#(<= 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); {49917#(<= main_~k~0 31)} is VALID [2018-11-23 12:01:08,476 INFO L273 TraceCheckUtils]: 98: Hoare triple {49917#(<= main_~k~0 31)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49917#(<= main_~k~0 31)} is VALID [2018-11-23 12:01:08,477 INFO L273 TraceCheckUtils]: 99: Hoare triple {49917#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {49927#(<= main_~k~0 32)} is VALID [2018-11-23 12:01:08,477 INFO L273 TraceCheckUtils]: 100: Hoare triple {49927#(<= 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); {49927#(<= main_~k~0 32)} is VALID [2018-11-23 12:01:08,478 INFO L273 TraceCheckUtils]: 101: Hoare triple {49927#(<= main_~k~0 32)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49927#(<= main_~k~0 32)} is VALID [2018-11-23 12:01:08,479 INFO L273 TraceCheckUtils]: 102: Hoare triple {49927#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {49937#(<= main_~k~0 33)} is VALID [2018-11-23 12:01:08,479 INFO L273 TraceCheckUtils]: 103: Hoare triple {49937#(<= 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); {49937#(<= main_~k~0 33)} is VALID [2018-11-23 12:01:08,480 INFO L273 TraceCheckUtils]: 104: Hoare triple {49937#(<= main_~k~0 33)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49937#(<= main_~k~0 33)} is VALID [2018-11-23 12:01:08,480 INFO L273 TraceCheckUtils]: 105: Hoare triple {49937#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {49947#(<= main_~k~0 34)} is VALID [2018-11-23 12:01:08,481 INFO L273 TraceCheckUtils]: 106: Hoare triple {49947#(<= 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); {49947#(<= main_~k~0 34)} is VALID [2018-11-23 12:01:08,481 INFO L273 TraceCheckUtils]: 107: Hoare triple {49947#(<= main_~k~0 34)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49947#(<= main_~k~0 34)} is VALID [2018-11-23 12:01:08,482 INFO L273 TraceCheckUtils]: 108: Hoare triple {49947#(<= main_~k~0 34)} ~k~0 := 1 + ~k~0; {49957#(<= main_~k~0 35)} is VALID [2018-11-23 12:01:08,483 INFO L273 TraceCheckUtils]: 109: Hoare triple {49957#(<= 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); {49957#(<= main_~k~0 35)} is VALID [2018-11-23 12:01:08,483 INFO L273 TraceCheckUtils]: 110: Hoare triple {49957#(<= main_~k~0 35)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49957#(<= main_~k~0 35)} is VALID [2018-11-23 12:01:08,484 INFO L273 TraceCheckUtils]: 111: Hoare triple {49957#(<= main_~k~0 35)} ~k~0 := 1 + ~k~0; {49967#(<= main_~k~0 36)} is VALID [2018-11-23 12:01:08,484 INFO L273 TraceCheckUtils]: 112: Hoare triple {49967#(<= 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); {49967#(<= main_~k~0 36)} is VALID [2018-11-23 12:01:08,485 INFO L273 TraceCheckUtils]: 113: Hoare triple {49967#(<= main_~k~0 36)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49967#(<= main_~k~0 36)} is VALID [2018-11-23 12:01:08,486 INFO L273 TraceCheckUtils]: 114: Hoare triple {49967#(<= main_~k~0 36)} ~k~0 := 1 + ~k~0; {49977#(<= main_~k~0 37)} is VALID [2018-11-23 12:01:08,486 INFO L273 TraceCheckUtils]: 115: Hoare triple {49977#(<= main_~k~0 37)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {49977#(<= main_~k~0 37)} is VALID [2018-11-23 12:01:08,487 INFO L273 TraceCheckUtils]: 116: Hoare triple {49977#(<= main_~k~0 37)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49977#(<= main_~k~0 37)} is VALID [2018-11-23 12:01:08,487 INFO L273 TraceCheckUtils]: 117: Hoare triple {49977#(<= main_~k~0 37)} ~k~0 := 1 + ~k~0; {49987#(<= main_~k~0 38)} is VALID [2018-11-23 12:01:08,488 INFO L273 TraceCheckUtils]: 118: Hoare triple {49987#(<= main_~k~0 38)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {49987#(<= main_~k~0 38)} is VALID [2018-11-23 12:01:08,489 INFO L273 TraceCheckUtils]: 119: Hoare triple {49987#(<= main_~k~0 38)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49987#(<= main_~k~0 38)} is VALID [2018-11-23 12:01:08,489 INFO L273 TraceCheckUtils]: 120: Hoare triple {49987#(<= main_~k~0 38)} ~k~0 := 1 + ~k~0; {49997#(<= main_~k~0 39)} is VALID [2018-11-23 12:01:08,490 INFO L273 TraceCheckUtils]: 121: Hoare triple {49997#(<= main_~k~0 39)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {49997#(<= main_~k~0 39)} is VALID [2018-11-23 12:01:08,490 INFO L273 TraceCheckUtils]: 122: Hoare triple {49997#(<= main_~k~0 39)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {49997#(<= main_~k~0 39)} is VALID [2018-11-23 12:01:08,491 INFO L273 TraceCheckUtils]: 123: Hoare triple {49997#(<= main_~k~0 39)} ~k~0 := 1 + ~k~0; {50007#(<= main_~k~0 40)} is VALID [2018-11-23 12:01:08,492 INFO L273 TraceCheckUtils]: 124: Hoare triple {50007#(<= main_~k~0 40)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50007#(<= main_~k~0 40)} is VALID [2018-11-23 12:01:08,492 INFO L273 TraceCheckUtils]: 125: Hoare triple {50007#(<= main_~k~0 40)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {50007#(<= main_~k~0 40)} is VALID [2018-11-23 12:01:08,493 INFO L273 TraceCheckUtils]: 126: Hoare triple {50007#(<= main_~k~0 40)} ~k~0 := 1 + ~k~0; {50017#(<= main_~k~0 41)} is VALID [2018-11-23 12:01:08,493 INFO L273 TraceCheckUtils]: 127: Hoare triple {50017#(<= main_~k~0 41)} assume !(~k~0 < 100000); {49552#false} is VALID [2018-11-23 12:01:08,494 INFO L273 TraceCheckUtils]: 128: Hoare triple {49552#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); {49552#false} is VALID [2018-11-23 12:01:08,494 INFO L273 TraceCheckUtils]: 129: Hoare triple {49552#false} ~x~0 := 0; {49552#false} is VALID [2018-11-23 12:01:08,494 INFO L273 TraceCheckUtils]: 130: Hoare triple {49552#false} assume !(~x~0 < ~i~0); {49552#false} is VALID [2018-11-23 12:01:08,494 INFO L273 TraceCheckUtils]: 131: Hoare triple {49552#false} ~x~0 := ~i~0; {49552#false} is VALID [2018-11-23 12:01:08,494 INFO L273 TraceCheckUtils]: 132: Hoare triple {49552#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); {49552#false} is VALID [2018-11-23 12:01:08,495 INFO L256 TraceCheckUtils]: 133: Hoare triple {49552#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {49552#false} is VALID [2018-11-23 12:01:08,495 INFO L273 TraceCheckUtils]: 134: Hoare triple {49552#false} ~cond := #in~cond; {49552#false} is VALID [2018-11-23 12:01:08,495 INFO L273 TraceCheckUtils]: 135: Hoare triple {49552#false} assume !(0 == ~cond); {49552#false} is VALID [2018-11-23 12:01:08,495 INFO L273 TraceCheckUtils]: 136: Hoare triple {49552#false} assume true; {49552#false} is VALID [2018-11-23 12:01:08,495 INFO L268 TraceCheckUtils]: 137: Hoare quadruple {49552#false} {49552#false} #136#return; {49552#false} is VALID [2018-11-23 12:01:08,495 INFO L273 TraceCheckUtils]: 138: Hoare triple {49552#false} havoc #t~mem9;havoc #t~mem10; {49552#false} is VALID [2018-11-23 12:01:08,496 INFO L273 TraceCheckUtils]: 139: Hoare triple {49552#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {49552#false} is VALID [2018-11-23 12:01:08,496 INFO L273 TraceCheckUtils]: 140: Hoare triple {49552#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); {49552#false} is VALID [2018-11-23 12:01:08,496 INFO L256 TraceCheckUtils]: 141: Hoare triple {49552#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {49552#false} is VALID [2018-11-23 12:01:08,496 INFO L273 TraceCheckUtils]: 142: Hoare triple {49552#false} ~cond := #in~cond; {49552#false} is VALID [2018-11-23 12:01:08,496 INFO L273 TraceCheckUtils]: 143: Hoare triple {49552#false} assume 0 == ~cond; {49552#false} is VALID [2018-11-23 12:01:08,496 INFO L273 TraceCheckUtils]: 144: Hoare triple {49552#false} assume !false; {49552#false} is VALID [2018-11-23 12:01:08,509 INFO L134 CoverageAnalysis]: Checked inductivity of 2384 backedges. 0 proven. 2380 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 12:01:08,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:01:08,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 86 [2018-11-23 12:01:08,530 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 145 [2018-11-23 12:01:08,531 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:08,531 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 86 states. [2018-11-23 12:01:08,813 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 270 edges. 270 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:08,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-11-23 12:01:08,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-11-23 12:01:08,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2753, Invalid=4557, Unknown=0, NotChecked=0, Total=7310 [2018-11-23 12:01:08,816 INFO L87 Difference]: Start difference. First operand 294 states and 389 transitions. Second operand 86 states. [2018-11-23 12:01:10,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:10,644 INFO L93 Difference]: Finished difference Result 357 states and 475 transitions. [2018-11-23 12:01:10,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-23 12:01:10,644 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 145 [2018-11-23 12:01:10,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:10,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-23 12:01:10,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 271 transitions. [2018-11-23 12:01:10,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-23 12:01:10,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 271 transitions. [2018-11-23 12:01:10,647 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states and 271 transitions. [2018-11-23 12:01:10,988 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 271 edges. 271 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:10,995 INFO L225 Difference]: With dead ends: 357 [2018-11-23 12:01:10,995 INFO L226 Difference]: Without dead ends: 310 [2018-11-23 12:01:10,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2584 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2753, Invalid=4557, Unknown=0, NotChecked=0, Total=7310 [2018-11-23 12:01:10,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-11-23 12:01:11,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 300. [2018-11-23 12:01:11,600 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:11,600 INFO L82 GeneralOperation]: Start isEquivalent. First operand 310 states. Second operand 300 states. [2018-11-23 12:01:11,600 INFO L74 IsIncluded]: Start isIncluded. First operand 310 states. Second operand 300 states. [2018-11-23 12:01:11,600 INFO L87 Difference]: Start difference. First operand 310 states. Second operand 300 states. [2018-11-23 12:01:11,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:11,607 INFO L93 Difference]: Finished difference Result 310 states and 412 transitions. [2018-11-23 12:01:11,607 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 412 transitions. [2018-11-23 12:01:11,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:11,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:11,607 INFO L74 IsIncluded]: Start isIncluded. First operand 300 states. Second operand 310 states. [2018-11-23 12:01:11,607 INFO L87 Difference]: Start difference. First operand 300 states. Second operand 310 states. [2018-11-23 12:01:11,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:11,613 INFO L93 Difference]: Finished difference Result 310 states and 412 transitions. [2018-11-23 12:01:11,613 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 412 transitions. [2018-11-23 12:01:11,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:11,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:11,614 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:11,614 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:11,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-11-23 12:01:11,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 397 transitions. [2018-11-23 12:01:11,619 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 397 transitions. Word has length 145 [2018-11-23 12:01:11,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:11,620 INFO L480 AbstractCegarLoop]: Abstraction has 300 states and 397 transitions. [2018-11-23 12:01:11,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-11-23 12:01:11,620 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 397 transitions. [2018-11-23 12:01:11,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-11-23 12:01:11,620 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:11,620 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 41, 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 12:01:11,621 INFO L423 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:11,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:11,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1859756175, now seen corresponding path program 37 times [2018-11-23 12:01:11,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:11,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:11,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:11,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:01:11,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:11,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:13,209 INFO L256 TraceCheckUtils]: 0: Hoare triple {51578#true} call ULTIMATE.init(); {51578#true} is VALID [2018-11-23 12:01:13,209 INFO L273 TraceCheckUtils]: 1: Hoare triple {51578#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {51578#true} is VALID [2018-11-23 12:01:13,209 INFO L273 TraceCheckUtils]: 2: Hoare triple {51578#true} assume true; {51578#true} is VALID [2018-11-23 12:01:13,209 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {51578#true} {51578#true} #130#return; {51578#true} is VALID [2018-11-23 12:01:13,209 INFO L256 TraceCheckUtils]: 4: Hoare triple {51578#true} call #t~ret15 := main(); {51578#true} is VALID [2018-11-23 12:01:13,210 INFO L273 TraceCheckUtils]: 5: Hoare triple {51578#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {51580#(= main_~i~0 0)} is VALID [2018-11-23 12:01:13,210 INFO L273 TraceCheckUtils]: 6: Hoare triple {51580#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {51581#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,211 INFO L273 TraceCheckUtils]: 7: Hoare triple {51581#(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); {51581#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,211 INFO L273 TraceCheckUtils]: 8: Hoare triple {51581#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51581#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,212 INFO L273 TraceCheckUtils]: 9: Hoare triple {51581#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {51582#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,213 INFO L273 TraceCheckUtils]: 10: Hoare triple {51582#(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); {51582#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,214 INFO L273 TraceCheckUtils]: 11: Hoare triple {51582#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51582#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,214 INFO L273 TraceCheckUtils]: 12: Hoare triple {51582#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {51583#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,215 INFO L273 TraceCheckUtils]: 13: Hoare triple {51583#(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); {51583#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,216 INFO L273 TraceCheckUtils]: 14: Hoare triple {51583#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51583#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,217 INFO L273 TraceCheckUtils]: 15: Hoare triple {51583#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {51584#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,218 INFO L273 TraceCheckUtils]: 16: Hoare triple {51584#(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); {51584#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,218 INFO L273 TraceCheckUtils]: 17: Hoare triple {51584#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51584#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,219 INFO L273 TraceCheckUtils]: 18: Hoare triple {51584#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {51585#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,220 INFO L273 TraceCheckUtils]: 19: Hoare triple {51585#(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); {51585#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,221 INFO L273 TraceCheckUtils]: 20: Hoare triple {51585#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51585#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,222 INFO L273 TraceCheckUtils]: 21: Hoare triple {51585#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {51586#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,223 INFO L273 TraceCheckUtils]: 22: Hoare triple {51586#(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); {51586#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,223 INFO L273 TraceCheckUtils]: 23: Hoare triple {51586#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51586#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,224 INFO L273 TraceCheckUtils]: 24: Hoare triple {51586#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {51587#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,225 INFO L273 TraceCheckUtils]: 25: Hoare triple {51587#(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); {51587#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,226 INFO L273 TraceCheckUtils]: 26: Hoare triple {51587#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51587#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,227 INFO L273 TraceCheckUtils]: 27: Hoare triple {51587#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {51588#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,227 INFO L273 TraceCheckUtils]: 28: Hoare triple {51588#(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); {51588#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,228 INFO L273 TraceCheckUtils]: 29: Hoare triple {51588#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51588#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,229 INFO L273 TraceCheckUtils]: 30: Hoare triple {51588#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {51589#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,230 INFO L273 TraceCheckUtils]: 31: Hoare triple {51589#(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); {51589#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,231 INFO L273 TraceCheckUtils]: 32: Hoare triple {51589#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51589#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,231 INFO L273 TraceCheckUtils]: 33: Hoare triple {51589#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {51590#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,232 INFO L273 TraceCheckUtils]: 34: Hoare triple {51590#(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); {51590#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,233 INFO L273 TraceCheckUtils]: 35: Hoare triple {51590#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51590#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,234 INFO L273 TraceCheckUtils]: 36: Hoare triple {51590#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {51591#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,235 INFO L273 TraceCheckUtils]: 37: Hoare triple {51591#(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); {51591#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,236 INFO L273 TraceCheckUtils]: 38: Hoare triple {51591#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51591#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,236 INFO L273 TraceCheckUtils]: 39: Hoare triple {51591#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {51592#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,237 INFO L273 TraceCheckUtils]: 40: Hoare triple {51592#(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); {51592#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,238 INFO L273 TraceCheckUtils]: 41: Hoare triple {51592#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51592#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,239 INFO L273 TraceCheckUtils]: 42: Hoare triple {51592#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {51593#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,240 INFO L273 TraceCheckUtils]: 43: Hoare triple {51593#(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); {51593#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,240 INFO L273 TraceCheckUtils]: 44: Hoare triple {51593#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51593#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,241 INFO L273 TraceCheckUtils]: 45: Hoare triple {51593#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {51594#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,242 INFO L273 TraceCheckUtils]: 46: Hoare triple {51594#(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); {51594#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,243 INFO L273 TraceCheckUtils]: 47: Hoare triple {51594#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51594#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,244 INFO L273 TraceCheckUtils]: 48: Hoare triple {51594#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {51595#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,244 INFO L273 TraceCheckUtils]: 49: Hoare triple {51595#(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); {51595#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,245 INFO L273 TraceCheckUtils]: 50: Hoare triple {51595#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51595#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,246 INFO L273 TraceCheckUtils]: 51: Hoare triple {51595#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {51596#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,247 INFO L273 TraceCheckUtils]: 52: Hoare triple {51596#(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); {51596#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,248 INFO L273 TraceCheckUtils]: 53: Hoare triple {51596#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51596#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,249 INFO L273 TraceCheckUtils]: 54: Hoare triple {51596#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {51597#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 12:01:13,249 INFO L273 TraceCheckUtils]: 55: Hoare triple {51597#(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); {51597#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 12:01:13,250 INFO L273 TraceCheckUtils]: 56: Hoare triple {51597#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51597#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 12:01:13,251 INFO L273 TraceCheckUtils]: 57: Hoare triple {51597#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} ~k~0 := 1 + ~k~0; {51598#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,252 INFO L273 TraceCheckUtils]: 58: Hoare triple {51598#(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); {51598#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,252 INFO L273 TraceCheckUtils]: 59: Hoare triple {51598#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51598#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,253 INFO L273 TraceCheckUtils]: 60: Hoare triple {51598#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {51599#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,254 INFO L273 TraceCheckUtils]: 61: Hoare triple {51599#(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); {51599#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,255 INFO L273 TraceCheckUtils]: 62: Hoare triple {51599#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51599#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,256 INFO L273 TraceCheckUtils]: 63: Hoare triple {51599#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {51600#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,257 INFO L273 TraceCheckUtils]: 64: Hoare triple {51600#(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); {51600#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,257 INFO L273 TraceCheckUtils]: 65: Hoare triple {51600#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51600#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,258 INFO L273 TraceCheckUtils]: 66: Hoare triple {51600#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {51601#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,259 INFO L273 TraceCheckUtils]: 67: Hoare triple {51601#(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); {51601#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,260 INFO L273 TraceCheckUtils]: 68: Hoare triple {51601#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51601#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,261 INFO L273 TraceCheckUtils]: 69: Hoare triple {51601#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {51602#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,261 INFO L273 TraceCheckUtils]: 70: Hoare triple {51602#(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); {51602#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,262 INFO L273 TraceCheckUtils]: 71: Hoare triple {51602#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51602#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,263 INFO L273 TraceCheckUtils]: 72: Hoare triple {51602#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {51603#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,264 INFO L273 TraceCheckUtils]: 73: Hoare triple {51603#(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); {51603#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,264 INFO L273 TraceCheckUtils]: 74: Hoare triple {51603#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51603#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,265 INFO L273 TraceCheckUtils]: 75: Hoare triple {51603#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {51604#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,266 INFO L273 TraceCheckUtils]: 76: Hoare triple {51604#(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); {51604#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,267 INFO L273 TraceCheckUtils]: 77: Hoare triple {51604#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51604#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,268 INFO L273 TraceCheckUtils]: 78: Hoare triple {51604#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {51605#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,269 INFO L273 TraceCheckUtils]: 79: Hoare triple {51605#(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); {51605#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,270 INFO L273 TraceCheckUtils]: 80: Hoare triple {51605#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51605#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,270 INFO L273 TraceCheckUtils]: 81: Hoare triple {51605#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {51606#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,271 INFO L273 TraceCheckUtils]: 82: Hoare triple {51606#(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); {51606#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,272 INFO L273 TraceCheckUtils]: 83: Hoare triple {51606#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51606#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,273 INFO L273 TraceCheckUtils]: 84: Hoare triple {51606#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {51607#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,274 INFO L273 TraceCheckUtils]: 85: Hoare triple {51607#(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); {51607#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,274 INFO L273 TraceCheckUtils]: 86: Hoare triple {51607#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51607#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,275 INFO L273 TraceCheckUtils]: 87: Hoare triple {51607#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {51608#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,276 INFO L273 TraceCheckUtils]: 88: Hoare triple {51608#(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); {51608#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,277 INFO L273 TraceCheckUtils]: 89: Hoare triple {51608#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51608#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,278 INFO L273 TraceCheckUtils]: 90: Hoare triple {51608#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {51609#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,279 INFO L273 TraceCheckUtils]: 91: Hoare triple {51609#(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); {51609#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,280 INFO L273 TraceCheckUtils]: 92: Hoare triple {51609#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51609#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,281 INFO L273 TraceCheckUtils]: 93: Hoare triple {51609#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {51610#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,281 INFO L273 TraceCheckUtils]: 94: Hoare triple {51610#(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); {51610#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,282 INFO L273 TraceCheckUtils]: 95: Hoare triple {51610#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51610#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,283 INFO L273 TraceCheckUtils]: 96: Hoare triple {51610#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {51611#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,284 INFO L273 TraceCheckUtils]: 97: Hoare triple {51611#(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); {51611#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,285 INFO L273 TraceCheckUtils]: 98: Hoare triple {51611#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51611#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,286 INFO L273 TraceCheckUtils]: 99: Hoare triple {51611#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {51612#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,286 INFO L273 TraceCheckUtils]: 100: Hoare triple {51612#(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); {51612#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,287 INFO L273 TraceCheckUtils]: 101: Hoare triple {51612#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51612#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,288 INFO L273 TraceCheckUtils]: 102: Hoare triple {51612#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {51613#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,289 INFO L273 TraceCheckUtils]: 103: Hoare triple {51613#(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); {51613#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,290 INFO L273 TraceCheckUtils]: 104: Hoare triple {51613#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51613#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,291 INFO L273 TraceCheckUtils]: 105: Hoare triple {51613#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {51614#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,292 INFO L273 TraceCheckUtils]: 106: Hoare triple {51614#(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); {51614#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,292 INFO L273 TraceCheckUtils]: 107: Hoare triple {51614#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51614#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,293 INFO L273 TraceCheckUtils]: 108: Hoare triple {51614#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {51615#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,294 INFO L273 TraceCheckUtils]: 109: Hoare triple {51615#(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); {51615#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,295 INFO L273 TraceCheckUtils]: 110: Hoare triple {51615#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51615#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,296 INFO L273 TraceCheckUtils]: 111: Hoare triple {51615#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {51616#(and (<= main_~k~0 (+ main_~i~0 36)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,297 INFO L273 TraceCheckUtils]: 112: Hoare triple {51616#(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); {51616#(and (<= main_~k~0 (+ main_~i~0 36)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,297 INFO L273 TraceCheckUtils]: 113: Hoare triple {51616#(and (<= main_~k~0 (+ main_~i~0 36)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51616#(and (<= main_~k~0 (+ main_~i~0 36)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,298 INFO L273 TraceCheckUtils]: 114: Hoare triple {51616#(and (<= main_~k~0 (+ main_~i~0 36)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {51617#(and (<= main_~k~0 (+ main_~i~0 37)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,299 INFO L273 TraceCheckUtils]: 115: Hoare triple {51617#(and (<= main_~k~0 (+ main_~i~0 37)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {51617#(and (<= main_~k~0 (+ main_~i~0 37)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,300 INFO L273 TraceCheckUtils]: 116: Hoare triple {51617#(and (<= main_~k~0 (+ main_~i~0 37)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51617#(and (<= main_~k~0 (+ main_~i~0 37)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,301 INFO L273 TraceCheckUtils]: 117: Hoare triple {51617#(and (<= main_~k~0 (+ main_~i~0 37)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {51618#(and (<= main_~k~0 (+ main_~i~0 38)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,302 INFO L273 TraceCheckUtils]: 118: Hoare triple {51618#(and (<= main_~k~0 (+ main_~i~0 38)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {51618#(and (<= main_~k~0 (+ main_~i~0 38)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,302 INFO L273 TraceCheckUtils]: 119: Hoare triple {51618#(and (<= main_~k~0 (+ main_~i~0 38)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51618#(and (<= main_~k~0 (+ main_~i~0 38)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,303 INFO L273 TraceCheckUtils]: 120: Hoare triple {51618#(and (<= main_~k~0 (+ main_~i~0 38)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {51619#(and (<= main_~k~0 (+ main_~i~0 39)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,304 INFO L273 TraceCheckUtils]: 121: Hoare triple {51619#(and (<= main_~k~0 (+ main_~i~0 39)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {51619#(and (<= main_~k~0 (+ main_~i~0 39)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,305 INFO L273 TraceCheckUtils]: 122: Hoare triple {51619#(and (<= main_~k~0 (+ main_~i~0 39)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51619#(and (<= main_~k~0 (+ main_~i~0 39)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,306 INFO L273 TraceCheckUtils]: 123: Hoare triple {51619#(and (<= main_~k~0 (+ main_~i~0 39)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {51620#(and (<= main_~k~0 (+ main_~i~0 40)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,306 INFO L273 TraceCheckUtils]: 124: Hoare triple {51620#(and (<= main_~k~0 (+ main_~i~0 40)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {51620#(and (<= main_~k~0 (+ main_~i~0 40)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,307 INFO L273 TraceCheckUtils]: 125: Hoare triple {51620#(and (<= main_~k~0 (+ main_~i~0 40)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51620#(and (<= main_~k~0 (+ main_~i~0 40)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,308 INFO L273 TraceCheckUtils]: 126: Hoare triple {51620#(and (<= main_~k~0 (+ main_~i~0 40)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {51621#(and (<= main_~k~0 (+ main_~i~0 41)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,309 INFO L273 TraceCheckUtils]: 127: Hoare triple {51621#(and (<= main_~k~0 (+ main_~i~0 41)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {51621#(and (<= main_~k~0 (+ main_~i~0 41)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,309 INFO L273 TraceCheckUtils]: 128: Hoare triple {51621#(and (<= main_~k~0 (+ main_~i~0 41)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51621#(and (<= main_~k~0 (+ main_~i~0 41)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,310 INFO L273 TraceCheckUtils]: 129: Hoare triple {51621#(and (<= main_~k~0 (+ main_~i~0 41)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {51622#(and (<= main_~k~0 (+ main_~i~0 42)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:13,311 INFO L273 TraceCheckUtils]: 130: Hoare triple {51622#(and (<= main_~k~0 (+ main_~i~0 42)) (= main_~i~0 0))} assume !(~k~0 < 100000); {51579#false} is VALID [2018-11-23 12:01:13,311 INFO L273 TraceCheckUtils]: 131: Hoare triple {51579#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); {51579#false} is VALID [2018-11-23 12:01:13,311 INFO L273 TraceCheckUtils]: 132: Hoare triple {51579#false} ~x~0 := 0; {51579#false} is VALID [2018-11-23 12:01:13,312 INFO L273 TraceCheckUtils]: 133: Hoare triple {51579#false} assume !(~x~0 < ~i~0); {51579#false} is VALID [2018-11-23 12:01:13,312 INFO L273 TraceCheckUtils]: 134: Hoare triple {51579#false} ~x~0 := ~i~0; {51579#false} is VALID [2018-11-23 12:01:13,312 INFO L273 TraceCheckUtils]: 135: Hoare triple {51579#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); {51579#false} is VALID [2018-11-23 12:01:13,312 INFO L256 TraceCheckUtils]: 136: Hoare triple {51579#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {51578#true} is VALID [2018-11-23 12:01:13,312 INFO L273 TraceCheckUtils]: 137: Hoare triple {51578#true} ~cond := #in~cond; {51578#true} is VALID [2018-11-23 12:01:13,313 INFO L273 TraceCheckUtils]: 138: Hoare triple {51578#true} assume !(0 == ~cond); {51578#true} is VALID [2018-11-23 12:01:13,313 INFO L273 TraceCheckUtils]: 139: Hoare triple {51578#true} assume true; {51578#true} is VALID [2018-11-23 12:01:13,313 INFO L268 TraceCheckUtils]: 140: Hoare quadruple {51578#true} {51579#false} #136#return; {51579#false} is VALID [2018-11-23 12:01:13,313 INFO L273 TraceCheckUtils]: 141: Hoare triple {51579#false} havoc #t~mem9;havoc #t~mem10; {51579#false} is VALID [2018-11-23 12:01:13,313 INFO L273 TraceCheckUtils]: 142: Hoare triple {51579#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {51579#false} is VALID [2018-11-23 12:01:13,313 INFO L273 TraceCheckUtils]: 143: Hoare triple {51579#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); {51579#false} is VALID [2018-11-23 12:01:13,314 INFO L256 TraceCheckUtils]: 144: Hoare triple {51579#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {51579#false} is VALID [2018-11-23 12:01:13,314 INFO L273 TraceCheckUtils]: 145: Hoare triple {51579#false} ~cond := #in~cond; {51579#false} is VALID [2018-11-23 12:01:13,314 INFO L273 TraceCheckUtils]: 146: Hoare triple {51579#false} assume 0 == ~cond; {51579#false} is VALID [2018-11-23 12:01:13,314 INFO L273 TraceCheckUtils]: 147: Hoare triple {51579#false} assume !false; {51579#false} is VALID [2018-11-23 12:01:13,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2505 backedges. 2 proven. 2501 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 12:01:13,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:13,364 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:01:13,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:01:13,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:13,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:13,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:01:14,947 INFO L256 TraceCheckUtils]: 0: Hoare triple {51578#true} call ULTIMATE.init(); {51578#true} is VALID [2018-11-23 12:01:14,947 INFO L273 TraceCheckUtils]: 1: Hoare triple {51578#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {51578#true} is VALID [2018-11-23 12:01:14,948 INFO L273 TraceCheckUtils]: 2: Hoare triple {51578#true} assume true; {51578#true} is VALID [2018-11-23 12:01:14,948 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {51578#true} {51578#true} #130#return; {51578#true} is VALID [2018-11-23 12:01:14,948 INFO L256 TraceCheckUtils]: 4: Hoare triple {51578#true} call #t~ret15 := main(); {51578#true} is VALID [2018-11-23 12:01:14,949 INFO L273 TraceCheckUtils]: 5: Hoare triple {51578#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {51641#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:14,950 INFO L273 TraceCheckUtils]: 6: Hoare triple {51641#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {51645#(<= main_~k~0 1)} is VALID [2018-11-23 12:01:14,950 INFO L273 TraceCheckUtils]: 7: Hoare triple {51645#(<= 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); {51645#(<= main_~k~0 1)} is VALID [2018-11-23 12:01:14,950 INFO L273 TraceCheckUtils]: 8: Hoare triple {51645#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51645#(<= main_~k~0 1)} is VALID [2018-11-23 12:01:14,951 INFO L273 TraceCheckUtils]: 9: Hoare triple {51645#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {51655#(<= main_~k~0 2)} is VALID [2018-11-23 12:01:14,951 INFO L273 TraceCheckUtils]: 10: Hoare triple {51655#(<= 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); {51655#(<= main_~k~0 2)} is VALID [2018-11-23 12:01:14,951 INFO L273 TraceCheckUtils]: 11: Hoare triple {51655#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51655#(<= main_~k~0 2)} is VALID [2018-11-23 12:01:14,952 INFO L273 TraceCheckUtils]: 12: Hoare triple {51655#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {51665#(<= main_~k~0 3)} is VALID [2018-11-23 12:01:14,953 INFO L273 TraceCheckUtils]: 13: Hoare triple {51665#(<= 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); {51665#(<= main_~k~0 3)} is VALID [2018-11-23 12:01:14,953 INFO L273 TraceCheckUtils]: 14: Hoare triple {51665#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51665#(<= main_~k~0 3)} is VALID [2018-11-23 12:01:14,954 INFO L273 TraceCheckUtils]: 15: Hoare triple {51665#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {51675#(<= main_~k~0 4)} is VALID [2018-11-23 12:01:14,954 INFO L273 TraceCheckUtils]: 16: Hoare triple {51675#(<= 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); {51675#(<= main_~k~0 4)} is VALID [2018-11-23 12:01:14,955 INFO L273 TraceCheckUtils]: 17: Hoare triple {51675#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51675#(<= main_~k~0 4)} is VALID [2018-11-23 12:01:14,955 INFO L273 TraceCheckUtils]: 18: Hoare triple {51675#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {51685#(<= main_~k~0 5)} is VALID [2018-11-23 12:01:14,956 INFO L273 TraceCheckUtils]: 19: Hoare triple {51685#(<= 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); {51685#(<= main_~k~0 5)} is VALID [2018-11-23 12:01:14,957 INFO L273 TraceCheckUtils]: 20: Hoare triple {51685#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51685#(<= main_~k~0 5)} is VALID [2018-11-23 12:01:14,957 INFO L273 TraceCheckUtils]: 21: Hoare triple {51685#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {51695#(<= main_~k~0 6)} is VALID [2018-11-23 12:01:14,958 INFO L273 TraceCheckUtils]: 22: Hoare triple {51695#(<= 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); {51695#(<= main_~k~0 6)} is VALID [2018-11-23 12:01:14,958 INFO L273 TraceCheckUtils]: 23: Hoare triple {51695#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51695#(<= main_~k~0 6)} is VALID [2018-11-23 12:01:14,959 INFO L273 TraceCheckUtils]: 24: Hoare triple {51695#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {51705#(<= main_~k~0 7)} is VALID [2018-11-23 12:01:14,960 INFO L273 TraceCheckUtils]: 25: Hoare triple {51705#(<= 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); {51705#(<= main_~k~0 7)} is VALID [2018-11-23 12:01:14,960 INFO L273 TraceCheckUtils]: 26: Hoare triple {51705#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51705#(<= main_~k~0 7)} is VALID [2018-11-23 12:01:14,961 INFO L273 TraceCheckUtils]: 27: Hoare triple {51705#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {51715#(<= main_~k~0 8)} is VALID [2018-11-23 12:01:14,961 INFO L273 TraceCheckUtils]: 28: Hoare triple {51715#(<= 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); {51715#(<= main_~k~0 8)} is VALID [2018-11-23 12:01:14,962 INFO L273 TraceCheckUtils]: 29: Hoare triple {51715#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51715#(<= main_~k~0 8)} is VALID [2018-11-23 12:01:14,963 INFO L273 TraceCheckUtils]: 30: Hoare triple {51715#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {51725#(<= main_~k~0 9)} is VALID [2018-11-23 12:01:14,963 INFO L273 TraceCheckUtils]: 31: Hoare triple {51725#(<= 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); {51725#(<= main_~k~0 9)} is VALID [2018-11-23 12:01:14,964 INFO L273 TraceCheckUtils]: 32: Hoare triple {51725#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51725#(<= main_~k~0 9)} is VALID [2018-11-23 12:01:14,964 INFO L273 TraceCheckUtils]: 33: Hoare triple {51725#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {51735#(<= main_~k~0 10)} is VALID [2018-11-23 12:01:14,965 INFO L273 TraceCheckUtils]: 34: Hoare triple {51735#(<= 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); {51735#(<= main_~k~0 10)} is VALID [2018-11-23 12:01:14,965 INFO L273 TraceCheckUtils]: 35: Hoare triple {51735#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51735#(<= main_~k~0 10)} is VALID [2018-11-23 12:01:14,966 INFO L273 TraceCheckUtils]: 36: Hoare triple {51735#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {51745#(<= main_~k~0 11)} is VALID [2018-11-23 12:01:14,967 INFO L273 TraceCheckUtils]: 37: Hoare triple {51745#(<= 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); {51745#(<= main_~k~0 11)} is VALID [2018-11-23 12:01:14,967 INFO L273 TraceCheckUtils]: 38: Hoare triple {51745#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51745#(<= main_~k~0 11)} is VALID [2018-11-23 12:01:14,968 INFO L273 TraceCheckUtils]: 39: Hoare triple {51745#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {51755#(<= main_~k~0 12)} is VALID [2018-11-23 12:01:14,968 INFO L273 TraceCheckUtils]: 40: Hoare triple {51755#(<= 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); {51755#(<= main_~k~0 12)} is VALID [2018-11-23 12:01:14,969 INFO L273 TraceCheckUtils]: 41: Hoare triple {51755#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51755#(<= main_~k~0 12)} is VALID [2018-11-23 12:01:14,970 INFO L273 TraceCheckUtils]: 42: Hoare triple {51755#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {51765#(<= main_~k~0 13)} is VALID [2018-11-23 12:01:14,970 INFO L273 TraceCheckUtils]: 43: Hoare triple {51765#(<= 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); {51765#(<= main_~k~0 13)} is VALID [2018-11-23 12:01:14,971 INFO L273 TraceCheckUtils]: 44: Hoare triple {51765#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51765#(<= main_~k~0 13)} is VALID [2018-11-23 12:01:14,971 INFO L273 TraceCheckUtils]: 45: Hoare triple {51765#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {51775#(<= main_~k~0 14)} is VALID [2018-11-23 12:01:14,972 INFO L273 TraceCheckUtils]: 46: Hoare triple {51775#(<= 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); {51775#(<= main_~k~0 14)} is VALID [2018-11-23 12:01:14,972 INFO L273 TraceCheckUtils]: 47: Hoare triple {51775#(<= main_~k~0 14)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51775#(<= main_~k~0 14)} is VALID [2018-11-23 12:01:14,973 INFO L273 TraceCheckUtils]: 48: Hoare triple {51775#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {51785#(<= main_~k~0 15)} is VALID [2018-11-23 12:01:14,974 INFO L273 TraceCheckUtils]: 49: Hoare triple {51785#(<= 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); {51785#(<= main_~k~0 15)} is VALID [2018-11-23 12:01:14,974 INFO L273 TraceCheckUtils]: 50: Hoare triple {51785#(<= main_~k~0 15)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51785#(<= main_~k~0 15)} is VALID [2018-11-23 12:01:14,975 INFO L273 TraceCheckUtils]: 51: Hoare triple {51785#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {51795#(<= main_~k~0 16)} is VALID [2018-11-23 12:01:14,976 INFO L273 TraceCheckUtils]: 52: Hoare triple {51795#(<= 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); {51795#(<= main_~k~0 16)} is VALID [2018-11-23 12:01:14,976 INFO L273 TraceCheckUtils]: 53: Hoare triple {51795#(<= main_~k~0 16)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51795#(<= main_~k~0 16)} is VALID [2018-11-23 12:01:14,977 INFO L273 TraceCheckUtils]: 54: Hoare triple {51795#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {51805#(<= main_~k~0 17)} is VALID [2018-11-23 12:01:14,977 INFO L273 TraceCheckUtils]: 55: Hoare triple {51805#(<= 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); {51805#(<= main_~k~0 17)} is VALID [2018-11-23 12:01:14,978 INFO L273 TraceCheckUtils]: 56: Hoare triple {51805#(<= main_~k~0 17)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51805#(<= main_~k~0 17)} is VALID [2018-11-23 12:01:14,979 INFO L273 TraceCheckUtils]: 57: Hoare triple {51805#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {51815#(<= main_~k~0 18)} is VALID [2018-11-23 12:01:14,979 INFO L273 TraceCheckUtils]: 58: Hoare triple {51815#(<= 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); {51815#(<= main_~k~0 18)} is VALID [2018-11-23 12:01:14,980 INFO L273 TraceCheckUtils]: 59: Hoare triple {51815#(<= main_~k~0 18)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51815#(<= main_~k~0 18)} is VALID [2018-11-23 12:01:14,980 INFO L273 TraceCheckUtils]: 60: Hoare triple {51815#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {51825#(<= main_~k~0 19)} is VALID [2018-11-23 12:01:14,981 INFO L273 TraceCheckUtils]: 61: Hoare triple {51825#(<= 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); {51825#(<= main_~k~0 19)} is VALID [2018-11-23 12:01:14,981 INFO L273 TraceCheckUtils]: 62: Hoare triple {51825#(<= main_~k~0 19)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51825#(<= main_~k~0 19)} is VALID [2018-11-23 12:01:14,982 INFO L273 TraceCheckUtils]: 63: Hoare triple {51825#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {51835#(<= main_~k~0 20)} is VALID [2018-11-23 12:01:14,983 INFO L273 TraceCheckUtils]: 64: Hoare triple {51835#(<= 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); {51835#(<= main_~k~0 20)} is VALID [2018-11-23 12:01:14,983 INFO L273 TraceCheckUtils]: 65: Hoare triple {51835#(<= main_~k~0 20)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51835#(<= main_~k~0 20)} is VALID [2018-11-23 12:01:14,984 INFO L273 TraceCheckUtils]: 66: Hoare triple {51835#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {51845#(<= main_~k~0 21)} is VALID [2018-11-23 12:01:14,984 INFO L273 TraceCheckUtils]: 67: Hoare triple {51845#(<= 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); {51845#(<= main_~k~0 21)} is VALID [2018-11-23 12:01:14,985 INFO L273 TraceCheckUtils]: 68: Hoare triple {51845#(<= main_~k~0 21)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51845#(<= main_~k~0 21)} is VALID [2018-11-23 12:01:14,986 INFO L273 TraceCheckUtils]: 69: Hoare triple {51845#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {51855#(<= main_~k~0 22)} is VALID [2018-11-23 12:01:14,986 INFO L273 TraceCheckUtils]: 70: Hoare triple {51855#(<= 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); {51855#(<= main_~k~0 22)} is VALID [2018-11-23 12:01:14,987 INFO L273 TraceCheckUtils]: 71: Hoare triple {51855#(<= main_~k~0 22)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51855#(<= main_~k~0 22)} is VALID [2018-11-23 12:01:14,987 INFO L273 TraceCheckUtils]: 72: Hoare triple {51855#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {51865#(<= main_~k~0 23)} is VALID [2018-11-23 12:01:14,988 INFO L273 TraceCheckUtils]: 73: Hoare triple {51865#(<= 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); {51865#(<= main_~k~0 23)} is VALID [2018-11-23 12:01:14,988 INFO L273 TraceCheckUtils]: 74: Hoare triple {51865#(<= main_~k~0 23)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51865#(<= main_~k~0 23)} is VALID [2018-11-23 12:01:14,989 INFO L273 TraceCheckUtils]: 75: Hoare triple {51865#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {51875#(<= main_~k~0 24)} is VALID [2018-11-23 12:01:14,990 INFO L273 TraceCheckUtils]: 76: Hoare triple {51875#(<= 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); {51875#(<= main_~k~0 24)} is VALID [2018-11-23 12:01:14,990 INFO L273 TraceCheckUtils]: 77: Hoare triple {51875#(<= main_~k~0 24)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51875#(<= main_~k~0 24)} is VALID [2018-11-23 12:01:14,991 INFO L273 TraceCheckUtils]: 78: Hoare triple {51875#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {51885#(<= main_~k~0 25)} is VALID [2018-11-23 12:01:14,991 INFO L273 TraceCheckUtils]: 79: Hoare triple {51885#(<= 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); {51885#(<= main_~k~0 25)} is VALID [2018-11-23 12:01:14,992 INFO L273 TraceCheckUtils]: 80: Hoare triple {51885#(<= main_~k~0 25)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51885#(<= main_~k~0 25)} is VALID [2018-11-23 12:01:14,993 INFO L273 TraceCheckUtils]: 81: Hoare triple {51885#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {51895#(<= main_~k~0 26)} is VALID [2018-11-23 12:01:14,993 INFO L273 TraceCheckUtils]: 82: Hoare triple {51895#(<= 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); {51895#(<= main_~k~0 26)} is VALID [2018-11-23 12:01:14,994 INFO L273 TraceCheckUtils]: 83: Hoare triple {51895#(<= main_~k~0 26)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51895#(<= main_~k~0 26)} is VALID [2018-11-23 12:01:14,994 INFO L273 TraceCheckUtils]: 84: Hoare triple {51895#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {51905#(<= main_~k~0 27)} is VALID [2018-11-23 12:01:14,995 INFO L273 TraceCheckUtils]: 85: Hoare triple {51905#(<= 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); {51905#(<= main_~k~0 27)} is VALID [2018-11-23 12:01:14,995 INFO L273 TraceCheckUtils]: 86: Hoare triple {51905#(<= main_~k~0 27)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51905#(<= main_~k~0 27)} is VALID [2018-11-23 12:01:14,996 INFO L273 TraceCheckUtils]: 87: Hoare triple {51905#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {51915#(<= main_~k~0 28)} is VALID [2018-11-23 12:01:14,997 INFO L273 TraceCheckUtils]: 88: Hoare triple {51915#(<= 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); {51915#(<= main_~k~0 28)} is VALID [2018-11-23 12:01:14,997 INFO L273 TraceCheckUtils]: 89: Hoare triple {51915#(<= main_~k~0 28)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51915#(<= main_~k~0 28)} is VALID [2018-11-23 12:01:14,998 INFO L273 TraceCheckUtils]: 90: Hoare triple {51915#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {51925#(<= main_~k~0 29)} is VALID [2018-11-23 12:01:14,998 INFO L273 TraceCheckUtils]: 91: Hoare triple {51925#(<= 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); {51925#(<= main_~k~0 29)} is VALID [2018-11-23 12:01:14,999 INFO L273 TraceCheckUtils]: 92: Hoare triple {51925#(<= main_~k~0 29)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51925#(<= main_~k~0 29)} is VALID [2018-11-23 12:01:15,000 INFO L273 TraceCheckUtils]: 93: Hoare triple {51925#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {51935#(<= main_~k~0 30)} is VALID [2018-11-23 12:01:15,000 INFO L273 TraceCheckUtils]: 94: Hoare triple {51935#(<= 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); {51935#(<= main_~k~0 30)} is VALID [2018-11-23 12:01:15,001 INFO L273 TraceCheckUtils]: 95: Hoare triple {51935#(<= main_~k~0 30)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51935#(<= main_~k~0 30)} is VALID [2018-11-23 12:01:15,001 INFO L273 TraceCheckUtils]: 96: Hoare triple {51935#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {51945#(<= main_~k~0 31)} is VALID [2018-11-23 12:01:15,002 INFO L273 TraceCheckUtils]: 97: Hoare triple {51945#(<= 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); {51945#(<= main_~k~0 31)} is VALID [2018-11-23 12:01:15,002 INFO L273 TraceCheckUtils]: 98: Hoare triple {51945#(<= main_~k~0 31)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51945#(<= main_~k~0 31)} is VALID [2018-11-23 12:01:15,003 INFO L273 TraceCheckUtils]: 99: Hoare triple {51945#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {51955#(<= main_~k~0 32)} is VALID [2018-11-23 12:01:15,004 INFO L273 TraceCheckUtils]: 100: Hoare triple {51955#(<= 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); {51955#(<= main_~k~0 32)} is VALID [2018-11-23 12:01:15,004 INFO L273 TraceCheckUtils]: 101: Hoare triple {51955#(<= main_~k~0 32)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51955#(<= main_~k~0 32)} is VALID [2018-11-23 12:01:15,005 INFO L273 TraceCheckUtils]: 102: Hoare triple {51955#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {51965#(<= main_~k~0 33)} is VALID [2018-11-23 12:01:15,005 INFO L273 TraceCheckUtils]: 103: Hoare triple {51965#(<= 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); {51965#(<= main_~k~0 33)} is VALID [2018-11-23 12:01:15,006 INFO L273 TraceCheckUtils]: 104: Hoare triple {51965#(<= main_~k~0 33)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51965#(<= main_~k~0 33)} is VALID [2018-11-23 12:01:15,007 INFO L273 TraceCheckUtils]: 105: Hoare triple {51965#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {51975#(<= main_~k~0 34)} is VALID [2018-11-23 12:01:15,007 INFO L273 TraceCheckUtils]: 106: Hoare triple {51975#(<= 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); {51975#(<= main_~k~0 34)} is VALID [2018-11-23 12:01:15,008 INFO L273 TraceCheckUtils]: 107: Hoare triple {51975#(<= main_~k~0 34)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51975#(<= main_~k~0 34)} is VALID [2018-11-23 12:01:15,009 INFO L273 TraceCheckUtils]: 108: Hoare triple {51975#(<= main_~k~0 34)} ~k~0 := 1 + ~k~0; {51985#(<= main_~k~0 35)} is VALID [2018-11-23 12:01:15,009 INFO L273 TraceCheckUtils]: 109: Hoare triple {51985#(<= 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); {51985#(<= main_~k~0 35)} is VALID [2018-11-23 12:01:15,010 INFO L273 TraceCheckUtils]: 110: Hoare triple {51985#(<= main_~k~0 35)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51985#(<= main_~k~0 35)} is VALID [2018-11-23 12:01:15,010 INFO L273 TraceCheckUtils]: 111: Hoare triple {51985#(<= main_~k~0 35)} ~k~0 := 1 + ~k~0; {51995#(<= main_~k~0 36)} is VALID [2018-11-23 12:01:15,011 INFO L273 TraceCheckUtils]: 112: Hoare triple {51995#(<= 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); {51995#(<= main_~k~0 36)} is VALID [2018-11-23 12:01:15,011 INFO L273 TraceCheckUtils]: 113: Hoare triple {51995#(<= main_~k~0 36)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {51995#(<= main_~k~0 36)} is VALID [2018-11-23 12:01:15,012 INFO L273 TraceCheckUtils]: 114: Hoare triple {51995#(<= main_~k~0 36)} ~k~0 := 1 + ~k~0; {52005#(<= main_~k~0 37)} is VALID [2018-11-23 12:01:15,013 INFO L273 TraceCheckUtils]: 115: Hoare triple {52005#(<= main_~k~0 37)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {52005#(<= main_~k~0 37)} is VALID [2018-11-23 12:01:15,013 INFO L273 TraceCheckUtils]: 116: Hoare triple {52005#(<= main_~k~0 37)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {52005#(<= main_~k~0 37)} is VALID [2018-11-23 12:01:15,014 INFO L273 TraceCheckUtils]: 117: Hoare triple {52005#(<= main_~k~0 37)} ~k~0 := 1 + ~k~0; {52015#(<= main_~k~0 38)} is VALID [2018-11-23 12:01:15,014 INFO L273 TraceCheckUtils]: 118: Hoare triple {52015#(<= main_~k~0 38)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {52015#(<= main_~k~0 38)} is VALID [2018-11-23 12:01:15,015 INFO L273 TraceCheckUtils]: 119: Hoare triple {52015#(<= main_~k~0 38)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {52015#(<= main_~k~0 38)} is VALID [2018-11-23 12:01:15,016 INFO L273 TraceCheckUtils]: 120: Hoare triple {52015#(<= main_~k~0 38)} ~k~0 := 1 + ~k~0; {52025#(<= main_~k~0 39)} is VALID [2018-11-23 12:01:15,016 INFO L273 TraceCheckUtils]: 121: Hoare triple {52025#(<= main_~k~0 39)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {52025#(<= main_~k~0 39)} is VALID [2018-11-23 12:01:15,017 INFO L273 TraceCheckUtils]: 122: Hoare triple {52025#(<= main_~k~0 39)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {52025#(<= main_~k~0 39)} is VALID [2018-11-23 12:01:15,017 INFO L273 TraceCheckUtils]: 123: Hoare triple {52025#(<= main_~k~0 39)} ~k~0 := 1 + ~k~0; {52035#(<= main_~k~0 40)} is VALID [2018-11-23 12:01:15,018 INFO L273 TraceCheckUtils]: 124: Hoare triple {52035#(<= main_~k~0 40)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {52035#(<= main_~k~0 40)} is VALID [2018-11-23 12:01:15,018 INFO L273 TraceCheckUtils]: 125: Hoare triple {52035#(<= main_~k~0 40)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {52035#(<= main_~k~0 40)} is VALID [2018-11-23 12:01:15,019 INFO L273 TraceCheckUtils]: 126: Hoare triple {52035#(<= main_~k~0 40)} ~k~0 := 1 + ~k~0; {52045#(<= main_~k~0 41)} is VALID [2018-11-23 12:01:15,020 INFO L273 TraceCheckUtils]: 127: Hoare triple {52045#(<= main_~k~0 41)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {52045#(<= main_~k~0 41)} is VALID [2018-11-23 12:01:15,020 INFO L273 TraceCheckUtils]: 128: Hoare triple {52045#(<= main_~k~0 41)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {52045#(<= main_~k~0 41)} is VALID [2018-11-23 12:01:15,021 INFO L273 TraceCheckUtils]: 129: Hoare triple {52045#(<= main_~k~0 41)} ~k~0 := 1 + ~k~0; {52055#(<= main_~k~0 42)} is VALID [2018-11-23 12:01:15,022 INFO L273 TraceCheckUtils]: 130: Hoare triple {52055#(<= main_~k~0 42)} assume !(~k~0 < 100000); {51579#false} is VALID [2018-11-23 12:01:15,022 INFO L273 TraceCheckUtils]: 131: Hoare triple {51579#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); {51579#false} is VALID [2018-11-23 12:01:15,022 INFO L273 TraceCheckUtils]: 132: Hoare triple {51579#false} ~x~0 := 0; {51579#false} is VALID [2018-11-23 12:01:15,022 INFO L273 TraceCheckUtils]: 133: Hoare triple {51579#false} assume !(~x~0 < ~i~0); {51579#false} is VALID [2018-11-23 12:01:15,022 INFO L273 TraceCheckUtils]: 134: Hoare triple {51579#false} ~x~0 := ~i~0; {51579#false} is VALID [2018-11-23 12:01:15,022 INFO L273 TraceCheckUtils]: 135: Hoare triple {51579#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); {51579#false} is VALID [2018-11-23 12:01:15,023 INFO L256 TraceCheckUtils]: 136: Hoare triple {51579#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {51579#false} is VALID [2018-11-23 12:01:15,023 INFO L273 TraceCheckUtils]: 137: Hoare triple {51579#false} ~cond := #in~cond; {51579#false} is VALID [2018-11-23 12:01:15,023 INFO L273 TraceCheckUtils]: 138: Hoare triple {51579#false} assume !(0 == ~cond); {51579#false} is VALID [2018-11-23 12:01:15,023 INFO L273 TraceCheckUtils]: 139: Hoare triple {51579#false} assume true; {51579#false} is VALID [2018-11-23 12:01:15,023 INFO L268 TraceCheckUtils]: 140: Hoare quadruple {51579#false} {51579#false} #136#return; {51579#false} is VALID [2018-11-23 12:01:15,024 INFO L273 TraceCheckUtils]: 141: Hoare triple {51579#false} havoc #t~mem9;havoc #t~mem10; {51579#false} is VALID [2018-11-23 12:01:15,024 INFO L273 TraceCheckUtils]: 142: Hoare triple {51579#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {51579#false} is VALID [2018-11-23 12:01:15,024 INFO L273 TraceCheckUtils]: 143: Hoare triple {51579#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); {51579#false} is VALID [2018-11-23 12:01:15,024 INFO L256 TraceCheckUtils]: 144: Hoare triple {51579#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {51579#false} is VALID [2018-11-23 12:01:15,024 INFO L273 TraceCheckUtils]: 145: Hoare triple {51579#false} ~cond := #in~cond; {51579#false} is VALID [2018-11-23 12:01:15,024 INFO L273 TraceCheckUtils]: 146: Hoare triple {51579#false} assume 0 == ~cond; {51579#false} is VALID [2018-11-23 12:01:15,025 INFO L273 TraceCheckUtils]: 147: Hoare triple {51579#false} assume !false; {51579#false} is VALID [2018-11-23 12:01:15,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2505 backedges. 0 proven. 2501 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 12:01:15,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:01:15,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 88 [2018-11-23 12:01:15,059 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 148 [2018-11-23 12:01:15,059 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:15,059 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 88 states. [2018-11-23 12:01:15,351 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 276 edges. 276 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:15,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-11-23 12:01:15,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-11-23 12:01:15,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2883, Invalid=4773, Unknown=0, NotChecked=0, Total=7656 [2018-11-23 12:01:15,354 INFO L87 Difference]: Start difference. First operand 300 states and 397 transitions. Second operand 88 states. [2018-11-23 12:01:17,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:17,794 INFO L93 Difference]: Finished difference Result 363 states and 483 transitions. [2018-11-23 12:01:17,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-23 12:01:17,794 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 148 [2018-11-23 12:01:17,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:17,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-23 12:01:17,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 275 transitions. [2018-11-23 12:01:17,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-23 12:01:17,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 275 transitions. [2018-11-23 12:01:17,798 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states and 275 transitions. [2018-11-23 12:01:18,078 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 275 edges. 275 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:18,085 INFO L225 Difference]: With dead ends: 363 [2018-11-23 12:01:18,085 INFO L226 Difference]: Without dead ends: 316 [2018-11-23 12:01:18,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2710 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2883, Invalid=4773, Unknown=0, NotChecked=0, Total=7656 [2018-11-23 12:01:18,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-11-23 12:01:18,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 306. [2018-11-23 12:01:18,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:18,608 INFO L82 GeneralOperation]: Start isEquivalent. First operand 316 states. Second operand 306 states. [2018-11-23 12:01:18,609 INFO L74 IsIncluded]: Start isIncluded. First operand 316 states. Second operand 306 states. [2018-11-23 12:01:18,609 INFO L87 Difference]: Start difference. First operand 316 states. Second operand 306 states. [2018-11-23 12:01:18,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:18,615 INFO L93 Difference]: Finished difference Result 316 states and 420 transitions. [2018-11-23 12:01:18,615 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 420 transitions. [2018-11-23 12:01:18,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:18,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:18,616 INFO L74 IsIncluded]: Start isIncluded. First operand 306 states. Second operand 316 states. [2018-11-23 12:01:18,616 INFO L87 Difference]: Start difference. First operand 306 states. Second operand 316 states. [2018-11-23 12:01:18,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:18,622 INFO L93 Difference]: Finished difference Result 316 states and 420 transitions. [2018-11-23 12:01:18,622 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 420 transitions. [2018-11-23 12:01:18,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:18,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:18,622 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:18,622 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:18,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-11-23 12:01:18,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 405 transitions. [2018-11-23 12:01:18,628 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 405 transitions. Word has length 148 [2018-11-23 12:01:18,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:18,628 INFO L480 AbstractCegarLoop]: Abstraction has 306 states and 405 transitions. [2018-11-23 12:01:18,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-11-23 12:01:18,629 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 405 transitions. [2018-11-23 12:01:18,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-23 12:01:18,629 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:18,630 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 42, 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 12:01:18,630 INFO L423 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:18,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:18,630 INFO L82 PathProgramCache]: Analyzing trace with hash -81855636, now seen corresponding path program 38 times [2018-11-23 12:01:18,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:18,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:18,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:18,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:01:18,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:18,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:20,225 INFO L256 TraceCheckUtils]: 0: Hoare triple {53644#true} call ULTIMATE.init(); {53644#true} is VALID [2018-11-23 12:01:20,225 INFO L273 TraceCheckUtils]: 1: Hoare triple {53644#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {53644#true} is VALID [2018-11-23 12:01:20,225 INFO L273 TraceCheckUtils]: 2: Hoare triple {53644#true} assume true; {53644#true} is VALID [2018-11-23 12:01:20,226 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {53644#true} {53644#true} #130#return; {53644#true} is VALID [2018-11-23 12:01:20,226 INFO L256 TraceCheckUtils]: 4: Hoare triple {53644#true} call #t~ret15 := main(); {53644#true} is VALID [2018-11-23 12:01:20,226 INFO L273 TraceCheckUtils]: 5: Hoare triple {53644#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {53646#(= main_~i~0 0)} is VALID [2018-11-23 12:01:20,227 INFO L273 TraceCheckUtils]: 6: Hoare triple {53646#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {53647#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,228 INFO L273 TraceCheckUtils]: 7: Hoare triple {53647#(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); {53647#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,229 INFO L273 TraceCheckUtils]: 8: Hoare triple {53647#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53647#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,229 INFO L273 TraceCheckUtils]: 9: Hoare triple {53647#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53648#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,230 INFO L273 TraceCheckUtils]: 10: Hoare triple {53648#(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); {53648#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,231 INFO L273 TraceCheckUtils]: 11: Hoare triple {53648#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53648#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,232 INFO L273 TraceCheckUtils]: 12: Hoare triple {53648#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53649#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,233 INFO L273 TraceCheckUtils]: 13: Hoare triple {53649#(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); {53649#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,233 INFO L273 TraceCheckUtils]: 14: Hoare triple {53649#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53649#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,234 INFO L273 TraceCheckUtils]: 15: Hoare triple {53649#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53650#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,235 INFO L273 TraceCheckUtils]: 16: Hoare triple {53650#(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); {53650#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,236 INFO L273 TraceCheckUtils]: 17: Hoare triple {53650#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53650#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,237 INFO L273 TraceCheckUtils]: 18: Hoare triple {53650#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53651#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,238 INFO L273 TraceCheckUtils]: 19: Hoare triple {53651#(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); {53651#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,238 INFO L273 TraceCheckUtils]: 20: Hoare triple {53651#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53651#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,239 INFO L273 TraceCheckUtils]: 21: Hoare triple {53651#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53652#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,240 INFO L273 TraceCheckUtils]: 22: Hoare triple {53652#(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); {53652#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,241 INFO L273 TraceCheckUtils]: 23: Hoare triple {53652#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53652#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,242 INFO L273 TraceCheckUtils]: 24: Hoare triple {53652#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53653#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,243 INFO L273 TraceCheckUtils]: 25: Hoare triple {53653#(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); {53653#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,243 INFO L273 TraceCheckUtils]: 26: Hoare triple {53653#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53653#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,244 INFO L273 TraceCheckUtils]: 27: Hoare triple {53653#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53654#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,245 INFO L273 TraceCheckUtils]: 28: Hoare triple {53654#(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); {53654#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,246 INFO L273 TraceCheckUtils]: 29: Hoare triple {53654#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53654#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,246 INFO L273 TraceCheckUtils]: 30: Hoare triple {53654#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53655#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,247 INFO L273 TraceCheckUtils]: 31: Hoare triple {53655#(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); {53655#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,248 INFO L273 TraceCheckUtils]: 32: Hoare triple {53655#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53655#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,249 INFO L273 TraceCheckUtils]: 33: Hoare triple {53655#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53656#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,250 INFO L273 TraceCheckUtils]: 34: Hoare triple {53656#(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); {53656#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,250 INFO L273 TraceCheckUtils]: 35: Hoare triple {53656#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53656#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,251 INFO L273 TraceCheckUtils]: 36: Hoare triple {53656#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53657#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,252 INFO L273 TraceCheckUtils]: 37: Hoare triple {53657#(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); {53657#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,253 INFO L273 TraceCheckUtils]: 38: Hoare triple {53657#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53657#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,254 INFO L273 TraceCheckUtils]: 39: Hoare triple {53657#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53658#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,255 INFO L273 TraceCheckUtils]: 40: Hoare triple {53658#(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); {53658#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,255 INFO L273 TraceCheckUtils]: 41: Hoare triple {53658#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53658#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,256 INFO L273 TraceCheckUtils]: 42: Hoare triple {53658#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53659#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,257 INFO L273 TraceCheckUtils]: 43: Hoare triple {53659#(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); {53659#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,258 INFO L273 TraceCheckUtils]: 44: Hoare triple {53659#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53659#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,259 INFO L273 TraceCheckUtils]: 45: Hoare triple {53659#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53660#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,259 INFO L273 TraceCheckUtils]: 46: Hoare triple {53660#(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); {53660#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,260 INFO L273 TraceCheckUtils]: 47: Hoare triple {53660#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53660#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,261 INFO L273 TraceCheckUtils]: 48: Hoare triple {53660#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53661#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,262 INFO L273 TraceCheckUtils]: 49: Hoare triple {53661#(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); {53661#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,262 INFO L273 TraceCheckUtils]: 50: Hoare triple {53661#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53661#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,263 INFO L273 TraceCheckUtils]: 51: Hoare triple {53661#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53662#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,264 INFO L273 TraceCheckUtils]: 52: Hoare triple {53662#(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); {53662#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,265 INFO L273 TraceCheckUtils]: 53: Hoare triple {53662#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53662#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,266 INFO L273 TraceCheckUtils]: 54: Hoare triple {53662#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53663#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 12:01:20,267 INFO L273 TraceCheckUtils]: 55: Hoare triple {53663#(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); {53663#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 12:01:20,268 INFO L273 TraceCheckUtils]: 56: Hoare triple {53663#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53663#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 12:01:20,268 INFO L273 TraceCheckUtils]: 57: Hoare triple {53663#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} ~k~0 := 1 + ~k~0; {53664#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,269 INFO L273 TraceCheckUtils]: 58: Hoare triple {53664#(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); {53664#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,270 INFO L273 TraceCheckUtils]: 59: Hoare triple {53664#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53664#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,271 INFO L273 TraceCheckUtils]: 60: Hoare triple {53664#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53665#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,272 INFO L273 TraceCheckUtils]: 61: Hoare triple {53665#(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); {53665#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,272 INFO L273 TraceCheckUtils]: 62: Hoare triple {53665#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53665#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,273 INFO L273 TraceCheckUtils]: 63: Hoare triple {53665#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53666#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,274 INFO L273 TraceCheckUtils]: 64: Hoare triple {53666#(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); {53666#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,275 INFO L273 TraceCheckUtils]: 65: Hoare triple {53666#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53666#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,276 INFO L273 TraceCheckUtils]: 66: Hoare triple {53666#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53667#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,277 INFO L273 TraceCheckUtils]: 67: Hoare triple {53667#(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); {53667#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,277 INFO L273 TraceCheckUtils]: 68: Hoare triple {53667#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53667#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,278 INFO L273 TraceCheckUtils]: 69: Hoare triple {53667#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53668#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,279 INFO L273 TraceCheckUtils]: 70: Hoare triple {53668#(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); {53668#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,280 INFO L273 TraceCheckUtils]: 71: Hoare triple {53668#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53668#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,280 INFO L273 TraceCheckUtils]: 72: Hoare triple {53668#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53669#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,281 INFO L273 TraceCheckUtils]: 73: Hoare triple {53669#(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); {53669#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,282 INFO L273 TraceCheckUtils]: 74: Hoare triple {53669#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53669#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,283 INFO L273 TraceCheckUtils]: 75: Hoare triple {53669#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53670#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,284 INFO L273 TraceCheckUtils]: 76: Hoare triple {53670#(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); {53670#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,284 INFO L273 TraceCheckUtils]: 77: Hoare triple {53670#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53670#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,285 INFO L273 TraceCheckUtils]: 78: Hoare triple {53670#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53671#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,286 INFO L273 TraceCheckUtils]: 79: Hoare triple {53671#(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); {53671#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,287 INFO L273 TraceCheckUtils]: 80: Hoare triple {53671#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53671#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,288 INFO L273 TraceCheckUtils]: 81: Hoare triple {53671#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53672#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,289 INFO L273 TraceCheckUtils]: 82: Hoare triple {53672#(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); {53672#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,289 INFO L273 TraceCheckUtils]: 83: Hoare triple {53672#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53672#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,290 INFO L273 TraceCheckUtils]: 84: Hoare triple {53672#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53673#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,291 INFO L273 TraceCheckUtils]: 85: Hoare triple {53673#(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); {53673#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,292 INFO L273 TraceCheckUtils]: 86: Hoare triple {53673#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53673#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,293 INFO L273 TraceCheckUtils]: 87: Hoare triple {53673#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53674#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,294 INFO L273 TraceCheckUtils]: 88: Hoare triple {53674#(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); {53674#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,295 INFO L273 TraceCheckUtils]: 89: Hoare triple {53674#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53674#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,295 INFO L273 TraceCheckUtils]: 90: Hoare triple {53674#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53675#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,296 INFO L273 TraceCheckUtils]: 91: Hoare triple {53675#(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); {53675#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,297 INFO L273 TraceCheckUtils]: 92: Hoare triple {53675#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53675#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,298 INFO L273 TraceCheckUtils]: 93: Hoare triple {53675#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53676#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,299 INFO L273 TraceCheckUtils]: 94: Hoare triple {53676#(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); {53676#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,300 INFO L273 TraceCheckUtils]: 95: Hoare triple {53676#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53676#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,300 INFO L273 TraceCheckUtils]: 96: Hoare triple {53676#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53677#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,301 INFO L273 TraceCheckUtils]: 97: Hoare triple {53677#(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); {53677#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,302 INFO L273 TraceCheckUtils]: 98: Hoare triple {53677#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53677#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,303 INFO L273 TraceCheckUtils]: 99: Hoare triple {53677#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53678#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,304 INFO L273 TraceCheckUtils]: 100: Hoare triple {53678#(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); {53678#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,305 INFO L273 TraceCheckUtils]: 101: Hoare triple {53678#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53678#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,306 INFO L273 TraceCheckUtils]: 102: Hoare triple {53678#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53679#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,307 INFO L273 TraceCheckUtils]: 103: Hoare triple {53679#(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); {53679#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,307 INFO L273 TraceCheckUtils]: 104: Hoare triple {53679#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53679#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,308 INFO L273 TraceCheckUtils]: 105: Hoare triple {53679#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53680#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,309 INFO L273 TraceCheckUtils]: 106: Hoare triple {53680#(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); {53680#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,310 INFO L273 TraceCheckUtils]: 107: Hoare triple {53680#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53680#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,311 INFO L273 TraceCheckUtils]: 108: Hoare triple {53680#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53681#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,312 INFO L273 TraceCheckUtils]: 109: Hoare triple {53681#(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); {53681#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,312 INFO L273 TraceCheckUtils]: 110: Hoare triple {53681#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53681#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,313 INFO L273 TraceCheckUtils]: 111: Hoare triple {53681#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53682#(and (<= main_~k~0 (+ main_~i~0 36)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,314 INFO L273 TraceCheckUtils]: 112: Hoare triple {53682#(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); {53682#(and (<= main_~k~0 (+ main_~i~0 36)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,315 INFO L273 TraceCheckUtils]: 113: Hoare triple {53682#(and (<= main_~k~0 (+ main_~i~0 36)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53682#(and (<= main_~k~0 (+ main_~i~0 36)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,316 INFO L273 TraceCheckUtils]: 114: Hoare triple {53682#(and (<= main_~k~0 (+ main_~i~0 36)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53683#(and (<= main_~k~0 (+ main_~i~0 37)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,317 INFO L273 TraceCheckUtils]: 115: Hoare triple {53683#(and (<= main_~k~0 (+ main_~i~0 37)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53683#(and (<= main_~k~0 (+ main_~i~0 37)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,318 INFO L273 TraceCheckUtils]: 116: Hoare triple {53683#(and (<= main_~k~0 (+ main_~i~0 37)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53683#(and (<= main_~k~0 (+ main_~i~0 37)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,318 INFO L273 TraceCheckUtils]: 117: Hoare triple {53683#(and (<= main_~k~0 (+ main_~i~0 37)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53684#(and (<= main_~k~0 (+ main_~i~0 38)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,319 INFO L273 TraceCheckUtils]: 118: Hoare triple {53684#(and (<= main_~k~0 (+ main_~i~0 38)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53684#(and (<= main_~k~0 (+ main_~i~0 38)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,320 INFO L273 TraceCheckUtils]: 119: Hoare triple {53684#(and (<= main_~k~0 (+ main_~i~0 38)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53684#(and (<= main_~k~0 (+ main_~i~0 38)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,321 INFO L273 TraceCheckUtils]: 120: Hoare triple {53684#(and (<= main_~k~0 (+ main_~i~0 38)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53685#(and (<= main_~k~0 (+ main_~i~0 39)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,322 INFO L273 TraceCheckUtils]: 121: Hoare triple {53685#(and (<= main_~k~0 (+ main_~i~0 39)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53685#(and (<= main_~k~0 (+ main_~i~0 39)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,322 INFO L273 TraceCheckUtils]: 122: Hoare triple {53685#(and (<= main_~k~0 (+ main_~i~0 39)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53685#(and (<= main_~k~0 (+ main_~i~0 39)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,323 INFO L273 TraceCheckUtils]: 123: Hoare triple {53685#(and (<= main_~k~0 (+ main_~i~0 39)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53686#(and (<= main_~k~0 (+ main_~i~0 40)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,324 INFO L273 TraceCheckUtils]: 124: Hoare triple {53686#(and (<= main_~k~0 (+ main_~i~0 40)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53686#(and (<= main_~k~0 (+ main_~i~0 40)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,325 INFO L273 TraceCheckUtils]: 125: Hoare triple {53686#(and (<= main_~k~0 (+ main_~i~0 40)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53686#(and (<= main_~k~0 (+ main_~i~0 40)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,326 INFO L273 TraceCheckUtils]: 126: Hoare triple {53686#(and (<= main_~k~0 (+ main_~i~0 40)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53687#(and (<= main_~k~0 (+ main_~i~0 41)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,326 INFO L273 TraceCheckUtils]: 127: Hoare triple {53687#(and (<= main_~k~0 (+ main_~i~0 41)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {53687#(and (<= main_~k~0 (+ main_~i~0 41)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,327 INFO L273 TraceCheckUtils]: 128: Hoare triple {53687#(and (<= main_~k~0 (+ main_~i~0 41)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53687#(and (<= main_~k~0 (+ main_~i~0 41)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,328 INFO L273 TraceCheckUtils]: 129: Hoare triple {53687#(and (<= main_~k~0 (+ main_~i~0 41)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53688#(and (<= main_~k~0 (+ main_~i~0 42)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,329 INFO L273 TraceCheckUtils]: 130: Hoare triple {53688#(and (<= main_~k~0 (+ main_~i~0 42)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~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#(and (<= main_~k~0 (+ main_~i~0 42)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,330 INFO L273 TraceCheckUtils]: 131: Hoare triple {53688#(and (<= main_~k~0 (+ main_~i~0 42)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53688#(and (<= main_~k~0 (+ main_~i~0 42)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,330 INFO L273 TraceCheckUtils]: 132: Hoare triple {53688#(and (<= main_~k~0 (+ main_~i~0 42)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {53689#(and (<= main_~k~0 (+ main_~i~0 43)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:20,331 INFO L273 TraceCheckUtils]: 133: Hoare triple {53689#(and (<= main_~k~0 (+ main_~i~0 43)) (= main_~i~0 0))} assume !(~k~0 < 100000); {53645#false} is VALID [2018-11-23 12:01:20,331 INFO L273 TraceCheckUtils]: 134: Hoare triple {53645#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); {53645#false} is VALID [2018-11-23 12:01:20,332 INFO L273 TraceCheckUtils]: 135: Hoare triple {53645#false} ~x~0 := 0; {53645#false} is VALID [2018-11-23 12:01:20,332 INFO L273 TraceCheckUtils]: 136: Hoare triple {53645#false} assume !(~x~0 < ~i~0); {53645#false} is VALID [2018-11-23 12:01:20,332 INFO L273 TraceCheckUtils]: 137: Hoare triple {53645#false} ~x~0 := ~i~0; {53645#false} is VALID [2018-11-23 12:01:20,332 INFO L273 TraceCheckUtils]: 138: Hoare triple {53645#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); {53645#false} is VALID [2018-11-23 12:01:20,332 INFO L256 TraceCheckUtils]: 139: Hoare triple {53645#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {53644#true} is VALID [2018-11-23 12:01:20,333 INFO L273 TraceCheckUtils]: 140: Hoare triple {53644#true} ~cond := #in~cond; {53644#true} is VALID [2018-11-23 12:01:20,333 INFO L273 TraceCheckUtils]: 141: Hoare triple {53644#true} assume !(0 == ~cond); {53644#true} is VALID [2018-11-23 12:01:20,333 INFO L273 TraceCheckUtils]: 142: Hoare triple {53644#true} assume true; {53644#true} is VALID [2018-11-23 12:01:20,333 INFO L268 TraceCheckUtils]: 143: Hoare quadruple {53644#true} {53645#false} #136#return; {53645#false} is VALID [2018-11-23 12:01:20,333 INFO L273 TraceCheckUtils]: 144: Hoare triple {53645#false} havoc #t~mem9;havoc #t~mem10; {53645#false} is VALID [2018-11-23 12:01:20,333 INFO L273 TraceCheckUtils]: 145: Hoare triple {53645#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {53645#false} is VALID [2018-11-23 12:01:20,334 INFO L273 TraceCheckUtils]: 146: Hoare triple {53645#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); {53645#false} is VALID [2018-11-23 12:01:20,334 INFO L256 TraceCheckUtils]: 147: Hoare triple {53645#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {53645#false} is VALID [2018-11-23 12:01:20,334 INFO L273 TraceCheckUtils]: 148: Hoare triple {53645#false} ~cond := #in~cond; {53645#false} is VALID [2018-11-23 12:01:20,334 INFO L273 TraceCheckUtils]: 149: Hoare triple {53645#false} assume 0 == ~cond; {53645#false} is VALID [2018-11-23 12:01:20,334 INFO L273 TraceCheckUtils]: 150: Hoare triple {53645#false} assume !false; {53645#false} is VALID [2018-11-23 12:01:20,367 INFO L134 CoverageAnalysis]: Checked inductivity of 2629 backedges. 2 proven. 2625 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 12:01:20,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:20,367 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:01:20,376 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:01:20,458 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:01:20,458 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:01:20,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:20,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:01:22,329 INFO L256 TraceCheckUtils]: 0: Hoare triple {53644#true} call ULTIMATE.init(); {53644#true} is VALID [2018-11-23 12:01:22,329 INFO L273 TraceCheckUtils]: 1: Hoare triple {53644#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {53644#true} is VALID [2018-11-23 12:01:22,329 INFO L273 TraceCheckUtils]: 2: Hoare triple {53644#true} assume true; {53644#true} is VALID [2018-11-23 12:01:22,330 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {53644#true} {53644#true} #130#return; {53644#true} is VALID [2018-11-23 12:01:22,330 INFO L256 TraceCheckUtils]: 4: Hoare triple {53644#true} call #t~ret15 := main(); {53644#true} is VALID [2018-11-23 12:01:22,331 INFO L273 TraceCheckUtils]: 5: Hoare triple {53644#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {53708#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:22,331 INFO L273 TraceCheckUtils]: 6: Hoare triple {53708#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {53712#(<= main_~k~0 1)} is VALID [2018-11-23 12:01:22,331 INFO L273 TraceCheckUtils]: 7: Hoare triple {53712#(<= 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); {53712#(<= main_~k~0 1)} is VALID [2018-11-23 12:01:22,332 INFO L273 TraceCheckUtils]: 8: Hoare triple {53712#(<= main_~k~0 1)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53712#(<= main_~k~0 1)} is VALID [2018-11-23 12:01:22,332 INFO L273 TraceCheckUtils]: 9: Hoare triple {53712#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {53722#(<= main_~k~0 2)} is VALID [2018-11-23 12:01:22,332 INFO L273 TraceCheckUtils]: 10: Hoare triple {53722#(<= 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); {53722#(<= main_~k~0 2)} is VALID [2018-11-23 12:01:22,333 INFO L273 TraceCheckUtils]: 11: Hoare triple {53722#(<= main_~k~0 2)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53722#(<= main_~k~0 2)} is VALID [2018-11-23 12:01:22,334 INFO L273 TraceCheckUtils]: 12: Hoare triple {53722#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {53732#(<= main_~k~0 3)} is VALID [2018-11-23 12:01:22,334 INFO L273 TraceCheckUtils]: 13: Hoare triple {53732#(<= 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); {53732#(<= main_~k~0 3)} is VALID [2018-11-23 12:01:22,335 INFO L273 TraceCheckUtils]: 14: Hoare triple {53732#(<= main_~k~0 3)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53732#(<= main_~k~0 3)} is VALID [2018-11-23 12:01:22,335 INFO L273 TraceCheckUtils]: 15: Hoare triple {53732#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {53742#(<= main_~k~0 4)} is VALID [2018-11-23 12:01:22,336 INFO L273 TraceCheckUtils]: 16: Hoare triple {53742#(<= 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); {53742#(<= main_~k~0 4)} is VALID [2018-11-23 12:01:22,336 INFO L273 TraceCheckUtils]: 17: Hoare triple {53742#(<= main_~k~0 4)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53742#(<= main_~k~0 4)} is VALID [2018-11-23 12:01:22,337 INFO L273 TraceCheckUtils]: 18: Hoare triple {53742#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {53752#(<= main_~k~0 5)} is VALID [2018-11-23 12:01:22,338 INFO L273 TraceCheckUtils]: 19: Hoare triple {53752#(<= 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); {53752#(<= main_~k~0 5)} is VALID [2018-11-23 12:01:22,338 INFO L273 TraceCheckUtils]: 20: Hoare triple {53752#(<= main_~k~0 5)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53752#(<= main_~k~0 5)} is VALID [2018-11-23 12:01:22,339 INFO L273 TraceCheckUtils]: 21: Hoare triple {53752#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {53762#(<= main_~k~0 6)} is VALID [2018-11-23 12:01:22,339 INFO L273 TraceCheckUtils]: 22: Hoare triple {53762#(<= 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); {53762#(<= main_~k~0 6)} is VALID [2018-11-23 12:01:22,340 INFO L273 TraceCheckUtils]: 23: Hoare triple {53762#(<= main_~k~0 6)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53762#(<= main_~k~0 6)} is VALID [2018-11-23 12:01:22,341 INFO L273 TraceCheckUtils]: 24: Hoare triple {53762#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {53772#(<= main_~k~0 7)} is VALID [2018-11-23 12:01:22,341 INFO L273 TraceCheckUtils]: 25: Hoare triple {53772#(<= 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); {53772#(<= main_~k~0 7)} is VALID [2018-11-23 12:01:22,342 INFO L273 TraceCheckUtils]: 26: Hoare triple {53772#(<= main_~k~0 7)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53772#(<= main_~k~0 7)} is VALID [2018-11-23 12:01:22,342 INFO L273 TraceCheckUtils]: 27: Hoare triple {53772#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {53782#(<= main_~k~0 8)} is VALID [2018-11-23 12:01:22,343 INFO L273 TraceCheckUtils]: 28: Hoare triple {53782#(<= 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); {53782#(<= main_~k~0 8)} is VALID [2018-11-23 12:01:22,343 INFO L273 TraceCheckUtils]: 29: Hoare triple {53782#(<= main_~k~0 8)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53782#(<= main_~k~0 8)} is VALID [2018-11-23 12:01:22,344 INFO L273 TraceCheckUtils]: 30: Hoare triple {53782#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {53792#(<= main_~k~0 9)} is VALID [2018-11-23 12:01:22,345 INFO L273 TraceCheckUtils]: 31: Hoare triple {53792#(<= 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); {53792#(<= main_~k~0 9)} is VALID [2018-11-23 12:01:22,345 INFO L273 TraceCheckUtils]: 32: Hoare triple {53792#(<= main_~k~0 9)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53792#(<= main_~k~0 9)} is VALID [2018-11-23 12:01:22,346 INFO L273 TraceCheckUtils]: 33: Hoare triple {53792#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {53802#(<= main_~k~0 10)} is VALID [2018-11-23 12:01:22,346 INFO L273 TraceCheckUtils]: 34: Hoare triple {53802#(<= 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); {53802#(<= main_~k~0 10)} is VALID [2018-11-23 12:01:22,347 INFO L273 TraceCheckUtils]: 35: Hoare triple {53802#(<= main_~k~0 10)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53802#(<= main_~k~0 10)} is VALID [2018-11-23 12:01:22,348 INFO L273 TraceCheckUtils]: 36: Hoare triple {53802#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {53812#(<= main_~k~0 11)} is VALID [2018-11-23 12:01:22,348 INFO L273 TraceCheckUtils]: 37: Hoare triple {53812#(<= 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); {53812#(<= main_~k~0 11)} is VALID [2018-11-23 12:01:22,349 INFO L273 TraceCheckUtils]: 38: Hoare triple {53812#(<= main_~k~0 11)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53812#(<= main_~k~0 11)} is VALID [2018-11-23 12:01:22,349 INFO L273 TraceCheckUtils]: 39: Hoare triple {53812#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {53822#(<= main_~k~0 12)} is VALID [2018-11-23 12:01:22,350 INFO L273 TraceCheckUtils]: 40: Hoare triple {53822#(<= 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); {53822#(<= main_~k~0 12)} is VALID [2018-11-23 12:01:22,350 INFO L273 TraceCheckUtils]: 41: Hoare triple {53822#(<= main_~k~0 12)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53822#(<= main_~k~0 12)} is VALID [2018-11-23 12:01:22,351 INFO L273 TraceCheckUtils]: 42: Hoare triple {53822#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {53832#(<= main_~k~0 13)} is VALID [2018-11-23 12:01:22,352 INFO L273 TraceCheckUtils]: 43: Hoare triple {53832#(<= 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); {53832#(<= main_~k~0 13)} is VALID [2018-11-23 12:01:22,352 INFO L273 TraceCheckUtils]: 44: Hoare triple {53832#(<= main_~k~0 13)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53832#(<= main_~k~0 13)} is VALID [2018-11-23 12:01:22,353 INFO L273 TraceCheckUtils]: 45: Hoare triple {53832#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {53842#(<= main_~k~0 14)} is VALID [2018-11-23 12:01:22,353 INFO L273 TraceCheckUtils]: 46: Hoare triple {53842#(<= 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); {53842#(<= main_~k~0 14)} is VALID [2018-11-23 12:01:22,354 INFO L273 TraceCheckUtils]: 47: Hoare triple {53842#(<= main_~k~0 14)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53842#(<= main_~k~0 14)} is VALID [2018-11-23 12:01:22,355 INFO L273 TraceCheckUtils]: 48: Hoare triple {53842#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {53852#(<= main_~k~0 15)} is VALID [2018-11-23 12:01:22,355 INFO L273 TraceCheckUtils]: 49: Hoare triple {53852#(<= 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); {53852#(<= main_~k~0 15)} is VALID [2018-11-23 12:01:22,356 INFO L273 TraceCheckUtils]: 50: Hoare triple {53852#(<= main_~k~0 15)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53852#(<= main_~k~0 15)} is VALID [2018-11-23 12:01:22,356 INFO L273 TraceCheckUtils]: 51: Hoare triple {53852#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {53862#(<= main_~k~0 16)} is VALID [2018-11-23 12:01:22,357 INFO L273 TraceCheckUtils]: 52: Hoare triple {53862#(<= 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); {53862#(<= main_~k~0 16)} is VALID [2018-11-23 12:01:22,357 INFO L273 TraceCheckUtils]: 53: Hoare triple {53862#(<= main_~k~0 16)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53862#(<= main_~k~0 16)} is VALID [2018-11-23 12:01:22,358 INFO L273 TraceCheckUtils]: 54: Hoare triple {53862#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {53872#(<= main_~k~0 17)} is VALID [2018-11-23 12:01:22,359 INFO L273 TraceCheckUtils]: 55: Hoare triple {53872#(<= 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); {53872#(<= main_~k~0 17)} is VALID [2018-11-23 12:01:22,359 INFO L273 TraceCheckUtils]: 56: Hoare triple {53872#(<= main_~k~0 17)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53872#(<= main_~k~0 17)} is VALID [2018-11-23 12:01:22,360 INFO L273 TraceCheckUtils]: 57: Hoare triple {53872#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {53882#(<= main_~k~0 18)} is VALID [2018-11-23 12:01:22,360 INFO L273 TraceCheckUtils]: 58: Hoare triple {53882#(<= 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); {53882#(<= main_~k~0 18)} is VALID [2018-11-23 12:01:22,361 INFO L273 TraceCheckUtils]: 59: Hoare triple {53882#(<= main_~k~0 18)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53882#(<= main_~k~0 18)} is VALID [2018-11-23 12:01:22,362 INFO L273 TraceCheckUtils]: 60: Hoare triple {53882#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {53892#(<= main_~k~0 19)} is VALID [2018-11-23 12:01:22,362 INFO L273 TraceCheckUtils]: 61: Hoare triple {53892#(<= 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); {53892#(<= main_~k~0 19)} is VALID [2018-11-23 12:01:22,363 INFO L273 TraceCheckUtils]: 62: Hoare triple {53892#(<= main_~k~0 19)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53892#(<= main_~k~0 19)} is VALID [2018-11-23 12:01:22,363 INFO L273 TraceCheckUtils]: 63: Hoare triple {53892#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {53902#(<= main_~k~0 20)} is VALID [2018-11-23 12:01:22,364 INFO L273 TraceCheckUtils]: 64: Hoare triple {53902#(<= 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); {53902#(<= main_~k~0 20)} is VALID [2018-11-23 12:01:22,364 INFO L273 TraceCheckUtils]: 65: Hoare triple {53902#(<= main_~k~0 20)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53902#(<= main_~k~0 20)} is VALID [2018-11-23 12:01:22,365 INFO L273 TraceCheckUtils]: 66: Hoare triple {53902#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {53912#(<= main_~k~0 21)} is VALID [2018-11-23 12:01:22,366 INFO L273 TraceCheckUtils]: 67: Hoare triple {53912#(<= 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); {53912#(<= main_~k~0 21)} is VALID [2018-11-23 12:01:22,366 INFO L273 TraceCheckUtils]: 68: Hoare triple {53912#(<= main_~k~0 21)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53912#(<= main_~k~0 21)} is VALID [2018-11-23 12:01:22,367 INFO L273 TraceCheckUtils]: 69: Hoare triple {53912#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {53922#(<= main_~k~0 22)} is VALID [2018-11-23 12:01:22,368 INFO L273 TraceCheckUtils]: 70: Hoare triple {53922#(<= 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); {53922#(<= main_~k~0 22)} is VALID [2018-11-23 12:01:22,368 INFO L273 TraceCheckUtils]: 71: Hoare triple {53922#(<= main_~k~0 22)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53922#(<= main_~k~0 22)} is VALID [2018-11-23 12:01:22,369 INFO L273 TraceCheckUtils]: 72: Hoare triple {53922#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {53932#(<= main_~k~0 23)} is VALID [2018-11-23 12:01:22,369 INFO L273 TraceCheckUtils]: 73: Hoare triple {53932#(<= 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); {53932#(<= main_~k~0 23)} is VALID [2018-11-23 12:01:22,370 INFO L273 TraceCheckUtils]: 74: Hoare triple {53932#(<= main_~k~0 23)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53932#(<= main_~k~0 23)} is VALID [2018-11-23 12:01:22,371 INFO L273 TraceCheckUtils]: 75: Hoare triple {53932#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {53942#(<= main_~k~0 24)} is VALID [2018-11-23 12:01:22,371 INFO L273 TraceCheckUtils]: 76: Hoare triple {53942#(<= 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); {53942#(<= main_~k~0 24)} is VALID [2018-11-23 12:01:22,372 INFO L273 TraceCheckUtils]: 77: Hoare triple {53942#(<= main_~k~0 24)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53942#(<= main_~k~0 24)} is VALID [2018-11-23 12:01:22,372 INFO L273 TraceCheckUtils]: 78: Hoare triple {53942#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {53952#(<= main_~k~0 25)} is VALID [2018-11-23 12:01:22,373 INFO L273 TraceCheckUtils]: 79: Hoare triple {53952#(<= 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); {53952#(<= main_~k~0 25)} is VALID [2018-11-23 12:01:22,373 INFO L273 TraceCheckUtils]: 80: Hoare triple {53952#(<= main_~k~0 25)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53952#(<= main_~k~0 25)} is VALID [2018-11-23 12:01:22,374 INFO L273 TraceCheckUtils]: 81: Hoare triple {53952#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {53962#(<= main_~k~0 26)} is VALID [2018-11-23 12:01:22,375 INFO L273 TraceCheckUtils]: 82: Hoare triple {53962#(<= 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); {53962#(<= main_~k~0 26)} is VALID [2018-11-23 12:01:22,375 INFO L273 TraceCheckUtils]: 83: Hoare triple {53962#(<= main_~k~0 26)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53962#(<= main_~k~0 26)} is VALID [2018-11-23 12:01:22,376 INFO L273 TraceCheckUtils]: 84: Hoare triple {53962#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {53972#(<= main_~k~0 27)} is VALID [2018-11-23 12:01:22,376 INFO L273 TraceCheckUtils]: 85: Hoare triple {53972#(<= 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); {53972#(<= main_~k~0 27)} is VALID [2018-11-23 12:01:22,377 INFO L273 TraceCheckUtils]: 86: Hoare triple {53972#(<= main_~k~0 27)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53972#(<= main_~k~0 27)} is VALID [2018-11-23 12:01:22,378 INFO L273 TraceCheckUtils]: 87: Hoare triple {53972#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {53982#(<= main_~k~0 28)} is VALID [2018-11-23 12:01:22,378 INFO L273 TraceCheckUtils]: 88: Hoare triple {53982#(<= 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); {53982#(<= main_~k~0 28)} is VALID [2018-11-23 12:01:22,379 INFO L273 TraceCheckUtils]: 89: Hoare triple {53982#(<= main_~k~0 28)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53982#(<= main_~k~0 28)} is VALID [2018-11-23 12:01:22,379 INFO L273 TraceCheckUtils]: 90: Hoare triple {53982#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {53992#(<= main_~k~0 29)} is VALID [2018-11-23 12:01:22,380 INFO L273 TraceCheckUtils]: 91: Hoare triple {53992#(<= 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); {53992#(<= main_~k~0 29)} is VALID [2018-11-23 12:01:22,380 INFO L273 TraceCheckUtils]: 92: Hoare triple {53992#(<= main_~k~0 29)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {53992#(<= main_~k~0 29)} is VALID [2018-11-23 12:01:22,381 INFO L273 TraceCheckUtils]: 93: Hoare triple {53992#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {54002#(<= main_~k~0 30)} is VALID [2018-11-23 12:01:22,382 INFO L273 TraceCheckUtils]: 94: Hoare triple {54002#(<= 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); {54002#(<= main_~k~0 30)} is VALID [2018-11-23 12:01:22,382 INFO L273 TraceCheckUtils]: 95: Hoare triple {54002#(<= main_~k~0 30)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {54002#(<= main_~k~0 30)} is VALID [2018-11-23 12:01:22,383 INFO L273 TraceCheckUtils]: 96: Hoare triple {54002#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {54012#(<= main_~k~0 31)} is VALID [2018-11-23 12:01:22,383 INFO L273 TraceCheckUtils]: 97: Hoare triple {54012#(<= 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); {54012#(<= main_~k~0 31)} is VALID [2018-11-23 12:01:22,384 INFO L273 TraceCheckUtils]: 98: Hoare triple {54012#(<= main_~k~0 31)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {54012#(<= main_~k~0 31)} is VALID [2018-11-23 12:01:22,385 INFO L273 TraceCheckUtils]: 99: Hoare triple {54012#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {54022#(<= main_~k~0 32)} is VALID [2018-11-23 12:01:22,385 INFO L273 TraceCheckUtils]: 100: Hoare triple {54022#(<= 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); {54022#(<= main_~k~0 32)} is VALID [2018-11-23 12:01:22,386 INFO L273 TraceCheckUtils]: 101: Hoare triple {54022#(<= main_~k~0 32)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {54022#(<= main_~k~0 32)} is VALID [2018-11-23 12:01:22,386 INFO L273 TraceCheckUtils]: 102: Hoare triple {54022#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {54032#(<= main_~k~0 33)} is VALID [2018-11-23 12:01:22,387 INFO L273 TraceCheckUtils]: 103: Hoare triple {54032#(<= 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); {54032#(<= main_~k~0 33)} is VALID [2018-11-23 12:01:22,387 INFO L273 TraceCheckUtils]: 104: Hoare triple {54032#(<= main_~k~0 33)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {54032#(<= main_~k~0 33)} is VALID [2018-11-23 12:01:22,388 INFO L273 TraceCheckUtils]: 105: Hoare triple {54032#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {54042#(<= main_~k~0 34)} is VALID [2018-11-23 12:01:22,389 INFO L273 TraceCheckUtils]: 106: Hoare triple {54042#(<= 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); {54042#(<= main_~k~0 34)} is VALID [2018-11-23 12:01:22,389 INFO L273 TraceCheckUtils]: 107: Hoare triple {54042#(<= main_~k~0 34)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {54042#(<= main_~k~0 34)} is VALID [2018-11-23 12:01:22,390 INFO L273 TraceCheckUtils]: 108: Hoare triple {54042#(<= main_~k~0 34)} ~k~0 := 1 + ~k~0; {54052#(<= main_~k~0 35)} is VALID [2018-11-23 12:01:22,390 INFO L273 TraceCheckUtils]: 109: Hoare triple {54052#(<= 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); {54052#(<= main_~k~0 35)} is VALID [2018-11-23 12:01:22,391 INFO L273 TraceCheckUtils]: 110: Hoare triple {54052#(<= main_~k~0 35)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {54052#(<= main_~k~0 35)} is VALID [2018-11-23 12:01:22,392 INFO L273 TraceCheckUtils]: 111: Hoare triple {54052#(<= main_~k~0 35)} ~k~0 := 1 + ~k~0; {54062#(<= main_~k~0 36)} is VALID [2018-11-23 12:01:22,392 INFO L273 TraceCheckUtils]: 112: Hoare triple {54062#(<= 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); {54062#(<= main_~k~0 36)} is VALID [2018-11-23 12:01:22,393 INFO L273 TraceCheckUtils]: 113: Hoare triple {54062#(<= main_~k~0 36)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {54062#(<= main_~k~0 36)} is VALID [2018-11-23 12:01:22,393 INFO L273 TraceCheckUtils]: 114: Hoare triple {54062#(<= main_~k~0 36)} ~k~0 := 1 + ~k~0; {54072#(<= main_~k~0 37)} is VALID [2018-11-23 12:01:22,394 INFO L273 TraceCheckUtils]: 115: Hoare triple {54072#(<= main_~k~0 37)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {54072#(<= main_~k~0 37)} is VALID [2018-11-23 12:01:22,394 INFO L273 TraceCheckUtils]: 116: Hoare triple {54072#(<= main_~k~0 37)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {54072#(<= main_~k~0 37)} is VALID [2018-11-23 12:01:22,395 INFO L273 TraceCheckUtils]: 117: Hoare triple {54072#(<= main_~k~0 37)} ~k~0 := 1 + ~k~0; {54082#(<= main_~k~0 38)} is VALID [2018-11-23 12:01:22,396 INFO L273 TraceCheckUtils]: 118: Hoare triple {54082#(<= main_~k~0 38)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {54082#(<= main_~k~0 38)} is VALID [2018-11-23 12:01:22,396 INFO L273 TraceCheckUtils]: 119: Hoare triple {54082#(<= main_~k~0 38)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {54082#(<= main_~k~0 38)} is VALID [2018-11-23 12:01:22,397 INFO L273 TraceCheckUtils]: 120: Hoare triple {54082#(<= main_~k~0 38)} ~k~0 := 1 + ~k~0; {54092#(<= main_~k~0 39)} is VALID [2018-11-23 12:01:22,397 INFO L273 TraceCheckUtils]: 121: Hoare triple {54092#(<= main_~k~0 39)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {54092#(<= main_~k~0 39)} is VALID [2018-11-23 12:01:22,398 INFO L273 TraceCheckUtils]: 122: Hoare triple {54092#(<= main_~k~0 39)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {54092#(<= main_~k~0 39)} is VALID [2018-11-23 12:01:22,399 INFO L273 TraceCheckUtils]: 123: Hoare triple {54092#(<= main_~k~0 39)} ~k~0 := 1 + ~k~0; {54102#(<= main_~k~0 40)} is VALID [2018-11-23 12:01:22,399 INFO L273 TraceCheckUtils]: 124: Hoare triple {54102#(<= main_~k~0 40)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {54102#(<= main_~k~0 40)} is VALID [2018-11-23 12:01:22,400 INFO L273 TraceCheckUtils]: 125: Hoare triple {54102#(<= main_~k~0 40)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {54102#(<= main_~k~0 40)} is VALID [2018-11-23 12:01:22,400 INFO L273 TraceCheckUtils]: 126: Hoare triple {54102#(<= main_~k~0 40)} ~k~0 := 1 + ~k~0; {54112#(<= main_~k~0 41)} is VALID [2018-11-23 12:01:22,401 INFO L273 TraceCheckUtils]: 127: Hoare triple {54112#(<= main_~k~0 41)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {54112#(<= main_~k~0 41)} is VALID [2018-11-23 12:01:22,401 INFO L273 TraceCheckUtils]: 128: Hoare triple {54112#(<= main_~k~0 41)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {54112#(<= main_~k~0 41)} is VALID [2018-11-23 12:01:22,402 INFO L273 TraceCheckUtils]: 129: Hoare triple {54112#(<= main_~k~0 41)} ~k~0 := 1 + ~k~0; {54122#(<= main_~k~0 42)} is VALID [2018-11-23 12:01:22,403 INFO L273 TraceCheckUtils]: 130: Hoare triple {54122#(<= main_~k~0 42)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {54122#(<= main_~k~0 42)} is VALID [2018-11-23 12:01:22,403 INFO L273 TraceCheckUtils]: 131: Hoare triple {54122#(<= main_~k~0 42)} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {54122#(<= main_~k~0 42)} is VALID [2018-11-23 12:01:22,404 INFO L273 TraceCheckUtils]: 132: Hoare triple {54122#(<= main_~k~0 42)} ~k~0 := 1 + ~k~0; {54132#(<= main_~k~0 43)} is VALID [2018-11-23 12:01:22,405 INFO L273 TraceCheckUtils]: 133: Hoare triple {54132#(<= main_~k~0 43)} assume !(~k~0 < 100000); {53645#false} is VALID [2018-11-23 12:01:22,405 INFO L273 TraceCheckUtils]: 134: Hoare triple {53645#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); {53645#false} is VALID [2018-11-23 12:01:22,405 INFO L273 TraceCheckUtils]: 135: Hoare triple {53645#false} ~x~0 := 0; {53645#false} is VALID [2018-11-23 12:01:22,405 INFO L273 TraceCheckUtils]: 136: Hoare triple {53645#false} assume !(~x~0 < ~i~0); {53645#false} is VALID [2018-11-23 12:01:22,405 INFO L273 TraceCheckUtils]: 137: Hoare triple {53645#false} ~x~0 := ~i~0; {53645#false} is VALID [2018-11-23 12:01:22,406 INFO L273 TraceCheckUtils]: 138: Hoare triple {53645#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); {53645#false} is VALID [2018-11-23 12:01:22,406 INFO L256 TraceCheckUtils]: 139: Hoare triple {53645#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {53645#false} is VALID [2018-11-23 12:01:22,406 INFO L273 TraceCheckUtils]: 140: Hoare triple {53645#false} ~cond := #in~cond; {53645#false} is VALID [2018-11-23 12:01:22,406 INFO L273 TraceCheckUtils]: 141: Hoare triple {53645#false} assume !(0 == ~cond); {53645#false} is VALID [2018-11-23 12:01:22,406 INFO L273 TraceCheckUtils]: 142: Hoare triple {53645#false} assume true; {53645#false} is VALID [2018-11-23 12:01:22,406 INFO L268 TraceCheckUtils]: 143: Hoare quadruple {53645#false} {53645#false} #136#return; {53645#false} is VALID [2018-11-23 12:01:22,407 INFO L273 TraceCheckUtils]: 144: Hoare triple {53645#false} havoc #t~mem9;havoc #t~mem10; {53645#false} is VALID [2018-11-23 12:01:22,407 INFO L273 TraceCheckUtils]: 145: Hoare triple {53645#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {53645#false} is VALID [2018-11-23 12:01:22,407 INFO L273 TraceCheckUtils]: 146: Hoare triple {53645#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); {53645#false} is VALID [2018-11-23 12:01:22,407 INFO L256 TraceCheckUtils]: 147: Hoare triple {53645#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {53645#false} is VALID [2018-11-23 12:01:22,407 INFO L273 TraceCheckUtils]: 148: Hoare triple {53645#false} ~cond := #in~cond; {53645#false} is VALID [2018-11-23 12:01:22,407 INFO L273 TraceCheckUtils]: 149: Hoare triple {53645#false} assume 0 == ~cond; {53645#false} is VALID [2018-11-23 12:01:22,408 INFO L273 TraceCheckUtils]: 150: Hoare triple {53645#false} assume !false; {53645#false} is VALID [2018-11-23 12:01:22,421 INFO L134 CoverageAnalysis]: Checked inductivity of 2629 backedges. 0 proven. 2625 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 12:01:22,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:01:22,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 90 [2018-11-23 12:01:22,441 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 151 [2018-11-23 12:01:22,442 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:22,442 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 90 states. [2018-11-23 12:01:22,736 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 282 edges. 282 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:22,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-11-23 12:01:22,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-11-23 12:01:22,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3016, Invalid=4994, Unknown=0, NotChecked=0, Total=8010 [2018-11-23 12:01:22,738 INFO L87 Difference]: Start difference. First operand 306 states and 405 transitions. Second operand 90 states. [2018-11-23 12:01:24,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:24,784 INFO L93 Difference]: Finished difference Result 369 states and 491 transitions. [2018-11-23 12:01:24,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-23 12:01:24,784 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 151 [2018-11-23 12:01:24,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:24,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-23 12:01:24,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 279 transitions. [2018-11-23 12:01:24,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-23 12:01:24,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 279 transitions. [2018-11-23 12:01:24,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states and 279 transitions. [2018-11-23 12:01:25,070 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 279 edges. 279 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:25,077 INFO L225 Difference]: With dead ends: 369 [2018-11-23 12:01:25,077 INFO L226 Difference]: Without dead ends: 322 [2018-11-23 12:01:25,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2839 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3016, Invalid=4994, Unknown=0, NotChecked=0, Total=8010 [2018-11-23 12:01:25,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-11-23 12:01:25,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 312. [2018-11-23 12:01:25,336 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:25,336 INFO L82 GeneralOperation]: Start isEquivalent. First operand 322 states. Second operand 312 states. [2018-11-23 12:01:25,336 INFO L74 IsIncluded]: Start isIncluded. First operand 322 states. Second operand 312 states. [2018-11-23 12:01:25,336 INFO L87 Difference]: Start difference. First operand 322 states. Second operand 312 states. [2018-11-23 12:01:25,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:25,343 INFO L93 Difference]: Finished difference Result 322 states and 428 transitions. [2018-11-23 12:01:25,343 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 428 transitions. [2018-11-23 12:01:25,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:25,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:25,344 INFO L74 IsIncluded]: Start isIncluded. First operand 312 states. Second operand 322 states. [2018-11-23 12:01:25,344 INFO L87 Difference]: Start difference. First operand 312 states. Second operand 322 states. [2018-11-23 12:01:25,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:25,350 INFO L93 Difference]: Finished difference Result 322 states and 428 transitions. [2018-11-23 12:01:25,350 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 428 transitions. [2018-11-23 12:01:25,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:25,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:25,350 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:25,351 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:25,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-11-23 12:01:25,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 413 transitions. [2018-11-23 12:01:25,356 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 413 transitions. Word has length 151 [2018-11-23 12:01:25,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:25,357 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 413 transitions. [2018-11-23 12:01:25,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-11-23 12:01:25,357 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 413 transitions. [2018-11-23 12:01:25,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-23 12:01:25,358 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:25,358 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 43, 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 12:01:25,358 INFO L423 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:25,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:25,358 INFO L82 PathProgramCache]: Analyzing trace with hash -183592559, now seen corresponding path program 39 times [2018-11-23 12:01:25,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:25,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:25,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:25,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:01:25,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:25,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:27,094 INFO L256 TraceCheckUtils]: 0: Hoare triple {55749#true} call ULTIMATE.init(); {55749#true} is VALID [2018-11-23 12:01:27,094 INFO L273 TraceCheckUtils]: 1: Hoare triple {55749#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {55749#true} is VALID [2018-11-23 12:01:27,094 INFO L273 TraceCheckUtils]: 2: Hoare triple {55749#true} assume true; {55749#true} is VALID [2018-11-23 12:01:27,094 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {55749#true} {55749#true} #130#return; {55749#true} is VALID [2018-11-23 12:01:27,095 INFO L256 TraceCheckUtils]: 4: Hoare triple {55749#true} call #t~ret15 := main(); {55749#true} is VALID [2018-11-23 12:01:27,095 INFO L273 TraceCheckUtils]: 5: Hoare triple {55749#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {55751#(= main_~i~0 0)} is VALID [2018-11-23 12:01:27,096 INFO L273 TraceCheckUtils]: 6: Hoare triple {55751#(= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := 1 + ~i~0;~s~0 := ~i~0; {55752#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,096 INFO L273 TraceCheckUtils]: 7: Hoare triple {55752#(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); {55752#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,097 INFO L273 TraceCheckUtils]: 8: Hoare triple {55752#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {55752#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,098 INFO L273 TraceCheckUtils]: 9: Hoare triple {55752#(and (<= main_~k~0 (+ main_~i~0 1)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {55753#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,099 INFO L273 TraceCheckUtils]: 10: Hoare triple {55753#(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); {55753#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,099 INFO L273 TraceCheckUtils]: 11: Hoare triple {55753#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {55753#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,100 INFO L273 TraceCheckUtils]: 12: Hoare triple {55753#(and (<= main_~k~0 (+ main_~i~0 2)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {55754#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,101 INFO L273 TraceCheckUtils]: 13: Hoare triple {55754#(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); {55754#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,101 INFO L273 TraceCheckUtils]: 14: Hoare triple {55754#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {55754#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,102 INFO L273 TraceCheckUtils]: 15: Hoare triple {55754#(and (<= main_~k~0 (+ main_~i~0 3)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {55755#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,103 INFO L273 TraceCheckUtils]: 16: Hoare triple {55755#(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); {55755#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,104 INFO L273 TraceCheckUtils]: 17: Hoare triple {55755#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {55755#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,104 INFO L273 TraceCheckUtils]: 18: Hoare triple {55755#(and (<= main_~k~0 (+ main_~i~0 4)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {55756#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,105 INFO L273 TraceCheckUtils]: 19: Hoare triple {55756#(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); {55756#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,106 INFO L273 TraceCheckUtils]: 20: Hoare triple {55756#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {55756#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,107 INFO L273 TraceCheckUtils]: 21: Hoare triple {55756#(and (<= main_~k~0 (+ main_~i~0 5)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {55757#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,108 INFO L273 TraceCheckUtils]: 22: Hoare triple {55757#(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); {55757#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,108 INFO L273 TraceCheckUtils]: 23: Hoare triple {55757#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {55757#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,109 INFO L273 TraceCheckUtils]: 24: Hoare triple {55757#(and (<= main_~k~0 (+ main_~i~0 6)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {55758#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,110 INFO L273 TraceCheckUtils]: 25: Hoare triple {55758#(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); {55758#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,111 INFO L273 TraceCheckUtils]: 26: Hoare triple {55758#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {55758#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,111 INFO L273 TraceCheckUtils]: 27: Hoare triple {55758#(and (<= main_~k~0 (+ main_~i~0 7)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {55759#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,112 INFO L273 TraceCheckUtils]: 28: Hoare triple {55759#(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); {55759#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,113 INFO L273 TraceCheckUtils]: 29: Hoare triple {55759#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {55759#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,114 INFO L273 TraceCheckUtils]: 30: Hoare triple {55759#(and (<= main_~k~0 (+ main_~i~0 8)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {55760#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,114 INFO L273 TraceCheckUtils]: 31: Hoare triple {55760#(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); {55760#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,115 INFO L273 TraceCheckUtils]: 32: Hoare triple {55760#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {55760#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,116 INFO L273 TraceCheckUtils]: 33: Hoare triple {55760#(and (<= main_~k~0 (+ main_~i~0 9)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {55761#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,116 INFO L273 TraceCheckUtils]: 34: Hoare triple {55761#(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); {55761#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,117 INFO L273 TraceCheckUtils]: 35: Hoare triple {55761#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {55761#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,118 INFO L273 TraceCheckUtils]: 36: Hoare triple {55761#(and (<= main_~k~0 (+ main_~i~0 10)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {55762#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,119 INFO L273 TraceCheckUtils]: 37: Hoare triple {55762#(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); {55762#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,120 INFO L273 TraceCheckUtils]: 38: Hoare triple {55762#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {55762#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,120 INFO L273 TraceCheckUtils]: 39: Hoare triple {55762#(and (<= main_~k~0 (+ main_~i~0 11)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {55763#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,121 INFO L273 TraceCheckUtils]: 40: Hoare triple {55763#(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); {55763#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,122 INFO L273 TraceCheckUtils]: 41: Hoare triple {55763#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {55763#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,123 INFO L273 TraceCheckUtils]: 42: Hoare triple {55763#(and (<= main_~k~0 (+ main_~i~0 12)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {55764#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,123 INFO L273 TraceCheckUtils]: 43: Hoare triple {55764#(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); {55764#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,124 INFO L273 TraceCheckUtils]: 44: Hoare triple {55764#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {55764#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,125 INFO L273 TraceCheckUtils]: 45: Hoare triple {55764#(and (<= main_~k~0 (+ main_~i~0 13)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {55765#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,125 INFO L273 TraceCheckUtils]: 46: Hoare triple {55765#(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); {55765#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,126 INFO L273 TraceCheckUtils]: 47: Hoare triple {55765#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {55765#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,127 INFO L273 TraceCheckUtils]: 48: Hoare triple {55765#(and (<= main_~k~0 (+ main_~i~0 14)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {55766#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,128 INFO L273 TraceCheckUtils]: 49: Hoare triple {55766#(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); {55766#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,128 INFO L273 TraceCheckUtils]: 50: Hoare triple {55766#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {55766#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,129 INFO L273 TraceCheckUtils]: 51: Hoare triple {55766#(and (<= main_~k~0 (+ main_~i~0 15)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {55767#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,130 INFO L273 TraceCheckUtils]: 52: Hoare triple {55767#(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); {55767#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,131 INFO L273 TraceCheckUtils]: 53: Hoare triple {55767#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {55767#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,131 INFO L273 TraceCheckUtils]: 54: Hoare triple {55767#(and (<= main_~k~0 (+ main_~i~0 16)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {55768#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 12:01:27,132 INFO L273 TraceCheckUtils]: 55: Hoare triple {55768#(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); {55768#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 12:01:27,133 INFO L273 TraceCheckUtils]: 56: Hoare triple {55768#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {55768#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} is VALID [2018-11-23 12:01:27,134 INFO L273 TraceCheckUtils]: 57: Hoare triple {55768#(and (= main_~i~0 0) (<= main_~k~0 (+ main_~i~0 17)))} ~k~0 := 1 + ~k~0; {55769#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,134 INFO L273 TraceCheckUtils]: 58: Hoare triple {55769#(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); {55769#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,135 INFO L273 TraceCheckUtils]: 59: Hoare triple {55769#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {55769#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,136 INFO L273 TraceCheckUtils]: 60: Hoare triple {55769#(and (<= main_~k~0 (+ main_~i~0 18)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {55770#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,137 INFO L273 TraceCheckUtils]: 61: Hoare triple {55770#(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); {55770#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,137 INFO L273 TraceCheckUtils]: 62: Hoare triple {55770#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {55770#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,138 INFO L273 TraceCheckUtils]: 63: Hoare triple {55770#(and (<= main_~k~0 (+ main_~i~0 19)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {55771#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,139 INFO L273 TraceCheckUtils]: 64: Hoare triple {55771#(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); {55771#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,139 INFO L273 TraceCheckUtils]: 65: Hoare triple {55771#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {55771#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,140 INFO L273 TraceCheckUtils]: 66: Hoare triple {55771#(and (<= main_~k~0 (+ main_~i~0 20)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {55772#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,141 INFO L273 TraceCheckUtils]: 67: Hoare triple {55772#(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); {55772#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,142 INFO L273 TraceCheckUtils]: 68: Hoare triple {55772#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {55772#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,142 INFO L273 TraceCheckUtils]: 69: Hoare triple {55772#(and (<= main_~k~0 (+ main_~i~0 21)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {55773#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,143 INFO L273 TraceCheckUtils]: 70: Hoare triple {55773#(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); {55773#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,144 INFO L273 TraceCheckUtils]: 71: Hoare triple {55773#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {55773#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,145 INFO L273 TraceCheckUtils]: 72: Hoare triple {55773#(and (<= main_~k~0 (+ main_~i~0 22)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {55774#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,145 INFO L273 TraceCheckUtils]: 73: Hoare triple {55774#(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); {55774#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,146 INFO L273 TraceCheckUtils]: 74: Hoare triple {55774#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {55774#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,147 INFO L273 TraceCheckUtils]: 75: Hoare triple {55774#(and (<= main_~k~0 (+ main_~i~0 23)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {55775#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,148 INFO L273 TraceCheckUtils]: 76: Hoare triple {55775#(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); {55775#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,148 INFO L273 TraceCheckUtils]: 77: Hoare triple {55775#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {55775#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,149 INFO L273 TraceCheckUtils]: 78: Hoare triple {55775#(and (<= main_~k~0 (+ main_~i~0 24)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {55776#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,150 INFO L273 TraceCheckUtils]: 79: Hoare triple {55776#(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); {55776#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,151 INFO L273 TraceCheckUtils]: 80: Hoare triple {55776#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {55776#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,151 INFO L273 TraceCheckUtils]: 81: Hoare triple {55776#(and (<= main_~k~0 (+ main_~i~0 25)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {55777#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,152 INFO L273 TraceCheckUtils]: 82: Hoare triple {55777#(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); {55777#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,153 INFO L273 TraceCheckUtils]: 83: Hoare triple {55777#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {55777#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,154 INFO L273 TraceCheckUtils]: 84: Hoare triple {55777#(and (<= main_~k~0 (+ main_~i~0 26)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {55778#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,154 INFO L273 TraceCheckUtils]: 85: Hoare triple {55778#(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); {55778#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,155 INFO L273 TraceCheckUtils]: 86: Hoare triple {55778#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {55778#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,156 INFO L273 TraceCheckUtils]: 87: Hoare triple {55778#(and (<= main_~k~0 (+ main_~i~0 27)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {55779#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,157 INFO L273 TraceCheckUtils]: 88: Hoare triple {55779#(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); {55779#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,157 INFO L273 TraceCheckUtils]: 89: Hoare triple {55779#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {55779#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,158 INFO L273 TraceCheckUtils]: 90: Hoare triple {55779#(and (<= main_~k~0 (+ main_~i~0 28)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {55780#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,159 INFO L273 TraceCheckUtils]: 91: Hoare triple {55780#(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); {55780#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,160 INFO L273 TraceCheckUtils]: 92: Hoare triple {55780#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {55780#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,161 INFO L273 TraceCheckUtils]: 93: Hoare triple {55780#(and (<= main_~k~0 (+ main_~i~0 29)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {55781#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,162 INFO L273 TraceCheckUtils]: 94: Hoare triple {55781#(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); {55781#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,162 INFO L273 TraceCheckUtils]: 95: Hoare triple {55781#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {55781#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,163 INFO L273 TraceCheckUtils]: 96: Hoare triple {55781#(and (<= main_~k~0 (+ main_~i~0 30)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {55782#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,164 INFO L273 TraceCheckUtils]: 97: Hoare triple {55782#(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); {55782#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,165 INFO L273 TraceCheckUtils]: 98: Hoare triple {55782#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {55782#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,165 INFO L273 TraceCheckUtils]: 99: Hoare triple {55782#(and (<= main_~k~0 (+ main_~i~0 31)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {55783#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,166 INFO L273 TraceCheckUtils]: 100: Hoare triple {55783#(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); {55783#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,167 INFO L273 TraceCheckUtils]: 101: Hoare triple {55783#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {55783#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,168 INFO L273 TraceCheckUtils]: 102: Hoare triple {55783#(and (<= main_~k~0 (+ main_~i~0 32)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {55784#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,169 INFO L273 TraceCheckUtils]: 103: Hoare triple {55784#(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); {55784#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,169 INFO L273 TraceCheckUtils]: 104: Hoare triple {55784#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {55784#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,170 INFO L273 TraceCheckUtils]: 105: Hoare triple {55784#(and (<= main_~k~0 (+ main_~i~0 33)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {55785#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,171 INFO L273 TraceCheckUtils]: 106: Hoare triple {55785#(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); {55785#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,172 INFO L273 TraceCheckUtils]: 107: Hoare triple {55785#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {55785#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,173 INFO L273 TraceCheckUtils]: 108: Hoare triple {55785#(and (<= main_~k~0 (+ main_~i~0 34)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {55786#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,173 INFO L273 TraceCheckUtils]: 109: Hoare triple {55786#(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); {55786#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,174 INFO L273 TraceCheckUtils]: 110: Hoare triple {55786#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {55786#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,175 INFO L273 TraceCheckUtils]: 111: Hoare triple {55786#(and (<= main_~k~0 (+ main_~i~0 35)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {55787#(and (<= main_~k~0 (+ main_~i~0 36)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,176 INFO L273 TraceCheckUtils]: 112: Hoare triple {55787#(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); {55787#(and (<= main_~k~0 (+ main_~i~0 36)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,176 INFO L273 TraceCheckUtils]: 113: Hoare triple {55787#(and (<= main_~k~0 (+ main_~i~0 36)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {55787#(and (<= main_~k~0 (+ main_~i~0 36)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,177 INFO L273 TraceCheckUtils]: 114: Hoare triple {55787#(and (<= main_~k~0 (+ main_~i~0 36)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {55788#(and (<= main_~k~0 (+ main_~i~0 37)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,178 INFO L273 TraceCheckUtils]: 115: Hoare triple {55788#(and (<= main_~k~0 (+ main_~i~0 37)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {55788#(and (<= main_~k~0 (+ main_~i~0 37)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,179 INFO L273 TraceCheckUtils]: 116: Hoare triple {55788#(and (<= main_~k~0 (+ main_~i~0 37)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {55788#(and (<= main_~k~0 (+ main_~i~0 37)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,179 INFO L273 TraceCheckUtils]: 117: Hoare triple {55788#(and (<= main_~k~0 (+ main_~i~0 37)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {55789#(and (<= main_~k~0 (+ main_~i~0 38)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,180 INFO L273 TraceCheckUtils]: 118: Hoare triple {55789#(and (<= main_~k~0 (+ main_~i~0 38)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {55789#(and (<= main_~k~0 (+ main_~i~0 38)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,181 INFO L273 TraceCheckUtils]: 119: Hoare triple {55789#(and (<= main_~k~0 (+ main_~i~0 38)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {55789#(and (<= main_~k~0 (+ main_~i~0 38)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,182 INFO L273 TraceCheckUtils]: 120: Hoare triple {55789#(and (<= main_~k~0 (+ main_~i~0 38)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {55790#(and (<= main_~k~0 (+ main_~i~0 39)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,182 INFO L273 TraceCheckUtils]: 121: Hoare triple {55790#(and (<= main_~k~0 (+ main_~i~0 39)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {55790#(and (<= main_~k~0 (+ main_~i~0 39)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,183 INFO L273 TraceCheckUtils]: 122: Hoare triple {55790#(and (<= main_~k~0 (+ main_~i~0 39)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {55790#(and (<= main_~k~0 (+ main_~i~0 39)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,184 INFO L273 TraceCheckUtils]: 123: Hoare triple {55790#(and (<= main_~k~0 (+ main_~i~0 39)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {55791#(and (<= main_~k~0 (+ main_~i~0 40)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,185 INFO L273 TraceCheckUtils]: 124: Hoare triple {55791#(and (<= main_~k~0 (+ main_~i~0 40)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {55791#(and (<= main_~k~0 (+ main_~i~0 40)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,185 INFO L273 TraceCheckUtils]: 125: Hoare triple {55791#(and (<= main_~k~0 (+ main_~i~0 40)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {55791#(and (<= main_~k~0 (+ main_~i~0 40)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,186 INFO L273 TraceCheckUtils]: 126: Hoare triple {55791#(and (<= main_~k~0 (+ main_~i~0 40)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {55792#(and (<= main_~k~0 (+ main_~i~0 41)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,187 INFO L273 TraceCheckUtils]: 127: Hoare triple {55792#(and (<= main_~k~0 (+ main_~i~0 41)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {55792#(and (<= main_~k~0 (+ main_~i~0 41)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,187 INFO L273 TraceCheckUtils]: 128: Hoare triple {55792#(and (<= main_~k~0 (+ main_~i~0 41)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {55792#(and (<= main_~k~0 (+ main_~i~0 41)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,188 INFO L273 TraceCheckUtils]: 129: Hoare triple {55792#(and (<= main_~k~0 (+ main_~i~0 41)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {55793#(and (<= main_~k~0 (+ main_~i~0 42)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,189 INFO L273 TraceCheckUtils]: 130: Hoare triple {55793#(and (<= main_~k~0 (+ main_~i~0 42)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {55793#(and (<= main_~k~0 (+ main_~i~0 42)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,190 INFO L273 TraceCheckUtils]: 131: Hoare triple {55793#(and (<= main_~k~0 (+ main_~i~0 42)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {55793#(and (<= main_~k~0 (+ main_~i~0 42)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,190 INFO L273 TraceCheckUtils]: 132: Hoare triple {55793#(and (<= main_~k~0 (+ main_~i~0 42)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {55794#(and (<= main_~k~0 (+ main_~i~0 43)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,191 INFO L273 TraceCheckUtils]: 133: Hoare triple {55794#(and (<= main_~k~0 (+ main_~i~0 43)) (= main_~i~0 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {55794#(and (<= main_~k~0 (+ main_~i~0 43)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,211 INFO L273 TraceCheckUtils]: 134: Hoare triple {55794#(and (<= main_~k~0 (+ main_~i~0 43)) (= main_~i~0 0))} assume #t~mem0 < #t~mem1;havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {55794#(and (<= main_~k~0 (+ main_~i~0 43)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,224 INFO L273 TraceCheckUtils]: 135: Hoare triple {55794#(and (<= main_~k~0 (+ main_~i~0 43)) (= main_~i~0 0))} ~k~0 := 1 + ~k~0; {55795#(and (<= main_~k~0 (+ main_~i~0 44)) (= main_~i~0 0))} is VALID [2018-11-23 12:01:27,237 INFO L273 TraceCheckUtils]: 136: Hoare triple {55795#(and (<= main_~k~0 (+ main_~i~0 44)) (= main_~i~0 0))} assume !(~k~0 < 100000); {55750#false} is VALID [2018-11-23 12:01:27,237 INFO L273 TraceCheckUtils]: 137: Hoare triple {55750#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); {55750#false} is VALID [2018-11-23 12:01:27,237 INFO L273 TraceCheckUtils]: 138: Hoare triple {55750#false} ~x~0 := 0; {55750#false} is VALID [2018-11-23 12:01:27,237 INFO L273 TraceCheckUtils]: 139: Hoare triple {55750#false} assume !(~x~0 < ~i~0); {55750#false} is VALID [2018-11-23 12:01:27,238 INFO L273 TraceCheckUtils]: 140: Hoare triple {55750#false} ~x~0 := ~i~0; {55750#false} is VALID [2018-11-23 12:01:27,238 INFO L273 TraceCheckUtils]: 141: Hoare triple {55750#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); {55750#false} is VALID [2018-11-23 12:01:27,238 INFO L256 TraceCheckUtils]: 142: Hoare triple {55750#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {55749#true} is VALID [2018-11-23 12:01:27,238 INFO L273 TraceCheckUtils]: 143: Hoare triple {55749#true} ~cond := #in~cond; {55749#true} is VALID [2018-11-23 12:01:27,238 INFO L273 TraceCheckUtils]: 144: Hoare triple {55749#true} assume !(0 == ~cond); {55749#true} is VALID [2018-11-23 12:01:27,238 INFO L273 TraceCheckUtils]: 145: Hoare triple {55749#true} assume true; {55749#true} is VALID [2018-11-23 12:01:27,238 INFO L268 TraceCheckUtils]: 146: Hoare quadruple {55749#true} {55750#false} #136#return; {55750#false} is VALID [2018-11-23 12:01:27,239 INFO L273 TraceCheckUtils]: 147: Hoare triple {55750#false} havoc #t~mem9;havoc #t~mem10; {55750#false} is VALID [2018-11-23 12:01:27,239 INFO L273 TraceCheckUtils]: 148: Hoare triple {55750#false} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {55750#false} is VALID [2018-11-23 12:01:27,239 INFO L273 TraceCheckUtils]: 149: Hoare triple {55750#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); {55750#false} is VALID [2018-11-23 12:01:27,239 INFO L256 TraceCheckUtils]: 150: Hoare triple {55750#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {55750#false} is VALID [2018-11-23 12:01:27,239 INFO L273 TraceCheckUtils]: 151: Hoare triple {55750#false} ~cond := #in~cond; {55750#false} is VALID [2018-11-23 12:01:27,239 INFO L273 TraceCheckUtils]: 152: Hoare triple {55750#false} assume 0 == ~cond; {55750#false} is VALID [2018-11-23 12:01:27,239 INFO L273 TraceCheckUtils]: 153: Hoare triple {55750#false} assume !false; {55750#false} is VALID [2018-11-23 12:01:27,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 2 proven. 2752 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 12:01:27,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:27,281 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:01:27,290 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:01:27,577 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2018-11-23 12:01:27,578 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:01:27,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:27,609 INFO L273 TraceCheckSpWp]: Computing forward predicates...