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_bubblesort_false-unreach-call2_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:51:45,146 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:51:45,148 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:51:45,160 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:51:45,161 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:51:45,162 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:51:45,163 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:51:45,166 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:51:45,168 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:51:45,169 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:51:45,170 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:51:45,170 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:51:45,171 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:51:45,172 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:51:45,173 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:51:45,174 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:51:45,175 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:51:45,177 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:51:45,180 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:51:45,182 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:51:45,183 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:51:45,184 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:51:45,187 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:51:45,188 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:51:45,188 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:51:45,189 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:51:45,190 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:51:45,191 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:51:45,192 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:51:45,193 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:51:45,193 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:51:45,194 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:51:45,195 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:51:45,195 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:51:45,196 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:51:45,197 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:51:45,197 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 11:51:45,216 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:51:45,216 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:51:45,217 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:51:45,217 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:51:45,218 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:51:45,218 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:51:45,218 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:51:45,219 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:51:45,219 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:51:45,219 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 11:51:45,219 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:51:45,220 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:51:45,220 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:51:45,220 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:51:45,220 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:51:45,221 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:51:45,221 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:51:45,221 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:51:45,221 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:51:45,221 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:51:45,222 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:51:45,222 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:51:45,222 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:51:45,222 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:51:45,223 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:51:45,223 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:51:45,223 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:51:45,223 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 11:51:45,223 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:51:45,224 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 11:51:45,224 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:51:45,270 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:51:45,283 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:51:45,287 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:51:45,288 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:51:45,289 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:51:45,290 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/sorting_bubblesort_false-unreach-call2_ground.i [2018-11-23 11:51:45,351 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0eb3fe80d/d705ed5ba44d473988975555eea27b27/FLAG2a50563f7 [2018-11-23 11:51:45,792 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:51:45,793 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/sorting_bubblesort_false-unreach-call2_ground.i [2018-11-23 11:51:45,800 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0eb3fe80d/d705ed5ba44d473988975555eea27b27/FLAG2a50563f7 [2018-11-23 11:51:46,163 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0eb3fe80d/d705ed5ba44d473988975555eea27b27 [2018-11-23 11:51:46,173 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:51:46,175 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:51:46,176 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:51:46,176 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:51:46,180 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:51:46,182 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,185 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@87e5e58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46, skipping insertion in model container [2018-11-23 11:51:46,185 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,195 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:51:46,222 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:51:46,444 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:51:46,449 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:51:46,488 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:51:46,512 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:51:46,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46 WrapperNode [2018-11-23 11:51:46,513 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:51:46,514 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:51:46,514 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:51:46,514 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:51:46,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,533 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,540 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:51:46,540 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:51:46,540 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:51:46,541 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:51:46,550 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,552 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,552 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,564 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,572 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,573 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,576 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:51:46,576 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:51:46,576 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:51:46,577 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:51:46,578 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:51:46,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 11:51:46,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:51:46,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:51:46,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:51:46,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:51:46,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:51:46,708 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 11:51:46,709 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:51:46,709 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:51:46,709 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:51:46,709 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:51:46,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:51:47,297 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:51:47,297 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 11:51:47,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:51:47 BoogieIcfgContainer [2018-11-23 11:51:47,298 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:51:47,299 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:51:47,299 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:51:47,303 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:51:47,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:51:46" (1/3) ... [2018-11-23 11:51:47,304 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d4e312c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:51:47, skipping insertion in model container [2018-11-23 11:51:47,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (2/3) ... [2018-11-23 11:51:47,305 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d4e312c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:51:47, skipping insertion in model container [2018-11-23 11:51:47,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:51:47" (3/3) ... [2018-11-23 11:51:47,307 INFO L112 eAbstractionObserver]: Analyzing ICFG sorting_bubblesort_false-unreach-call2_ground.i [2018-11-23 11:51:47,315 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:51:47,323 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:51:47,338 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:51:47,372 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:51:47,373 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:51:47,374 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:51:47,374 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:51:47,376 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:51:47,376 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:51:47,376 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:51:47,377 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:51:47,377 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:51:47,396 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-11-23 11:51:47,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:51:47,403 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:47,404 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:47,406 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:47,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:47,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1964500077, now seen corresponding path program 1 times [2018-11-23 11:51:47,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:47,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:47,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:47,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:47,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:47,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:47,551 INFO L256 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {31#true} is VALID [2018-11-23 11:51:47,556 INFO L273 TraceCheckUtils]: 1: Hoare triple {31#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {31#true} is VALID [2018-11-23 11:51:47,557 INFO L273 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2018-11-23 11:51:47,557 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #79#return; {31#true} is VALID [2018-11-23 11:51:47,558 INFO L256 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret8 := main(); {31#true} is VALID [2018-11-23 11:51:47,558 INFO L273 TraceCheckUtils]: 5: Hoare triple {31#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {31#true} is VALID [2018-11-23 11:51:47,563 INFO L273 TraceCheckUtils]: 6: Hoare triple {31#true} assume !true; {32#false} is VALID [2018-11-23 11:51:47,564 INFO L273 TraceCheckUtils]: 7: Hoare triple {32#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {32#false} is VALID [2018-11-23 11:51:47,564 INFO L273 TraceCheckUtils]: 8: Hoare triple {32#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {32#false} is VALID [2018-11-23 11:51:47,565 INFO L273 TraceCheckUtils]: 9: Hoare triple {32#false} assume !!(~y~0 < 100000);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); {32#false} is VALID [2018-11-23 11:51:47,565 INFO L256 TraceCheckUtils]: 10: Hoare triple {32#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {32#false} is VALID [2018-11-23 11:51:47,565 INFO L273 TraceCheckUtils]: 11: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2018-11-23 11:51:47,569 INFO L273 TraceCheckUtils]: 12: Hoare triple {32#false} assume 0 == ~cond; {32#false} is VALID [2018-11-23 11:51:47,569 INFO L273 TraceCheckUtils]: 13: Hoare triple {32#false} assume !false; {32#false} is VALID [2018-11-23 11:51:47,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:47,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:51:47,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:51:47,583 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 11:51:47,586 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:47,589 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:51:47,706 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:47,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:51:47,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:51:47,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:51:47,720 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-11-23 11:51:48,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:48,001 INFO L93 Difference]: Finished difference Result 50 states and 69 transitions. [2018-11-23 11:51:48,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:51:48,002 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 11:51:48,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:48,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:51:48,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 69 transitions. [2018-11-23 11:51:48,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:51:48,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 69 transitions. [2018-11-23 11:51:48,021 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 69 transitions. [2018-11-23 11:51:48,555 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:48,567 INFO L225 Difference]: With dead ends: 50 [2018-11-23 11:51:48,567 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 11:51:48,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:51:48,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 11:51:48,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-23 11:51:48,628 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:48,629 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2018-11-23 11:51:48,629 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-23 11:51:48,629 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-23 11:51:48,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:48,634 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2018-11-23 11:51:48,634 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-11-23 11:51:48,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:48,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:48,635 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-23 11:51:48,635 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-23 11:51:48,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:48,640 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2018-11-23 11:51:48,640 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-11-23 11:51:48,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:48,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:48,641 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:48,641 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:48,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:51:48,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-11-23 11:51:48,646 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 14 [2018-11-23 11:51:48,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:48,647 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-23 11:51:48,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:51:48,647 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-11-23 11:51:48,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:51:48,648 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:48,648 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:48,649 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:48,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:48,649 INFO L82 PathProgramCache]: Analyzing trace with hash 900535178, now seen corresponding path program 1 times [2018-11-23 11:51:48,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:48,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:48,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:48,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:48,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:48,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:48,746 INFO L256 TraceCheckUtils]: 0: Hoare triple {180#true} call ULTIMATE.init(); {180#true} is VALID [2018-11-23 11:51:48,746 INFO L273 TraceCheckUtils]: 1: Hoare triple {180#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {180#true} is VALID [2018-11-23 11:51:48,747 INFO L273 TraceCheckUtils]: 2: Hoare triple {180#true} assume true; {180#true} is VALID [2018-11-23 11:51:48,747 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {180#true} {180#true} #79#return; {180#true} is VALID [2018-11-23 11:51:48,747 INFO L256 TraceCheckUtils]: 4: Hoare triple {180#true} call #t~ret8 := main(); {180#true} is VALID [2018-11-23 11:51:48,748 INFO L273 TraceCheckUtils]: 5: Hoare triple {180#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {182#(<= 1 main_~swapped~0)} is VALID [2018-11-23 11:51:48,749 INFO L273 TraceCheckUtils]: 6: Hoare triple {182#(<= 1 main_~swapped~0)} assume !(0 != ~swapped~0); {181#false} is VALID [2018-11-23 11:51:48,749 INFO L273 TraceCheckUtils]: 7: Hoare triple {181#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {181#false} is VALID [2018-11-23 11:51:48,749 INFO L273 TraceCheckUtils]: 8: Hoare triple {181#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {181#false} is VALID [2018-11-23 11:51:48,749 INFO L273 TraceCheckUtils]: 9: Hoare triple {181#false} assume !!(~y~0 < 100000);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); {181#false} is VALID [2018-11-23 11:51:48,750 INFO L256 TraceCheckUtils]: 10: Hoare triple {181#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {181#false} is VALID [2018-11-23 11:51:48,750 INFO L273 TraceCheckUtils]: 11: Hoare triple {181#false} ~cond := #in~cond; {181#false} is VALID [2018-11-23 11:51:48,750 INFO L273 TraceCheckUtils]: 12: Hoare triple {181#false} assume 0 == ~cond; {181#false} is VALID [2018-11-23 11:51:48,751 INFO L273 TraceCheckUtils]: 13: Hoare triple {181#false} assume !false; {181#false} is VALID [2018-11-23 11:51:48,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:48,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:51:48,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:51:48,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 11:51:48,755 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:48,755 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:51:48,813 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:48,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:51:48,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:51:48,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:51:48,815 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 3 states. [2018-11-23 11:51:48,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:48,976 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2018-11-23 11:51:48,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:51:48,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 11:51:48,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:48,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:51:48,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2018-11-23 11:51:48,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:51:48,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2018-11-23 11:51:48,984 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 48 transitions. [2018-11-23 11:51:49,405 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:49,407 INFO L225 Difference]: With dead ends: 40 [2018-11-23 11:51:49,407 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 11:51:49,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:51:49,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 11:51:49,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-23 11:51:49,427 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:49,427 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2018-11-23 11:51:49,427 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 11:51:49,427 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 11:51:49,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:49,430 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2018-11-23 11:51:49,430 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2018-11-23 11:51:49,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:49,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:49,431 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 11:51:49,431 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 11:51:49,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:49,434 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2018-11-23 11:51:49,434 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2018-11-23 11:51:49,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:49,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:49,435 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:49,435 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:49,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 11:51:49,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2018-11-23 11:51:49,438 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 14 [2018-11-23 11:51:49,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:49,439 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2018-11-23 11:51:49,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:51:49,439 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2018-11-23 11:51:49,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:51:49,440 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:49,440 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:49,440 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:49,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:49,441 INFO L82 PathProgramCache]: Analyzing trace with hash 817144017, now seen corresponding path program 1 times [2018-11-23 11:51:49,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:49,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:49,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:49,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:49,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:49,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:49,578 INFO L256 TraceCheckUtils]: 0: Hoare triple {334#true} call ULTIMATE.init(); {334#true} is VALID [2018-11-23 11:51:49,578 INFO L273 TraceCheckUtils]: 1: Hoare triple {334#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {334#true} is VALID [2018-11-23 11:51:49,578 INFO L273 TraceCheckUtils]: 2: Hoare triple {334#true} assume true; {334#true} is VALID [2018-11-23 11:51:49,579 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {334#true} {334#true} #79#return; {334#true} is VALID [2018-11-23 11:51:49,579 INFO L256 TraceCheckUtils]: 4: Hoare triple {334#true} call #t~ret8 := main(); {334#true} is VALID [2018-11-23 11:51:49,579 INFO L273 TraceCheckUtils]: 5: Hoare triple {334#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {334#true} is VALID [2018-11-23 11:51:49,580 INFO L273 TraceCheckUtils]: 6: Hoare triple {334#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {336#(= main_~i~0 1)} is VALID [2018-11-23 11:51:49,581 INFO L273 TraceCheckUtils]: 7: Hoare triple {336#(= main_~i~0 1)} assume !(~i~0 < 100000); {335#false} is VALID [2018-11-23 11:51:49,581 INFO L273 TraceCheckUtils]: 8: Hoare triple {335#false} assume !(0 != ~swapped~0); {335#false} is VALID [2018-11-23 11:51:49,581 INFO L273 TraceCheckUtils]: 9: Hoare triple {335#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {335#false} is VALID [2018-11-23 11:51:49,581 INFO L273 TraceCheckUtils]: 10: Hoare triple {335#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {335#false} is VALID [2018-11-23 11:51:49,582 INFO L273 TraceCheckUtils]: 11: Hoare triple {335#false} assume !!(~y~0 < 100000);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); {335#false} is VALID [2018-11-23 11:51:49,582 INFO L256 TraceCheckUtils]: 12: Hoare triple {335#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {335#false} is VALID [2018-11-23 11:51:49,582 INFO L273 TraceCheckUtils]: 13: Hoare triple {335#false} ~cond := #in~cond; {335#false} is VALID [2018-11-23 11:51:49,582 INFO L273 TraceCheckUtils]: 14: Hoare triple {335#false} assume 0 == ~cond; {335#false} is VALID [2018-11-23 11:51:49,583 INFO L273 TraceCheckUtils]: 15: Hoare triple {335#false} assume !false; {335#false} is VALID [2018-11-23 11:51:49,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:49,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:51:49,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:51:49,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 11:51:49,586 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:49,586 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:51:49,612 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:49,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:51:49,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:51:49,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:51:49,614 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand 3 states. [2018-11-23 11:51:49,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:49,742 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2018-11-23 11:51:49,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:51:49,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 11:51:49,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:49,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:51:49,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2018-11-23 11:51:49,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:51:49,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2018-11-23 11:51:49,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 53 transitions. [2018-11-23 11:51:49,871 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:49,873 INFO L225 Difference]: With dead ends: 52 [2018-11-23 11:51:49,873 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 11:51:49,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:51:49,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 11:51:49,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2018-11-23 11:51:49,892 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:49,893 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 28 states. [2018-11-23 11:51:49,893 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 28 states. [2018-11-23 11:51:49,893 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 28 states. [2018-11-23 11:51:49,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:49,896 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2018-11-23 11:51:49,896 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2018-11-23 11:51:49,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:49,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:49,897 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 31 states. [2018-11-23 11:51:49,897 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 31 states. [2018-11-23 11:51:49,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:49,900 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2018-11-23 11:51:49,900 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2018-11-23 11:51:49,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:49,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:49,901 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:49,902 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:49,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:51:49,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2018-11-23 11:51:49,904 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 16 [2018-11-23 11:51:49,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:49,904 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2018-11-23 11:51:49,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:51:49,904 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2018-11-23 11:51:49,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 11:51:49,905 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:49,906 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:49,906 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:49,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:49,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1624563448, now seen corresponding path program 1 times [2018-11-23 11:51:49,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:49,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:49,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:49,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:49,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:49,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:50,021 INFO L256 TraceCheckUtils]: 0: Hoare triple {515#true} call ULTIMATE.init(); {515#true} is VALID [2018-11-23 11:51:50,022 INFO L273 TraceCheckUtils]: 1: Hoare triple {515#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {515#true} is VALID [2018-11-23 11:51:50,022 INFO L273 TraceCheckUtils]: 2: Hoare triple {515#true} assume true; {515#true} is VALID [2018-11-23 11:51:50,023 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {515#true} {515#true} #79#return; {515#true} is VALID [2018-11-23 11:51:50,023 INFO L256 TraceCheckUtils]: 4: Hoare triple {515#true} call #t~ret8 := main(); {515#true} is VALID [2018-11-23 11:51:50,024 INFO L273 TraceCheckUtils]: 5: Hoare triple {515#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {515#true} is VALID [2018-11-23 11:51:50,027 INFO L273 TraceCheckUtils]: 6: Hoare triple {515#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {517#(= main_~i~0 1)} is VALID [2018-11-23 11:51:50,039 INFO L273 TraceCheckUtils]: 7: Hoare triple {517#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {517#(= main_~i~0 1)} is VALID [2018-11-23 11:51:50,045 INFO L273 TraceCheckUtils]: 8: Hoare triple {517#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {517#(= main_~i~0 1)} is VALID [2018-11-23 11:51:50,046 INFO L273 TraceCheckUtils]: 9: Hoare triple {517#(= main_~i~0 1)} ~i~0 := 1 + ~i~0; {518#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:50,046 INFO L273 TraceCheckUtils]: 10: Hoare triple {518#(<= main_~i~0 2)} assume !(~i~0 < 100000); {516#false} is VALID [2018-11-23 11:51:50,047 INFO L273 TraceCheckUtils]: 11: Hoare triple {516#false} assume !(0 != ~swapped~0); {516#false} is VALID [2018-11-23 11:51:50,047 INFO L273 TraceCheckUtils]: 12: Hoare triple {516#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {516#false} is VALID [2018-11-23 11:51:50,047 INFO L273 TraceCheckUtils]: 13: Hoare triple {516#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {516#false} is VALID [2018-11-23 11:51:50,047 INFO L273 TraceCheckUtils]: 14: Hoare triple {516#false} assume !!(~y~0 < 100000);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); {516#false} is VALID [2018-11-23 11:51:50,048 INFO L256 TraceCheckUtils]: 15: Hoare triple {516#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {516#false} is VALID [2018-11-23 11:51:50,048 INFO L273 TraceCheckUtils]: 16: Hoare triple {516#false} ~cond := #in~cond; {516#false} is VALID [2018-11-23 11:51:50,048 INFO L273 TraceCheckUtils]: 17: Hoare triple {516#false} assume 0 == ~cond; {516#false} is VALID [2018-11-23 11:51:50,048 INFO L273 TraceCheckUtils]: 18: Hoare triple {516#false} assume !false; {516#false} is VALID [2018-11-23 11:51:50,050 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:50,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:50,050 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:51:50,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:50,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:50,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:50,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:50,335 INFO L256 TraceCheckUtils]: 0: Hoare triple {515#true} call ULTIMATE.init(); {515#true} is VALID [2018-11-23 11:51:50,335 INFO L273 TraceCheckUtils]: 1: Hoare triple {515#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {515#true} is VALID [2018-11-23 11:51:50,336 INFO L273 TraceCheckUtils]: 2: Hoare triple {515#true} assume true; {515#true} is VALID [2018-11-23 11:51:50,336 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {515#true} {515#true} #79#return; {515#true} is VALID [2018-11-23 11:51:50,336 INFO L256 TraceCheckUtils]: 4: Hoare triple {515#true} call #t~ret8 := main(); {515#true} is VALID [2018-11-23 11:51:50,337 INFO L273 TraceCheckUtils]: 5: Hoare triple {515#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {515#true} is VALID [2018-11-23 11:51:50,353 INFO L273 TraceCheckUtils]: 6: Hoare triple {515#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {540#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:50,368 INFO L273 TraceCheckUtils]: 7: Hoare triple {540#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {540#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:50,382 INFO L273 TraceCheckUtils]: 8: Hoare triple {540#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {540#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:50,392 INFO L273 TraceCheckUtils]: 9: Hoare triple {540#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {518#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:50,400 INFO L273 TraceCheckUtils]: 10: Hoare triple {518#(<= main_~i~0 2)} assume !(~i~0 < 100000); {516#false} is VALID [2018-11-23 11:51:50,400 INFO L273 TraceCheckUtils]: 11: Hoare triple {516#false} assume !(0 != ~swapped~0); {516#false} is VALID [2018-11-23 11:51:50,400 INFO L273 TraceCheckUtils]: 12: Hoare triple {516#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {516#false} is VALID [2018-11-23 11:51:50,401 INFO L273 TraceCheckUtils]: 13: Hoare triple {516#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {516#false} is VALID [2018-11-23 11:51:50,401 INFO L273 TraceCheckUtils]: 14: Hoare triple {516#false} assume !!(~y~0 < 100000);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); {516#false} is VALID [2018-11-23 11:51:50,401 INFO L256 TraceCheckUtils]: 15: Hoare triple {516#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {516#false} is VALID [2018-11-23 11:51:50,401 INFO L273 TraceCheckUtils]: 16: Hoare triple {516#false} ~cond := #in~cond; {516#false} is VALID [2018-11-23 11:51:50,402 INFO L273 TraceCheckUtils]: 17: Hoare triple {516#false} assume 0 == ~cond; {516#false} is VALID [2018-11-23 11:51:50,402 INFO L273 TraceCheckUtils]: 18: Hoare triple {516#false} assume !false; {516#false} is VALID [2018-11-23 11:51:50,403 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:50,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:50,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 11:51:50,424 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-23 11:51:50,424 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:50,424 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:51:50,476 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:50,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:51:50,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:51:50,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:51:50,477 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand 5 states. [2018-11-23 11:51:50,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:50,967 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2018-11-23 11:51:50,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:51:50,967 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-23 11:51:50,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:50,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:51:50,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2018-11-23 11:51:50,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:51:50,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2018-11-23 11:51:50,974 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 57 transitions. [2018-11-23 11:51:51,135 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:51,137 INFO L225 Difference]: With dead ends: 59 [2018-11-23 11:51:51,137 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 11:51:51,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:51:51,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 11:51:51,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2018-11-23 11:51:51,155 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:51,155 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 33 states. [2018-11-23 11:51:51,156 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 33 states. [2018-11-23 11:51:51,156 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 33 states. [2018-11-23 11:51:51,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:51,158 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2018-11-23 11:51:51,159 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2018-11-23 11:51:51,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:51,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:51,160 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 37 states. [2018-11-23 11:51:51,160 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 37 states. [2018-11-23 11:51:51,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:51,162 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2018-11-23 11:51:51,163 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2018-11-23 11:51:51,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:51,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:51,164 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:51,164 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:51,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 11:51:51,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2018-11-23 11:51:51,167 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 19 [2018-11-23 11:51:51,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:51,167 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2018-11-23 11:51:51,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:51:51,168 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2018-11-23 11:51:51,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 11:51:51,169 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:51,169 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:51,170 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:51,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:51,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1329439089, now seen corresponding path program 2 times [2018-11-23 11:51:51,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:51,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:51,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:51,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:51,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:51,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:51,276 INFO L256 TraceCheckUtils]: 0: Hoare triple {781#true} call ULTIMATE.init(); {781#true} is VALID [2018-11-23 11:51:51,277 INFO L273 TraceCheckUtils]: 1: Hoare triple {781#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {781#true} is VALID [2018-11-23 11:51:51,277 INFO L273 TraceCheckUtils]: 2: Hoare triple {781#true} assume true; {781#true} is VALID [2018-11-23 11:51:51,278 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {781#true} {781#true} #79#return; {781#true} is VALID [2018-11-23 11:51:51,278 INFO L256 TraceCheckUtils]: 4: Hoare triple {781#true} call #t~ret8 := main(); {781#true} is VALID [2018-11-23 11:51:51,279 INFO L273 TraceCheckUtils]: 5: Hoare triple {781#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {781#true} is VALID [2018-11-23 11:51:51,286 INFO L273 TraceCheckUtils]: 6: Hoare triple {781#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {783#(= main_~i~0 1)} is VALID [2018-11-23 11:51:51,287 INFO L273 TraceCheckUtils]: 7: Hoare triple {783#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {783#(= main_~i~0 1)} is VALID [2018-11-23 11:51:51,288 INFO L273 TraceCheckUtils]: 8: Hoare triple {783#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {783#(= main_~i~0 1)} is VALID [2018-11-23 11:51:51,288 INFO L273 TraceCheckUtils]: 9: Hoare triple {783#(= main_~i~0 1)} ~i~0 := 1 + ~i~0; {784#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:51,290 INFO L273 TraceCheckUtils]: 10: Hoare triple {784#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {784#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:51,290 INFO L273 TraceCheckUtils]: 11: Hoare triple {784#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {784#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:51,291 INFO L273 TraceCheckUtils]: 12: Hoare triple {784#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {785#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:51,292 INFO L273 TraceCheckUtils]: 13: Hoare triple {785#(<= main_~i~0 3)} assume !(~i~0 < 100000); {782#false} is VALID [2018-11-23 11:51:51,292 INFO L273 TraceCheckUtils]: 14: Hoare triple {782#false} assume !(0 != ~swapped~0); {782#false} is VALID [2018-11-23 11:51:51,293 INFO L273 TraceCheckUtils]: 15: Hoare triple {782#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {782#false} is VALID [2018-11-23 11:51:51,293 INFO L273 TraceCheckUtils]: 16: Hoare triple {782#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {782#false} is VALID [2018-11-23 11:51:51,293 INFO L273 TraceCheckUtils]: 17: Hoare triple {782#false} assume !!(~y~0 < 100000);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); {782#false} is VALID [2018-11-23 11:51:51,294 INFO L256 TraceCheckUtils]: 18: Hoare triple {782#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {782#false} is VALID [2018-11-23 11:51:51,294 INFO L273 TraceCheckUtils]: 19: Hoare triple {782#false} ~cond := #in~cond; {782#false} is VALID [2018-11-23 11:51:51,295 INFO L273 TraceCheckUtils]: 20: Hoare triple {782#false} assume 0 == ~cond; {782#false} is VALID [2018-11-23 11:51:51,295 INFO L273 TraceCheckUtils]: 21: Hoare triple {782#false} assume !false; {782#false} is VALID [2018-11-23 11:51:51,297 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:51,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:51,297 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:51:51,314 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:51:51,336 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:51:51,336 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:51:51,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:51,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:51,420 INFO L256 TraceCheckUtils]: 0: Hoare triple {781#true} call ULTIMATE.init(); {781#true} is VALID [2018-11-23 11:51:51,420 INFO L273 TraceCheckUtils]: 1: Hoare triple {781#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {781#true} is VALID [2018-11-23 11:51:51,421 INFO L273 TraceCheckUtils]: 2: Hoare triple {781#true} assume true; {781#true} is VALID [2018-11-23 11:51:51,421 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {781#true} {781#true} #79#return; {781#true} is VALID [2018-11-23 11:51:51,421 INFO L256 TraceCheckUtils]: 4: Hoare triple {781#true} call #t~ret8 := main(); {781#true} is VALID [2018-11-23 11:51:51,422 INFO L273 TraceCheckUtils]: 5: Hoare triple {781#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {781#true} is VALID [2018-11-23 11:51:51,425 INFO L273 TraceCheckUtils]: 6: Hoare triple {781#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {807#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:51,430 INFO L273 TraceCheckUtils]: 7: Hoare triple {807#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {807#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:51,432 INFO L273 TraceCheckUtils]: 8: Hoare triple {807#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {807#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:51,432 INFO L273 TraceCheckUtils]: 9: Hoare triple {807#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {784#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:51,434 INFO L273 TraceCheckUtils]: 10: Hoare triple {784#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {784#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:51,435 INFO L273 TraceCheckUtils]: 11: Hoare triple {784#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {784#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:51,436 INFO L273 TraceCheckUtils]: 12: Hoare triple {784#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {785#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:51,437 INFO L273 TraceCheckUtils]: 13: Hoare triple {785#(<= main_~i~0 3)} assume !(~i~0 < 100000); {782#false} is VALID [2018-11-23 11:51:51,437 INFO L273 TraceCheckUtils]: 14: Hoare triple {782#false} assume !(0 != ~swapped~0); {782#false} is VALID [2018-11-23 11:51:51,437 INFO L273 TraceCheckUtils]: 15: Hoare triple {782#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {782#false} is VALID [2018-11-23 11:51:51,438 INFO L273 TraceCheckUtils]: 16: Hoare triple {782#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {782#false} is VALID [2018-11-23 11:51:51,438 INFO L273 TraceCheckUtils]: 17: Hoare triple {782#false} assume !!(~y~0 < 100000);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); {782#false} is VALID [2018-11-23 11:51:51,439 INFO L256 TraceCheckUtils]: 18: Hoare triple {782#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {782#false} is VALID [2018-11-23 11:51:51,439 INFO L273 TraceCheckUtils]: 19: Hoare triple {782#false} ~cond := #in~cond; {782#false} is VALID [2018-11-23 11:51:51,440 INFO L273 TraceCheckUtils]: 20: Hoare triple {782#false} assume 0 == ~cond; {782#false} is VALID [2018-11-23 11:51:51,440 INFO L273 TraceCheckUtils]: 21: Hoare triple {782#false} assume !false; {782#false} is VALID [2018-11-23 11:51:51,442 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:51,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:51,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 11:51:51,465 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-23 11:51:51,466 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:51,466 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:51:51,497 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:51,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:51:51,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:51:51,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:51:51,499 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand 6 states. [2018-11-23 11:51:51,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:51,745 INFO L93 Difference]: Finished difference Result 70 states and 90 transitions. [2018-11-23 11:51:51,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:51:51,746 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-23 11:51:51,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:51,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:51:51,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2018-11-23 11:51:51,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:51:51,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2018-11-23 11:51:51,752 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 61 transitions. [2018-11-23 11:51:51,844 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:51,847 INFO L225 Difference]: With dead ends: 70 [2018-11-23 11:51:51,847 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 11:51:51,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:51:51,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 11:51:51,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2018-11-23 11:51:51,938 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:51,938 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 39 states. [2018-11-23 11:51:51,938 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 39 states. [2018-11-23 11:51:51,939 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 39 states. [2018-11-23 11:51:51,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:51,942 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2018-11-23 11:51:51,942 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2018-11-23 11:51:51,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:51,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:51,943 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 43 states. [2018-11-23 11:51:51,943 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 43 states. [2018-11-23 11:51:51,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:51,946 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2018-11-23 11:51:51,946 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2018-11-23 11:51:51,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:51,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:51,947 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:51,947 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:51,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 11:51:51,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2018-11-23 11:51:51,950 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 22 [2018-11-23 11:51:51,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:51,950 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2018-11-23 11:51:51,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:51:51,950 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2018-11-23 11:51:51,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 11:51:51,951 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:51,952 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:51,952 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:51,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:51,952 INFO L82 PathProgramCache]: Analyzing trace with hash 139123816, now seen corresponding path program 3 times [2018-11-23 11:51:51,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:51,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:51,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:51,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:51,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:51,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:52,065 INFO L256 TraceCheckUtils]: 0: Hoare triple {1092#true} call ULTIMATE.init(); {1092#true} is VALID [2018-11-23 11:51:52,066 INFO L273 TraceCheckUtils]: 1: Hoare triple {1092#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1092#true} is VALID [2018-11-23 11:51:52,066 INFO L273 TraceCheckUtils]: 2: Hoare triple {1092#true} assume true; {1092#true} is VALID [2018-11-23 11:51:52,067 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1092#true} {1092#true} #79#return; {1092#true} is VALID [2018-11-23 11:51:52,067 INFO L256 TraceCheckUtils]: 4: Hoare triple {1092#true} call #t~ret8 := main(); {1092#true} is VALID [2018-11-23 11:51:52,067 INFO L273 TraceCheckUtils]: 5: Hoare triple {1092#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {1092#true} is VALID [2018-11-23 11:51:52,068 INFO L273 TraceCheckUtils]: 6: Hoare triple {1092#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {1094#(= main_~i~0 1)} is VALID [2018-11-23 11:51:52,069 INFO L273 TraceCheckUtils]: 7: Hoare triple {1094#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {1094#(= main_~i~0 1)} is VALID [2018-11-23 11:51:52,070 INFO L273 TraceCheckUtils]: 8: Hoare triple {1094#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {1094#(= main_~i~0 1)} is VALID [2018-11-23 11:51:52,074 INFO L273 TraceCheckUtils]: 9: Hoare triple {1094#(= main_~i~0 1)} ~i~0 := 1 + ~i~0; {1095#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:52,077 INFO L273 TraceCheckUtils]: 10: Hoare triple {1095#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {1095#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:52,079 INFO L273 TraceCheckUtils]: 11: Hoare triple {1095#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {1095#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:52,079 INFO L273 TraceCheckUtils]: 12: Hoare triple {1095#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {1096#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:52,081 INFO L273 TraceCheckUtils]: 13: Hoare triple {1096#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {1096#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:52,086 INFO L273 TraceCheckUtils]: 14: Hoare triple {1096#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {1096#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:52,086 INFO L273 TraceCheckUtils]: 15: Hoare triple {1096#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {1097#(<= main_~i~0 4)} is VALID [2018-11-23 11:51:52,088 INFO L273 TraceCheckUtils]: 16: Hoare triple {1097#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1093#false} is VALID [2018-11-23 11:51:52,088 INFO L273 TraceCheckUtils]: 17: Hoare triple {1093#false} assume !(0 != ~swapped~0); {1093#false} is VALID [2018-11-23 11:51:52,088 INFO L273 TraceCheckUtils]: 18: Hoare triple {1093#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {1093#false} is VALID [2018-11-23 11:51:52,088 INFO L273 TraceCheckUtils]: 19: Hoare triple {1093#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {1093#false} is VALID [2018-11-23 11:51:52,089 INFO L273 TraceCheckUtils]: 20: Hoare triple {1093#false} assume !!(~y~0 < 100000);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); {1093#false} is VALID [2018-11-23 11:51:52,089 INFO L256 TraceCheckUtils]: 21: Hoare triple {1093#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {1093#false} is VALID [2018-11-23 11:51:52,089 INFO L273 TraceCheckUtils]: 22: Hoare triple {1093#false} ~cond := #in~cond; {1093#false} is VALID [2018-11-23 11:51:52,090 INFO L273 TraceCheckUtils]: 23: Hoare triple {1093#false} assume 0 == ~cond; {1093#false} is VALID [2018-11-23 11:51:52,090 INFO L273 TraceCheckUtils]: 24: Hoare triple {1093#false} assume !false; {1093#false} is VALID [2018-11-23 11:51:52,091 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:52,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:52,092 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:51:52,100 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:51:52,120 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-23 11:51:52,121 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:51:52,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:52,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:52,229 INFO L256 TraceCheckUtils]: 0: Hoare triple {1092#true} call ULTIMATE.init(); {1092#true} is VALID [2018-11-23 11:51:52,230 INFO L273 TraceCheckUtils]: 1: Hoare triple {1092#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1092#true} is VALID [2018-11-23 11:51:52,230 INFO L273 TraceCheckUtils]: 2: Hoare triple {1092#true} assume true; {1092#true} is VALID [2018-11-23 11:51:52,231 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1092#true} {1092#true} #79#return; {1092#true} is VALID [2018-11-23 11:51:52,231 INFO L256 TraceCheckUtils]: 4: Hoare triple {1092#true} call #t~ret8 := main(); {1092#true} is VALID [2018-11-23 11:51:52,232 INFO L273 TraceCheckUtils]: 5: Hoare triple {1092#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {1092#true} is VALID [2018-11-23 11:51:52,233 INFO L273 TraceCheckUtils]: 6: Hoare triple {1092#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {1119#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:52,237 INFO L273 TraceCheckUtils]: 7: Hoare triple {1119#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {1119#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:52,237 INFO L273 TraceCheckUtils]: 8: Hoare triple {1119#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {1119#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:52,238 INFO L273 TraceCheckUtils]: 9: Hoare triple {1119#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {1095#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:52,238 INFO L273 TraceCheckUtils]: 10: Hoare triple {1095#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {1095#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:52,239 INFO L273 TraceCheckUtils]: 11: Hoare triple {1095#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {1095#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:52,239 INFO L273 TraceCheckUtils]: 12: Hoare triple {1095#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {1096#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:52,240 INFO L273 TraceCheckUtils]: 13: Hoare triple {1096#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {1096#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:52,240 INFO L273 TraceCheckUtils]: 14: Hoare triple {1096#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {1096#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:52,241 INFO L273 TraceCheckUtils]: 15: Hoare triple {1096#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {1097#(<= main_~i~0 4)} is VALID [2018-11-23 11:51:52,242 INFO L273 TraceCheckUtils]: 16: Hoare triple {1097#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1093#false} is VALID [2018-11-23 11:51:52,242 INFO L273 TraceCheckUtils]: 17: Hoare triple {1093#false} assume !(0 != ~swapped~0); {1093#false} is VALID [2018-11-23 11:51:52,243 INFO L273 TraceCheckUtils]: 18: Hoare triple {1093#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {1093#false} is VALID [2018-11-23 11:51:52,243 INFO L273 TraceCheckUtils]: 19: Hoare triple {1093#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {1093#false} is VALID [2018-11-23 11:51:52,243 INFO L273 TraceCheckUtils]: 20: Hoare triple {1093#false} assume !!(~y~0 < 100000);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); {1093#false} is VALID [2018-11-23 11:51:52,244 INFO L256 TraceCheckUtils]: 21: Hoare triple {1093#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {1093#false} is VALID [2018-11-23 11:51:52,244 INFO L273 TraceCheckUtils]: 22: Hoare triple {1093#false} ~cond := #in~cond; {1093#false} is VALID [2018-11-23 11:51:52,245 INFO L273 TraceCheckUtils]: 23: Hoare triple {1093#false} assume 0 == ~cond; {1093#false} is VALID [2018-11-23 11:51:52,245 INFO L273 TraceCheckUtils]: 24: Hoare triple {1093#false} assume !false; {1093#false} is VALID [2018-11-23 11:51:52,246 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:52,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:52,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 11:51:52,266 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-23 11:51:52,266 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:52,266 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:51:52,302 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:52,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:51:52,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:51:52,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:51:52,303 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand 7 states. [2018-11-23 11:51:52,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:52,569 INFO L93 Difference]: Finished difference Result 82 states and 106 transitions. [2018-11-23 11:51:52,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:51:52,569 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-23 11:51:52,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:52,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:51:52,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2018-11-23 11:51:52,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:51:52,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2018-11-23 11:51:52,575 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 65 transitions. [2018-11-23 11:51:52,658 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:52,660 INFO L225 Difference]: With dead ends: 82 [2018-11-23 11:51:52,661 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 11:51:52,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:51:52,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 11:51:52,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2018-11-23 11:51:52,702 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:52,702 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 45 states. [2018-11-23 11:51:52,702 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 45 states. [2018-11-23 11:51:52,702 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 45 states. [2018-11-23 11:51:52,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:52,705 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2018-11-23 11:51:52,705 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 62 transitions. [2018-11-23 11:51:52,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:52,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:52,706 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 49 states. [2018-11-23 11:51:52,706 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 49 states. [2018-11-23 11:51:52,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:52,709 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2018-11-23 11:51:52,709 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 62 transitions. [2018-11-23 11:51:52,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:52,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:52,710 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:52,710 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:52,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 11:51:52,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2018-11-23 11:51:52,713 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 25 [2018-11-23 11:51:52,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:52,713 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2018-11-23 11:51:52,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:51:52,714 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2018-11-23 11:51:52,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 11:51:52,714 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:52,715 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:52,715 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:52,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:52,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1293178351, now seen corresponding path program 4 times [2018-11-23 11:51:52,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:52,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:52,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:52,717 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:52,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:52,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:52,899 INFO L256 TraceCheckUtils]: 0: Hoare triple {1449#true} call ULTIMATE.init(); {1449#true} is VALID [2018-11-23 11:51:52,899 INFO L273 TraceCheckUtils]: 1: Hoare triple {1449#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1449#true} is VALID [2018-11-23 11:51:52,900 INFO L273 TraceCheckUtils]: 2: Hoare triple {1449#true} assume true; {1449#true} is VALID [2018-11-23 11:51:52,900 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1449#true} {1449#true} #79#return; {1449#true} is VALID [2018-11-23 11:51:52,900 INFO L256 TraceCheckUtils]: 4: Hoare triple {1449#true} call #t~ret8 := main(); {1449#true} is VALID [2018-11-23 11:51:52,901 INFO L273 TraceCheckUtils]: 5: Hoare triple {1449#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {1449#true} is VALID [2018-11-23 11:51:52,901 INFO L273 TraceCheckUtils]: 6: Hoare triple {1449#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {1451#(= main_~i~0 1)} is VALID [2018-11-23 11:51:52,903 INFO L273 TraceCheckUtils]: 7: Hoare triple {1451#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {1451#(= main_~i~0 1)} is VALID [2018-11-23 11:51:52,903 INFO L273 TraceCheckUtils]: 8: Hoare triple {1451#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {1451#(= main_~i~0 1)} is VALID [2018-11-23 11:51:52,906 INFO L273 TraceCheckUtils]: 9: Hoare triple {1451#(= main_~i~0 1)} ~i~0 := 1 + ~i~0; {1452#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:52,906 INFO L273 TraceCheckUtils]: 10: Hoare triple {1452#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {1452#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:52,916 INFO L273 TraceCheckUtils]: 11: Hoare triple {1452#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {1452#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:52,918 INFO L273 TraceCheckUtils]: 12: Hoare triple {1452#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {1453#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:52,918 INFO L273 TraceCheckUtils]: 13: Hoare triple {1453#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {1453#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:52,920 INFO L273 TraceCheckUtils]: 14: Hoare triple {1453#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {1453#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:52,920 INFO L273 TraceCheckUtils]: 15: Hoare triple {1453#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {1454#(<= main_~i~0 4)} is VALID [2018-11-23 11:51:52,924 INFO L273 TraceCheckUtils]: 16: Hoare triple {1454#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {1454#(<= main_~i~0 4)} is VALID [2018-11-23 11:51:52,926 INFO L273 TraceCheckUtils]: 17: Hoare triple {1454#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {1454#(<= main_~i~0 4)} is VALID [2018-11-23 11:51:52,926 INFO L273 TraceCheckUtils]: 18: Hoare triple {1454#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {1455#(<= main_~i~0 5)} is VALID [2018-11-23 11:51:52,928 INFO L273 TraceCheckUtils]: 19: Hoare triple {1455#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1450#false} is VALID [2018-11-23 11:51:52,928 INFO L273 TraceCheckUtils]: 20: Hoare triple {1450#false} assume !(0 != ~swapped~0); {1450#false} is VALID [2018-11-23 11:51:52,928 INFO L273 TraceCheckUtils]: 21: Hoare triple {1450#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {1450#false} is VALID [2018-11-23 11:51:52,928 INFO L273 TraceCheckUtils]: 22: Hoare triple {1450#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {1450#false} is VALID [2018-11-23 11:51:52,928 INFO L273 TraceCheckUtils]: 23: Hoare triple {1450#false} assume !!(~y~0 < 100000);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); {1450#false} is VALID [2018-11-23 11:51:52,929 INFO L256 TraceCheckUtils]: 24: Hoare triple {1450#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {1450#false} is VALID [2018-11-23 11:51:52,929 INFO L273 TraceCheckUtils]: 25: Hoare triple {1450#false} ~cond := #in~cond; {1450#false} is VALID [2018-11-23 11:51:52,929 INFO L273 TraceCheckUtils]: 26: Hoare triple {1450#false} assume 0 == ~cond; {1450#false} is VALID [2018-11-23 11:51:52,929 INFO L273 TraceCheckUtils]: 27: Hoare triple {1450#false} assume !false; {1450#false} is VALID [2018-11-23 11:51:52,931 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:52,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:52,931 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:51:52,948 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:51:52,971 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:51:52,971 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:51:52,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:52,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:53,348 INFO L256 TraceCheckUtils]: 0: Hoare triple {1449#true} call ULTIMATE.init(); {1449#true} is VALID [2018-11-23 11:51:53,349 INFO L273 TraceCheckUtils]: 1: Hoare triple {1449#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1449#true} is VALID [2018-11-23 11:51:53,349 INFO L273 TraceCheckUtils]: 2: Hoare triple {1449#true} assume true; {1449#true} is VALID [2018-11-23 11:51:53,349 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1449#true} {1449#true} #79#return; {1449#true} is VALID [2018-11-23 11:51:53,349 INFO L256 TraceCheckUtils]: 4: Hoare triple {1449#true} call #t~ret8 := main(); {1449#true} is VALID [2018-11-23 11:51:53,350 INFO L273 TraceCheckUtils]: 5: Hoare triple {1449#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {1449#true} is VALID [2018-11-23 11:51:53,350 INFO L273 TraceCheckUtils]: 6: Hoare triple {1449#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {1477#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:53,351 INFO L273 TraceCheckUtils]: 7: Hoare triple {1477#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {1477#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:53,351 INFO L273 TraceCheckUtils]: 8: Hoare triple {1477#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {1477#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:53,352 INFO L273 TraceCheckUtils]: 9: Hoare triple {1477#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {1452#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:53,352 INFO L273 TraceCheckUtils]: 10: Hoare triple {1452#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {1452#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:53,353 INFO L273 TraceCheckUtils]: 11: Hoare triple {1452#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {1452#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:53,354 INFO L273 TraceCheckUtils]: 12: Hoare triple {1452#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {1453#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:53,355 INFO L273 TraceCheckUtils]: 13: Hoare triple {1453#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {1453#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:53,356 INFO L273 TraceCheckUtils]: 14: Hoare triple {1453#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {1453#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:53,357 INFO L273 TraceCheckUtils]: 15: Hoare triple {1453#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {1454#(<= main_~i~0 4)} is VALID [2018-11-23 11:51:53,358 INFO L273 TraceCheckUtils]: 16: Hoare triple {1454#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {1454#(<= main_~i~0 4)} is VALID [2018-11-23 11:51:53,358 INFO L273 TraceCheckUtils]: 17: Hoare triple {1454#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {1454#(<= main_~i~0 4)} is VALID [2018-11-23 11:51:53,359 INFO L273 TraceCheckUtils]: 18: Hoare triple {1454#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {1455#(<= main_~i~0 5)} is VALID [2018-11-23 11:51:53,360 INFO L273 TraceCheckUtils]: 19: Hoare triple {1455#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1450#false} is VALID [2018-11-23 11:51:53,361 INFO L273 TraceCheckUtils]: 20: Hoare triple {1450#false} assume !(0 != ~swapped~0); {1450#false} is VALID [2018-11-23 11:51:53,361 INFO L273 TraceCheckUtils]: 21: Hoare triple {1450#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {1450#false} is VALID [2018-11-23 11:51:53,361 INFO L273 TraceCheckUtils]: 22: Hoare triple {1450#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {1450#false} is VALID [2018-11-23 11:51:53,362 INFO L273 TraceCheckUtils]: 23: Hoare triple {1450#false} assume !!(~y~0 < 100000);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); {1450#false} is VALID [2018-11-23 11:51:53,362 INFO L256 TraceCheckUtils]: 24: Hoare triple {1450#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {1450#false} is VALID [2018-11-23 11:51:53,363 INFO L273 TraceCheckUtils]: 25: Hoare triple {1450#false} ~cond := #in~cond; {1450#false} is VALID [2018-11-23 11:51:53,363 INFO L273 TraceCheckUtils]: 26: Hoare triple {1450#false} assume 0 == ~cond; {1450#false} is VALID [2018-11-23 11:51:53,363 INFO L273 TraceCheckUtils]: 27: Hoare triple {1450#false} assume !false; {1450#false} is VALID [2018-11-23 11:51:53,365 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:53,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:53,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 11:51:53,387 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-11-23 11:51:53,387 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:53,387 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:51:53,425 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:53,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:51:53,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:51:53,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:51:53,426 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand 8 states. [2018-11-23 11:51:53,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:53,719 INFO L93 Difference]: Finished difference Result 94 states and 122 transitions. [2018-11-23 11:51:53,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:51:53,720 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-11-23 11:51:53,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:53,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:51:53,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 69 transitions. [2018-11-23 11:51:53,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:51:53,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 69 transitions. [2018-11-23 11:51:53,725 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 69 transitions. [2018-11-23 11:51:53,802 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:53,805 INFO L225 Difference]: With dead ends: 94 [2018-11-23 11:51:53,807 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 11:51:53,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:51:53,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 11:51:53,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2018-11-23 11:51:53,845 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:53,846 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 51 states. [2018-11-23 11:51:53,846 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 51 states. [2018-11-23 11:51:53,846 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 51 states. [2018-11-23 11:51:53,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:53,849 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2018-11-23 11:51:53,850 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2018-11-23 11:51:53,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:53,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:53,851 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 55 states. [2018-11-23 11:51:53,851 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 55 states. [2018-11-23 11:51:53,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:53,853 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2018-11-23 11:51:53,854 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2018-11-23 11:51:53,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:53,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:53,854 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:53,855 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:53,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 11:51:53,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2018-11-23 11:51:53,857 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 28 [2018-11-23 11:51:53,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:53,857 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2018-11-23 11:51:53,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:51:53,858 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2018-11-23 11:51:53,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 11:51:53,858 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:53,858 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:53,859 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:53,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:53,859 INFO L82 PathProgramCache]: Analyzing trace with hash -506949688, now seen corresponding path program 5 times [2018-11-23 11:51:53,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:53,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:53,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:53,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:53,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:53,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:53,998 INFO L256 TraceCheckUtils]: 0: Hoare triple {1852#true} call ULTIMATE.init(); {1852#true} is VALID [2018-11-23 11:51:53,999 INFO L273 TraceCheckUtils]: 1: Hoare triple {1852#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1852#true} is VALID [2018-11-23 11:51:53,999 INFO L273 TraceCheckUtils]: 2: Hoare triple {1852#true} assume true; {1852#true} is VALID [2018-11-23 11:51:53,999 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1852#true} {1852#true} #79#return; {1852#true} is VALID [2018-11-23 11:51:54,000 INFO L256 TraceCheckUtils]: 4: Hoare triple {1852#true} call #t~ret8 := main(); {1852#true} is VALID [2018-11-23 11:51:54,000 INFO L273 TraceCheckUtils]: 5: Hoare triple {1852#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {1852#true} is VALID [2018-11-23 11:51:54,001 INFO L273 TraceCheckUtils]: 6: Hoare triple {1852#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {1854#(= main_~i~0 1)} is VALID [2018-11-23 11:51:54,001 INFO L273 TraceCheckUtils]: 7: Hoare triple {1854#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {1854#(= main_~i~0 1)} is VALID [2018-11-23 11:51:54,002 INFO L273 TraceCheckUtils]: 8: Hoare triple {1854#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {1854#(= main_~i~0 1)} is VALID [2018-11-23 11:51:54,002 INFO L273 TraceCheckUtils]: 9: Hoare triple {1854#(= main_~i~0 1)} ~i~0 := 1 + ~i~0; {1855#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:54,003 INFO L273 TraceCheckUtils]: 10: Hoare triple {1855#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {1855#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:54,003 INFO L273 TraceCheckUtils]: 11: Hoare triple {1855#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {1855#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:54,004 INFO L273 TraceCheckUtils]: 12: Hoare triple {1855#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {1856#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:54,005 INFO L273 TraceCheckUtils]: 13: Hoare triple {1856#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {1856#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:54,006 INFO L273 TraceCheckUtils]: 14: Hoare triple {1856#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {1856#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:54,007 INFO L273 TraceCheckUtils]: 15: Hoare triple {1856#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {1857#(<= main_~i~0 4)} is VALID [2018-11-23 11:51:54,008 INFO L273 TraceCheckUtils]: 16: Hoare triple {1857#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {1857#(<= main_~i~0 4)} is VALID [2018-11-23 11:51:54,008 INFO L273 TraceCheckUtils]: 17: Hoare triple {1857#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {1857#(<= main_~i~0 4)} is VALID [2018-11-23 11:51:54,009 INFO L273 TraceCheckUtils]: 18: Hoare triple {1857#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {1858#(<= main_~i~0 5)} is VALID [2018-11-23 11:51:54,010 INFO L273 TraceCheckUtils]: 19: Hoare triple {1858#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {1858#(<= main_~i~0 5)} is VALID [2018-11-23 11:51:54,011 INFO L273 TraceCheckUtils]: 20: Hoare triple {1858#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {1858#(<= main_~i~0 5)} is VALID [2018-11-23 11:51:54,013 INFO L273 TraceCheckUtils]: 21: Hoare triple {1858#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {1859#(<= main_~i~0 6)} is VALID [2018-11-23 11:51:54,016 INFO L273 TraceCheckUtils]: 22: Hoare triple {1859#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1853#false} is VALID [2018-11-23 11:51:54,017 INFO L273 TraceCheckUtils]: 23: Hoare triple {1853#false} assume !(0 != ~swapped~0); {1853#false} is VALID [2018-11-23 11:51:54,017 INFO L273 TraceCheckUtils]: 24: Hoare triple {1853#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {1853#false} is VALID [2018-11-23 11:51:54,017 INFO L273 TraceCheckUtils]: 25: Hoare triple {1853#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {1853#false} is VALID [2018-11-23 11:51:54,018 INFO L273 TraceCheckUtils]: 26: Hoare triple {1853#false} assume !!(~y~0 < 100000);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); {1853#false} is VALID [2018-11-23 11:51:54,018 INFO L256 TraceCheckUtils]: 27: Hoare triple {1853#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {1853#false} is VALID [2018-11-23 11:51:54,018 INFO L273 TraceCheckUtils]: 28: Hoare triple {1853#false} ~cond := #in~cond; {1853#false} is VALID [2018-11-23 11:51:54,018 INFO L273 TraceCheckUtils]: 29: Hoare triple {1853#false} assume 0 == ~cond; {1853#false} is VALID [2018-11-23 11:51:54,019 INFO L273 TraceCheckUtils]: 30: Hoare triple {1853#false} assume !false; {1853#false} is VALID [2018-11-23 11:51:54,020 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:54,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:54,020 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:51:54,030 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:51:54,091 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 11:51:54,091 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:51:54,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:54,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:54,232 INFO L256 TraceCheckUtils]: 0: Hoare triple {1852#true} call ULTIMATE.init(); {1852#true} is VALID [2018-11-23 11:51:54,233 INFO L273 TraceCheckUtils]: 1: Hoare triple {1852#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1852#true} is VALID [2018-11-23 11:51:54,233 INFO L273 TraceCheckUtils]: 2: Hoare triple {1852#true} assume true; {1852#true} is VALID [2018-11-23 11:51:54,233 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1852#true} {1852#true} #79#return; {1852#true} is VALID [2018-11-23 11:51:54,234 INFO L256 TraceCheckUtils]: 4: Hoare triple {1852#true} call #t~ret8 := main(); {1852#true} is VALID [2018-11-23 11:51:54,234 INFO L273 TraceCheckUtils]: 5: Hoare triple {1852#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {1852#true} is VALID [2018-11-23 11:51:54,234 INFO L273 TraceCheckUtils]: 6: Hoare triple {1852#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {1881#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:54,235 INFO L273 TraceCheckUtils]: 7: Hoare triple {1881#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {1881#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:54,235 INFO L273 TraceCheckUtils]: 8: Hoare triple {1881#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {1881#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:54,239 INFO L273 TraceCheckUtils]: 9: Hoare triple {1881#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {1855#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:54,239 INFO L273 TraceCheckUtils]: 10: Hoare triple {1855#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {1855#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:54,240 INFO L273 TraceCheckUtils]: 11: Hoare triple {1855#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {1855#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:54,241 INFO L273 TraceCheckUtils]: 12: Hoare triple {1855#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {1856#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:54,241 INFO L273 TraceCheckUtils]: 13: Hoare triple {1856#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {1856#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:54,241 INFO L273 TraceCheckUtils]: 14: Hoare triple {1856#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {1856#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:54,242 INFO L273 TraceCheckUtils]: 15: Hoare triple {1856#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {1857#(<= main_~i~0 4)} is VALID [2018-11-23 11:51:54,243 INFO L273 TraceCheckUtils]: 16: Hoare triple {1857#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {1857#(<= main_~i~0 4)} is VALID [2018-11-23 11:51:54,243 INFO L273 TraceCheckUtils]: 17: Hoare triple {1857#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {1857#(<= main_~i~0 4)} is VALID [2018-11-23 11:51:54,244 INFO L273 TraceCheckUtils]: 18: Hoare triple {1857#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {1858#(<= main_~i~0 5)} is VALID [2018-11-23 11:51:54,245 INFO L273 TraceCheckUtils]: 19: Hoare triple {1858#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {1858#(<= main_~i~0 5)} is VALID [2018-11-23 11:51:54,246 INFO L273 TraceCheckUtils]: 20: Hoare triple {1858#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {1858#(<= main_~i~0 5)} is VALID [2018-11-23 11:51:54,247 INFO L273 TraceCheckUtils]: 21: Hoare triple {1858#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {1859#(<= main_~i~0 6)} is VALID [2018-11-23 11:51:54,247 INFO L273 TraceCheckUtils]: 22: Hoare triple {1859#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1853#false} is VALID [2018-11-23 11:51:54,248 INFO L273 TraceCheckUtils]: 23: Hoare triple {1853#false} assume !(0 != ~swapped~0); {1853#false} is VALID [2018-11-23 11:51:54,248 INFO L273 TraceCheckUtils]: 24: Hoare triple {1853#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {1853#false} is VALID [2018-11-23 11:51:54,248 INFO L273 TraceCheckUtils]: 25: Hoare triple {1853#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {1853#false} is VALID [2018-11-23 11:51:54,249 INFO L273 TraceCheckUtils]: 26: Hoare triple {1853#false} assume !!(~y~0 < 100000);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); {1853#false} is VALID [2018-11-23 11:51:54,249 INFO L256 TraceCheckUtils]: 27: Hoare triple {1853#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {1853#false} is VALID [2018-11-23 11:51:54,249 INFO L273 TraceCheckUtils]: 28: Hoare triple {1853#false} ~cond := #in~cond; {1853#false} is VALID [2018-11-23 11:51:54,250 INFO L273 TraceCheckUtils]: 29: Hoare triple {1853#false} assume 0 == ~cond; {1853#false} is VALID [2018-11-23 11:51:54,250 INFO L273 TraceCheckUtils]: 30: Hoare triple {1853#false} assume !false; {1853#false} is VALID [2018-11-23 11:51:54,252 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:54,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:54,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 11:51:54,280 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-11-23 11:51:54,281 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:54,281 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:51:54,353 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:54,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:51:54,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:51:54,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:51:54,355 INFO L87 Difference]: Start difference. First operand 51 states and 64 transitions. Second operand 9 states. [2018-11-23 11:51:54,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:54,561 INFO L93 Difference]: Finished difference Result 106 states and 138 transitions. [2018-11-23 11:51:54,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:51:54,561 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-11-23 11:51:54,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:54,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:51:54,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 73 transitions. [2018-11-23 11:51:54,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:51:54,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 73 transitions. [2018-11-23 11:51:54,566 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 73 transitions. [2018-11-23 11:51:54,822 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:54,824 INFO L225 Difference]: With dead ends: 106 [2018-11-23 11:51:54,824 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 11:51:54,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:51:54,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 11:51:54,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2018-11-23 11:51:54,879 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:54,879 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 57 states. [2018-11-23 11:51:54,879 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 57 states. [2018-11-23 11:51:54,879 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 57 states. [2018-11-23 11:51:54,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:54,883 INFO L93 Difference]: Finished difference Result 61 states and 78 transitions. [2018-11-23 11:51:54,883 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 78 transitions. [2018-11-23 11:51:54,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:54,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:54,883 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 61 states. [2018-11-23 11:51:54,883 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 61 states. [2018-11-23 11:51:54,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:54,885 INFO L93 Difference]: Finished difference Result 61 states and 78 transitions. [2018-11-23 11:51:54,886 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 78 transitions. [2018-11-23 11:51:54,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:54,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:54,886 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:54,886 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:54,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 11:51:54,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 72 transitions. [2018-11-23 11:51:54,888 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 72 transitions. Word has length 31 [2018-11-23 11:51:54,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:54,889 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 72 transitions. [2018-11-23 11:51:54,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:51:54,889 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 72 transitions. [2018-11-23 11:51:54,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 11:51:54,890 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:54,890 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:54,891 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:54,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:54,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1574484657, now seen corresponding path program 6 times [2018-11-23 11:51:54,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:54,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:54,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:54,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:54,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:54,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:55,070 INFO L256 TraceCheckUtils]: 0: Hoare triple {2301#true} call ULTIMATE.init(); {2301#true} is VALID [2018-11-23 11:51:55,071 INFO L273 TraceCheckUtils]: 1: Hoare triple {2301#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2301#true} is VALID [2018-11-23 11:51:55,071 INFO L273 TraceCheckUtils]: 2: Hoare triple {2301#true} assume true; {2301#true} is VALID [2018-11-23 11:51:55,072 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2301#true} {2301#true} #79#return; {2301#true} is VALID [2018-11-23 11:51:55,072 INFO L256 TraceCheckUtils]: 4: Hoare triple {2301#true} call #t~ret8 := main(); {2301#true} is VALID [2018-11-23 11:51:55,072 INFO L273 TraceCheckUtils]: 5: Hoare triple {2301#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {2301#true} is VALID [2018-11-23 11:51:55,073 INFO L273 TraceCheckUtils]: 6: Hoare triple {2301#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {2303#(= main_~i~0 1)} is VALID [2018-11-23 11:51:55,074 INFO L273 TraceCheckUtils]: 7: Hoare triple {2303#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {2303#(= main_~i~0 1)} is VALID [2018-11-23 11:51:55,074 INFO L273 TraceCheckUtils]: 8: Hoare triple {2303#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2303#(= main_~i~0 1)} is VALID [2018-11-23 11:51:55,075 INFO L273 TraceCheckUtils]: 9: Hoare triple {2303#(= main_~i~0 1)} ~i~0 := 1 + ~i~0; {2304#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:55,075 INFO L273 TraceCheckUtils]: 10: Hoare triple {2304#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {2304#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:55,076 INFO L273 TraceCheckUtils]: 11: Hoare triple {2304#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2304#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:55,076 INFO L273 TraceCheckUtils]: 12: Hoare triple {2304#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {2305#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:55,078 INFO L273 TraceCheckUtils]: 13: Hoare triple {2305#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {2305#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:55,079 INFO L273 TraceCheckUtils]: 14: Hoare triple {2305#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2305#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:55,080 INFO L273 TraceCheckUtils]: 15: Hoare triple {2305#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {2306#(<= main_~i~0 4)} is VALID [2018-11-23 11:51:55,081 INFO L273 TraceCheckUtils]: 16: Hoare triple {2306#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {2306#(<= main_~i~0 4)} is VALID [2018-11-23 11:51:55,083 INFO L273 TraceCheckUtils]: 17: Hoare triple {2306#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2306#(<= main_~i~0 4)} is VALID [2018-11-23 11:51:55,084 INFO L273 TraceCheckUtils]: 18: Hoare triple {2306#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {2307#(<= main_~i~0 5)} is VALID [2018-11-23 11:51:55,085 INFO L273 TraceCheckUtils]: 19: Hoare triple {2307#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {2307#(<= main_~i~0 5)} is VALID [2018-11-23 11:51:55,086 INFO L273 TraceCheckUtils]: 20: Hoare triple {2307#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2307#(<= main_~i~0 5)} is VALID [2018-11-23 11:51:55,087 INFO L273 TraceCheckUtils]: 21: Hoare triple {2307#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {2308#(<= main_~i~0 6)} is VALID [2018-11-23 11:51:55,088 INFO L273 TraceCheckUtils]: 22: Hoare triple {2308#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {2308#(<= main_~i~0 6)} is VALID [2018-11-23 11:51:55,088 INFO L273 TraceCheckUtils]: 23: Hoare triple {2308#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2308#(<= main_~i~0 6)} is VALID [2018-11-23 11:51:55,089 INFO L273 TraceCheckUtils]: 24: Hoare triple {2308#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {2309#(<= main_~i~0 7)} is VALID [2018-11-23 11:51:55,090 INFO L273 TraceCheckUtils]: 25: Hoare triple {2309#(<= main_~i~0 7)} assume !(~i~0 < 100000); {2302#false} is VALID [2018-11-23 11:51:55,090 INFO L273 TraceCheckUtils]: 26: Hoare triple {2302#false} assume !(0 != ~swapped~0); {2302#false} is VALID [2018-11-23 11:51:55,091 INFO L273 TraceCheckUtils]: 27: Hoare triple {2302#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {2302#false} is VALID [2018-11-23 11:51:55,091 INFO L273 TraceCheckUtils]: 28: Hoare triple {2302#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {2302#false} is VALID [2018-11-23 11:51:55,091 INFO L273 TraceCheckUtils]: 29: Hoare triple {2302#false} assume !!(~y~0 < 100000);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); {2302#false} is VALID [2018-11-23 11:51:55,092 INFO L256 TraceCheckUtils]: 30: Hoare triple {2302#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {2302#false} is VALID [2018-11-23 11:51:55,092 INFO L273 TraceCheckUtils]: 31: Hoare triple {2302#false} ~cond := #in~cond; {2302#false} is VALID [2018-11-23 11:51:55,092 INFO L273 TraceCheckUtils]: 32: Hoare triple {2302#false} assume 0 == ~cond; {2302#false} is VALID [2018-11-23 11:51:55,092 INFO L273 TraceCheckUtils]: 33: Hoare triple {2302#false} assume !false; {2302#false} is VALID [2018-11-23 11:51:55,094 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 1 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:55,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:55,095 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:51:55,103 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:51:55,132 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-11-23 11:51:55,132 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:51:55,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:55,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:55,348 INFO L256 TraceCheckUtils]: 0: Hoare triple {2301#true} call ULTIMATE.init(); {2301#true} is VALID [2018-11-23 11:51:55,348 INFO L273 TraceCheckUtils]: 1: Hoare triple {2301#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2301#true} is VALID [2018-11-23 11:51:55,348 INFO L273 TraceCheckUtils]: 2: Hoare triple {2301#true} assume true; {2301#true} is VALID [2018-11-23 11:51:55,349 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2301#true} {2301#true} #79#return; {2301#true} is VALID [2018-11-23 11:51:55,349 INFO L256 TraceCheckUtils]: 4: Hoare triple {2301#true} call #t~ret8 := main(); {2301#true} is VALID [2018-11-23 11:51:55,349 INFO L273 TraceCheckUtils]: 5: Hoare triple {2301#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {2301#true} is VALID [2018-11-23 11:51:55,349 INFO L273 TraceCheckUtils]: 6: Hoare triple {2301#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {2331#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:55,350 INFO L273 TraceCheckUtils]: 7: Hoare triple {2331#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {2331#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:55,350 INFO L273 TraceCheckUtils]: 8: Hoare triple {2331#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2331#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:55,351 INFO L273 TraceCheckUtils]: 9: Hoare triple {2331#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {2304#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:55,351 INFO L273 TraceCheckUtils]: 10: Hoare triple {2304#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {2304#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:55,351 INFO L273 TraceCheckUtils]: 11: Hoare triple {2304#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2304#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:55,352 INFO L273 TraceCheckUtils]: 12: Hoare triple {2304#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {2305#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:55,352 INFO L273 TraceCheckUtils]: 13: Hoare triple {2305#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {2305#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:55,352 INFO L273 TraceCheckUtils]: 14: Hoare triple {2305#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2305#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:55,353 INFO L273 TraceCheckUtils]: 15: Hoare triple {2305#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {2306#(<= main_~i~0 4)} is VALID [2018-11-23 11:51:55,353 INFO L273 TraceCheckUtils]: 16: Hoare triple {2306#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {2306#(<= main_~i~0 4)} is VALID [2018-11-23 11:51:55,354 INFO L273 TraceCheckUtils]: 17: Hoare triple {2306#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2306#(<= main_~i~0 4)} is VALID [2018-11-23 11:51:55,354 INFO L273 TraceCheckUtils]: 18: Hoare triple {2306#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {2307#(<= main_~i~0 5)} is VALID [2018-11-23 11:51:55,361 INFO L273 TraceCheckUtils]: 19: Hoare triple {2307#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {2307#(<= main_~i~0 5)} is VALID [2018-11-23 11:51:55,364 INFO L273 TraceCheckUtils]: 20: Hoare triple {2307#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2307#(<= main_~i~0 5)} is VALID [2018-11-23 11:51:55,364 INFO L273 TraceCheckUtils]: 21: Hoare triple {2307#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {2308#(<= main_~i~0 6)} is VALID [2018-11-23 11:51:55,365 INFO L273 TraceCheckUtils]: 22: Hoare triple {2308#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {2308#(<= main_~i~0 6)} is VALID [2018-11-23 11:51:55,365 INFO L273 TraceCheckUtils]: 23: Hoare triple {2308#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2308#(<= main_~i~0 6)} is VALID [2018-11-23 11:51:55,366 INFO L273 TraceCheckUtils]: 24: Hoare triple {2308#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {2309#(<= main_~i~0 7)} is VALID [2018-11-23 11:51:55,366 INFO L273 TraceCheckUtils]: 25: Hoare triple {2309#(<= main_~i~0 7)} assume !(~i~0 < 100000); {2302#false} is VALID [2018-11-23 11:51:55,366 INFO L273 TraceCheckUtils]: 26: Hoare triple {2302#false} assume !(0 != ~swapped~0); {2302#false} is VALID [2018-11-23 11:51:55,366 INFO L273 TraceCheckUtils]: 27: Hoare triple {2302#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {2302#false} is VALID [2018-11-23 11:51:55,366 INFO L273 TraceCheckUtils]: 28: Hoare triple {2302#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {2302#false} is VALID [2018-11-23 11:51:55,367 INFO L273 TraceCheckUtils]: 29: Hoare triple {2302#false} assume !!(~y~0 < 100000);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); {2302#false} is VALID [2018-11-23 11:51:55,367 INFO L256 TraceCheckUtils]: 30: Hoare triple {2302#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {2302#false} is VALID [2018-11-23 11:51:55,367 INFO L273 TraceCheckUtils]: 31: Hoare triple {2302#false} ~cond := #in~cond; {2302#false} is VALID [2018-11-23 11:51:55,367 INFO L273 TraceCheckUtils]: 32: Hoare triple {2302#false} assume 0 == ~cond; {2302#false} is VALID [2018-11-23 11:51:55,367 INFO L273 TraceCheckUtils]: 33: Hoare triple {2302#false} assume !false; {2302#false} is VALID [2018-11-23 11:51:55,368 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 1 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:55,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:55,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 11:51:55,388 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-11-23 11:51:55,388 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:55,388 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:51:55,432 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:55,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:51:55,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:51:55,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:51:55,433 INFO L87 Difference]: Start difference. First operand 57 states and 72 transitions. Second operand 10 states. [2018-11-23 11:51:56,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:56,112 INFO L93 Difference]: Finished difference Result 118 states and 154 transitions. [2018-11-23 11:51:56,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:51:56,112 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-11-23 11:51:56,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:56,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:51:56,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 77 transitions. [2018-11-23 11:51:56,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:51:56,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 77 transitions. [2018-11-23 11:51:56,117 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 77 transitions. [2018-11-23 11:51:56,372 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:56,374 INFO L225 Difference]: With dead ends: 118 [2018-11-23 11:51:56,375 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 11:51:56,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:51:56,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 11:51:56,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2018-11-23 11:51:56,445 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:56,445 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 63 states. [2018-11-23 11:51:56,445 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 63 states. [2018-11-23 11:51:56,445 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 63 states. [2018-11-23 11:51:56,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:56,448 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2018-11-23 11:51:56,448 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2018-11-23 11:51:56,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:56,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:56,448 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 67 states. [2018-11-23 11:51:56,448 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 67 states. [2018-11-23 11:51:56,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:56,451 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2018-11-23 11:51:56,451 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2018-11-23 11:51:56,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:56,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:56,452 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:56,452 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:56,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 11:51:56,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 80 transitions. [2018-11-23 11:51:56,454 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 80 transitions. Word has length 34 [2018-11-23 11:51:56,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:56,455 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 80 transitions. [2018-11-23 11:51:56,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:51:56,455 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2018-11-23 11:51:56,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 11:51:56,455 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:56,456 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:56,456 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:56,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:56,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1152763096, now seen corresponding path program 7 times [2018-11-23 11:51:56,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:56,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:56,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:56,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:56,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:56,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:56,939 INFO L256 TraceCheckUtils]: 0: Hoare triple {2796#true} call ULTIMATE.init(); {2796#true} is VALID [2018-11-23 11:51:56,939 INFO L273 TraceCheckUtils]: 1: Hoare triple {2796#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2796#true} is VALID [2018-11-23 11:51:56,939 INFO L273 TraceCheckUtils]: 2: Hoare triple {2796#true} assume true; {2796#true} is VALID [2018-11-23 11:51:56,940 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2796#true} {2796#true} #79#return; {2796#true} is VALID [2018-11-23 11:51:56,940 INFO L256 TraceCheckUtils]: 4: Hoare triple {2796#true} call #t~ret8 := main(); {2796#true} is VALID [2018-11-23 11:51:56,940 INFO L273 TraceCheckUtils]: 5: Hoare triple {2796#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {2796#true} is VALID [2018-11-23 11:51:56,941 INFO L273 TraceCheckUtils]: 6: Hoare triple {2796#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {2798#(= main_~i~0 1)} is VALID [2018-11-23 11:51:56,941 INFO L273 TraceCheckUtils]: 7: Hoare triple {2798#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {2798#(= main_~i~0 1)} is VALID [2018-11-23 11:51:56,941 INFO L273 TraceCheckUtils]: 8: Hoare triple {2798#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2798#(= main_~i~0 1)} is VALID [2018-11-23 11:51:56,942 INFO L273 TraceCheckUtils]: 9: Hoare triple {2798#(= main_~i~0 1)} ~i~0 := 1 + ~i~0; {2799#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:56,942 INFO L273 TraceCheckUtils]: 10: Hoare triple {2799#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {2799#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:56,943 INFO L273 TraceCheckUtils]: 11: Hoare triple {2799#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2799#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:56,943 INFO L273 TraceCheckUtils]: 12: Hoare triple {2799#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {2800#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:56,944 INFO L273 TraceCheckUtils]: 13: Hoare triple {2800#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {2800#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:56,944 INFO L273 TraceCheckUtils]: 14: Hoare triple {2800#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2800#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:56,945 INFO L273 TraceCheckUtils]: 15: Hoare triple {2800#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {2801#(<= main_~i~0 4)} is VALID [2018-11-23 11:51:56,946 INFO L273 TraceCheckUtils]: 16: Hoare triple {2801#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {2801#(<= main_~i~0 4)} is VALID [2018-11-23 11:51:56,946 INFO L273 TraceCheckUtils]: 17: Hoare triple {2801#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2801#(<= main_~i~0 4)} is VALID [2018-11-23 11:51:56,947 INFO L273 TraceCheckUtils]: 18: Hoare triple {2801#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {2802#(<= main_~i~0 5)} is VALID [2018-11-23 11:51:56,948 INFO L273 TraceCheckUtils]: 19: Hoare triple {2802#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {2802#(<= main_~i~0 5)} is VALID [2018-11-23 11:51:56,953 INFO L273 TraceCheckUtils]: 20: Hoare triple {2802#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2802#(<= main_~i~0 5)} is VALID [2018-11-23 11:51:56,953 INFO L273 TraceCheckUtils]: 21: Hoare triple {2802#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {2803#(<= main_~i~0 6)} is VALID [2018-11-23 11:51:56,974 INFO L273 TraceCheckUtils]: 22: Hoare triple {2803#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {2803#(<= main_~i~0 6)} is VALID [2018-11-23 11:51:56,989 INFO L273 TraceCheckUtils]: 23: Hoare triple {2803#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2803#(<= main_~i~0 6)} is VALID [2018-11-23 11:51:57,003 INFO L273 TraceCheckUtils]: 24: Hoare triple {2803#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {2804#(<= main_~i~0 7)} is VALID [2018-11-23 11:51:57,010 INFO L273 TraceCheckUtils]: 25: Hoare triple {2804#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {2804#(<= main_~i~0 7)} is VALID [2018-11-23 11:51:57,010 INFO L273 TraceCheckUtils]: 26: Hoare triple {2804#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2804#(<= main_~i~0 7)} is VALID [2018-11-23 11:51:57,011 INFO L273 TraceCheckUtils]: 27: Hoare triple {2804#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {2805#(<= main_~i~0 8)} is VALID [2018-11-23 11:51:57,011 INFO L273 TraceCheckUtils]: 28: Hoare triple {2805#(<= main_~i~0 8)} assume !(~i~0 < 100000); {2797#false} is VALID [2018-11-23 11:51:57,011 INFO L273 TraceCheckUtils]: 29: Hoare triple {2797#false} assume !(0 != ~swapped~0); {2797#false} is VALID [2018-11-23 11:51:57,012 INFO L273 TraceCheckUtils]: 30: Hoare triple {2797#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {2797#false} is VALID [2018-11-23 11:51:57,012 INFO L273 TraceCheckUtils]: 31: Hoare triple {2797#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {2797#false} is VALID [2018-11-23 11:51:57,012 INFO L273 TraceCheckUtils]: 32: Hoare triple {2797#false} assume !!(~y~0 < 100000);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); {2797#false} is VALID [2018-11-23 11:51:57,012 INFO L256 TraceCheckUtils]: 33: Hoare triple {2797#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {2797#false} is VALID [2018-11-23 11:51:57,012 INFO L273 TraceCheckUtils]: 34: Hoare triple {2797#false} ~cond := #in~cond; {2797#false} is VALID [2018-11-23 11:51:57,012 INFO L273 TraceCheckUtils]: 35: Hoare triple {2797#false} assume 0 == ~cond; {2797#false} is VALID [2018-11-23 11:51:57,012 INFO L273 TraceCheckUtils]: 36: Hoare triple {2797#false} assume !false; {2797#false} is VALID [2018-11-23 11:51:57,013 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 1 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:57,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:57,014 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:51:57,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:57,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:57,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:57,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:57,160 INFO L256 TraceCheckUtils]: 0: Hoare triple {2796#true} call ULTIMATE.init(); {2796#true} is VALID [2018-11-23 11:51:57,161 INFO L273 TraceCheckUtils]: 1: Hoare triple {2796#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2796#true} is VALID [2018-11-23 11:51:57,161 INFO L273 TraceCheckUtils]: 2: Hoare triple {2796#true} assume true; {2796#true} is VALID [2018-11-23 11:51:57,161 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2796#true} {2796#true} #79#return; {2796#true} is VALID [2018-11-23 11:51:57,162 INFO L256 TraceCheckUtils]: 4: Hoare triple {2796#true} call #t~ret8 := main(); {2796#true} is VALID [2018-11-23 11:51:57,162 INFO L273 TraceCheckUtils]: 5: Hoare triple {2796#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {2796#true} is VALID [2018-11-23 11:51:57,163 INFO L273 TraceCheckUtils]: 6: Hoare triple {2796#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {2827#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:57,163 INFO L273 TraceCheckUtils]: 7: Hoare triple {2827#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {2827#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:57,163 INFO L273 TraceCheckUtils]: 8: Hoare triple {2827#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2827#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:57,164 INFO L273 TraceCheckUtils]: 9: Hoare triple {2827#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {2799#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:57,164 INFO L273 TraceCheckUtils]: 10: Hoare triple {2799#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {2799#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:57,165 INFO L273 TraceCheckUtils]: 11: Hoare triple {2799#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2799#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:57,165 INFO L273 TraceCheckUtils]: 12: Hoare triple {2799#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {2800#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:57,166 INFO L273 TraceCheckUtils]: 13: Hoare triple {2800#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {2800#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:57,166 INFO L273 TraceCheckUtils]: 14: Hoare triple {2800#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2800#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:57,167 INFO L273 TraceCheckUtils]: 15: Hoare triple {2800#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {2801#(<= main_~i~0 4)} is VALID [2018-11-23 11:51:57,168 INFO L273 TraceCheckUtils]: 16: Hoare triple {2801#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {2801#(<= main_~i~0 4)} is VALID [2018-11-23 11:51:57,168 INFO L273 TraceCheckUtils]: 17: Hoare triple {2801#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2801#(<= main_~i~0 4)} is VALID [2018-11-23 11:51:57,169 INFO L273 TraceCheckUtils]: 18: Hoare triple {2801#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {2802#(<= main_~i~0 5)} is VALID [2018-11-23 11:51:57,170 INFO L273 TraceCheckUtils]: 19: Hoare triple {2802#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {2802#(<= main_~i~0 5)} is VALID [2018-11-23 11:51:57,170 INFO L273 TraceCheckUtils]: 20: Hoare triple {2802#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2802#(<= main_~i~0 5)} is VALID [2018-11-23 11:51:57,171 INFO L273 TraceCheckUtils]: 21: Hoare triple {2802#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {2803#(<= main_~i~0 6)} is VALID [2018-11-23 11:51:57,172 INFO L273 TraceCheckUtils]: 22: Hoare triple {2803#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {2803#(<= main_~i~0 6)} is VALID [2018-11-23 11:51:57,172 INFO L273 TraceCheckUtils]: 23: Hoare triple {2803#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2803#(<= main_~i~0 6)} is VALID [2018-11-23 11:51:57,173 INFO L273 TraceCheckUtils]: 24: Hoare triple {2803#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {2804#(<= main_~i~0 7)} is VALID [2018-11-23 11:51:57,173 INFO L273 TraceCheckUtils]: 25: Hoare triple {2804#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {2804#(<= main_~i~0 7)} is VALID [2018-11-23 11:51:57,174 INFO L273 TraceCheckUtils]: 26: Hoare triple {2804#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2804#(<= main_~i~0 7)} is VALID [2018-11-23 11:51:57,175 INFO L273 TraceCheckUtils]: 27: Hoare triple {2804#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {2805#(<= main_~i~0 8)} is VALID [2018-11-23 11:51:57,176 INFO L273 TraceCheckUtils]: 28: Hoare triple {2805#(<= main_~i~0 8)} assume !(~i~0 < 100000); {2797#false} is VALID [2018-11-23 11:51:57,176 INFO L273 TraceCheckUtils]: 29: Hoare triple {2797#false} assume !(0 != ~swapped~0); {2797#false} is VALID [2018-11-23 11:51:57,176 INFO L273 TraceCheckUtils]: 30: Hoare triple {2797#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {2797#false} is VALID [2018-11-23 11:51:57,176 INFO L273 TraceCheckUtils]: 31: Hoare triple {2797#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {2797#false} is VALID [2018-11-23 11:51:57,177 INFO L273 TraceCheckUtils]: 32: Hoare triple {2797#false} assume !!(~y~0 < 100000);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); {2797#false} is VALID [2018-11-23 11:51:57,177 INFO L256 TraceCheckUtils]: 33: Hoare triple {2797#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {2797#false} is VALID [2018-11-23 11:51:57,177 INFO L273 TraceCheckUtils]: 34: Hoare triple {2797#false} ~cond := #in~cond; {2797#false} is VALID [2018-11-23 11:51:57,177 INFO L273 TraceCheckUtils]: 35: Hoare triple {2797#false} assume 0 == ~cond; {2797#false} is VALID [2018-11-23 11:51:57,178 INFO L273 TraceCheckUtils]: 36: Hoare triple {2797#false} assume !false; {2797#false} is VALID [2018-11-23 11:51:57,179 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 1 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:57,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:57,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 11:51:57,198 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2018-11-23 11:51:57,199 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:57,199 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 11:51:57,247 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:57,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:51:57,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:51:57,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:51:57,248 INFO L87 Difference]: Start difference. First operand 63 states and 80 transitions. Second operand 11 states. [2018-11-23 11:51:57,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:57,667 INFO L93 Difference]: Finished difference Result 130 states and 170 transitions. [2018-11-23 11:51:57,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:51:57,669 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2018-11-23 11:51:57,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:57,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:51:57,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2018-11-23 11:51:57,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:51:57,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2018-11-23 11:51:57,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 81 transitions. [2018-11-23 11:51:57,832 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:57,833 INFO L225 Difference]: With dead ends: 130 [2018-11-23 11:51:57,833 INFO L226 Difference]: Without dead ends: 73 [2018-11-23 11:51:57,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:51:57,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-23 11:51:57,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2018-11-23 11:51:57,906 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:57,906 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 69 states. [2018-11-23 11:51:57,906 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 69 states. [2018-11-23 11:51:57,906 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 69 states. [2018-11-23 11:51:57,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:57,908 INFO L93 Difference]: Finished difference Result 73 states and 94 transitions. [2018-11-23 11:51:57,908 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 94 transitions. [2018-11-23 11:51:57,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:57,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:57,908 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 73 states. [2018-11-23 11:51:57,908 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 73 states. [2018-11-23 11:51:57,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:57,910 INFO L93 Difference]: Finished difference Result 73 states and 94 transitions. [2018-11-23 11:51:57,910 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 94 transitions. [2018-11-23 11:51:57,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:57,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:57,910 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:57,911 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:57,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-23 11:51:57,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 88 transitions. [2018-11-23 11:51:57,912 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 88 transitions. Word has length 37 [2018-11-23 11:51:57,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:57,912 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 88 transitions. [2018-11-23 11:51:57,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:51:57,913 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 88 transitions. [2018-11-23 11:51:57,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 11:51:57,913 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:57,913 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:57,914 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:57,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:57,914 INFO L82 PathProgramCache]: Analyzing trace with hash -694234287, now seen corresponding path program 8 times [2018-11-23 11:51:57,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:57,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:57,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:57,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:57,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:57,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:58,171 INFO L256 TraceCheckUtils]: 0: Hoare triple {3337#true} call ULTIMATE.init(); {3337#true} is VALID [2018-11-23 11:51:58,172 INFO L273 TraceCheckUtils]: 1: Hoare triple {3337#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3337#true} is VALID [2018-11-23 11:51:58,172 INFO L273 TraceCheckUtils]: 2: Hoare triple {3337#true} assume true; {3337#true} is VALID [2018-11-23 11:51:58,172 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3337#true} {3337#true} #79#return; {3337#true} is VALID [2018-11-23 11:51:58,172 INFO L256 TraceCheckUtils]: 4: Hoare triple {3337#true} call #t~ret8 := main(); {3337#true} is VALID [2018-11-23 11:51:58,173 INFO L273 TraceCheckUtils]: 5: Hoare triple {3337#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {3337#true} is VALID [2018-11-23 11:51:58,173 INFO L273 TraceCheckUtils]: 6: Hoare triple {3337#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {3339#(= main_~i~0 1)} is VALID [2018-11-23 11:51:58,178 INFO L273 TraceCheckUtils]: 7: Hoare triple {3339#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {3339#(= main_~i~0 1)} is VALID [2018-11-23 11:51:58,181 INFO L273 TraceCheckUtils]: 8: Hoare triple {3339#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3339#(= main_~i~0 1)} is VALID [2018-11-23 11:51:58,184 INFO L273 TraceCheckUtils]: 9: Hoare triple {3339#(= main_~i~0 1)} ~i~0 := 1 + ~i~0; {3340#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:58,184 INFO L273 TraceCheckUtils]: 10: Hoare triple {3340#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {3340#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:58,186 INFO L273 TraceCheckUtils]: 11: Hoare triple {3340#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3340#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:58,186 INFO L273 TraceCheckUtils]: 12: Hoare triple {3340#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {3341#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:58,189 INFO L273 TraceCheckUtils]: 13: Hoare triple {3341#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {3341#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:58,189 INFO L273 TraceCheckUtils]: 14: Hoare triple {3341#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3341#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:58,192 INFO L273 TraceCheckUtils]: 15: Hoare triple {3341#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {3342#(<= main_~i~0 4)} is VALID [2018-11-23 11:51:58,192 INFO L273 TraceCheckUtils]: 16: Hoare triple {3342#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {3342#(<= main_~i~0 4)} is VALID [2018-11-23 11:51:58,195 INFO L273 TraceCheckUtils]: 17: Hoare triple {3342#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3342#(<= main_~i~0 4)} is VALID [2018-11-23 11:51:58,195 INFO L273 TraceCheckUtils]: 18: Hoare triple {3342#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {3343#(<= main_~i~0 5)} is VALID [2018-11-23 11:51:58,198 INFO L273 TraceCheckUtils]: 19: Hoare triple {3343#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {3343#(<= main_~i~0 5)} is VALID [2018-11-23 11:51:58,198 INFO L273 TraceCheckUtils]: 20: Hoare triple {3343#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3343#(<= main_~i~0 5)} is VALID [2018-11-23 11:51:58,201 INFO L273 TraceCheckUtils]: 21: Hoare triple {3343#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {3344#(<= main_~i~0 6)} is VALID [2018-11-23 11:51:58,201 INFO L273 TraceCheckUtils]: 22: Hoare triple {3344#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {3344#(<= main_~i~0 6)} is VALID [2018-11-23 11:51:58,204 INFO L273 TraceCheckUtils]: 23: Hoare triple {3344#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3344#(<= main_~i~0 6)} is VALID [2018-11-23 11:51:58,204 INFO L273 TraceCheckUtils]: 24: Hoare triple {3344#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {3345#(<= main_~i~0 7)} is VALID [2018-11-23 11:51:58,207 INFO L273 TraceCheckUtils]: 25: Hoare triple {3345#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {3345#(<= main_~i~0 7)} is VALID [2018-11-23 11:51:58,207 INFO L273 TraceCheckUtils]: 26: Hoare triple {3345#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3345#(<= main_~i~0 7)} is VALID [2018-11-23 11:51:58,210 INFO L273 TraceCheckUtils]: 27: Hoare triple {3345#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {3346#(<= main_~i~0 8)} is VALID [2018-11-23 11:51:58,210 INFO L273 TraceCheckUtils]: 28: Hoare triple {3346#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {3346#(<= main_~i~0 8)} is VALID [2018-11-23 11:51:58,213 INFO L273 TraceCheckUtils]: 29: Hoare triple {3346#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3346#(<= main_~i~0 8)} is VALID [2018-11-23 11:51:58,213 INFO L273 TraceCheckUtils]: 30: Hoare triple {3346#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {3347#(<= main_~i~0 9)} is VALID [2018-11-23 11:51:58,216 INFO L273 TraceCheckUtils]: 31: Hoare triple {3347#(<= main_~i~0 9)} assume !(~i~0 < 100000); {3338#false} is VALID [2018-11-23 11:51:58,216 INFO L273 TraceCheckUtils]: 32: Hoare triple {3338#false} assume !(0 != ~swapped~0); {3338#false} is VALID [2018-11-23 11:51:58,216 INFO L273 TraceCheckUtils]: 33: Hoare triple {3338#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {3338#false} is VALID [2018-11-23 11:51:58,216 INFO L273 TraceCheckUtils]: 34: Hoare triple {3338#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {3338#false} is VALID [2018-11-23 11:51:58,216 INFO L273 TraceCheckUtils]: 35: Hoare triple {3338#false} assume !!(~y~0 < 100000);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); {3338#false} is VALID [2018-11-23 11:51:58,216 INFO L256 TraceCheckUtils]: 36: Hoare triple {3338#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {3338#false} is VALID [2018-11-23 11:51:58,217 INFO L273 TraceCheckUtils]: 37: Hoare triple {3338#false} ~cond := #in~cond; {3338#false} is VALID [2018-11-23 11:51:58,217 INFO L273 TraceCheckUtils]: 38: Hoare triple {3338#false} assume 0 == ~cond; {3338#false} is VALID [2018-11-23 11:51:58,217 INFO L273 TraceCheckUtils]: 39: Hoare triple {3338#false} assume !false; {3338#false} is VALID [2018-11-23 11:51:58,218 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 1 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:58,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:58,218 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:51:58,228 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:51:58,250 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:51:58,251 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:51:58,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:58,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:58,371 INFO L256 TraceCheckUtils]: 0: Hoare triple {3337#true} call ULTIMATE.init(); {3337#true} is VALID [2018-11-23 11:51:58,372 INFO L273 TraceCheckUtils]: 1: Hoare triple {3337#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3337#true} is VALID [2018-11-23 11:51:58,372 INFO L273 TraceCheckUtils]: 2: Hoare triple {3337#true} assume true; {3337#true} is VALID [2018-11-23 11:51:58,372 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3337#true} {3337#true} #79#return; {3337#true} is VALID [2018-11-23 11:51:58,372 INFO L256 TraceCheckUtils]: 4: Hoare triple {3337#true} call #t~ret8 := main(); {3337#true} is VALID [2018-11-23 11:51:58,372 INFO L273 TraceCheckUtils]: 5: Hoare triple {3337#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {3337#true} is VALID [2018-11-23 11:51:58,373 INFO L273 TraceCheckUtils]: 6: Hoare triple {3337#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {3369#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:58,373 INFO L273 TraceCheckUtils]: 7: Hoare triple {3369#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {3369#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:58,373 INFO L273 TraceCheckUtils]: 8: Hoare triple {3369#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3369#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:58,374 INFO L273 TraceCheckUtils]: 9: Hoare triple {3369#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {3340#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:58,374 INFO L273 TraceCheckUtils]: 10: Hoare triple {3340#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {3340#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:58,374 INFO L273 TraceCheckUtils]: 11: Hoare triple {3340#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3340#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:58,375 INFO L273 TraceCheckUtils]: 12: Hoare triple {3340#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {3341#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:58,375 INFO L273 TraceCheckUtils]: 13: Hoare triple {3341#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {3341#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:58,376 INFO L273 TraceCheckUtils]: 14: Hoare triple {3341#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3341#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:58,376 INFO L273 TraceCheckUtils]: 15: Hoare triple {3341#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {3342#(<= main_~i~0 4)} is VALID [2018-11-23 11:51:58,377 INFO L273 TraceCheckUtils]: 16: Hoare triple {3342#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {3342#(<= main_~i~0 4)} is VALID [2018-11-23 11:51:58,377 INFO L273 TraceCheckUtils]: 17: Hoare triple {3342#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3342#(<= main_~i~0 4)} is VALID [2018-11-23 11:51:58,378 INFO L273 TraceCheckUtils]: 18: Hoare triple {3342#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {3343#(<= main_~i~0 5)} is VALID [2018-11-23 11:51:58,379 INFO L273 TraceCheckUtils]: 19: Hoare triple {3343#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {3343#(<= main_~i~0 5)} is VALID [2018-11-23 11:51:58,379 INFO L273 TraceCheckUtils]: 20: Hoare triple {3343#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3343#(<= main_~i~0 5)} is VALID [2018-11-23 11:51:58,380 INFO L273 TraceCheckUtils]: 21: Hoare triple {3343#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {3344#(<= main_~i~0 6)} is VALID [2018-11-23 11:51:58,381 INFO L273 TraceCheckUtils]: 22: Hoare triple {3344#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {3344#(<= main_~i~0 6)} is VALID [2018-11-23 11:51:58,381 INFO L273 TraceCheckUtils]: 23: Hoare triple {3344#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3344#(<= main_~i~0 6)} is VALID [2018-11-23 11:51:58,382 INFO L273 TraceCheckUtils]: 24: Hoare triple {3344#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {3345#(<= main_~i~0 7)} is VALID [2018-11-23 11:51:58,382 INFO L273 TraceCheckUtils]: 25: Hoare triple {3345#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {3345#(<= main_~i~0 7)} is VALID [2018-11-23 11:51:58,383 INFO L273 TraceCheckUtils]: 26: Hoare triple {3345#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3345#(<= main_~i~0 7)} is VALID [2018-11-23 11:51:58,384 INFO L273 TraceCheckUtils]: 27: Hoare triple {3345#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {3346#(<= main_~i~0 8)} is VALID [2018-11-23 11:51:58,384 INFO L273 TraceCheckUtils]: 28: Hoare triple {3346#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {3346#(<= main_~i~0 8)} is VALID [2018-11-23 11:51:58,385 INFO L273 TraceCheckUtils]: 29: Hoare triple {3346#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3346#(<= main_~i~0 8)} is VALID [2018-11-23 11:51:58,385 INFO L273 TraceCheckUtils]: 30: Hoare triple {3346#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {3347#(<= main_~i~0 9)} is VALID [2018-11-23 11:51:58,386 INFO L273 TraceCheckUtils]: 31: Hoare triple {3347#(<= main_~i~0 9)} assume !(~i~0 < 100000); {3338#false} is VALID [2018-11-23 11:51:58,386 INFO L273 TraceCheckUtils]: 32: Hoare triple {3338#false} assume !(0 != ~swapped~0); {3338#false} is VALID [2018-11-23 11:51:58,387 INFO L273 TraceCheckUtils]: 33: Hoare triple {3338#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {3338#false} is VALID [2018-11-23 11:51:58,387 INFO L273 TraceCheckUtils]: 34: Hoare triple {3338#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {3338#false} is VALID [2018-11-23 11:51:58,387 INFO L273 TraceCheckUtils]: 35: Hoare triple {3338#false} assume !!(~y~0 < 100000);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); {3338#false} is VALID [2018-11-23 11:51:58,388 INFO L256 TraceCheckUtils]: 36: Hoare triple {3338#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {3338#false} is VALID [2018-11-23 11:51:58,388 INFO L273 TraceCheckUtils]: 37: Hoare triple {3338#false} ~cond := #in~cond; {3338#false} is VALID [2018-11-23 11:51:58,388 INFO L273 TraceCheckUtils]: 38: Hoare triple {3338#false} assume 0 == ~cond; {3338#false} is VALID [2018-11-23 11:51:58,389 INFO L273 TraceCheckUtils]: 39: Hoare triple {3338#false} assume !false; {3338#false} is VALID [2018-11-23 11:51:58,391 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 1 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:58,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:58,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 11:51:58,415 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2018-11-23 11:51:58,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:58,415 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:51:58,455 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:58,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:51:58,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:51:58,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:51:58,456 INFO L87 Difference]: Start difference. First operand 69 states and 88 transitions. Second operand 12 states. [2018-11-23 11:51:58,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:58,721 INFO L93 Difference]: Finished difference Result 142 states and 186 transitions. [2018-11-23 11:51:58,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:51:58,722 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2018-11-23 11:51:58,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:58,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:51:58,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 85 transitions. [2018-11-23 11:51:58,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:51:58,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 85 transitions. [2018-11-23 11:51:58,725 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 85 transitions. [2018-11-23 11:51:58,910 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:58,912 INFO L225 Difference]: With dead ends: 142 [2018-11-23 11:51:58,912 INFO L226 Difference]: Without dead ends: 79 [2018-11-23 11:51:58,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:51:58,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-23 11:51:58,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2018-11-23 11:51:58,942 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:58,942 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand 75 states. [2018-11-23 11:51:58,942 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 75 states. [2018-11-23 11:51:58,942 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 75 states. [2018-11-23 11:51:58,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:58,945 INFO L93 Difference]: Finished difference Result 79 states and 102 transitions. [2018-11-23 11:51:58,945 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 102 transitions. [2018-11-23 11:51:58,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:58,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:58,946 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 79 states. [2018-11-23 11:51:58,946 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 79 states. [2018-11-23 11:51:58,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:58,948 INFO L93 Difference]: Finished difference Result 79 states and 102 transitions. [2018-11-23 11:51:58,948 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 102 transitions. [2018-11-23 11:51:58,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:58,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:58,948 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:58,948 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:58,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-23 11:51:58,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 96 transitions. [2018-11-23 11:51:58,950 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 96 transitions. Word has length 40 [2018-11-23 11:51:58,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:58,951 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 96 transitions. [2018-11-23 11:51:58,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:51:58,951 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 96 transitions. [2018-11-23 11:51:58,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 11:51:58,952 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:58,952 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:58,952 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:58,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:58,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1341513352, now seen corresponding path program 9 times [2018-11-23 11:51:58,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:58,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:58,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:58,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:58,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:58,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:59,264 INFO L256 TraceCheckUtils]: 0: Hoare triple {3924#true} call ULTIMATE.init(); {3924#true} is VALID [2018-11-23 11:51:59,264 INFO L273 TraceCheckUtils]: 1: Hoare triple {3924#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3924#true} is VALID [2018-11-23 11:51:59,264 INFO L273 TraceCheckUtils]: 2: Hoare triple {3924#true} assume true; {3924#true} is VALID [2018-11-23 11:51:59,265 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3924#true} {3924#true} #79#return; {3924#true} is VALID [2018-11-23 11:51:59,265 INFO L256 TraceCheckUtils]: 4: Hoare triple {3924#true} call #t~ret8 := main(); {3924#true} is VALID [2018-11-23 11:51:59,265 INFO L273 TraceCheckUtils]: 5: Hoare triple {3924#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {3924#true} is VALID [2018-11-23 11:51:59,265 INFO L273 TraceCheckUtils]: 6: Hoare triple {3924#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {3926#(= main_~i~0 1)} is VALID [2018-11-23 11:51:59,266 INFO L273 TraceCheckUtils]: 7: Hoare triple {3926#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {3926#(= main_~i~0 1)} is VALID [2018-11-23 11:51:59,266 INFO L273 TraceCheckUtils]: 8: Hoare triple {3926#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3926#(= main_~i~0 1)} is VALID [2018-11-23 11:51:59,267 INFO L273 TraceCheckUtils]: 9: Hoare triple {3926#(= main_~i~0 1)} ~i~0 := 1 + ~i~0; {3927#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:59,267 INFO L273 TraceCheckUtils]: 10: Hoare triple {3927#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {3927#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:59,268 INFO L273 TraceCheckUtils]: 11: Hoare triple {3927#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3927#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:59,268 INFO L273 TraceCheckUtils]: 12: Hoare triple {3927#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {3928#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:59,268 INFO L273 TraceCheckUtils]: 13: Hoare triple {3928#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {3928#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:59,269 INFO L273 TraceCheckUtils]: 14: Hoare triple {3928#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3928#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:59,269 INFO L273 TraceCheckUtils]: 15: Hoare triple {3928#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {3929#(<= main_~i~0 4)} is VALID [2018-11-23 11:51:59,270 INFO L273 TraceCheckUtils]: 16: Hoare triple {3929#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {3929#(<= main_~i~0 4)} is VALID [2018-11-23 11:51:59,270 INFO L273 TraceCheckUtils]: 17: Hoare triple {3929#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3929#(<= main_~i~0 4)} is VALID [2018-11-23 11:51:59,271 INFO L273 TraceCheckUtils]: 18: Hoare triple {3929#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {3930#(<= main_~i~0 5)} is VALID [2018-11-23 11:51:59,274 INFO L273 TraceCheckUtils]: 19: Hoare triple {3930#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {3930#(<= main_~i~0 5)} is VALID [2018-11-23 11:51:59,274 INFO L273 TraceCheckUtils]: 20: Hoare triple {3930#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3930#(<= main_~i~0 5)} is VALID [2018-11-23 11:51:59,278 INFO L273 TraceCheckUtils]: 21: Hoare triple {3930#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {3931#(<= main_~i~0 6)} is VALID [2018-11-23 11:51:59,278 INFO L273 TraceCheckUtils]: 22: Hoare triple {3931#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {3931#(<= main_~i~0 6)} is VALID [2018-11-23 11:51:59,283 INFO L273 TraceCheckUtils]: 23: Hoare triple {3931#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3931#(<= main_~i~0 6)} is VALID [2018-11-23 11:51:59,286 INFO L273 TraceCheckUtils]: 24: Hoare triple {3931#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {3932#(<= main_~i~0 7)} is VALID [2018-11-23 11:51:59,286 INFO L273 TraceCheckUtils]: 25: Hoare triple {3932#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {3932#(<= main_~i~0 7)} is VALID [2018-11-23 11:51:59,289 INFO L273 TraceCheckUtils]: 26: Hoare triple {3932#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3932#(<= main_~i~0 7)} is VALID [2018-11-23 11:51:59,289 INFO L273 TraceCheckUtils]: 27: Hoare triple {3932#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {3933#(<= main_~i~0 8)} is VALID [2018-11-23 11:51:59,295 INFO L273 TraceCheckUtils]: 28: Hoare triple {3933#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {3933#(<= main_~i~0 8)} is VALID [2018-11-23 11:51:59,297 INFO L273 TraceCheckUtils]: 29: Hoare triple {3933#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3933#(<= main_~i~0 8)} is VALID [2018-11-23 11:51:59,300 INFO L273 TraceCheckUtils]: 30: Hoare triple {3933#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {3934#(<= main_~i~0 9)} is VALID [2018-11-23 11:51:59,300 INFO L273 TraceCheckUtils]: 31: Hoare triple {3934#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {3934#(<= main_~i~0 9)} is VALID [2018-11-23 11:51:59,303 INFO L273 TraceCheckUtils]: 32: Hoare triple {3934#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3934#(<= main_~i~0 9)} is VALID [2018-11-23 11:51:59,303 INFO L273 TraceCheckUtils]: 33: Hoare triple {3934#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {3935#(<= main_~i~0 10)} is VALID [2018-11-23 11:51:59,305 INFO L273 TraceCheckUtils]: 34: Hoare triple {3935#(<= main_~i~0 10)} assume !(~i~0 < 100000); {3925#false} is VALID [2018-11-23 11:51:59,305 INFO L273 TraceCheckUtils]: 35: Hoare triple {3925#false} assume !(0 != ~swapped~0); {3925#false} is VALID [2018-11-23 11:51:59,305 INFO L273 TraceCheckUtils]: 36: Hoare triple {3925#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {3925#false} is VALID [2018-11-23 11:51:59,305 INFO L273 TraceCheckUtils]: 37: Hoare triple {3925#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {3925#false} is VALID [2018-11-23 11:51:59,305 INFO L273 TraceCheckUtils]: 38: Hoare triple {3925#false} assume !!(~y~0 < 100000);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); {3925#false} is VALID [2018-11-23 11:51:59,305 INFO L256 TraceCheckUtils]: 39: Hoare triple {3925#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {3925#false} is VALID [2018-11-23 11:51:59,305 INFO L273 TraceCheckUtils]: 40: Hoare triple {3925#false} ~cond := #in~cond; {3925#false} is VALID [2018-11-23 11:51:59,306 INFO L273 TraceCheckUtils]: 41: Hoare triple {3925#false} assume 0 == ~cond; {3925#false} is VALID [2018-11-23 11:51:59,306 INFO L273 TraceCheckUtils]: 42: Hoare triple {3925#false} assume !false; {3925#false} is VALID [2018-11-23 11:51:59,307 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 1 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:59,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:59,307 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:51:59,317 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:51:59,353 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-23 11:51:59,353 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:51:59,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:59,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:59,468 INFO L256 TraceCheckUtils]: 0: Hoare triple {3924#true} call ULTIMATE.init(); {3924#true} is VALID [2018-11-23 11:51:59,468 INFO L273 TraceCheckUtils]: 1: Hoare triple {3924#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3924#true} is VALID [2018-11-23 11:51:59,468 INFO L273 TraceCheckUtils]: 2: Hoare triple {3924#true} assume true; {3924#true} is VALID [2018-11-23 11:51:59,469 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3924#true} {3924#true} #79#return; {3924#true} is VALID [2018-11-23 11:51:59,469 INFO L256 TraceCheckUtils]: 4: Hoare triple {3924#true} call #t~ret8 := main(); {3924#true} is VALID [2018-11-23 11:51:59,469 INFO L273 TraceCheckUtils]: 5: Hoare triple {3924#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {3924#true} is VALID [2018-11-23 11:51:59,470 INFO L273 TraceCheckUtils]: 6: Hoare triple {3924#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {3957#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:59,470 INFO L273 TraceCheckUtils]: 7: Hoare triple {3957#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {3957#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:59,471 INFO L273 TraceCheckUtils]: 8: Hoare triple {3957#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3957#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:59,471 INFO L273 TraceCheckUtils]: 9: Hoare triple {3957#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {3927#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:59,472 INFO L273 TraceCheckUtils]: 10: Hoare triple {3927#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {3927#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:59,472 INFO L273 TraceCheckUtils]: 11: Hoare triple {3927#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3927#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:59,472 INFO L273 TraceCheckUtils]: 12: Hoare triple {3927#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {3928#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:59,473 INFO L273 TraceCheckUtils]: 13: Hoare triple {3928#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {3928#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:59,473 INFO L273 TraceCheckUtils]: 14: Hoare triple {3928#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3928#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:59,473 INFO L273 TraceCheckUtils]: 15: Hoare triple {3928#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {3929#(<= main_~i~0 4)} is VALID [2018-11-23 11:51:59,474 INFO L273 TraceCheckUtils]: 16: Hoare triple {3929#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {3929#(<= main_~i~0 4)} is VALID [2018-11-23 11:51:59,474 INFO L273 TraceCheckUtils]: 17: Hoare triple {3929#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3929#(<= main_~i~0 4)} is VALID [2018-11-23 11:51:59,475 INFO L273 TraceCheckUtils]: 18: Hoare triple {3929#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {3930#(<= main_~i~0 5)} is VALID [2018-11-23 11:51:59,476 INFO L273 TraceCheckUtils]: 19: Hoare triple {3930#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {3930#(<= main_~i~0 5)} is VALID [2018-11-23 11:51:59,476 INFO L273 TraceCheckUtils]: 20: Hoare triple {3930#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3930#(<= main_~i~0 5)} is VALID [2018-11-23 11:51:59,477 INFO L273 TraceCheckUtils]: 21: Hoare triple {3930#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {3931#(<= main_~i~0 6)} is VALID [2018-11-23 11:51:59,477 INFO L273 TraceCheckUtils]: 22: Hoare triple {3931#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {3931#(<= main_~i~0 6)} is VALID [2018-11-23 11:51:59,478 INFO L273 TraceCheckUtils]: 23: Hoare triple {3931#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3931#(<= main_~i~0 6)} is VALID [2018-11-23 11:51:59,479 INFO L273 TraceCheckUtils]: 24: Hoare triple {3931#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {3932#(<= main_~i~0 7)} is VALID [2018-11-23 11:51:59,479 INFO L273 TraceCheckUtils]: 25: Hoare triple {3932#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {3932#(<= main_~i~0 7)} is VALID [2018-11-23 11:51:59,480 INFO L273 TraceCheckUtils]: 26: Hoare triple {3932#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3932#(<= main_~i~0 7)} is VALID [2018-11-23 11:51:59,480 INFO L273 TraceCheckUtils]: 27: Hoare triple {3932#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {3933#(<= main_~i~0 8)} is VALID [2018-11-23 11:51:59,481 INFO L273 TraceCheckUtils]: 28: Hoare triple {3933#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {3933#(<= main_~i~0 8)} is VALID [2018-11-23 11:51:59,482 INFO L273 TraceCheckUtils]: 29: Hoare triple {3933#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3933#(<= main_~i~0 8)} is VALID [2018-11-23 11:51:59,482 INFO L273 TraceCheckUtils]: 30: Hoare triple {3933#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {3934#(<= main_~i~0 9)} is VALID [2018-11-23 11:51:59,483 INFO L273 TraceCheckUtils]: 31: Hoare triple {3934#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {3934#(<= main_~i~0 9)} is VALID [2018-11-23 11:51:59,483 INFO L273 TraceCheckUtils]: 32: Hoare triple {3934#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3934#(<= main_~i~0 9)} is VALID [2018-11-23 11:51:59,484 INFO L273 TraceCheckUtils]: 33: Hoare triple {3934#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {3935#(<= main_~i~0 10)} is VALID [2018-11-23 11:51:59,485 INFO L273 TraceCheckUtils]: 34: Hoare triple {3935#(<= main_~i~0 10)} assume !(~i~0 < 100000); {3925#false} is VALID [2018-11-23 11:51:59,485 INFO L273 TraceCheckUtils]: 35: Hoare triple {3925#false} assume !(0 != ~swapped~0); {3925#false} is VALID [2018-11-23 11:51:59,485 INFO L273 TraceCheckUtils]: 36: Hoare triple {3925#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {3925#false} is VALID [2018-11-23 11:51:59,485 INFO L273 TraceCheckUtils]: 37: Hoare triple {3925#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {3925#false} is VALID [2018-11-23 11:51:59,485 INFO L273 TraceCheckUtils]: 38: Hoare triple {3925#false} assume !!(~y~0 < 100000);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); {3925#false} is VALID [2018-11-23 11:51:59,486 INFO L256 TraceCheckUtils]: 39: Hoare triple {3925#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {3925#false} is VALID [2018-11-23 11:51:59,486 INFO L273 TraceCheckUtils]: 40: Hoare triple {3925#false} ~cond := #in~cond; {3925#false} is VALID [2018-11-23 11:51:59,486 INFO L273 TraceCheckUtils]: 41: Hoare triple {3925#false} assume 0 == ~cond; {3925#false} is VALID [2018-11-23 11:51:59,486 INFO L273 TraceCheckUtils]: 42: Hoare triple {3925#false} assume !false; {3925#false} is VALID [2018-11-23 11:51:59,488 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 1 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:59,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:59,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-23 11:51:59,507 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2018-11-23 11:51:59,508 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:59,508 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 11:51:59,554 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:59,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 11:51:59,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 11:51:59,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:51:59,556 INFO L87 Difference]: Start difference. First operand 75 states and 96 transitions. Second operand 13 states. [2018-11-23 11:51:59,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:59,881 INFO L93 Difference]: Finished difference Result 154 states and 202 transitions. [2018-11-23 11:51:59,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:51:59,881 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2018-11-23 11:51:59,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:59,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:51:59,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 89 transitions. [2018-11-23 11:51:59,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:51:59,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 89 transitions. [2018-11-23 11:51:59,884 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 89 transitions. [2018-11-23 11:52:00,937 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:00,939 INFO L225 Difference]: With dead ends: 154 [2018-11-23 11:52:00,939 INFO L226 Difference]: Without dead ends: 85 [2018-11-23 11:52:00,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:52:00,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-23 11:52:00,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2018-11-23 11:52:00,994 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:00,994 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand 81 states. [2018-11-23 11:52:00,994 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 81 states. [2018-11-23 11:52:00,995 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 81 states. [2018-11-23 11:52:00,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:00,998 INFO L93 Difference]: Finished difference Result 85 states and 110 transitions. [2018-11-23 11:52:00,998 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 110 transitions. [2018-11-23 11:52:00,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:00,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:00,999 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 85 states. [2018-11-23 11:52:00,999 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 85 states. [2018-11-23 11:52:01,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:01,001 INFO L93 Difference]: Finished difference Result 85 states and 110 transitions. [2018-11-23 11:52:01,001 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 110 transitions. [2018-11-23 11:52:01,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:01,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:01,002 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:01,002 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:01,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-23 11:52:01,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 104 transitions. [2018-11-23 11:52:01,004 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 104 transitions. Word has length 43 [2018-11-23 11:52:01,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:01,005 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 104 transitions. [2018-11-23 11:52:01,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 11:52:01,005 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 104 transitions. [2018-11-23 11:52:01,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 11:52:01,006 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:01,006 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:01,006 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:01,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:01,006 INFO L82 PathProgramCache]: Analyzing trace with hash -933760015, now seen corresponding path program 10 times [2018-11-23 11:52:01,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:01,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:01,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:01,008 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:01,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:01,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:01,640 INFO L256 TraceCheckUtils]: 0: Hoare triple {4557#true} call ULTIMATE.init(); {4557#true} is VALID [2018-11-23 11:52:01,640 INFO L273 TraceCheckUtils]: 1: Hoare triple {4557#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4557#true} is VALID [2018-11-23 11:52:01,640 INFO L273 TraceCheckUtils]: 2: Hoare triple {4557#true} assume true; {4557#true} is VALID [2018-11-23 11:52:01,640 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4557#true} {4557#true} #79#return; {4557#true} is VALID [2018-11-23 11:52:01,640 INFO L256 TraceCheckUtils]: 4: Hoare triple {4557#true} call #t~ret8 := main(); {4557#true} is VALID [2018-11-23 11:52:01,640 INFO L273 TraceCheckUtils]: 5: Hoare triple {4557#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {4557#true} is VALID [2018-11-23 11:52:01,641 INFO L273 TraceCheckUtils]: 6: Hoare triple {4557#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {4559#(= main_~i~0 1)} is VALID [2018-11-23 11:52:01,641 INFO L273 TraceCheckUtils]: 7: Hoare triple {4559#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {4559#(= main_~i~0 1)} is VALID [2018-11-23 11:52:01,641 INFO L273 TraceCheckUtils]: 8: Hoare triple {4559#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4559#(= main_~i~0 1)} is VALID [2018-11-23 11:52:01,642 INFO L273 TraceCheckUtils]: 9: Hoare triple {4559#(= main_~i~0 1)} ~i~0 := 1 + ~i~0; {4560#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:01,643 INFO L273 TraceCheckUtils]: 10: Hoare triple {4560#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {4560#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:01,643 INFO L273 TraceCheckUtils]: 11: Hoare triple {4560#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4560#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:01,644 INFO L273 TraceCheckUtils]: 12: Hoare triple {4560#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {4561#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:01,645 INFO L273 TraceCheckUtils]: 13: Hoare triple {4561#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {4561#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:01,645 INFO L273 TraceCheckUtils]: 14: Hoare triple {4561#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4561#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:01,646 INFO L273 TraceCheckUtils]: 15: Hoare triple {4561#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {4562#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:01,646 INFO L273 TraceCheckUtils]: 16: Hoare triple {4562#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {4562#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:01,647 INFO L273 TraceCheckUtils]: 17: Hoare triple {4562#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4562#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:01,648 INFO L273 TraceCheckUtils]: 18: Hoare triple {4562#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {4563#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:01,648 INFO L273 TraceCheckUtils]: 19: Hoare triple {4563#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {4563#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:01,649 INFO L273 TraceCheckUtils]: 20: Hoare triple {4563#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4563#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:01,649 INFO L273 TraceCheckUtils]: 21: Hoare triple {4563#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {4564#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:01,650 INFO L273 TraceCheckUtils]: 22: Hoare triple {4564#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {4564#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:01,650 INFO L273 TraceCheckUtils]: 23: Hoare triple {4564#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4564#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:01,651 INFO L273 TraceCheckUtils]: 24: Hoare triple {4564#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {4565#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:01,652 INFO L273 TraceCheckUtils]: 25: Hoare triple {4565#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {4565#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:01,652 INFO L273 TraceCheckUtils]: 26: Hoare triple {4565#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4565#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:01,653 INFO L273 TraceCheckUtils]: 27: Hoare triple {4565#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {4566#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:01,653 INFO L273 TraceCheckUtils]: 28: Hoare triple {4566#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {4566#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:01,654 INFO L273 TraceCheckUtils]: 29: Hoare triple {4566#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4566#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:01,655 INFO L273 TraceCheckUtils]: 30: Hoare triple {4566#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {4567#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:01,655 INFO L273 TraceCheckUtils]: 31: Hoare triple {4567#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {4567#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:01,656 INFO L273 TraceCheckUtils]: 32: Hoare triple {4567#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4567#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:01,656 INFO L273 TraceCheckUtils]: 33: Hoare triple {4567#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {4568#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:01,657 INFO L273 TraceCheckUtils]: 34: Hoare triple {4568#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {4568#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:01,657 INFO L273 TraceCheckUtils]: 35: Hoare triple {4568#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4568#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:01,658 INFO L273 TraceCheckUtils]: 36: Hoare triple {4568#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {4569#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:01,659 INFO L273 TraceCheckUtils]: 37: Hoare triple {4569#(<= main_~i~0 11)} assume !(~i~0 < 100000); {4558#false} is VALID [2018-11-23 11:52:01,659 INFO L273 TraceCheckUtils]: 38: Hoare triple {4558#false} assume !(0 != ~swapped~0); {4558#false} is VALID [2018-11-23 11:52:01,659 INFO L273 TraceCheckUtils]: 39: Hoare triple {4558#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {4558#false} is VALID [2018-11-23 11:52:01,660 INFO L273 TraceCheckUtils]: 40: Hoare triple {4558#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {4558#false} is VALID [2018-11-23 11:52:01,660 INFO L273 TraceCheckUtils]: 41: Hoare triple {4558#false} assume !!(~y~0 < 100000);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); {4558#false} is VALID [2018-11-23 11:52:01,660 INFO L256 TraceCheckUtils]: 42: Hoare triple {4558#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {4558#false} is VALID [2018-11-23 11:52:01,661 INFO L273 TraceCheckUtils]: 43: Hoare triple {4558#false} ~cond := #in~cond; {4558#false} is VALID [2018-11-23 11:52:01,661 INFO L273 TraceCheckUtils]: 44: Hoare triple {4558#false} assume 0 == ~cond; {4558#false} is VALID [2018-11-23 11:52:01,661 INFO L273 TraceCheckUtils]: 45: Hoare triple {4558#false} assume !false; {4558#false} is VALID [2018-11-23 11:52:01,663 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 1 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:01,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:01,664 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:52:01,680 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:52:01,702 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:52:01,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:01,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:01,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:01,935 INFO L256 TraceCheckUtils]: 0: Hoare triple {4557#true} call ULTIMATE.init(); {4557#true} is VALID [2018-11-23 11:52:01,935 INFO L273 TraceCheckUtils]: 1: Hoare triple {4557#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4557#true} is VALID [2018-11-23 11:52:01,935 INFO L273 TraceCheckUtils]: 2: Hoare triple {4557#true} assume true; {4557#true} is VALID [2018-11-23 11:52:01,936 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4557#true} {4557#true} #79#return; {4557#true} is VALID [2018-11-23 11:52:01,936 INFO L256 TraceCheckUtils]: 4: Hoare triple {4557#true} call #t~ret8 := main(); {4557#true} is VALID [2018-11-23 11:52:01,936 INFO L273 TraceCheckUtils]: 5: Hoare triple {4557#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {4557#true} is VALID [2018-11-23 11:52:01,937 INFO L273 TraceCheckUtils]: 6: Hoare triple {4557#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {4591#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:01,937 INFO L273 TraceCheckUtils]: 7: Hoare triple {4591#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {4591#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:01,938 INFO L273 TraceCheckUtils]: 8: Hoare triple {4591#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4591#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:01,938 INFO L273 TraceCheckUtils]: 9: Hoare triple {4591#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {4560#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:01,938 INFO L273 TraceCheckUtils]: 10: Hoare triple {4560#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {4560#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:01,939 INFO L273 TraceCheckUtils]: 11: Hoare triple {4560#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4560#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:01,951 INFO L273 TraceCheckUtils]: 12: Hoare triple {4560#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {4561#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:01,951 INFO L273 TraceCheckUtils]: 13: Hoare triple {4561#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {4561#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:01,971 INFO L273 TraceCheckUtils]: 14: Hoare triple {4561#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4561#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:01,973 INFO L273 TraceCheckUtils]: 15: Hoare triple {4561#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {4562#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:01,973 INFO L273 TraceCheckUtils]: 16: Hoare triple {4562#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {4562#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:01,974 INFO L273 TraceCheckUtils]: 17: Hoare triple {4562#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4562#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:01,974 INFO L273 TraceCheckUtils]: 18: Hoare triple {4562#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {4563#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:01,977 INFO L273 TraceCheckUtils]: 19: Hoare triple {4563#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {4563#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:01,977 INFO L273 TraceCheckUtils]: 20: Hoare triple {4563#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4563#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:01,977 INFO L273 TraceCheckUtils]: 21: Hoare triple {4563#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {4564#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:01,978 INFO L273 TraceCheckUtils]: 22: Hoare triple {4564#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {4564#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:01,978 INFO L273 TraceCheckUtils]: 23: Hoare triple {4564#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4564#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:01,979 INFO L273 TraceCheckUtils]: 24: Hoare triple {4564#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {4565#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:01,979 INFO L273 TraceCheckUtils]: 25: Hoare triple {4565#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {4565#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:01,979 INFO L273 TraceCheckUtils]: 26: Hoare triple {4565#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4565#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:01,980 INFO L273 TraceCheckUtils]: 27: Hoare triple {4565#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {4566#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:01,980 INFO L273 TraceCheckUtils]: 28: Hoare triple {4566#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {4566#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:01,980 INFO L273 TraceCheckUtils]: 29: Hoare triple {4566#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4566#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:01,981 INFO L273 TraceCheckUtils]: 30: Hoare triple {4566#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {4567#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:01,981 INFO L273 TraceCheckUtils]: 31: Hoare triple {4567#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {4567#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:01,982 INFO L273 TraceCheckUtils]: 32: Hoare triple {4567#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4567#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:01,983 INFO L273 TraceCheckUtils]: 33: Hoare triple {4567#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {4568#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:01,983 INFO L273 TraceCheckUtils]: 34: Hoare triple {4568#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {4568#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:01,984 INFO L273 TraceCheckUtils]: 35: Hoare triple {4568#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4568#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:01,984 INFO L273 TraceCheckUtils]: 36: Hoare triple {4568#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {4569#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:01,985 INFO L273 TraceCheckUtils]: 37: Hoare triple {4569#(<= main_~i~0 11)} assume !(~i~0 < 100000); {4558#false} is VALID [2018-11-23 11:52:01,985 INFO L273 TraceCheckUtils]: 38: Hoare triple {4558#false} assume !(0 != ~swapped~0); {4558#false} is VALID [2018-11-23 11:52:01,986 INFO L273 TraceCheckUtils]: 39: Hoare triple {4558#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {4558#false} is VALID [2018-11-23 11:52:01,986 INFO L273 TraceCheckUtils]: 40: Hoare triple {4558#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {4558#false} is VALID [2018-11-23 11:52:01,986 INFO L273 TraceCheckUtils]: 41: Hoare triple {4558#false} assume !!(~y~0 < 100000);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); {4558#false} is VALID [2018-11-23 11:52:01,986 INFO L256 TraceCheckUtils]: 42: Hoare triple {4558#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {4558#false} is VALID [2018-11-23 11:52:01,986 INFO L273 TraceCheckUtils]: 43: Hoare triple {4558#false} ~cond := #in~cond; {4558#false} is VALID [2018-11-23 11:52:01,987 INFO L273 TraceCheckUtils]: 44: Hoare triple {4558#false} assume 0 == ~cond; {4558#false} is VALID [2018-11-23 11:52:01,987 INFO L273 TraceCheckUtils]: 45: Hoare triple {4558#false} assume !false; {4558#false} is VALID [2018-11-23 11:52:01,988 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 1 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:02,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:02,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-23 11:52:02,009 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 46 [2018-11-23 11:52:02,009 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:02,009 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:52:02,101 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:02,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:52:02,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:52:02,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:52:02,103 INFO L87 Difference]: Start difference. First operand 81 states and 104 transitions. Second operand 14 states. [2018-11-23 11:52:02,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:02,436 INFO L93 Difference]: Finished difference Result 166 states and 218 transitions. [2018-11-23 11:52:02,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 11:52:02,437 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 46 [2018-11-23 11:52:02,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:02,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:52:02,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 93 transitions. [2018-11-23 11:52:02,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:52:02,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 93 transitions. [2018-11-23 11:52:02,440 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 93 transitions. [2018-11-23 11:52:02,955 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:02,956 INFO L225 Difference]: With dead ends: 166 [2018-11-23 11:52:02,957 INFO L226 Difference]: Without dead ends: 91 [2018-11-23 11:52:02,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:52:02,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-23 11:52:03,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2018-11-23 11:52:03,103 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:03,104 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand 87 states. [2018-11-23 11:52:03,104 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 87 states. [2018-11-23 11:52:03,104 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 87 states. [2018-11-23 11:52:03,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:03,108 INFO L93 Difference]: Finished difference Result 91 states and 118 transitions. [2018-11-23 11:52:03,108 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 118 transitions. [2018-11-23 11:52:03,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:03,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:03,109 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 91 states. [2018-11-23 11:52:03,109 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 91 states. [2018-11-23 11:52:03,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:03,111 INFO L93 Difference]: Finished difference Result 91 states and 118 transitions. [2018-11-23 11:52:03,111 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 118 transitions. [2018-11-23 11:52:03,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:03,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:03,112 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:03,112 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:03,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-23 11:52:03,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 112 transitions. [2018-11-23 11:52:03,115 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 112 transitions. Word has length 46 [2018-11-23 11:52:03,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:03,115 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 112 transitions. [2018-11-23 11:52:03,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:52:03,115 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 112 transitions. [2018-11-23 11:52:03,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 11:52:03,116 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:03,116 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:03,117 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:03,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:03,117 INFO L82 PathProgramCache]: Analyzing trace with hash -428770840, now seen corresponding path program 11 times [2018-11-23 11:52:03,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:03,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:03,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:03,118 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:03,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:03,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:04,135 INFO L256 TraceCheckUtils]: 0: Hoare triple {5236#true} call ULTIMATE.init(); {5236#true} is VALID [2018-11-23 11:52:04,136 INFO L273 TraceCheckUtils]: 1: Hoare triple {5236#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5236#true} is VALID [2018-11-23 11:52:04,136 INFO L273 TraceCheckUtils]: 2: Hoare triple {5236#true} assume true; {5236#true} is VALID [2018-11-23 11:52:04,137 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5236#true} {5236#true} #79#return; {5236#true} is VALID [2018-11-23 11:52:04,137 INFO L256 TraceCheckUtils]: 4: Hoare triple {5236#true} call #t~ret8 := main(); {5236#true} is VALID [2018-11-23 11:52:04,137 INFO L273 TraceCheckUtils]: 5: Hoare triple {5236#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {5236#true} is VALID [2018-11-23 11:52:04,139 INFO L273 TraceCheckUtils]: 6: Hoare triple {5236#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {5238#(= main_~i~0 1)} is VALID [2018-11-23 11:52:04,139 INFO L273 TraceCheckUtils]: 7: Hoare triple {5238#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {5238#(= main_~i~0 1)} is VALID [2018-11-23 11:52:04,140 INFO L273 TraceCheckUtils]: 8: Hoare triple {5238#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5238#(= main_~i~0 1)} is VALID [2018-11-23 11:52:04,140 INFO L273 TraceCheckUtils]: 9: Hoare triple {5238#(= main_~i~0 1)} ~i~0 := 1 + ~i~0; {5239#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:04,141 INFO L273 TraceCheckUtils]: 10: Hoare triple {5239#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {5239#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:04,141 INFO L273 TraceCheckUtils]: 11: Hoare triple {5239#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5239#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:04,142 INFO L273 TraceCheckUtils]: 12: Hoare triple {5239#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {5240#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:04,142 INFO L273 TraceCheckUtils]: 13: Hoare triple {5240#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {5240#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:04,143 INFO L273 TraceCheckUtils]: 14: Hoare triple {5240#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5240#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:04,143 INFO L273 TraceCheckUtils]: 15: Hoare triple {5240#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {5241#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:04,144 INFO L273 TraceCheckUtils]: 16: Hoare triple {5241#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {5241#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:04,145 INFO L273 TraceCheckUtils]: 17: Hoare triple {5241#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5241#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:04,146 INFO L273 TraceCheckUtils]: 18: Hoare triple {5241#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {5242#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:04,146 INFO L273 TraceCheckUtils]: 19: Hoare triple {5242#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {5242#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:04,147 INFO L273 TraceCheckUtils]: 20: Hoare triple {5242#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5242#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:04,148 INFO L273 TraceCheckUtils]: 21: Hoare triple {5242#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {5243#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:04,148 INFO L273 TraceCheckUtils]: 22: Hoare triple {5243#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {5243#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:04,149 INFO L273 TraceCheckUtils]: 23: Hoare triple {5243#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5243#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:04,150 INFO L273 TraceCheckUtils]: 24: Hoare triple {5243#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {5244#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:04,150 INFO L273 TraceCheckUtils]: 25: Hoare triple {5244#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {5244#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:04,151 INFO L273 TraceCheckUtils]: 26: Hoare triple {5244#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5244#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:04,152 INFO L273 TraceCheckUtils]: 27: Hoare triple {5244#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {5245#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:04,153 INFO L273 TraceCheckUtils]: 28: Hoare triple {5245#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {5245#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:04,153 INFO L273 TraceCheckUtils]: 29: Hoare triple {5245#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5245#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:04,154 INFO L273 TraceCheckUtils]: 30: Hoare triple {5245#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {5246#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:04,155 INFO L273 TraceCheckUtils]: 31: Hoare triple {5246#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {5246#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:04,155 INFO L273 TraceCheckUtils]: 32: Hoare triple {5246#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5246#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:04,156 INFO L273 TraceCheckUtils]: 33: Hoare triple {5246#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {5247#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:04,157 INFO L273 TraceCheckUtils]: 34: Hoare triple {5247#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {5247#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:04,158 INFO L273 TraceCheckUtils]: 35: Hoare triple {5247#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5247#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:04,158 INFO L273 TraceCheckUtils]: 36: Hoare triple {5247#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {5248#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:04,159 INFO L273 TraceCheckUtils]: 37: Hoare triple {5248#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {5248#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:04,160 INFO L273 TraceCheckUtils]: 38: Hoare triple {5248#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5248#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:04,161 INFO L273 TraceCheckUtils]: 39: Hoare triple {5248#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {5249#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:04,161 INFO L273 TraceCheckUtils]: 40: Hoare triple {5249#(<= main_~i~0 12)} assume !(~i~0 < 100000); {5237#false} is VALID [2018-11-23 11:52:04,162 INFO L273 TraceCheckUtils]: 41: Hoare triple {5237#false} assume !(0 != ~swapped~0); {5237#false} is VALID [2018-11-23 11:52:04,162 INFO L273 TraceCheckUtils]: 42: Hoare triple {5237#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {5237#false} is VALID [2018-11-23 11:52:04,162 INFO L273 TraceCheckUtils]: 43: Hoare triple {5237#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {5237#false} is VALID [2018-11-23 11:52:04,162 INFO L273 TraceCheckUtils]: 44: Hoare triple {5237#false} assume !!(~y~0 < 100000);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); {5237#false} is VALID [2018-11-23 11:52:04,163 INFO L256 TraceCheckUtils]: 45: Hoare triple {5237#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {5237#false} is VALID [2018-11-23 11:52:04,163 INFO L273 TraceCheckUtils]: 46: Hoare triple {5237#false} ~cond := #in~cond; {5237#false} is VALID [2018-11-23 11:52:04,163 INFO L273 TraceCheckUtils]: 47: Hoare triple {5237#false} assume 0 == ~cond; {5237#false} is VALID [2018-11-23 11:52:04,164 INFO L273 TraceCheckUtils]: 48: Hoare triple {5237#false} assume !false; {5237#false} is VALID [2018-11-23 11:52:04,166 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 1 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:04,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:04,167 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:52:04,175 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:52:04,226 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-23 11:52:04,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:04,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:04,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:04,461 INFO L256 TraceCheckUtils]: 0: Hoare triple {5236#true} call ULTIMATE.init(); {5236#true} is VALID [2018-11-23 11:52:04,461 INFO L273 TraceCheckUtils]: 1: Hoare triple {5236#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5236#true} is VALID [2018-11-23 11:52:04,462 INFO L273 TraceCheckUtils]: 2: Hoare triple {5236#true} assume true; {5236#true} is VALID [2018-11-23 11:52:04,462 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5236#true} {5236#true} #79#return; {5236#true} is VALID [2018-11-23 11:52:04,462 INFO L256 TraceCheckUtils]: 4: Hoare triple {5236#true} call #t~ret8 := main(); {5236#true} is VALID [2018-11-23 11:52:04,463 INFO L273 TraceCheckUtils]: 5: Hoare triple {5236#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {5236#true} is VALID [2018-11-23 11:52:04,463 INFO L273 TraceCheckUtils]: 6: Hoare triple {5236#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {5271#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:04,464 INFO L273 TraceCheckUtils]: 7: Hoare triple {5271#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {5271#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:04,464 INFO L273 TraceCheckUtils]: 8: Hoare triple {5271#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5271#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:04,465 INFO L273 TraceCheckUtils]: 9: Hoare triple {5271#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {5239#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:04,465 INFO L273 TraceCheckUtils]: 10: Hoare triple {5239#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {5239#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:04,466 INFO L273 TraceCheckUtils]: 11: Hoare triple {5239#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5239#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:04,466 INFO L273 TraceCheckUtils]: 12: Hoare triple {5239#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {5240#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:04,467 INFO L273 TraceCheckUtils]: 13: Hoare triple {5240#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {5240#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:04,467 INFO L273 TraceCheckUtils]: 14: Hoare triple {5240#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5240#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:04,468 INFO L273 TraceCheckUtils]: 15: Hoare triple {5240#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {5241#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:04,469 INFO L273 TraceCheckUtils]: 16: Hoare triple {5241#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {5241#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:04,469 INFO L273 TraceCheckUtils]: 17: Hoare triple {5241#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5241#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:04,470 INFO L273 TraceCheckUtils]: 18: Hoare triple {5241#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {5242#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:04,471 INFO L273 TraceCheckUtils]: 19: Hoare triple {5242#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {5242#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:04,472 INFO L273 TraceCheckUtils]: 20: Hoare triple {5242#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5242#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:04,472 INFO L273 TraceCheckUtils]: 21: Hoare triple {5242#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {5243#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:04,473 INFO L273 TraceCheckUtils]: 22: Hoare triple {5243#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {5243#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:04,474 INFO L273 TraceCheckUtils]: 23: Hoare triple {5243#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5243#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:04,474 INFO L273 TraceCheckUtils]: 24: Hoare triple {5243#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {5244#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:04,475 INFO L273 TraceCheckUtils]: 25: Hoare triple {5244#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {5244#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:04,476 INFO L273 TraceCheckUtils]: 26: Hoare triple {5244#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5244#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:04,477 INFO L273 TraceCheckUtils]: 27: Hoare triple {5244#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {5245#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:04,477 INFO L273 TraceCheckUtils]: 28: Hoare triple {5245#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {5245#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:04,478 INFO L273 TraceCheckUtils]: 29: Hoare triple {5245#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5245#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:04,479 INFO L273 TraceCheckUtils]: 30: Hoare triple {5245#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {5246#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:04,479 INFO L273 TraceCheckUtils]: 31: Hoare triple {5246#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {5246#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:04,480 INFO L273 TraceCheckUtils]: 32: Hoare triple {5246#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5246#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:04,481 INFO L273 TraceCheckUtils]: 33: Hoare triple {5246#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {5247#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:04,498 INFO L273 TraceCheckUtils]: 34: Hoare triple {5247#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {5247#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:04,507 INFO L273 TraceCheckUtils]: 35: Hoare triple {5247#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5247#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:04,521 INFO L273 TraceCheckUtils]: 36: Hoare triple {5247#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {5248#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:04,530 INFO L273 TraceCheckUtils]: 37: Hoare triple {5248#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {5248#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:04,543 INFO L273 TraceCheckUtils]: 38: Hoare triple {5248#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5248#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:04,552 INFO L273 TraceCheckUtils]: 39: Hoare triple {5248#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {5249#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:04,555 INFO L273 TraceCheckUtils]: 40: Hoare triple {5249#(<= main_~i~0 12)} assume !(~i~0 < 100000); {5237#false} is VALID [2018-11-23 11:52:04,556 INFO L273 TraceCheckUtils]: 41: Hoare triple {5237#false} assume !(0 != ~swapped~0); {5237#false} is VALID [2018-11-23 11:52:04,556 INFO L273 TraceCheckUtils]: 42: Hoare triple {5237#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {5237#false} is VALID [2018-11-23 11:52:04,556 INFO L273 TraceCheckUtils]: 43: Hoare triple {5237#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {5237#false} is VALID [2018-11-23 11:52:04,556 INFO L273 TraceCheckUtils]: 44: Hoare triple {5237#false} assume !!(~y~0 < 100000);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); {5237#false} is VALID [2018-11-23 11:52:04,556 INFO L256 TraceCheckUtils]: 45: Hoare triple {5237#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {5237#false} is VALID [2018-11-23 11:52:04,560 INFO L273 TraceCheckUtils]: 46: Hoare triple {5237#false} ~cond := #in~cond; {5237#false} is VALID [2018-11-23 11:52:04,560 INFO L273 TraceCheckUtils]: 47: Hoare triple {5237#false} assume 0 == ~cond; {5237#false} is VALID [2018-11-23 11:52:04,560 INFO L273 TraceCheckUtils]: 48: Hoare triple {5237#false} assume !false; {5237#false} is VALID [2018-11-23 11:52:04,564 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 1 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:04,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:04,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-23 11:52:04,592 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 49 [2018-11-23 11:52:04,592 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:04,593 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 11:52:04,667 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:04,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 11:52:04,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 11:52:04,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:52:04,669 INFO L87 Difference]: Start difference. First operand 87 states and 112 transitions. Second operand 15 states. [2018-11-23 11:52:04,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:04,955 INFO L93 Difference]: Finished difference Result 178 states and 234 transitions. [2018-11-23 11:52:04,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 11:52:04,955 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 49 [2018-11-23 11:52:04,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:04,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:52:04,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 97 transitions. [2018-11-23 11:52:04,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:52:04,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 97 transitions. [2018-11-23 11:52:04,958 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 97 transitions. [2018-11-23 11:52:05,052 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:05,054 INFO L225 Difference]: With dead ends: 178 [2018-11-23 11:52:05,054 INFO L226 Difference]: Without dead ends: 97 [2018-11-23 11:52:05,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:52:05,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-23 11:52:05,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2018-11-23 11:52:05,092 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:05,092 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand 93 states. [2018-11-23 11:52:05,092 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 93 states. [2018-11-23 11:52:05,092 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 93 states. [2018-11-23 11:52:05,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:05,095 INFO L93 Difference]: Finished difference Result 97 states and 126 transitions. [2018-11-23 11:52:05,095 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 126 transitions. [2018-11-23 11:52:05,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:05,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:05,095 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 97 states. [2018-11-23 11:52:05,095 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 97 states. [2018-11-23 11:52:05,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:05,097 INFO L93 Difference]: Finished difference Result 97 states and 126 transitions. [2018-11-23 11:52:05,097 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 126 transitions. [2018-11-23 11:52:05,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:05,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:05,098 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:05,098 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:05,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-23 11:52:05,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 120 transitions. [2018-11-23 11:52:05,100 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 120 transitions. Word has length 49 [2018-11-23 11:52:05,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:05,100 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 120 transitions. [2018-11-23 11:52:05,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 11:52:05,100 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 120 transitions. [2018-11-23 11:52:05,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 11:52:05,101 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:05,101 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:05,102 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:05,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:05,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1566696303, now seen corresponding path program 12 times [2018-11-23 11:52:05,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:05,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:05,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:05,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:05,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:05,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:05,376 INFO L256 TraceCheckUtils]: 0: Hoare triple {5961#true} call ULTIMATE.init(); {5961#true} is VALID [2018-11-23 11:52:05,377 INFO L273 TraceCheckUtils]: 1: Hoare triple {5961#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5961#true} is VALID [2018-11-23 11:52:05,377 INFO L273 TraceCheckUtils]: 2: Hoare triple {5961#true} assume true; {5961#true} is VALID [2018-11-23 11:52:05,377 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5961#true} {5961#true} #79#return; {5961#true} is VALID [2018-11-23 11:52:05,377 INFO L256 TraceCheckUtils]: 4: Hoare triple {5961#true} call #t~ret8 := main(); {5961#true} is VALID [2018-11-23 11:52:05,377 INFO L273 TraceCheckUtils]: 5: Hoare triple {5961#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {5961#true} is VALID [2018-11-23 11:52:05,378 INFO L273 TraceCheckUtils]: 6: Hoare triple {5961#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {5963#(= main_~i~0 1)} is VALID [2018-11-23 11:52:05,378 INFO L273 TraceCheckUtils]: 7: Hoare triple {5963#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {5963#(= main_~i~0 1)} is VALID [2018-11-23 11:52:05,378 INFO L273 TraceCheckUtils]: 8: Hoare triple {5963#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5963#(= main_~i~0 1)} is VALID [2018-11-23 11:52:05,379 INFO L273 TraceCheckUtils]: 9: Hoare triple {5963#(= main_~i~0 1)} ~i~0 := 1 + ~i~0; {5964#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:05,379 INFO L273 TraceCheckUtils]: 10: Hoare triple {5964#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {5964#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:05,380 INFO L273 TraceCheckUtils]: 11: Hoare triple {5964#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5964#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:05,381 INFO L273 TraceCheckUtils]: 12: Hoare triple {5964#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {5965#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:05,381 INFO L273 TraceCheckUtils]: 13: Hoare triple {5965#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {5965#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:05,382 INFO L273 TraceCheckUtils]: 14: Hoare triple {5965#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5965#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:05,383 INFO L273 TraceCheckUtils]: 15: Hoare triple {5965#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {5966#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:05,383 INFO L273 TraceCheckUtils]: 16: Hoare triple {5966#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {5966#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:05,384 INFO L273 TraceCheckUtils]: 17: Hoare triple {5966#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5966#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:05,384 INFO L273 TraceCheckUtils]: 18: Hoare triple {5966#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {5967#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:05,385 INFO L273 TraceCheckUtils]: 19: Hoare triple {5967#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {5967#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:05,385 INFO L273 TraceCheckUtils]: 20: Hoare triple {5967#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5967#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:05,386 INFO L273 TraceCheckUtils]: 21: Hoare triple {5967#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {5968#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:05,387 INFO L273 TraceCheckUtils]: 22: Hoare triple {5968#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {5968#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:05,387 INFO L273 TraceCheckUtils]: 23: Hoare triple {5968#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5968#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:05,388 INFO L273 TraceCheckUtils]: 24: Hoare triple {5968#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {5969#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:05,389 INFO L273 TraceCheckUtils]: 25: Hoare triple {5969#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {5969#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:05,389 INFO L273 TraceCheckUtils]: 26: Hoare triple {5969#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5969#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:05,390 INFO L273 TraceCheckUtils]: 27: Hoare triple {5969#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {5970#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:05,390 INFO L273 TraceCheckUtils]: 28: Hoare triple {5970#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {5970#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:05,391 INFO L273 TraceCheckUtils]: 29: Hoare triple {5970#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5970#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:05,392 INFO L273 TraceCheckUtils]: 30: Hoare triple {5970#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {5971#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:05,392 INFO L273 TraceCheckUtils]: 31: Hoare triple {5971#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {5971#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:05,393 INFO L273 TraceCheckUtils]: 32: Hoare triple {5971#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5971#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:05,393 INFO L273 TraceCheckUtils]: 33: Hoare triple {5971#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {5972#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:05,394 INFO L273 TraceCheckUtils]: 34: Hoare triple {5972#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {5972#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:05,395 INFO L273 TraceCheckUtils]: 35: Hoare triple {5972#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5972#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:05,395 INFO L273 TraceCheckUtils]: 36: Hoare triple {5972#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {5973#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:05,396 INFO L273 TraceCheckUtils]: 37: Hoare triple {5973#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {5973#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:05,396 INFO L273 TraceCheckUtils]: 38: Hoare triple {5973#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5973#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:05,397 INFO L273 TraceCheckUtils]: 39: Hoare triple {5973#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {5974#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:05,398 INFO L273 TraceCheckUtils]: 40: Hoare triple {5974#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {5974#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:05,398 INFO L273 TraceCheckUtils]: 41: Hoare triple {5974#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5974#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:05,399 INFO L273 TraceCheckUtils]: 42: Hoare triple {5974#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {5975#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:05,400 INFO L273 TraceCheckUtils]: 43: Hoare triple {5975#(<= main_~i~0 13)} assume !(~i~0 < 100000); {5962#false} is VALID [2018-11-23 11:52:05,400 INFO L273 TraceCheckUtils]: 44: Hoare triple {5962#false} assume !(0 != ~swapped~0); {5962#false} is VALID [2018-11-23 11:52:05,400 INFO L273 TraceCheckUtils]: 45: Hoare triple {5962#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {5962#false} is VALID [2018-11-23 11:52:05,400 INFO L273 TraceCheckUtils]: 46: Hoare triple {5962#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {5962#false} is VALID [2018-11-23 11:52:05,401 INFO L273 TraceCheckUtils]: 47: Hoare triple {5962#false} assume !!(~y~0 < 100000);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); {5962#false} is VALID [2018-11-23 11:52:05,401 INFO L256 TraceCheckUtils]: 48: Hoare triple {5962#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {5962#false} is VALID [2018-11-23 11:52:05,401 INFO L273 TraceCheckUtils]: 49: Hoare triple {5962#false} ~cond := #in~cond; {5962#false} is VALID [2018-11-23 11:52:05,401 INFO L273 TraceCheckUtils]: 50: Hoare triple {5962#false} assume 0 == ~cond; {5962#false} is VALID [2018-11-23 11:52:05,401 INFO L273 TraceCheckUtils]: 51: Hoare triple {5962#false} assume !false; {5962#false} is VALID [2018-11-23 11:52:05,404 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 1 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:05,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:05,404 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:52:05,413 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:52:05,451 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2018-11-23 11:52:05,451 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:05,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:05,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:05,587 INFO L256 TraceCheckUtils]: 0: Hoare triple {5961#true} call ULTIMATE.init(); {5961#true} is VALID [2018-11-23 11:52:05,588 INFO L273 TraceCheckUtils]: 1: Hoare triple {5961#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5961#true} is VALID [2018-11-23 11:52:05,588 INFO L273 TraceCheckUtils]: 2: Hoare triple {5961#true} assume true; {5961#true} is VALID [2018-11-23 11:52:05,588 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5961#true} {5961#true} #79#return; {5961#true} is VALID [2018-11-23 11:52:05,588 INFO L256 TraceCheckUtils]: 4: Hoare triple {5961#true} call #t~ret8 := main(); {5961#true} is VALID [2018-11-23 11:52:05,588 INFO L273 TraceCheckUtils]: 5: Hoare triple {5961#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {5961#true} is VALID [2018-11-23 11:52:05,589 INFO L273 TraceCheckUtils]: 6: Hoare triple {5961#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {5997#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:05,590 INFO L273 TraceCheckUtils]: 7: Hoare triple {5997#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {5997#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:05,590 INFO L273 TraceCheckUtils]: 8: Hoare triple {5997#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5997#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:05,591 INFO L273 TraceCheckUtils]: 9: Hoare triple {5997#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {5964#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:05,591 INFO L273 TraceCheckUtils]: 10: Hoare triple {5964#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {5964#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:05,592 INFO L273 TraceCheckUtils]: 11: Hoare triple {5964#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5964#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:05,593 INFO L273 TraceCheckUtils]: 12: Hoare triple {5964#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {5965#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:05,593 INFO L273 TraceCheckUtils]: 13: Hoare triple {5965#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {5965#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:05,594 INFO L273 TraceCheckUtils]: 14: Hoare triple {5965#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5965#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:05,594 INFO L273 TraceCheckUtils]: 15: Hoare triple {5965#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {5966#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:05,595 INFO L273 TraceCheckUtils]: 16: Hoare triple {5966#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {5966#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:05,595 INFO L273 TraceCheckUtils]: 17: Hoare triple {5966#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5966#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:05,596 INFO L273 TraceCheckUtils]: 18: Hoare triple {5966#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {5967#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:05,597 INFO L273 TraceCheckUtils]: 19: Hoare triple {5967#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {5967#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:05,597 INFO L273 TraceCheckUtils]: 20: Hoare triple {5967#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5967#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:05,598 INFO L273 TraceCheckUtils]: 21: Hoare triple {5967#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {5968#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:05,598 INFO L273 TraceCheckUtils]: 22: Hoare triple {5968#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {5968#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:05,599 INFO L273 TraceCheckUtils]: 23: Hoare triple {5968#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5968#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:05,599 INFO L273 TraceCheckUtils]: 24: Hoare triple {5968#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {5969#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:05,600 INFO L273 TraceCheckUtils]: 25: Hoare triple {5969#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {5969#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:05,600 INFO L273 TraceCheckUtils]: 26: Hoare triple {5969#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5969#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:05,601 INFO L273 TraceCheckUtils]: 27: Hoare triple {5969#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {5970#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:05,602 INFO L273 TraceCheckUtils]: 28: Hoare triple {5970#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {5970#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:05,602 INFO L273 TraceCheckUtils]: 29: Hoare triple {5970#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5970#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:05,603 INFO L273 TraceCheckUtils]: 30: Hoare triple {5970#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {5971#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:05,603 INFO L273 TraceCheckUtils]: 31: Hoare triple {5971#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {5971#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:05,604 INFO L273 TraceCheckUtils]: 32: Hoare triple {5971#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5971#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:05,605 INFO L273 TraceCheckUtils]: 33: Hoare triple {5971#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {5972#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:05,605 INFO L273 TraceCheckUtils]: 34: Hoare triple {5972#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {5972#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:05,606 INFO L273 TraceCheckUtils]: 35: Hoare triple {5972#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5972#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:05,606 INFO L273 TraceCheckUtils]: 36: Hoare triple {5972#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {5973#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:05,607 INFO L273 TraceCheckUtils]: 37: Hoare triple {5973#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {5973#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:05,607 INFO L273 TraceCheckUtils]: 38: Hoare triple {5973#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5973#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:05,608 INFO L273 TraceCheckUtils]: 39: Hoare triple {5973#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {5974#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:05,609 INFO L273 TraceCheckUtils]: 40: Hoare triple {5974#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {5974#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:05,609 INFO L273 TraceCheckUtils]: 41: Hoare triple {5974#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5974#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:05,610 INFO L273 TraceCheckUtils]: 42: Hoare triple {5974#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {5975#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:05,611 INFO L273 TraceCheckUtils]: 43: Hoare triple {5975#(<= main_~i~0 13)} assume !(~i~0 < 100000); {5962#false} is VALID [2018-11-23 11:52:05,611 INFO L273 TraceCheckUtils]: 44: Hoare triple {5962#false} assume !(0 != ~swapped~0); {5962#false} is VALID [2018-11-23 11:52:05,611 INFO L273 TraceCheckUtils]: 45: Hoare triple {5962#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {5962#false} is VALID [2018-11-23 11:52:05,611 INFO L273 TraceCheckUtils]: 46: Hoare triple {5962#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {5962#false} is VALID [2018-11-23 11:52:05,612 INFO L273 TraceCheckUtils]: 47: Hoare triple {5962#false} assume !!(~y~0 < 100000);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); {5962#false} is VALID [2018-11-23 11:52:05,612 INFO L256 TraceCheckUtils]: 48: Hoare triple {5962#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {5962#false} is VALID [2018-11-23 11:52:05,612 INFO L273 TraceCheckUtils]: 49: Hoare triple {5962#false} ~cond := #in~cond; {5962#false} is VALID [2018-11-23 11:52:05,612 INFO L273 TraceCheckUtils]: 50: Hoare triple {5962#false} assume 0 == ~cond; {5962#false} is VALID [2018-11-23 11:52:05,612 INFO L273 TraceCheckUtils]: 51: Hoare triple {5962#false} assume !false; {5962#false} is VALID [2018-11-23 11:52:05,615 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 1 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:05,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:05,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-23 11:52:05,634 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 52 [2018-11-23 11:52:05,634 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:05,634 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 11:52:05,686 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:05,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 11:52:05,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 11:52:05,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:52:05,687 INFO L87 Difference]: Start difference. First operand 93 states and 120 transitions. Second operand 16 states. [2018-11-23 11:52:06,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:06,322 INFO L93 Difference]: Finished difference Result 190 states and 250 transitions. [2018-11-23 11:52:06,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 11:52:06,322 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 52 [2018-11-23 11:52:06,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:06,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:52:06,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 101 transitions. [2018-11-23 11:52:06,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:52:06,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 101 transitions. [2018-11-23 11:52:06,326 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 101 transitions. [2018-11-23 11:52:06,438 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:06,440 INFO L225 Difference]: With dead ends: 190 [2018-11-23 11:52:06,440 INFO L226 Difference]: Without dead ends: 103 [2018-11-23 11:52:06,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:52:06,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-23 11:52:06,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2018-11-23 11:52:06,478 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:06,478 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand 99 states. [2018-11-23 11:52:06,478 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 99 states. [2018-11-23 11:52:06,479 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 99 states. [2018-11-23 11:52:06,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:06,482 INFO L93 Difference]: Finished difference Result 103 states and 134 transitions. [2018-11-23 11:52:06,482 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 134 transitions. [2018-11-23 11:52:06,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:06,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:06,483 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 103 states. [2018-11-23 11:52:06,483 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 103 states. [2018-11-23 11:52:06,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:06,485 INFO L93 Difference]: Finished difference Result 103 states and 134 transitions. [2018-11-23 11:52:06,485 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 134 transitions. [2018-11-23 11:52:06,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:06,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:06,486 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:06,486 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:06,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-23 11:52:06,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 128 transitions. [2018-11-23 11:52:06,488 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 128 transitions. Word has length 52 [2018-11-23 11:52:06,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:06,489 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 128 transitions. [2018-11-23 11:52:06,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 11:52:06,489 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 128 transitions. [2018-11-23 11:52:06,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 11:52:06,490 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:06,490 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:06,490 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:06,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:06,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1327297208, now seen corresponding path program 13 times [2018-11-23 11:52:06,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:06,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:06,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:06,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:06,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:06,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:07,245 INFO L256 TraceCheckUtils]: 0: Hoare triple {6732#true} call ULTIMATE.init(); {6732#true} is VALID [2018-11-23 11:52:07,245 INFO L273 TraceCheckUtils]: 1: Hoare triple {6732#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6732#true} is VALID [2018-11-23 11:52:07,245 INFO L273 TraceCheckUtils]: 2: Hoare triple {6732#true} assume true; {6732#true} is VALID [2018-11-23 11:52:07,245 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6732#true} {6732#true} #79#return; {6732#true} is VALID [2018-11-23 11:52:07,245 INFO L256 TraceCheckUtils]: 4: Hoare triple {6732#true} call #t~ret8 := main(); {6732#true} is VALID [2018-11-23 11:52:07,246 INFO L273 TraceCheckUtils]: 5: Hoare triple {6732#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {6732#true} is VALID [2018-11-23 11:52:07,246 INFO L273 TraceCheckUtils]: 6: Hoare triple {6732#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {6734#(= main_~i~0 1)} is VALID [2018-11-23 11:52:07,246 INFO L273 TraceCheckUtils]: 7: Hoare triple {6734#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {6734#(= main_~i~0 1)} is VALID [2018-11-23 11:52:07,247 INFO L273 TraceCheckUtils]: 8: Hoare triple {6734#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6734#(= main_~i~0 1)} is VALID [2018-11-23 11:52:07,248 INFO L273 TraceCheckUtils]: 9: Hoare triple {6734#(= main_~i~0 1)} ~i~0 := 1 + ~i~0; {6735#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:07,248 INFO L273 TraceCheckUtils]: 10: Hoare triple {6735#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {6735#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:07,248 INFO L273 TraceCheckUtils]: 11: Hoare triple {6735#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6735#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:07,249 INFO L273 TraceCheckUtils]: 12: Hoare triple {6735#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {6736#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:07,249 INFO L273 TraceCheckUtils]: 13: Hoare triple {6736#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {6736#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:07,249 INFO L273 TraceCheckUtils]: 14: Hoare triple {6736#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6736#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:07,250 INFO L273 TraceCheckUtils]: 15: Hoare triple {6736#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {6737#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:07,251 INFO L273 TraceCheckUtils]: 16: Hoare triple {6737#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {6737#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:07,251 INFO L273 TraceCheckUtils]: 17: Hoare triple {6737#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6737#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:07,252 INFO L273 TraceCheckUtils]: 18: Hoare triple {6737#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {6738#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:07,252 INFO L273 TraceCheckUtils]: 19: Hoare triple {6738#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {6738#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:07,253 INFO L273 TraceCheckUtils]: 20: Hoare triple {6738#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6738#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:07,253 INFO L273 TraceCheckUtils]: 21: Hoare triple {6738#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {6739#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:07,254 INFO L273 TraceCheckUtils]: 22: Hoare triple {6739#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {6739#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:07,254 INFO L273 TraceCheckUtils]: 23: Hoare triple {6739#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6739#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:07,255 INFO L273 TraceCheckUtils]: 24: Hoare triple {6739#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {6740#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:07,256 INFO L273 TraceCheckUtils]: 25: Hoare triple {6740#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {6740#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:07,256 INFO L273 TraceCheckUtils]: 26: Hoare triple {6740#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6740#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:07,257 INFO L273 TraceCheckUtils]: 27: Hoare triple {6740#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {6741#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:07,257 INFO L273 TraceCheckUtils]: 28: Hoare triple {6741#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {6741#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:07,258 INFO L273 TraceCheckUtils]: 29: Hoare triple {6741#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6741#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:07,259 INFO L273 TraceCheckUtils]: 30: Hoare triple {6741#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {6742#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:07,259 INFO L273 TraceCheckUtils]: 31: Hoare triple {6742#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {6742#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:07,260 INFO L273 TraceCheckUtils]: 32: Hoare triple {6742#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6742#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:07,260 INFO L273 TraceCheckUtils]: 33: Hoare triple {6742#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {6743#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:07,261 INFO L273 TraceCheckUtils]: 34: Hoare triple {6743#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {6743#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:07,261 INFO L273 TraceCheckUtils]: 35: Hoare triple {6743#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6743#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:07,262 INFO L273 TraceCheckUtils]: 36: Hoare triple {6743#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {6744#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:07,262 INFO L273 TraceCheckUtils]: 37: Hoare triple {6744#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {6744#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:07,263 INFO L273 TraceCheckUtils]: 38: Hoare triple {6744#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6744#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:07,264 INFO L273 TraceCheckUtils]: 39: Hoare triple {6744#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {6745#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:07,264 INFO L273 TraceCheckUtils]: 40: Hoare triple {6745#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {6745#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:07,265 INFO L273 TraceCheckUtils]: 41: Hoare triple {6745#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6745#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:07,265 INFO L273 TraceCheckUtils]: 42: Hoare triple {6745#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {6746#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:07,266 INFO L273 TraceCheckUtils]: 43: Hoare triple {6746#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {6746#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:07,266 INFO L273 TraceCheckUtils]: 44: Hoare triple {6746#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6746#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:07,267 INFO L273 TraceCheckUtils]: 45: Hoare triple {6746#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {6747#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:07,268 INFO L273 TraceCheckUtils]: 46: Hoare triple {6747#(<= main_~i~0 14)} assume !(~i~0 < 100000); {6733#false} is VALID [2018-11-23 11:52:07,268 INFO L273 TraceCheckUtils]: 47: Hoare triple {6733#false} assume !(0 != ~swapped~0); {6733#false} is VALID [2018-11-23 11:52:07,268 INFO L273 TraceCheckUtils]: 48: Hoare triple {6733#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {6733#false} is VALID [2018-11-23 11:52:07,269 INFO L273 TraceCheckUtils]: 49: Hoare triple {6733#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {6733#false} is VALID [2018-11-23 11:52:07,269 INFO L273 TraceCheckUtils]: 50: Hoare triple {6733#false} assume !!(~y~0 < 100000);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); {6733#false} is VALID [2018-11-23 11:52:07,269 INFO L256 TraceCheckUtils]: 51: Hoare triple {6733#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {6733#false} is VALID [2018-11-23 11:52:07,269 INFO L273 TraceCheckUtils]: 52: Hoare triple {6733#false} ~cond := #in~cond; {6733#false} is VALID [2018-11-23 11:52:07,270 INFO L273 TraceCheckUtils]: 53: Hoare triple {6733#false} assume 0 == ~cond; {6733#false} is VALID [2018-11-23 11:52:07,270 INFO L273 TraceCheckUtils]: 54: Hoare triple {6733#false} assume !false; {6733#false} is VALID [2018-11-23 11:52:07,272 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 1 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:07,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:07,272 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:52:07,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:52:07,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:07,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:07,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:07,581 INFO L256 TraceCheckUtils]: 0: Hoare triple {6732#true} call ULTIMATE.init(); {6732#true} is VALID [2018-11-23 11:52:07,582 INFO L273 TraceCheckUtils]: 1: Hoare triple {6732#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6732#true} is VALID [2018-11-23 11:52:07,582 INFO L273 TraceCheckUtils]: 2: Hoare triple {6732#true} assume true; {6732#true} is VALID [2018-11-23 11:52:07,582 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6732#true} {6732#true} #79#return; {6732#true} is VALID [2018-11-23 11:52:07,582 INFO L256 TraceCheckUtils]: 4: Hoare triple {6732#true} call #t~ret8 := main(); {6732#true} is VALID [2018-11-23 11:52:07,582 INFO L273 TraceCheckUtils]: 5: Hoare triple {6732#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {6732#true} is VALID [2018-11-23 11:52:07,583 INFO L273 TraceCheckUtils]: 6: Hoare triple {6732#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {6769#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:07,584 INFO L273 TraceCheckUtils]: 7: Hoare triple {6769#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {6769#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:07,584 INFO L273 TraceCheckUtils]: 8: Hoare triple {6769#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6769#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:07,584 INFO L273 TraceCheckUtils]: 9: Hoare triple {6769#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {6735#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:07,585 INFO L273 TraceCheckUtils]: 10: Hoare triple {6735#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {6735#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:07,585 INFO L273 TraceCheckUtils]: 11: Hoare triple {6735#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6735#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:07,586 INFO L273 TraceCheckUtils]: 12: Hoare triple {6735#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {6736#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:07,586 INFO L273 TraceCheckUtils]: 13: Hoare triple {6736#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {6736#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:07,586 INFO L273 TraceCheckUtils]: 14: Hoare triple {6736#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6736#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:07,587 INFO L273 TraceCheckUtils]: 15: Hoare triple {6736#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {6737#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:07,588 INFO L273 TraceCheckUtils]: 16: Hoare triple {6737#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {6737#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:07,588 INFO L273 TraceCheckUtils]: 17: Hoare triple {6737#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6737#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:07,589 INFO L273 TraceCheckUtils]: 18: Hoare triple {6737#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {6738#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:07,589 INFO L273 TraceCheckUtils]: 19: Hoare triple {6738#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {6738#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:07,590 INFO L273 TraceCheckUtils]: 20: Hoare triple {6738#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6738#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:07,591 INFO L273 TraceCheckUtils]: 21: Hoare triple {6738#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {6739#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:07,591 INFO L273 TraceCheckUtils]: 22: Hoare triple {6739#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {6739#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:07,592 INFO L273 TraceCheckUtils]: 23: Hoare triple {6739#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6739#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:07,592 INFO L273 TraceCheckUtils]: 24: Hoare triple {6739#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {6740#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:07,593 INFO L273 TraceCheckUtils]: 25: Hoare triple {6740#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {6740#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:07,593 INFO L273 TraceCheckUtils]: 26: Hoare triple {6740#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6740#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:07,594 INFO L273 TraceCheckUtils]: 27: Hoare triple {6740#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {6741#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:07,595 INFO L273 TraceCheckUtils]: 28: Hoare triple {6741#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {6741#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:07,595 INFO L273 TraceCheckUtils]: 29: Hoare triple {6741#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6741#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:07,596 INFO L273 TraceCheckUtils]: 30: Hoare triple {6741#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {6742#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:07,596 INFO L273 TraceCheckUtils]: 31: Hoare triple {6742#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {6742#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:07,597 INFO L273 TraceCheckUtils]: 32: Hoare triple {6742#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6742#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:07,597 INFO L273 TraceCheckUtils]: 33: Hoare triple {6742#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {6743#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:07,598 INFO L273 TraceCheckUtils]: 34: Hoare triple {6743#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {6743#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:07,598 INFO L273 TraceCheckUtils]: 35: Hoare triple {6743#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6743#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:07,599 INFO L273 TraceCheckUtils]: 36: Hoare triple {6743#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {6744#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:07,600 INFO L273 TraceCheckUtils]: 37: Hoare triple {6744#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {6744#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:07,600 INFO L273 TraceCheckUtils]: 38: Hoare triple {6744#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6744#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:07,601 INFO L273 TraceCheckUtils]: 39: Hoare triple {6744#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {6745#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:07,601 INFO L273 TraceCheckUtils]: 40: Hoare triple {6745#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {6745#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:07,602 INFO L273 TraceCheckUtils]: 41: Hoare triple {6745#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6745#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:07,603 INFO L273 TraceCheckUtils]: 42: Hoare triple {6745#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {6746#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:07,603 INFO L273 TraceCheckUtils]: 43: Hoare triple {6746#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {6746#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:07,604 INFO L273 TraceCheckUtils]: 44: Hoare triple {6746#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6746#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:07,604 INFO L273 TraceCheckUtils]: 45: Hoare triple {6746#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {6747#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:07,605 INFO L273 TraceCheckUtils]: 46: Hoare triple {6747#(<= main_~i~0 14)} assume !(~i~0 < 100000); {6733#false} is VALID [2018-11-23 11:52:07,605 INFO L273 TraceCheckUtils]: 47: Hoare triple {6733#false} assume !(0 != ~swapped~0); {6733#false} is VALID [2018-11-23 11:52:07,605 INFO L273 TraceCheckUtils]: 48: Hoare triple {6733#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {6733#false} is VALID [2018-11-23 11:52:07,606 INFO L273 TraceCheckUtils]: 49: Hoare triple {6733#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {6733#false} is VALID [2018-11-23 11:52:07,606 INFO L273 TraceCheckUtils]: 50: Hoare triple {6733#false} assume !!(~y~0 < 100000);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); {6733#false} is VALID [2018-11-23 11:52:07,606 INFO L256 TraceCheckUtils]: 51: Hoare triple {6733#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {6733#false} is VALID [2018-11-23 11:52:07,606 INFO L273 TraceCheckUtils]: 52: Hoare triple {6733#false} ~cond := #in~cond; {6733#false} is VALID [2018-11-23 11:52:07,606 INFO L273 TraceCheckUtils]: 53: Hoare triple {6733#false} assume 0 == ~cond; {6733#false} is VALID [2018-11-23 11:52:07,607 INFO L273 TraceCheckUtils]: 54: Hoare triple {6733#false} assume !false; {6733#false} is VALID [2018-11-23 11:52:07,609 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 1 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:07,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:07,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 11:52:07,628 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 55 [2018-11-23 11:52:07,629 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:07,629 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 11:52:07,681 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:07,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 11:52:07,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 11:52:07,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:52:07,682 INFO L87 Difference]: Start difference. First operand 99 states and 128 transitions. Second operand 17 states. [2018-11-23 11:52:08,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:08,171 INFO L93 Difference]: Finished difference Result 202 states and 266 transitions. [2018-11-23 11:52:08,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 11:52:08,171 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 55 [2018-11-23 11:52:08,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:08,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:52:08,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 105 transitions. [2018-11-23 11:52:08,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:52:08,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 105 transitions. [2018-11-23 11:52:08,174 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 105 transitions. [2018-11-23 11:52:08,317 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:08,319 INFO L225 Difference]: With dead ends: 202 [2018-11-23 11:52:08,319 INFO L226 Difference]: Without dead ends: 109 [2018-11-23 11:52:08,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:52:08,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-23 11:52:08,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2018-11-23 11:52:08,389 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:08,389 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand 105 states. [2018-11-23 11:52:08,389 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 105 states. [2018-11-23 11:52:08,389 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 105 states. [2018-11-23 11:52:08,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:08,391 INFO L93 Difference]: Finished difference Result 109 states and 142 transitions. [2018-11-23 11:52:08,392 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 142 transitions. [2018-11-23 11:52:08,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:08,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:08,392 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 109 states. [2018-11-23 11:52:08,392 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 109 states. [2018-11-23 11:52:08,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:08,395 INFO L93 Difference]: Finished difference Result 109 states and 142 transitions. [2018-11-23 11:52:08,395 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 142 transitions. [2018-11-23 11:52:08,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:08,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:08,395 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:08,395 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:08,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-23 11:52:08,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 136 transitions. [2018-11-23 11:52:08,397 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 136 transitions. Word has length 55 [2018-11-23 11:52:08,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:08,398 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 136 transitions. [2018-11-23 11:52:08,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 11:52:08,398 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 136 transitions. [2018-11-23 11:52:08,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-23 11:52:08,399 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:08,399 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:08,399 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:08,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:08,399 INFO L82 PathProgramCache]: Analyzing trace with hash 965430577, now seen corresponding path program 14 times [2018-11-23 11:52:08,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:08,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:08,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:08,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:52:08,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:08,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:08,633 INFO L256 TraceCheckUtils]: 0: Hoare triple {7549#true} call ULTIMATE.init(); {7549#true} is VALID [2018-11-23 11:52:08,633 INFO L273 TraceCheckUtils]: 1: Hoare triple {7549#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7549#true} is VALID [2018-11-23 11:52:08,633 INFO L273 TraceCheckUtils]: 2: Hoare triple {7549#true} assume true; {7549#true} is VALID [2018-11-23 11:52:08,634 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7549#true} {7549#true} #79#return; {7549#true} is VALID [2018-11-23 11:52:08,634 INFO L256 TraceCheckUtils]: 4: Hoare triple {7549#true} call #t~ret8 := main(); {7549#true} is VALID [2018-11-23 11:52:08,634 INFO L273 TraceCheckUtils]: 5: Hoare triple {7549#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {7549#true} is VALID [2018-11-23 11:52:08,635 INFO L273 TraceCheckUtils]: 6: Hoare triple {7549#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {7551#(= main_~i~0 1)} is VALID [2018-11-23 11:52:08,635 INFO L273 TraceCheckUtils]: 7: Hoare triple {7551#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {7551#(= main_~i~0 1)} is VALID [2018-11-23 11:52:08,636 INFO L273 TraceCheckUtils]: 8: Hoare triple {7551#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7551#(= main_~i~0 1)} is VALID [2018-11-23 11:52:08,636 INFO L273 TraceCheckUtils]: 9: Hoare triple {7551#(= main_~i~0 1)} ~i~0 := 1 + ~i~0; {7552#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:08,637 INFO L273 TraceCheckUtils]: 10: Hoare triple {7552#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {7552#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:08,637 INFO L273 TraceCheckUtils]: 11: Hoare triple {7552#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7552#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:08,638 INFO L273 TraceCheckUtils]: 12: Hoare triple {7552#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {7553#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:08,638 INFO L273 TraceCheckUtils]: 13: Hoare triple {7553#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {7553#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:08,638 INFO L273 TraceCheckUtils]: 14: Hoare triple {7553#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7553#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:08,639 INFO L273 TraceCheckUtils]: 15: Hoare triple {7553#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {7554#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:08,639 INFO L273 TraceCheckUtils]: 16: Hoare triple {7554#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {7554#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:08,640 INFO L273 TraceCheckUtils]: 17: Hoare triple {7554#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7554#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:08,641 INFO L273 TraceCheckUtils]: 18: Hoare triple {7554#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {7555#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:08,641 INFO L273 TraceCheckUtils]: 19: Hoare triple {7555#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {7555#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:08,642 INFO L273 TraceCheckUtils]: 20: Hoare triple {7555#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7555#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:08,642 INFO L273 TraceCheckUtils]: 21: Hoare triple {7555#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {7556#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:08,643 INFO L273 TraceCheckUtils]: 22: Hoare triple {7556#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {7556#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:08,644 INFO L273 TraceCheckUtils]: 23: Hoare triple {7556#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7556#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:08,644 INFO L273 TraceCheckUtils]: 24: Hoare triple {7556#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {7557#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:08,645 INFO L273 TraceCheckUtils]: 25: Hoare triple {7557#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {7557#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:08,645 INFO L273 TraceCheckUtils]: 26: Hoare triple {7557#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7557#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:08,646 INFO L273 TraceCheckUtils]: 27: Hoare triple {7557#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {7558#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:08,647 INFO L273 TraceCheckUtils]: 28: Hoare triple {7558#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {7558#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:08,647 INFO L273 TraceCheckUtils]: 29: Hoare triple {7558#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7558#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:08,648 INFO L273 TraceCheckUtils]: 30: Hoare triple {7558#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {7559#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:08,649 INFO L273 TraceCheckUtils]: 31: Hoare triple {7559#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {7559#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:08,649 INFO L273 TraceCheckUtils]: 32: Hoare triple {7559#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7559#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:08,650 INFO L273 TraceCheckUtils]: 33: Hoare triple {7559#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {7560#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:08,650 INFO L273 TraceCheckUtils]: 34: Hoare triple {7560#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {7560#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:08,651 INFO L273 TraceCheckUtils]: 35: Hoare triple {7560#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7560#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:08,652 INFO L273 TraceCheckUtils]: 36: Hoare triple {7560#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {7561#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:08,652 INFO L273 TraceCheckUtils]: 37: Hoare triple {7561#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {7561#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:08,653 INFO L273 TraceCheckUtils]: 38: Hoare triple {7561#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7561#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:08,653 INFO L273 TraceCheckUtils]: 39: Hoare triple {7561#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {7562#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:08,654 INFO L273 TraceCheckUtils]: 40: Hoare triple {7562#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {7562#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:08,655 INFO L273 TraceCheckUtils]: 41: Hoare triple {7562#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7562#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:08,655 INFO L273 TraceCheckUtils]: 42: Hoare triple {7562#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {7563#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:08,656 INFO L273 TraceCheckUtils]: 43: Hoare triple {7563#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {7563#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:08,656 INFO L273 TraceCheckUtils]: 44: Hoare triple {7563#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7563#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:08,657 INFO L273 TraceCheckUtils]: 45: Hoare triple {7563#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {7564#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:08,658 INFO L273 TraceCheckUtils]: 46: Hoare triple {7564#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {7564#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:08,658 INFO L273 TraceCheckUtils]: 47: Hoare triple {7564#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7564#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:08,659 INFO L273 TraceCheckUtils]: 48: Hoare triple {7564#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {7565#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:08,660 INFO L273 TraceCheckUtils]: 49: Hoare triple {7565#(<= main_~i~0 15)} assume !(~i~0 < 100000); {7550#false} is VALID [2018-11-23 11:52:08,660 INFO L273 TraceCheckUtils]: 50: Hoare triple {7550#false} assume !(0 != ~swapped~0); {7550#false} is VALID [2018-11-23 11:52:08,660 INFO L273 TraceCheckUtils]: 51: Hoare triple {7550#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {7550#false} is VALID [2018-11-23 11:52:08,660 INFO L273 TraceCheckUtils]: 52: Hoare triple {7550#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {7550#false} is VALID [2018-11-23 11:52:08,661 INFO L273 TraceCheckUtils]: 53: Hoare triple {7550#false} assume !!(~y~0 < 100000);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); {7550#false} is VALID [2018-11-23 11:52:08,661 INFO L256 TraceCheckUtils]: 54: Hoare triple {7550#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {7550#false} is VALID [2018-11-23 11:52:08,661 INFO L273 TraceCheckUtils]: 55: Hoare triple {7550#false} ~cond := #in~cond; {7550#false} is VALID [2018-11-23 11:52:08,661 INFO L273 TraceCheckUtils]: 56: Hoare triple {7550#false} assume 0 == ~cond; {7550#false} is VALID [2018-11-23 11:52:08,661 INFO L273 TraceCheckUtils]: 57: Hoare triple {7550#false} assume !false; {7550#false} is VALID [2018-11-23 11:52:08,665 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 1 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:08,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:08,665 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:52:08,675 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:52:08,701 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:52:08,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:08,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:08,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:08,926 INFO L256 TraceCheckUtils]: 0: Hoare triple {7549#true} call ULTIMATE.init(); {7549#true} is VALID [2018-11-23 11:52:08,927 INFO L273 TraceCheckUtils]: 1: Hoare triple {7549#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7549#true} is VALID [2018-11-23 11:52:08,927 INFO L273 TraceCheckUtils]: 2: Hoare triple {7549#true} assume true; {7549#true} is VALID [2018-11-23 11:52:08,927 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7549#true} {7549#true} #79#return; {7549#true} is VALID [2018-11-23 11:52:08,927 INFO L256 TraceCheckUtils]: 4: Hoare triple {7549#true} call #t~ret8 := main(); {7549#true} is VALID [2018-11-23 11:52:08,928 INFO L273 TraceCheckUtils]: 5: Hoare triple {7549#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {7549#true} is VALID [2018-11-23 11:52:08,928 INFO L273 TraceCheckUtils]: 6: Hoare triple {7549#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {7587#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:08,929 INFO L273 TraceCheckUtils]: 7: Hoare triple {7587#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {7587#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:08,929 INFO L273 TraceCheckUtils]: 8: Hoare triple {7587#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7587#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:08,930 INFO L273 TraceCheckUtils]: 9: Hoare triple {7587#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {7552#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:08,930 INFO L273 TraceCheckUtils]: 10: Hoare triple {7552#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {7552#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:08,930 INFO L273 TraceCheckUtils]: 11: Hoare triple {7552#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7552#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:08,931 INFO L273 TraceCheckUtils]: 12: Hoare triple {7552#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {7553#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:08,931 INFO L273 TraceCheckUtils]: 13: Hoare triple {7553#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {7553#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:08,931 INFO L273 TraceCheckUtils]: 14: Hoare triple {7553#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7553#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:08,932 INFO L273 TraceCheckUtils]: 15: Hoare triple {7553#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {7554#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:08,932 INFO L273 TraceCheckUtils]: 16: Hoare triple {7554#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {7554#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:08,933 INFO L273 TraceCheckUtils]: 17: Hoare triple {7554#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7554#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:08,934 INFO L273 TraceCheckUtils]: 18: Hoare triple {7554#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {7555#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:08,934 INFO L273 TraceCheckUtils]: 19: Hoare triple {7555#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {7555#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:08,935 INFO L273 TraceCheckUtils]: 20: Hoare triple {7555#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7555#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:08,936 INFO L273 TraceCheckUtils]: 21: Hoare triple {7555#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {7556#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:08,936 INFO L273 TraceCheckUtils]: 22: Hoare triple {7556#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {7556#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:08,937 INFO L273 TraceCheckUtils]: 23: Hoare triple {7556#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7556#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:08,937 INFO L273 TraceCheckUtils]: 24: Hoare triple {7556#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {7557#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:08,938 INFO L273 TraceCheckUtils]: 25: Hoare triple {7557#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {7557#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:08,938 INFO L273 TraceCheckUtils]: 26: Hoare triple {7557#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7557#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:08,939 INFO L273 TraceCheckUtils]: 27: Hoare triple {7557#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {7558#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:08,940 INFO L273 TraceCheckUtils]: 28: Hoare triple {7558#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {7558#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:08,943 INFO L273 TraceCheckUtils]: 29: Hoare triple {7558#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7558#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:08,943 INFO L273 TraceCheckUtils]: 30: Hoare triple {7558#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {7559#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:08,944 INFO L273 TraceCheckUtils]: 31: Hoare triple {7559#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {7559#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:08,944 INFO L273 TraceCheckUtils]: 32: Hoare triple {7559#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7559#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:08,944 INFO L273 TraceCheckUtils]: 33: Hoare triple {7559#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {7560#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:08,945 INFO L273 TraceCheckUtils]: 34: Hoare triple {7560#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {7560#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:08,945 INFO L273 TraceCheckUtils]: 35: Hoare triple {7560#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7560#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:08,946 INFO L273 TraceCheckUtils]: 36: Hoare triple {7560#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {7561#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:08,946 INFO L273 TraceCheckUtils]: 37: Hoare triple {7561#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {7561#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:08,946 INFO L273 TraceCheckUtils]: 38: Hoare triple {7561#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7561#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:08,947 INFO L273 TraceCheckUtils]: 39: Hoare triple {7561#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {7562#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:08,947 INFO L273 TraceCheckUtils]: 40: Hoare triple {7562#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {7562#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:08,947 INFO L273 TraceCheckUtils]: 41: Hoare triple {7562#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7562#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:08,948 INFO L273 TraceCheckUtils]: 42: Hoare triple {7562#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {7563#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:08,949 INFO L273 TraceCheckUtils]: 43: Hoare triple {7563#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {7563#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:08,949 INFO L273 TraceCheckUtils]: 44: Hoare triple {7563#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7563#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:08,950 INFO L273 TraceCheckUtils]: 45: Hoare triple {7563#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {7564#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:08,950 INFO L273 TraceCheckUtils]: 46: Hoare triple {7564#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {7564#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:08,951 INFO L273 TraceCheckUtils]: 47: Hoare triple {7564#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7564#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:08,952 INFO L273 TraceCheckUtils]: 48: Hoare triple {7564#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {7565#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:08,952 INFO L273 TraceCheckUtils]: 49: Hoare triple {7565#(<= main_~i~0 15)} assume !(~i~0 < 100000); {7550#false} is VALID [2018-11-23 11:52:08,952 INFO L273 TraceCheckUtils]: 50: Hoare triple {7550#false} assume !(0 != ~swapped~0); {7550#false} is VALID [2018-11-23 11:52:08,953 INFO L273 TraceCheckUtils]: 51: Hoare triple {7550#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {7550#false} is VALID [2018-11-23 11:52:08,953 INFO L273 TraceCheckUtils]: 52: Hoare triple {7550#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {7550#false} is VALID [2018-11-23 11:52:08,953 INFO L273 TraceCheckUtils]: 53: Hoare triple {7550#false} assume !!(~y~0 < 100000);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); {7550#false} is VALID [2018-11-23 11:52:08,953 INFO L256 TraceCheckUtils]: 54: Hoare triple {7550#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {7550#false} is VALID [2018-11-23 11:52:08,953 INFO L273 TraceCheckUtils]: 55: Hoare triple {7550#false} ~cond := #in~cond; {7550#false} is VALID [2018-11-23 11:52:08,954 INFO L273 TraceCheckUtils]: 56: Hoare triple {7550#false} assume 0 == ~cond; {7550#false} is VALID [2018-11-23 11:52:08,954 INFO L273 TraceCheckUtils]: 57: Hoare triple {7550#false} assume !false; {7550#false} is VALID [2018-11-23 11:52:08,956 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 1 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:08,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:08,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 11:52:08,975 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 58 [2018-11-23 11:52:08,975 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:08,976 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 11:52:09,032 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:09,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 11:52:09,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 11:52:09,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:52:09,033 INFO L87 Difference]: Start difference. First operand 105 states and 136 transitions. Second operand 18 states. [2018-11-23 11:52:10,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:10,063 INFO L93 Difference]: Finished difference Result 214 states and 282 transitions. [2018-11-23 11:52:10,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 11:52:10,063 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 58 [2018-11-23 11:52:10,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:10,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:52:10,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 109 transitions. [2018-11-23 11:52:10,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:52:10,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 109 transitions. [2018-11-23 11:52:10,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 109 transitions. [2018-11-23 11:52:10,230 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:10,233 INFO L225 Difference]: With dead ends: 214 [2018-11-23 11:52:10,233 INFO L226 Difference]: Without dead ends: 115 [2018-11-23 11:52:10,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:52:10,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-11-23 11:52:10,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2018-11-23 11:52:10,337 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:10,338 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand 111 states. [2018-11-23 11:52:10,338 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 111 states. [2018-11-23 11:52:10,338 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 111 states. [2018-11-23 11:52:10,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:10,341 INFO L93 Difference]: Finished difference Result 115 states and 150 transitions. [2018-11-23 11:52:10,341 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 150 transitions. [2018-11-23 11:52:10,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:10,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:10,341 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 115 states. [2018-11-23 11:52:10,341 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 115 states. [2018-11-23 11:52:10,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:10,343 INFO L93 Difference]: Finished difference Result 115 states and 150 transitions. [2018-11-23 11:52:10,343 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 150 transitions. [2018-11-23 11:52:10,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:10,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:10,344 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:10,344 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:10,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-23 11:52:10,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 144 transitions. [2018-11-23 11:52:10,346 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 144 transitions. Word has length 58 [2018-11-23 11:52:10,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:10,346 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 144 transitions. [2018-11-23 11:52:10,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 11:52:10,346 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 144 transitions. [2018-11-23 11:52:10,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 11:52:10,347 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:10,347 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:10,348 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:10,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:10,348 INFO L82 PathProgramCache]: Analyzing trace with hash 753965224, now seen corresponding path program 15 times [2018-11-23 11:52:10,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:10,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:10,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:10,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:10,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:10,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:10,599 INFO L256 TraceCheckUtils]: 0: Hoare triple {8412#true} call ULTIMATE.init(); {8412#true} is VALID [2018-11-23 11:52:10,599 INFO L273 TraceCheckUtils]: 1: Hoare triple {8412#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8412#true} is VALID [2018-11-23 11:52:10,599 INFO L273 TraceCheckUtils]: 2: Hoare triple {8412#true} assume true; {8412#true} is VALID [2018-11-23 11:52:10,600 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8412#true} {8412#true} #79#return; {8412#true} is VALID [2018-11-23 11:52:10,600 INFO L256 TraceCheckUtils]: 4: Hoare triple {8412#true} call #t~ret8 := main(); {8412#true} is VALID [2018-11-23 11:52:10,600 INFO L273 TraceCheckUtils]: 5: Hoare triple {8412#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {8412#true} is VALID [2018-11-23 11:52:10,601 INFO L273 TraceCheckUtils]: 6: Hoare triple {8412#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {8414#(= main_~i~0 1)} is VALID [2018-11-23 11:52:10,601 INFO L273 TraceCheckUtils]: 7: Hoare triple {8414#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {8414#(= main_~i~0 1)} is VALID [2018-11-23 11:52:10,602 INFO L273 TraceCheckUtils]: 8: Hoare triple {8414#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {8414#(= main_~i~0 1)} is VALID [2018-11-23 11:52:10,602 INFO L273 TraceCheckUtils]: 9: Hoare triple {8414#(= main_~i~0 1)} ~i~0 := 1 + ~i~0; {8415#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:10,602 INFO L273 TraceCheckUtils]: 10: Hoare triple {8415#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {8415#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:10,603 INFO L273 TraceCheckUtils]: 11: Hoare triple {8415#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {8415#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:10,603 INFO L273 TraceCheckUtils]: 12: Hoare triple {8415#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {8416#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:10,603 INFO L273 TraceCheckUtils]: 13: Hoare triple {8416#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {8416#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:10,605 INFO L273 TraceCheckUtils]: 14: Hoare triple {8416#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {8416#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:10,605 INFO L273 TraceCheckUtils]: 15: Hoare triple {8416#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {8417#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:10,606 INFO L273 TraceCheckUtils]: 16: Hoare triple {8417#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {8417#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:10,607 INFO L273 TraceCheckUtils]: 17: Hoare triple {8417#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {8417#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:10,607 INFO L273 TraceCheckUtils]: 18: Hoare triple {8417#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {8418#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:10,608 INFO L273 TraceCheckUtils]: 19: Hoare triple {8418#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {8418#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:10,608 INFO L273 TraceCheckUtils]: 20: Hoare triple {8418#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {8418#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:10,609 INFO L273 TraceCheckUtils]: 21: Hoare triple {8418#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {8419#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:10,610 INFO L273 TraceCheckUtils]: 22: Hoare triple {8419#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {8419#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:10,610 INFO L273 TraceCheckUtils]: 23: Hoare triple {8419#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {8419#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:10,611 INFO L273 TraceCheckUtils]: 24: Hoare triple {8419#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {8420#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:10,611 INFO L273 TraceCheckUtils]: 25: Hoare triple {8420#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {8420#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:10,612 INFO L273 TraceCheckUtils]: 26: Hoare triple {8420#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {8420#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:10,613 INFO L273 TraceCheckUtils]: 27: Hoare triple {8420#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {8421#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:10,613 INFO L273 TraceCheckUtils]: 28: Hoare triple {8421#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {8421#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:10,614 INFO L273 TraceCheckUtils]: 29: Hoare triple {8421#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {8421#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:10,614 INFO L273 TraceCheckUtils]: 30: Hoare triple {8421#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {8422#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:10,615 INFO L273 TraceCheckUtils]: 31: Hoare triple {8422#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {8422#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:10,615 INFO L273 TraceCheckUtils]: 32: Hoare triple {8422#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {8422#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:10,616 INFO L273 TraceCheckUtils]: 33: Hoare triple {8422#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {8423#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:10,617 INFO L273 TraceCheckUtils]: 34: Hoare triple {8423#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {8423#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:10,617 INFO L273 TraceCheckUtils]: 35: Hoare triple {8423#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {8423#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:10,618 INFO L273 TraceCheckUtils]: 36: Hoare triple {8423#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {8424#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:10,619 INFO L273 TraceCheckUtils]: 37: Hoare triple {8424#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {8424#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:10,619 INFO L273 TraceCheckUtils]: 38: Hoare triple {8424#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {8424#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:10,620 INFO L273 TraceCheckUtils]: 39: Hoare triple {8424#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {8425#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:10,620 INFO L273 TraceCheckUtils]: 40: Hoare triple {8425#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {8425#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:10,621 INFO L273 TraceCheckUtils]: 41: Hoare triple {8425#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {8425#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:10,622 INFO L273 TraceCheckUtils]: 42: Hoare triple {8425#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {8426#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:10,622 INFO L273 TraceCheckUtils]: 43: Hoare triple {8426#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {8426#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:10,623 INFO L273 TraceCheckUtils]: 44: Hoare triple {8426#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {8426#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:10,623 INFO L273 TraceCheckUtils]: 45: Hoare triple {8426#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {8427#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:10,624 INFO L273 TraceCheckUtils]: 46: Hoare triple {8427#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {8427#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:10,624 INFO L273 TraceCheckUtils]: 47: Hoare triple {8427#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {8427#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:10,625 INFO L273 TraceCheckUtils]: 48: Hoare triple {8427#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {8428#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:10,626 INFO L273 TraceCheckUtils]: 49: Hoare triple {8428#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {8428#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:10,626 INFO L273 TraceCheckUtils]: 50: Hoare triple {8428#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {8428#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:10,627 INFO L273 TraceCheckUtils]: 51: Hoare triple {8428#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {8429#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:10,628 INFO L273 TraceCheckUtils]: 52: Hoare triple {8429#(<= main_~i~0 16)} assume !(~i~0 < 100000); {8413#false} is VALID [2018-11-23 11:52:10,628 INFO L273 TraceCheckUtils]: 53: Hoare triple {8413#false} assume !(0 != ~swapped~0); {8413#false} is VALID [2018-11-23 11:52:10,628 INFO L273 TraceCheckUtils]: 54: Hoare triple {8413#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {8413#false} is VALID [2018-11-23 11:52:10,628 INFO L273 TraceCheckUtils]: 55: Hoare triple {8413#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {8413#false} is VALID [2018-11-23 11:52:10,629 INFO L273 TraceCheckUtils]: 56: Hoare triple {8413#false} assume !!(~y~0 < 100000);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); {8413#false} is VALID [2018-11-23 11:52:10,629 INFO L256 TraceCheckUtils]: 57: Hoare triple {8413#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {8413#false} is VALID [2018-11-23 11:52:10,629 INFO L273 TraceCheckUtils]: 58: Hoare triple {8413#false} ~cond := #in~cond; {8413#false} is VALID [2018-11-23 11:52:10,629 INFO L273 TraceCheckUtils]: 59: Hoare triple {8413#false} assume 0 == ~cond; {8413#false} is VALID [2018-11-23 11:52:10,629 INFO L273 TraceCheckUtils]: 60: Hoare triple {8413#false} assume !false; {8413#false} is VALID [2018-11-23 11:52:10,632 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 1 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:10,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:10,633 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:52:10,641 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:52:10,748 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-11-23 11:52:10,748 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:10,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:10,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:10,991 INFO L256 TraceCheckUtils]: 0: Hoare triple {8412#true} call ULTIMATE.init(); {8412#true} is VALID [2018-11-23 11:52:10,992 INFO L273 TraceCheckUtils]: 1: Hoare triple {8412#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8412#true} is VALID [2018-11-23 11:52:10,992 INFO L273 TraceCheckUtils]: 2: Hoare triple {8412#true} assume true; {8412#true} is VALID [2018-11-23 11:52:10,992 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8412#true} {8412#true} #79#return; {8412#true} is VALID [2018-11-23 11:52:10,993 INFO L256 TraceCheckUtils]: 4: Hoare triple {8412#true} call #t~ret8 := main(); {8412#true} is VALID [2018-11-23 11:52:10,993 INFO L273 TraceCheckUtils]: 5: Hoare triple {8412#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {8412#true} is VALID [2018-11-23 11:52:10,993 INFO L273 TraceCheckUtils]: 6: Hoare triple {8412#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {8451#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:10,994 INFO L273 TraceCheckUtils]: 7: Hoare triple {8451#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {8451#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:10,994 INFO L273 TraceCheckUtils]: 8: Hoare triple {8451#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {8451#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:10,995 INFO L273 TraceCheckUtils]: 9: Hoare triple {8451#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {8415#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:10,995 INFO L273 TraceCheckUtils]: 10: Hoare triple {8415#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {8415#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:10,995 INFO L273 TraceCheckUtils]: 11: Hoare triple {8415#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {8415#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:10,996 INFO L273 TraceCheckUtils]: 12: Hoare triple {8415#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {8416#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:10,996 INFO L273 TraceCheckUtils]: 13: Hoare triple {8416#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {8416#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:10,997 INFO L273 TraceCheckUtils]: 14: Hoare triple {8416#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {8416#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:10,998 INFO L273 TraceCheckUtils]: 15: Hoare triple {8416#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {8417#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:10,999 INFO L273 TraceCheckUtils]: 16: Hoare triple {8417#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {8417#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:10,999 INFO L273 TraceCheckUtils]: 17: Hoare triple {8417#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {8417#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:11,000 INFO L273 TraceCheckUtils]: 18: Hoare triple {8417#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {8418#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:11,001 INFO L273 TraceCheckUtils]: 19: Hoare triple {8418#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {8418#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:11,002 INFO L273 TraceCheckUtils]: 20: Hoare triple {8418#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {8418#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:11,003 INFO L273 TraceCheckUtils]: 21: Hoare triple {8418#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {8419#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:11,003 INFO L273 TraceCheckUtils]: 22: Hoare triple {8419#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {8419#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:11,004 INFO L273 TraceCheckUtils]: 23: Hoare triple {8419#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {8419#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:11,005 INFO L273 TraceCheckUtils]: 24: Hoare triple {8419#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {8420#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:11,005 INFO L273 TraceCheckUtils]: 25: Hoare triple {8420#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {8420#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:11,006 INFO L273 TraceCheckUtils]: 26: Hoare triple {8420#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {8420#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:11,007 INFO L273 TraceCheckUtils]: 27: Hoare triple {8420#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {8421#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:11,007 INFO L273 TraceCheckUtils]: 28: Hoare triple {8421#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {8421#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:11,008 INFO L273 TraceCheckUtils]: 29: Hoare triple {8421#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {8421#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:11,009 INFO L273 TraceCheckUtils]: 30: Hoare triple {8421#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {8422#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:11,010 INFO L273 TraceCheckUtils]: 31: Hoare triple {8422#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {8422#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:11,010 INFO L273 TraceCheckUtils]: 32: Hoare triple {8422#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {8422#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:11,011 INFO L273 TraceCheckUtils]: 33: Hoare triple {8422#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {8423#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:11,012 INFO L273 TraceCheckUtils]: 34: Hoare triple {8423#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {8423#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:11,012 INFO L273 TraceCheckUtils]: 35: Hoare triple {8423#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {8423#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:11,013 INFO L273 TraceCheckUtils]: 36: Hoare triple {8423#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {8424#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:11,014 INFO L273 TraceCheckUtils]: 37: Hoare triple {8424#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {8424#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:11,014 INFO L273 TraceCheckUtils]: 38: Hoare triple {8424#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {8424#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:11,015 INFO L273 TraceCheckUtils]: 39: Hoare triple {8424#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {8425#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:11,016 INFO L273 TraceCheckUtils]: 40: Hoare triple {8425#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {8425#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:11,016 INFO L273 TraceCheckUtils]: 41: Hoare triple {8425#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {8425#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:11,017 INFO L273 TraceCheckUtils]: 42: Hoare triple {8425#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {8426#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:11,018 INFO L273 TraceCheckUtils]: 43: Hoare triple {8426#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {8426#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:11,019 INFO L273 TraceCheckUtils]: 44: Hoare triple {8426#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {8426#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:11,019 INFO L273 TraceCheckUtils]: 45: Hoare triple {8426#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {8427#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:11,020 INFO L273 TraceCheckUtils]: 46: Hoare triple {8427#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {8427#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:11,021 INFO L273 TraceCheckUtils]: 47: Hoare triple {8427#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {8427#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:11,022 INFO L273 TraceCheckUtils]: 48: Hoare triple {8427#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {8428#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:11,022 INFO L273 TraceCheckUtils]: 49: Hoare triple {8428#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {8428#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:11,023 INFO L273 TraceCheckUtils]: 50: Hoare triple {8428#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {8428#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:11,024 INFO L273 TraceCheckUtils]: 51: Hoare triple {8428#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {8429#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:11,024 INFO L273 TraceCheckUtils]: 52: Hoare triple {8429#(<= main_~i~0 16)} assume !(~i~0 < 100000); {8413#false} is VALID [2018-11-23 11:52:11,025 INFO L273 TraceCheckUtils]: 53: Hoare triple {8413#false} assume !(0 != ~swapped~0); {8413#false} is VALID [2018-11-23 11:52:11,025 INFO L273 TraceCheckUtils]: 54: Hoare triple {8413#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {8413#false} is VALID [2018-11-23 11:52:11,025 INFO L273 TraceCheckUtils]: 55: Hoare triple {8413#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {8413#false} is VALID [2018-11-23 11:52:11,025 INFO L273 TraceCheckUtils]: 56: Hoare triple {8413#false} assume !!(~y~0 < 100000);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); {8413#false} is VALID [2018-11-23 11:52:11,026 INFO L256 TraceCheckUtils]: 57: Hoare triple {8413#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {8413#false} is VALID [2018-11-23 11:52:11,026 INFO L273 TraceCheckUtils]: 58: Hoare triple {8413#false} ~cond := #in~cond; {8413#false} is VALID [2018-11-23 11:52:11,026 INFO L273 TraceCheckUtils]: 59: Hoare triple {8413#false} assume 0 == ~cond; {8413#false} is VALID [2018-11-23 11:52:11,026 INFO L273 TraceCheckUtils]: 60: Hoare triple {8413#false} assume !false; {8413#false} is VALID [2018-11-23 11:52:11,031 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 1 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:11,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:11,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-23 11:52:11,050 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2018-11-23 11:52:11,051 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:11,051 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 11:52:11,120 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:11,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 11:52:11,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 11:52:11,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 11:52:11,122 INFO L87 Difference]: Start difference. First operand 111 states and 144 transitions. Second operand 19 states. [2018-11-23 11:52:11,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:11,657 INFO L93 Difference]: Finished difference Result 226 states and 298 transitions. [2018-11-23 11:52:11,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 11:52:11,657 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2018-11-23 11:52:11,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:11,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:52:11,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 113 transitions. [2018-11-23 11:52:11,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:52:11,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 113 transitions. [2018-11-23 11:52:11,661 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 113 transitions. [2018-11-23 11:52:11,781 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:52:11,784 INFO L225 Difference]: With dead ends: 226 [2018-11-23 11:52:11,784 INFO L226 Difference]: Without dead ends: 121 [2018-11-23 11:52:11,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 11:52:11,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-11-23 11:52:11,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 117. [2018-11-23 11:52:11,833 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:11,834 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand 117 states. [2018-11-23 11:52:11,834 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 117 states. [2018-11-23 11:52:11,834 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 117 states. [2018-11-23 11:52:11,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:11,837 INFO L93 Difference]: Finished difference Result 121 states and 158 transitions. [2018-11-23 11:52:11,837 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 158 transitions. [2018-11-23 11:52:11,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:11,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:11,839 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 121 states. [2018-11-23 11:52:11,839 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 121 states. [2018-11-23 11:52:11,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:11,841 INFO L93 Difference]: Finished difference Result 121 states and 158 transitions. [2018-11-23 11:52:11,841 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 158 transitions. [2018-11-23 11:52:11,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:11,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:11,842 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:11,842 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:11,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-23 11:52:11,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 152 transitions. [2018-11-23 11:52:11,845 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 152 transitions. Word has length 61 [2018-11-23 11:52:11,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:11,845 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 152 transitions. [2018-11-23 11:52:11,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 11:52:11,845 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 152 transitions. [2018-11-23 11:52:11,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-23 11:52:11,846 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:11,846 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:11,847 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:11,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:11,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1706657233, now seen corresponding path program 16 times [2018-11-23 11:52:11,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:11,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:11,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:11,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:11,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:11,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:12,217 INFO L256 TraceCheckUtils]: 0: Hoare triple {9321#true} call ULTIMATE.init(); {9321#true} is VALID [2018-11-23 11:52:12,218 INFO L273 TraceCheckUtils]: 1: Hoare triple {9321#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9321#true} is VALID [2018-11-23 11:52:12,218 INFO L273 TraceCheckUtils]: 2: Hoare triple {9321#true} assume true; {9321#true} is VALID [2018-11-23 11:52:12,218 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9321#true} {9321#true} #79#return; {9321#true} is VALID [2018-11-23 11:52:12,218 INFO L256 TraceCheckUtils]: 4: Hoare triple {9321#true} call #t~ret8 := main(); {9321#true} is VALID [2018-11-23 11:52:12,219 INFO L273 TraceCheckUtils]: 5: Hoare triple {9321#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {9321#true} is VALID [2018-11-23 11:52:12,238 INFO L273 TraceCheckUtils]: 6: Hoare triple {9321#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {9323#(= main_~i~0 1)} is VALID [2018-11-23 11:52:12,238 INFO L273 TraceCheckUtils]: 7: Hoare triple {9323#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {9323#(= main_~i~0 1)} is VALID [2018-11-23 11:52:12,239 INFO L273 TraceCheckUtils]: 8: Hoare triple {9323#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9323#(= main_~i~0 1)} is VALID [2018-11-23 11:52:12,239 INFO L273 TraceCheckUtils]: 9: Hoare triple {9323#(= main_~i~0 1)} ~i~0 := 1 + ~i~0; {9324#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:12,239 INFO L273 TraceCheckUtils]: 10: Hoare triple {9324#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {9324#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:12,240 INFO L273 TraceCheckUtils]: 11: Hoare triple {9324#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9324#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:12,240 INFO L273 TraceCheckUtils]: 12: Hoare triple {9324#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {9325#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:12,241 INFO L273 TraceCheckUtils]: 13: Hoare triple {9325#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {9325#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:12,241 INFO L273 TraceCheckUtils]: 14: Hoare triple {9325#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9325#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:12,241 INFO L273 TraceCheckUtils]: 15: Hoare triple {9325#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {9326#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:12,242 INFO L273 TraceCheckUtils]: 16: Hoare triple {9326#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {9326#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:12,242 INFO L273 TraceCheckUtils]: 17: Hoare triple {9326#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9326#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:12,243 INFO L273 TraceCheckUtils]: 18: Hoare triple {9326#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {9327#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:12,243 INFO L273 TraceCheckUtils]: 19: Hoare triple {9327#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {9327#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:12,244 INFO L273 TraceCheckUtils]: 20: Hoare triple {9327#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9327#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:12,244 INFO L273 TraceCheckUtils]: 21: Hoare triple {9327#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {9328#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:12,245 INFO L273 TraceCheckUtils]: 22: Hoare triple {9328#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {9328#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:12,245 INFO L273 TraceCheckUtils]: 23: Hoare triple {9328#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9328#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:12,246 INFO L273 TraceCheckUtils]: 24: Hoare triple {9328#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {9329#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:12,247 INFO L273 TraceCheckUtils]: 25: Hoare triple {9329#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {9329#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:12,247 INFO L273 TraceCheckUtils]: 26: Hoare triple {9329#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9329#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:12,248 INFO L273 TraceCheckUtils]: 27: Hoare triple {9329#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {9330#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:12,248 INFO L273 TraceCheckUtils]: 28: Hoare triple {9330#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {9330#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:12,249 INFO L273 TraceCheckUtils]: 29: Hoare triple {9330#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9330#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:12,250 INFO L273 TraceCheckUtils]: 30: Hoare triple {9330#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {9331#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:12,250 INFO L273 TraceCheckUtils]: 31: Hoare triple {9331#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {9331#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:12,251 INFO L273 TraceCheckUtils]: 32: Hoare triple {9331#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9331#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:12,251 INFO L273 TraceCheckUtils]: 33: Hoare triple {9331#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {9332#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:12,252 INFO L273 TraceCheckUtils]: 34: Hoare triple {9332#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {9332#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:12,252 INFO L273 TraceCheckUtils]: 35: Hoare triple {9332#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9332#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:12,253 INFO L273 TraceCheckUtils]: 36: Hoare triple {9332#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {9333#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:12,253 INFO L273 TraceCheckUtils]: 37: Hoare triple {9333#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {9333#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:12,254 INFO L273 TraceCheckUtils]: 38: Hoare triple {9333#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9333#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:12,255 INFO L273 TraceCheckUtils]: 39: Hoare triple {9333#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {9334#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:12,255 INFO L273 TraceCheckUtils]: 40: Hoare triple {9334#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {9334#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:12,256 INFO L273 TraceCheckUtils]: 41: Hoare triple {9334#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9334#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:12,256 INFO L273 TraceCheckUtils]: 42: Hoare triple {9334#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {9335#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:12,257 INFO L273 TraceCheckUtils]: 43: Hoare triple {9335#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {9335#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:12,257 INFO L273 TraceCheckUtils]: 44: Hoare triple {9335#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9335#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:12,258 INFO L273 TraceCheckUtils]: 45: Hoare triple {9335#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {9336#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:12,258 INFO L273 TraceCheckUtils]: 46: Hoare triple {9336#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {9336#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:12,259 INFO L273 TraceCheckUtils]: 47: Hoare triple {9336#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9336#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:12,260 INFO L273 TraceCheckUtils]: 48: Hoare triple {9336#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {9337#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:12,260 INFO L273 TraceCheckUtils]: 49: Hoare triple {9337#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {9337#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:12,261 INFO L273 TraceCheckUtils]: 50: Hoare triple {9337#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9337#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:12,261 INFO L273 TraceCheckUtils]: 51: Hoare triple {9337#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {9338#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:12,262 INFO L273 TraceCheckUtils]: 52: Hoare triple {9338#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {9338#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:12,262 INFO L273 TraceCheckUtils]: 53: Hoare triple {9338#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9338#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:12,263 INFO L273 TraceCheckUtils]: 54: Hoare triple {9338#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {9339#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:12,264 INFO L273 TraceCheckUtils]: 55: Hoare triple {9339#(<= main_~i~0 17)} assume !(~i~0 < 100000); {9322#false} is VALID [2018-11-23 11:52:12,264 INFO L273 TraceCheckUtils]: 56: Hoare triple {9322#false} assume !(0 != ~swapped~0); {9322#false} is VALID [2018-11-23 11:52:12,264 INFO L273 TraceCheckUtils]: 57: Hoare triple {9322#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {9322#false} is VALID [2018-11-23 11:52:12,264 INFO L273 TraceCheckUtils]: 58: Hoare triple {9322#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {9322#false} is VALID [2018-11-23 11:52:12,264 INFO L273 TraceCheckUtils]: 59: Hoare triple {9322#false} assume !!(~y~0 < 100000);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); {9322#false} is VALID [2018-11-23 11:52:12,265 INFO L256 TraceCheckUtils]: 60: Hoare triple {9322#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {9322#false} is VALID [2018-11-23 11:52:12,265 INFO L273 TraceCheckUtils]: 61: Hoare triple {9322#false} ~cond := #in~cond; {9322#false} is VALID [2018-11-23 11:52:12,265 INFO L273 TraceCheckUtils]: 62: Hoare triple {9322#false} assume 0 == ~cond; {9322#false} is VALID [2018-11-23 11:52:12,265 INFO L273 TraceCheckUtils]: 63: Hoare triple {9322#false} assume !false; {9322#false} is VALID [2018-11-23 11:52:12,268 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 1 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:12,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:12,269 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:52:12,279 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:52:12,310 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:52:12,310 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:12,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:12,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:12,676 INFO L256 TraceCheckUtils]: 0: Hoare triple {9321#true} call ULTIMATE.init(); {9321#true} is VALID [2018-11-23 11:52:12,676 INFO L273 TraceCheckUtils]: 1: Hoare triple {9321#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9321#true} is VALID [2018-11-23 11:52:12,676 INFO L273 TraceCheckUtils]: 2: Hoare triple {9321#true} assume true; {9321#true} is VALID [2018-11-23 11:52:12,676 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9321#true} {9321#true} #79#return; {9321#true} is VALID [2018-11-23 11:52:12,676 INFO L256 TraceCheckUtils]: 4: Hoare triple {9321#true} call #t~ret8 := main(); {9321#true} is VALID [2018-11-23 11:52:12,676 INFO L273 TraceCheckUtils]: 5: Hoare triple {9321#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {9321#true} is VALID [2018-11-23 11:52:12,677 INFO L273 TraceCheckUtils]: 6: Hoare triple {9321#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {9361#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:12,677 INFO L273 TraceCheckUtils]: 7: Hoare triple {9361#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {9361#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:12,677 INFO L273 TraceCheckUtils]: 8: Hoare triple {9361#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9361#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:12,678 INFO L273 TraceCheckUtils]: 9: Hoare triple {9361#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {9324#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:12,678 INFO L273 TraceCheckUtils]: 10: Hoare triple {9324#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {9324#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:12,679 INFO L273 TraceCheckUtils]: 11: Hoare triple {9324#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9324#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:12,679 INFO L273 TraceCheckUtils]: 12: Hoare triple {9324#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {9325#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:12,680 INFO L273 TraceCheckUtils]: 13: Hoare triple {9325#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {9325#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:12,680 INFO L273 TraceCheckUtils]: 14: Hoare triple {9325#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9325#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:12,681 INFO L273 TraceCheckUtils]: 15: Hoare triple {9325#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {9326#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:12,682 INFO L273 TraceCheckUtils]: 16: Hoare triple {9326#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {9326#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:12,682 INFO L273 TraceCheckUtils]: 17: Hoare triple {9326#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9326#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:12,683 INFO L273 TraceCheckUtils]: 18: Hoare triple {9326#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {9327#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:12,683 INFO L273 TraceCheckUtils]: 19: Hoare triple {9327#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {9327#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:12,684 INFO L273 TraceCheckUtils]: 20: Hoare triple {9327#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9327#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:12,685 INFO L273 TraceCheckUtils]: 21: Hoare triple {9327#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {9328#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:12,685 INFO L273 TraceCheckUtils]: 22: Hoare triple {9328#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {9328#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:12,686 INFO L273 TraceCheckUtils]: 23: Hoare triple {9328#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9328#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:12,686 INFO L273 TraceCheckUtils]: 24: Hoare triple {9328#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {9329#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:12,687 INFO L273 TraceCheckUtils]: 25: Hoare triple {9329#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {9329#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:12,688 INFO L273 TraceCheckUtils]: 26: Hoare triple {9329#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9329#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:12,688 INFO L273 TraceCheckUtils]: 27: Hoare triple {9329#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {9330#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:12,689 INFO L273 TraceCheckUtils]: 28: Hoare triple {9330#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {9330#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:12,689 INFO L273 TraceCheckUtils]: 29: Hoare triple {9330#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9330#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:12,690 INFO L273 TraceCheckUtils]: 30: Hoare triple {9330#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {9331#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:12,691 INFO L273 TraceCheckUtils]: 31: Hoare triple {9331#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {9331#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:12,691 INFO L273 TraceCheckUtils]: 32: Hoare triple {9331#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9331#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:12,692 INFO L273 TraceCheckUtils]: 33: Hoare triple {9331#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {9332#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:12,710 INFO L273 TraceCheckUtils]: 34: Hoare triple {9332#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {9332#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:12,712 INFO L273 TraceCheckUtils]: 35: Hoare triple {9332#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9332#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:12,712 INFO L273 TraceCheckUtils]: 36: Hoare triple {9332#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {9333#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:12,713 INFO L273 TraceCheckUtils]: 37: Hoare triple {9333#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {9333#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:12,713 INFO L273 TraceCheckUtils]: 38: Hoare triple {9333#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9333#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:12,713 INFO L273 TraceCheckUtils]: 39: Hoare triple {9333#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {9334#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:12,714 INFO L273 TraceCheckUtils]: 40: Hoare triple {9334#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {9334#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:12,714 INFO L273 TraceCheckUtils]: 41: Hoare triple {9334#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9334#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:12,714 INFO L273 TraceCheckUtils]: 42: Hoare triple {9334#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {9335#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:12,715 INFO L273 TraceCheckUtils]: 43: Hoare triple {9335#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {9335#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:12,715 INFO L273 TraceCheckUtils]: 44: Hoare triple {9335#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9335#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:12,716 INFO L273 TraceCheckUtils]: 45: Hoare triple {9335#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {9336#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:12,717 INFO L273 TraceCheckUtils]: 46: Hoare triple {9336#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {9336#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:12,717 INFO L273 TraceCheckUtils]: 47: Hoare triple {9336#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9336#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:12,718 INFO L273 TraceCheckUtils]: 48: Hoare triple {9336#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {9337#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:12,719 INFO L273 TraceCheckUtils]: 49: Hoare triple {9337#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {9337#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:12,719 INFO L273 TraceCheckUtils]: 50: Hoare triple {9337#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9337#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:12,720 INFO L273 TraceCheckUtils]: 51: Hoare triple {9337#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {9338#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:12,720 INFO L273 TraceCheckUtils]: 52: Hoare triple {9338#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {9338#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:12,721 INFO L273 TraceCheckUtils]: 53: Hoare triple {9338#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9338#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:12,722 INFO L273 TraceCheckUtils]: 54: Hoare triple {9338#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {9339#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:12,722 INFO L273 TraceCheckUtils]: 55: Hoare triple {9339#(<= main_~i~0 17)} assume !(~i~0 < 100000); {9322#false} is VALID [2018-11-23 11:52:12,722 INFO L273 TraceCheckUtils]: 56: Hoare triple {9322#false} assume !(0 != ~swapped~0); {9322#false} is VALID [2018-11-23 11:52:12,723 INFO L273 TraceCheckUtils]: 57: Hoare triple {9322#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {9322#false} is VALID [2018-11-23 11:52:12,723 INFO L273 TraceCheckUtils]: 58: Hoare triple {9322#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {9322#false} is VALID [2018-11-23 11:52:12,723 INFO L273 TraceCheckUtils]: 59: Hoare triple {9322#false} assume !!(~y~0 < 100000);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); {9322#false} is VALID [2018-11-23 11:52:12,723 INFO L256 TraceCheckUtils]: 60: Hoare triple {9322#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {9322#false} is VALID [2018-11-23 11:52:12,724 INFO L273 TraceCheckUtils]: 61: Hoare triple {9322#false} ~cond := #in~cond; {9322#false} is VALID [2018-11-23 11:52:12,724 INFO L273 TraceCheckUtils]: 62: Hoare triple {9322#false} assume 0 == ~cond; {9322#false} is VALID [2018-11-23 11:52:12,724 INFO L273 TraceCheckUtils]: 63: Hoare triple {9322#false} assume !false; {9322#false} is VALID [2018-11-23 11:52:12,727 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 1 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:12,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:12,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-23 11:52:12,747 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 64 [2018-11-23 11:52:12,748 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:12,748 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 11:52:12,808 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:12,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 11:52:12,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 11:52:12,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:52:12,810 INFO L87 Difference]: Start difference. First operand 117 states and 152 transitions. Second operand 20 states. [2018-11-23 11:52:13,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:13,768 INFO L93 Difference]: Finished difference Result 238 states and 314 transitions. [2018-11-23 11:52:13,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 11:52:13,768 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 64 [2018-11-23 11:52:13,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:13,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:52:13,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 117 transitions. [2018-11-23 11:52:13,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:52:13,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 117 transitions. [2018-11-23 11:52:13,772 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 117 transitions. [2018-11-23 11:52:13,877 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:52:13,880 INFO L225 Difference]: With dead ends: 238 [2018-11-23 11:52:13,880 INFO L226 Difference]: Without dead ends: 127 [2018-11-23 11:52:13,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:52:13,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-23 11:52:13,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 123. [2018-11-23 11:52:13,935 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:13,935 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand 123 states. [2018-11-23 11:52:13,935 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand 123 states. [2018-11-23 11:52:13,935 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 123 states. [2018-11-23 11:52:13,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:13,938 INFO L93 Difference]: Finished difference Result 127 states and 166 transitions. [2018-11-23 11:52:13,938 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 166 transitions. [2018-11-23 11:52:13,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:13,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:13,939 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 127 states. [2018-11-23 11:52:13,939 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 127 states. [2018-11-23 11:52:13,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:13,940 INFO L93 Difference]: Finished difference Result 127 states and 166 transitions. [2018-11-23 11:52:13,940 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 166 transitions. [2018-11-23 11:52:13,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:13,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:13,941 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:13,941 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:13,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-23 11:52:13,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 160 transitions. [2018-11-23 11:52:13,943 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 160 transitions. Word has length 64 [2018-11-23 11:52:13,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:13,944 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 160 transitions. [2018-11-23 11:52:13,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 11:52:13,944 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 160 transitions. [2018-11-23 11:52:13,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 11:52:13,945 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:13,945 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:13,945 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:13,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:13,945 INFO L82 PathProgramCache]: Analyzing trace with hash -2084561912, now seen corresponding path program 17 times [2018-11-23 11:52:13,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:13,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:13,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:13,946 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:13,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:13,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:14,820 INFO L256 TraceCheckUtils]: 0: Hoare triple {10276#true} call ULTIMATE.init(); {10276#true} is VALID [2018-11-23 11:52:14,820 INFO L273 TraceCheckUtils]: 1: Hoare triple {10276#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10276#true} is VALID [2018-11-23 11:52:14,820 INFO L273 TraceCheckUtils]: 2: Hoare triple {10276#true} assume true; {10276#true} is VALID [2018-11-23 11:52:14,820 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10276#true} {10276#true} #79#return; {10276#true} is VALID [2018-11-23 11:52:14,821 INFO L256 TraceCheckUtils]: 4: Hoare triple {10276#true} call #t~ret8 := main(); {10276#true} is VALID [2018-11-23 11:52:14,821 INFO L273 TraceCheckUtils]: 5: Hoare triple {10276#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {10276#true} is VALID [2018-11-23 11:52:14,821 INFO L273 TraceCheckUtils]: 6: Hoare triple {10276#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {10278#(= main_~i~0 1)} is VALID [2018-11-23 11:52:14,822 INFO L273 TraceCheckUtils]: 7: Hoare triple {10278#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {10278#(= main_~i~0 1)} is VALID [2018-11-23 11:52:14,822 INFO L273 TraceCheckUtils]: 8: Hoare triple {10278#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10278#(= main_~i~0 1)} is VALID [2018-11-23 11:52:14,822 INFO L273 TraceCheckUtils]: 9: Hoare triple {10278#(= main_~i~0 1)} ~i~0 := 1 + ~i~0; {10279#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:14,823 INFO L273 TraceCheckUtils]: 10: Hoare triple {10279#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {10279#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:14,823 INFO L273 TraceCheckUtils]: 11: Hoare triple {10279#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10279#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:14,824 INFO L273 TraceCheckUtils]: 12: Hoare triple {10279#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {10280#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:14,824 INFO L273 TraceCheckUtils]: 13: Hoare triple {10280#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {10280#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:14,825 INFO L273 TraceCheckUtils]: 14: Hoare triple {10280#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10280#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:14,825 INFO L273 TraceCheckUtils]: 15: Hoare triple {10280#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {10281#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:14,826 INFO L273 TraceCheckUtils]: 16: Hoare triple {10281#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {10281#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:14,826 INFO L273 TraceCheckUtils]: 17: Hoare triple {10281#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10281#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:14,827 INFO L273 TraceCheckUtils]: 18: Hoare triple {10281#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {10282#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:14,827 INFO L273 TraceCheckUtils]: 19: Hoare triple {10282#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {10282#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:14,828 INFO L273 TraceCheckUtils]: 20: Hoare triple {10282#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10282#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:14,829 INFO L273 TraceCheckUtils]: 21: Hoare triple {10282#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {10283#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:14,829 INFO L273 TraceCheckUtils]: 22: Hoare triple {10283#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {10283#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:14,830 INFO L273 TraceCheckUtils]: 23: Hoare triple {10283#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10283#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:14,830 INFO L273 TraceCheckUtils]: 24: Hoare triple {10283#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {10284#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:14,831 INFO L273 TraceCheckUtils]: 25: Hoare triple {10284#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {10284#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:14,831 INFO L273 TraceCheckUtils]: 26: Hoare triple {10284#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10284#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:14,832 INFO L273 TraceCheckUtils]: 27: Hoare triple {10284#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {10285#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:14,832 INFO L273 TraceCheckUtils]: 28: Hoare triple {10285#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {10285#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:14,833 INFO L273 TraceCheckUtils]: 29: Hoare triple {10285#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10285#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:14,834 INFO L273 TraceCheckUtils]: 30: Hoare triple {10285#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {10286#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:14,834 INFO L273 TraceCheckUtils]: 31: Hoare triple {10286#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {10286#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:14,835 INFO L273 TraceCheckUtils]: 32: Hoare triple {10286#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10286#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:14,835 INFO L273 TraceCheckUtils]: 33: Hoare triple {10286#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {10287#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:14,836 INFO L273 TraceCheckUtils]: 34: Hoare triple {10287#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {10287#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:14,836 INFO L273 TraceCheckUtils]: 35: Hoare triple {10287#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10287#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:14,837 INFO L273 TraceCheckUtils]: 36: Hoare triple {10287#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {10288#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:14,838 INFO L273 TraceCheckUtils]: 37: Hoare triple {10288#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {10288#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:14,838 INFO L273 TraceCheckUtils]: 38: Hoare triple {10288#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10288#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:14,839 INFO L273 TraceCheckUtils]: 39: Hoare triple {10288#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {10289#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:14,840 INFO L273 TraceCheckUtils]: 40: Hoare triple {10289#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {10289#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:14,840 INFO L273 TraceCheckUtils]: 41: Hoare triple {10289#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10289#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:14,841 INFO L273 TraceCheckUtils]: 42: Hoare triple {10289#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {10290#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:14,841 INFO L273 TraceCheckUtils]: 43: Hoare triple {10290#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {10290#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:14,842 INFO L273 TraceCheckUtils]: 44: Hoare triple {10290#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10290#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:14,842 INFO L273 TraceCheckUtils]: 45: Hoare triple {10290#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {10291#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:14,843 INFO L273 TraceCheckUtils]: 46: Hoare triple {10291#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {10291#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:14,843 INFO L273 TraceCheckUtils]: 47: Hoare triple {10291#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10291#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:14,844 INFO L273 TraceCheckUtils]: 48: Hoare triple {10291#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {10292#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:14,845 INFO L273 TraceCheckUtils]: 49: Hoare triple {10292#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {10292#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:14,845 INFO L273 TraceCheckUtils]: 50: Hoare triple {10292#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10292#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:14,846 INFO L273 TraceCheckUtils]: 51: Hoare triple {10292#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {10293#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:14,846 INFO L273 TraceCheckUtils]: 52: Hoare triple {10293#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {10293#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:14,847 INFO L273 TraceCheckUtils]: 53: Hoare triple {10293#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10293#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:14,848 INFO L273 TraceCheckUtils]: 54: Hoare triple {10293#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {10294#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:14,848 INFO L273 TraceCheckUtils]: 55: Hoare triple {10294#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {10294#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:14,849 INFO L273 TraceCheckUtils]: 56: Hoare triple {10294#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10294#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:14,849 INFO L273 TraceCheckUtils]: 57: Hoare triple {10294#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {10295#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:14,850 INFO L273 TraceCheckUtils]: 58: Hoare triple {10295#(<= main_~i~0 18)} assume !(~i~0 < 100000); {10277#false} is VALID [2018-11-23 11:52:14,850 INFO L273 TraceCheckUtils]: 59: Hoare triple {10277#false} assume !(0 != ~swapped~0); {10277#false} is VALID [2018-11-23 11:52:14,850 INFO L273 TraceCheckUtils]: 60: Hoare triple {10277#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {10277#false} is VALID [2018-11-23 11:52:14,851 INFO L273 TraceCheckUtils]: 61: Hoare triple {10277#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {10277#false} is VALID [2018-11-23 11:52:14,851 INFO L273 TraceCheckUtils]: 62: Hoare triple {10277#false} assume !!(~y~0 < 100000);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); {10277#false} is VALID [2018-11-23 11:52:14,851 INFO L256 TraceCheckUtils]: 63: Hoare triple {10277#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {10277#false} is VALID [2018-11-23 11:52:14,851 INFO L273 TraceCheckUtils]: 64: Hoare triple {10277#false} ~cond := #in~cond; {10277#false} is VALID [2018-11-23 11:52:14,851 INFO L273 TraceCheckUtils]: 65: Hoare triple {10277#false} assume 0 == ~cond; {10277#false} is VALID [2018-11-23 11:52:14,852 INFO L273 TraceCheckUtils]: 66: Hoare triple {10277#false} assume !false; {10277#false} is VALID [2018-11-23 11:52:14,855 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 1 proven. 425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:14,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:14,855 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:52:14,864 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:52:14,908 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-11-23 11:52:14,909 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:14,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:14,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:15,071 INFO L256 TraceCheckUtils]: 0: Hoare triple {10276#true} call ULTIMATE.init(); {10276#true} is VALID [2018-11-23 11:52:15,071 INFO L273 TraceCheckUtils]: 1: Hoare triple {10276#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10276#true} is VALID [2018-11-23 11:52:15,071 INFO L273 TraceCheckUtils]: 2: Hoare triple {10276#true} assume true; {10276#true} is VALID [2018-11-23 11:52:15,072 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10276#true} {10276#true} #79#return; {10276#true} is VALID [2018-11-23 11:52:15,072 INFO L256 TraceCheckUtils]: 4: Hoare triple {10276#true} call #t~ret8 := main(); {10276#true} is VALID [2018-11-23 11:52:15,072 INFO L273 TraceCheckUtils]: 5: Hoare triple {10276#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {10276#true} is VALID [2018-11-23 11:52:15,073 INFO L273 TraceCheckUtils]: 6: Hoare triple {10276#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {10317#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:15,073 INFO L273 TraceCheckUtils]: 7: Hoare triple {10317#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {10317#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:15,073 INFO L273 TraceCheckUtils]: 8: Hoare triple {10317#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10317#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:15,074 INFO L273 TraceCheckUtils]: 9: Hoare triple {10317#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {10279#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:15,074 INFO L273 TraceCheckUtils]: 10: Hoare triple {10279#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {10279#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:15,075 INFO L273 TraceCheckUtils]: 11: Hoare triple {10279#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10279#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:15,075 INFO L273 TraceCheckUtils]: 12: Hoare triple {10279#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {10280#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:15,076 INFO L273 TraceCheckUtils]: 13: Hoare triple {10280#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {10280#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:15,076 INFO L273 TraceCheckUtils]: 14: Hoare triple {10280#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10280#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:15,077 INFO L273 TraceCheckUtils]: 15: Hoare triple {10280#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {10281#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:15,077 INFO L273 TraceCheckUtils]: 16: Hoare triple {10281#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {10281#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:15,078 INFO L273 TraceCheckUtils]: 17: Hoare triple {10281#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10281#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:15,079 INFO L273 TraceCheckUtils]: 18: Hoare triple {10281#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {10282#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:15,079 INFO L273 TraceCheckUtils]: 19: Hoare triple {10282#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {10282#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:15,080 INFO L273 TraceCheckUtils]: 20: Hoare triple {10282#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10282#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:15,080 INFO L273 TraceCheckUtils]: 21: Hoare triple {10282#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {10283#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:15,081 INFO L273 TraceCheckUtils]: 22: Hoare triple {10283#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {10283#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:15,081 INFO L273 TraceCheckUtils]: 23: Hoare triple {10283#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10283#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:15,082 INFO L273 TraceCheckUtils]: 24: Hoare triple {10283#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {10284#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:15,083 INFO L273 TraceCheckUtils]: 25: Hoare triple {10284#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {10284#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:15,083 INFO L273 TraceCheckUtils]: 26: Hoare triple {10284#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10284#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:15,084 INFO L273 TraceCheckUtils]: 27: Hoare triple {10284#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {10285#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:15,084 INFO L273 TraceCheckUtils]: 28: Hoare triple {10285#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {10285#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:15,085 INFO L273 TraceCheckUtils]: 29: Hoare triple {10285#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10285#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:15,086 INFO L273 TraceCheckUtils]: 30: Hoare triple {10285#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {10286#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:15,086 INFO L273 TraceCheckUtils]: 31: Hoare triple {10286#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {10286#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:15,087 INFO L273 TraceCheckUtils]: 32: Hoare triple {10286#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10286#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:15,087 INFO L273 TraceCheckUtils]: 33: Hoare triple {10286#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {10287#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:15,088 INFO L273 TraceCheckUtils]: 34: Hoare triple {10287#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {10287#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:15,088 INFO L273 TraceCheckUtils]: 35: Hoare triple {10287#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10287#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:15,089 INFO L273 TraceCheckUtils]: 36: Hoare triple {10287#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {10288#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:15,090 INFO L273 TraceCheckUtils]: 37: Hoare triple {10288#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {10288#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:15,090 INFO L273 TraceCheckUtils]: 38: Hoare triple {10288#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10288#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:15,091 INFO L273 TraceCheckUtils]: 39: Hoare triple {10288#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {10289#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:15,092 INFO L273 TraceCheckUtils]: 40: Hoare triple {10289#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {10289#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:15,092 INFO L273 TraceCheckUtils]: 41: Hoare triple {10289#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10289#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:15,093 INFO L273 TraceCheckUtils]: 42: Hoare triple {10289#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {10290#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:15,093 INFO L273 TraceCheckUtils]: 43: Hoare triple {10290#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {10290#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:15,094 INFO L273 TraceCheckUtils]: 44: Hoare triple {10290#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10290#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:15,095 INFO L273 TraceCheckUtils]: 45: Hoare triple {10290#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {10291#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:15,095 INFO L273 TraceCheckUtils]: 46: Hoare triple {10291#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {10291#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:15,096 INFO L273 TraceCheckUtils]: 47: Hoare triple {10291#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10291#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:15,096 INFO L273 TraceCheckUtils]: 48: Hoare triple {10291#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {10292#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:15,097 INFO L273 TraceCheckUtils]: 49: Hoare triple {10292#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {10292#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:15,097 INFO L273 TraceCheckUtils]: 50: Hoare triple {10292#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10292#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:15,098 INFO L273 TraceCheckUtils]: 51: Hoare triple {10292#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {10293#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:15,099 INFO L273 TraceCheckUtils]: 52: Hoare triple {10293#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {10293#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:15,099 INFO L273 TraceCheckUtils]: 53: Hoare triple {10293#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10293#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:15,100 INFO L273 TraceCheckUtils]: 54: Hoare triple {10293#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {10294#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:15,100 INFO L273 TraceCheckUtils]: 55: Hoare triple {10294#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {10294#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:15,101 INFO L273 TraceCheckUtils]: 56: Hoare triple {10294#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10294#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:15,102 INFO L273 TraceCheckUtils]: 57: Hoare triple {10294#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {10295#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:15,102 INFO L273 TraceCheckUtils]: 58: Hoare triple {10295#(<= main_~i~0 18)} assume !(~i~0 < 100000); {10277#false} is VALID [2018-11-23 11:52:15,102 INFO L273 TraceCheckUtils]: 59: Hoare triple {10277#false} assume !(0 != ~swapped~0); {10277#false} is VALID [2018-11-23 11:52:15,103 INFO L273 TraceCheckUtils]: 60: Hoare triple {10277#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {10277#false} is VALID [2018-11-23 11:52:15,103 INFO L273 TraceCheckUtils]: 61: Hoare triple {10277#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {10277#false} is VALID [2018-11-23 11:52:15,103 INFO L273 TraceCheckUtils]: 62: Hoare triple {10277#false} assume !!(~y~0 < 100000);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); {10277#false} is VALID [2018-11-23 11:52:15,103 INFO L256 TraceCheckUtils]: 63: Hoare triple {10277#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {10277#false} is VALID [2018-11-23 11:52:15,103 INFO L273 TraceCheckUtils]: 64: Hoare triple {10277#false} ~cond := #in~cond; {10277#false} is VALID [2018-11-23 11:52:15,104 INFO L273 TraceCheckUtils]: 65: Hoare triple {10277#false} assume 0 == ~cond; {10277#false} is VALID [2018-11-23 11:52:15,104 INFO L273 TraceCheckUtils]: 66: Hoare triple {10277#false} assume !false; {10277#false} is VALID [2018-11-23 11:52:15,107 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 1 proven. 425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:15,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:15,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-23 11:52:15,126 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 67 [2018-11-23 11:52:15,127 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:15,127 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 11:52:15,196 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:15,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 11:52:15,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 11:52:15,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 11:52:15,198 INFO L87 Difference]: Start difference. First operand 123 states and 160 transitions. Second operand 21 states. [2018-11-23 11:52:15,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:15,806 INFO L93 Difference]: Finished difference Result 250 states and 330 transitions. [2018-11-23 11:52:15,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 11:52:15,807 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 67 [2018-11-23 11:52:15,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:15,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:52:15,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 121 transitions. [2018-11-23 11:52:15,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:52:15,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 121 transitions. [2018-11-23 11:52:15,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 121 transitions. [2018-11-23 11:52:16,330 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:16,333 INFO L225 Difference]: With dead ends: 250 [2018-11-23 11:52:16,333 INFO L226 Difference]: Without dead ends: 133 [2018-11-23 11:52:16,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 11:52:16,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-23 11:52:16,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2018-11-23 11:52:16,381 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:16,381 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand 129 states. [2018-11-23 11:52:16,381 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 129 states. [2018-11-23 11:52:16,382 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 129 states. [2018-11-23 11:52:16,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:16,385 INFO L93 Difference]: Finished difference Result 133 states and 174 transitions. [2018-11-23 11:52:16,385 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 174 transitions. [2018-11-23 11:52:16,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:16,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:16,386 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand 133 states. [2018-11-23 11:52:16,386 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 133 states. [2018-11-23 11:52:16,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:16,388 INFO L93 Difference]: Finished difference Result 133 states and 174 transitions. [2018-11-23 11:52:16,388 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 174 transitions. [2018-11-23 11:52:16,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:16,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:16,389 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:16,389 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:16,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-11-23 11:52:16,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 168 transitions. [2018-11-23 11:52:16,391 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 168 transitions. Word has length 67 [2018-11-23 11:52:16,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:16,392 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 168 transitions. [2018-11-23 11:52:16,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 11:52:16,392 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 168 transitions. [2018-11-23 11:52:16,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 11:52:16,392 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:16,393 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:16,393 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:16,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:16,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1539127695, now seen corresponding path program 18 times [2018-11-23 11:52:16,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:16,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:16,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:16,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:16,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:16,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:16,764 INFO L256 TraceCheckUtils]: 0: Hoare triple {11277#true} call ULTIMATE.init(); {11277#true} is VALID [2018-11-23 11:52:16,764 INFO L273 TraceCheckUtils]: 1: Hoare triple {11277#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11277#true} is VALID [2018-11-23 11:52:16,765 INFO L273 TraceCheckUtils]: 2: Hoare triple {11277#true} assume true; {11277#true} is VALID [2018-11-23 11:52:16,765 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11277#true} {11277#true} #79#return; {11277#true} is VALID [2018-11-23 11:52:16,765 INFO L256 TraceCheckUtils]: 4: Hoare triple {11277#true} call #t~ret8 := main(); {11277#true} is VALID [2018-11-23 11:52:16,765 INFO L273 TraceCheckUtils]: 5: Hoare triple {11277#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {11277#true} is VALID [2018-11-23 11:52:16,766 INFO L273 TraceCheckUtils]: 6: Hoare triple {11277#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {11279#(= main_~i~0 1)} is VALID [2018-11-23 11:52:16,766 INFO L273 TraceCheckUtils]: 7: Hoare triple {11279#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {11279#(= main_~i~0 1)} is VALID [2018-11-23 11:52:16,767 INFO L273 TraceCheckUtils]: 8: Hoare triple {11279#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11279#(= main_~i~0 1)} is VALID [2018-11-23 11:52:16,767 INFO L273 TraceCheckUtils]: 9: Hoare triple {11279#(= main_~i~0 1)} ~i~0 := 1 + ~i~0; {11280#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:16,768 INFO L273 TraceCheckUtils]: 10: Hoare triple {11280#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {11280#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:16,768 INFO L273 TraceCheckUtils]: 11: Hoare triple {11280#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11280#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:16,768 INFO L273 TraceCheckUtils]: 12: Hoare triple {11280#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {11281#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:16,769 INFO L273 TraceCheckUtils]: 13: Hoare triple {11281#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {11281#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:16,769 INFO L273 TraceCheckUtils]: 14: Hoare triple {11281#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11281#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:16,769 INFO L273 TraceCheckUtils]: 15: Hoare triple {11281#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {11282#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:16,770 INFO L273 TraceCheckUtils]: 16: Hoare triple {11282#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {11282#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:16,770 INFO L273 TraceCheckUtils]: 17: Hoare triple {11282#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11282#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:16,771 INFO L273 TraceCheckUtils]: 18: Hoare triple {11282#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {11283#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:16,771 INFO L273 TraceCheckUtils]: 19: Hoare triple {11283#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {11283#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:16,772 INFO L273 TraceCheckUtils]: 20: Hoare triple {11283#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11283#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:16,772 INFO L273 TraceCheckUtils]: 21: Hoare triple {11283#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {11284#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:16,773 INFO L273 TraceCheckUtils]: 22: Hoare triple {11284#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {11284#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:16,773 INFO L273 TraceCheckUtils]: 23: Hoare triple {11284#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11284#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:16,774 INFO L273 TraceCheckUtils]: 24: Hoare triple {11284#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {11285#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:16,775 INFO L273 TraceCheckUtils]: 25: Hoare triple {11285#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {11285#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:16,775 INFO L273 TraceCheckUtils]: 26: Hoare triple {11285#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11285#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:16,776 INFO L273 TraceCheckUtils]: 27: Hoare triple {11285#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {11286#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:16,776 INFO L273 TraceCheckUtils]: 28: Hoare triple {11286#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {11286#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:16,777 INFO L273 TraceCheckUtils]: 29: Hoare triple {11286#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11286#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:16,777 INFO L273 TraceCheckUtils]: 30: Hoare triple {11286#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {11287#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:16,778 INFO L273 TraceCheckUtils]: 31: Hoare triple {11287#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {11287#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:16,778 INFO L273 TraceCheckUtils]: 32: Hoare triple {11287#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11287#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:16,779 INFO L273 TraceCheckUtils]: 33: Hoare triple {11287#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {11288#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:16,780 INFO L273 TraceCheckUtils]: 34: Hoare triple {11288#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {11288#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:16,780 INFO L273 TraceCheckUtils]: 35: Hoare triple {11288#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11288#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:16,781 INFO L273 TraceCheckUtils]: 36: Hoare triple {11288#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {11289#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:16,781 INFO L273 TraceCheckUtils]: 37: Hoare triple {11289#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {11289#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:16,782 INFO L273 TraceCheckUtils]: 38: Hoare triple {11289#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11289#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:16,782 INFO L273 TraceCheckUtils]: 39: Hoare triple {11289#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {11290#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:16,783 INFO L273 TraceCheckUtils]: 40: Hoare triple {11290#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {11290#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:16,783 INFO L273 TraceCheckUtils]: 41: Hoare triple {11290#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11290#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:16,784 INFO L273 TraceCheckUtils]: 42: Hoare triple {11290#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {11291#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:16,785 INFO L273 TraceCheckUtils]: 43: Hoare triple {11291#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {11291#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:16,785 INFO L273 TraceCheckUtils]: 44: Hoare triple {11291#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11291#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:16,786 INFO L273 TraceCheckUtils]: 45: Hoare triple {11291#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {11292#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:16,786 INFO L273 TraceCheckUtils]: 46: Hoare triple {11292#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {11292#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:16,787 INFO L273 TraceCheckUtils]: 47: Hoare triple {11292#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11292#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:16,787 INFO L273 TraceCheckUtils]: 48: Hoare triple {11292#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {11293#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:16,788 INFO L273 TraceCheckUtils]: 49: Hoare triple {11293#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {11293#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:16,788 INFO L273 TraceCheckUtils]: 50: Hoare triple {11293#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11293#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:16,789 INFO L273 TraceCheckUtils]: 51: Hoare triple {11293#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {11294#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:16,790 INFO L273 TraceCheckUtils]: 52: Hoare triple {11294#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {11294#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:16,790 INFO L273 TraceCheckUtils]: 53: Hoare triple {11294#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11294#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:16,791 INFO L273 TraceCheckUtils]: 54: Hoare triple {11294#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {11295#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:16,791 INFO L273 TraceCheckUtils]: 55: Hoare triple {11295#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {11295#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:16,792 INFO L273 TraceCheckUtils]: 56: Hoare triple {11295#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11295#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:16,792 INFO L273 TraceCheckUtils]: 57: Hoare triple {11295#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {11296#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:16,793 INFO L273 TraceCheckUtils]: 58: Hoare triple {11296#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {11296#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:16,793 INFO L273 TraceCheckUtils]: 59: Hoare triple {11296#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11296#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:16,794 INFO L273 TraceCheckUtils]: 60: Hoare triple {11296#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {11297#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:16,795 INFO L273 TraceCheckUtils]: 61: Hoare triple {11297#(<= main_~i~0 19)} assume !(~i~0 < 100000); {11278#false} is VALID [2018-11-23 11:52:16,795 INFO L273 TraceCheckUtils]: 62: Hoare triple {11278#false} assume !(0 != ~swapped~0); {11278#false} is VALID [2018-11-23 11:52:16,795 INFO L273 TraceCheckUtils]: 63: Hoare triple {11278#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {11278#false} is VALID [2018-11-23 11:52:16,795 INFO L273 TraceCheckUtils]: 64: Hoare triple {11278#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {11278#false} is VALID [2018-11-23 11:52:16,796 INFO L273 TraceCheckUtils]: 65: Hoare triple {11278#false} assume !!(~y~0 < 100000);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); {11278#false} is VALID [2018-11-23 11:52:16,796 INFO L256 TraceCheckUtils]: 66: Hoare triple {11278#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {11278#false} is VALID [2018-11-23 11:52:16,796 INFO L273 TraceCheckUtils]: 67: Hoare triple {11278#false} ~cond := #in~cond; {11278#false} is VALID [2018-11-23 11:52:16,796 INFO L273 TraceCheckUtils]: 68: Hoare triple {11278#false} assume 0 == ~cond; {11278#false} is VALID [2018-11-23 11:52:16,796 INFO L273 TraceCheckUtils]: 69: Hoare triple {11278#false} assume !false; {11278#false} is VALID [2018-11-23 11:52:16,800 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 1 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:16,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:16,800 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:52:16,809 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:52:16,856 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2018-11-23 11:52:16,857 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:16,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:16,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:17,007 INFO L256 TraceCheckUtils]: 0: Hoare triple {11277#true} call ULTIMATE.init(); {11277#true} is VALID [2018-11-23 11:52:17,007 INFO L273 TraceCheckUtils]: 1: Hoare triple {11277#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11277#true} is VALID [2018-11-23 11:52:17,007 INFO L273 TraceCheckUtils]: 2: Hoare triple {11277#true} assume true; {11277#true} is VALID [2018-11-23 11:52:17,008 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11277#true} {11277#true} #79#return; {11277#true} is VALID [2018-11-23 11:52:17,008 INFO L256 TraceCheckUtils]: 4: Hoare triple {11277#true} call #t~ret8 := main(); {11277#true} is VALID [2018-11-23 11:52:17,008 INFO L273 TraceCheckUtils]: 5: Hoare triple {11277#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {11277#true} is VALID [2018-11-23 11:52:17,009 INFO L273 TraceCheckUtils]: 6: Hoare triple {11277#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {11319#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:17,009 INFO L273 TraceCheckUtils]: 7: Hoare triple {11319#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {11319#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:17,010 INFO L273 TraceCheckUtils]: 8: Hoare triple {11319#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11319#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:17,010 INFO L273 TraceCheckUtils]: 9: Hoare triple {11319#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {11280#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:17,028 INFO L273 TraceCheckUtils]: 10: Hoare triple {11280#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {11280#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:17,041 INFO L273 TraceCheckUtils]: 11: Hoare triple {11280#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11280#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:17,050 INFO L273 TraceCheckUtils]: 12: Hoare triple {11280#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {11281#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:17,062 INFO L273 TraceCheckUtils]: 13: Hoare triple {11281#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {11281#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:17,062 INFO L273 TraceCheckUtils]: 14: Hoare triple {11281#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11281#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:17,063 INFO L273 TraceCheckUtils]: 15: Hoare triple {11281#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {11282#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:17,063 INFO L273 TraceCheckUtils]: 16: Hoare triple {11282#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {11282#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:17,063 INFO L273 TraceCheckUtils]: 17: Hoare triple {11282#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11282#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:17,064 INFO L273 TraceCheckUtils]: 18: Hoare triple {11282#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {11283#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:17,064 INFO L273 TraceCheckUtils]: 19: Hoare triple {11283#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {11283#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:17,065 INFO L273 TraceCheckUtils]: 20: Hoare triple {11283#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11283#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:17,065 INFO L273 TraceCheckUtils]: 21: Hoare triple {11283#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {11284#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:17,065 INFO L273 TraceCheckUtils]: 22: Hoare triple {11284#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {11284#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:17,066 INFO L273 TraceCheckUtils]: 23: Hoare triple {11284#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11284#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:17,066 INFO L273 TraceCheckUtils]: 24: Hoare triple {11284#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {11285#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:17,066 INFO L273 TraceCheckUtils]: 25: Hoare triple {11285#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {11285#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:17,067 INFO L273 TraceCheckUtils]: 26: Hoare triple {11285#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11285#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:17,067 INFO L273 TraceCheckUtils]: 27: Hoare triple {11285#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {11286#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:17,068 INFO L273 TraceCheckUtils]: 28: Hoare triple {11286#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {11286#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:17,068 INFO L273 TraceCheckUtils]: 29: Hoare triple {11286#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11286#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:17,069 INFO L273 TraceCheckUtils]: 30: Hoare triple {11286#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {11287#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:17,069 INFO L273 TraceCheckUtils]: 31: Hoare triple {11287#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {11287#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:17,070 INFO L273 TraceCheckUtils]: 32: Hoare triple {11287#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11287#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:17,071 INFO L273 TraceCheckUtils]: 33: Hoare triple {11287#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {11288#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:17,071 INFO L273 TraceCheckUtils]: 34: Hoare triple {11288#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {11288#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:17,071 INFO L273 TraceCheckUtils]: 35: Hoare triple {11288#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11288#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:17,072 INFO L273 TraceCheckUtils]: 36: Hoare triple {11288#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {11289#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:17,073 INFO L273 TraceCheckUtils]: 37: Hoare triple {11289#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {11289#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:17,073 INFO L273 TraceCheckUtils]: 38: Hoare triple {11289#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11289#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:17,074 INFO L273 TraceCheckUtils]: 39: Hoare triple {11289#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {11290#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:17,074 INFO L273 TraceCheckUtils]: 40: Hoare triple {11290#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {11290#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:17,075 INFO L273 TraceCheckUtils]: 41: Hoare triple {11290#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11290#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:17,076 INFO L273 TraceCheckUtils]: 42: Hoare triple {11290#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {11291#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:17,076 INFO L273 TraceCheckUtils]: 43: Hoare triple {11291#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {11291#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:17,077 INFO L273 TraceCheckUtils]: 44: Hoare triple {11291#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11291#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:17,077 INFO L273 TraceCheckUtils]: 45: Hoare triple {11291#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {11292#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:17,078 INFO L273 TraceCheckUtils]: 46: Hoare triple {11292#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {11292#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:17,078 INFO L273 TraceCheckUtils]: 47: Hoare triple {11292#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11292#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:17,079 INFO L273 TraceCheckUtils]: 48: Hoare triple {11292#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {11293#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:17,079 INFO L273 TraceCheckUtils]: 49: Hoare triple {11293#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {11293#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:17,080 INFO L273 TraceCheckUtils]: 50: Hoare triple {11293#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11293#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:17,080 INFO L273 TraceCheckUtils]: 51: Hoare triple {11293#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {11294#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:17,081 INFO L273 TraceCheckUtils]: 52: Hoare triple {11294#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {11294#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:17,081 INFO L273 TraceCheckUtils]: 53: Hoare triple {11294#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11294#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:17,082 INFO L273 TraceCheckUtils]: 54: Hoare triple {11294#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {11295#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:17,083 INFO L273 TraceCheckUtils]: 55: Hoare triple {11295#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {11295#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:17,083 INFO L273 TraceCheckUtils]: 56: Hoare triple {11295#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11295#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:17,084 INFO L273 TraceCheckUtils]: 57: Hoare triple {11295#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {11296#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:17,084 INFO L273 TraceCheckUtils]: 58: Hoare triple {11296#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {11296#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:17,085 INFO L273 TraceCheckUtils]: 59: Hoare triple {11296#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11296#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:17,085 INFO L273 TraceCheckUtils]: 60: Hoare triple {11296#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {11297#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:17,086 INFO L273 TraceCheckUtils]: 61: Hoare triple {11297#(<= main_~i~0 19)} assume !(~i~0 < 100000); {11278#false} is VALID [2018-11-23 11:52:17,086 INFO L273 TraceCheckUtils]: 62: Hoare triple {11278#false} assume !(0 != ~swapped~0); {11278#false} is VALID [2018-11-23 11:52:17,087 INFO L273 TraceCheckUtils]: 63: Hoare triple {11278#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {11278#false} is VALID [2018-11-23 11:52:17,087 INFO L273 TraceCheckUtils]: 64: Hoare triple {11278#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {11278#false} is VALID [2018-11-23 11:52:17,087 INFO L273 TraceCheckUtils]: 65: Hoare triple {11278#false} assume !!(~y~0 < 100000);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); {11278#false} is VALID [2018-11-23 11:52:17,087 INFO L256 TraceCheckUtils]: 66: Hoare triple {11278#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {11278#false} is VALID [2018-11-23 11:52:17,087 INFO L273 TraceCheckUtils]: 67: Hoare triple {11278#false} ~cond := #in~cond; {11278#false} is VALID [2018-11-23 11:52:17,087 INFO L273 TraceCheckUtils]: 68: Hoare triple {11278#false} assume 0 == ~cond; {11278#false} is VALID [2018-11-23 11:52:17,088 INFO L273 TraceCheckUtils]: 69: Hoare triple {11278#false} assume !false; {11278#false} is VALID [2018-11-23 11:52:17,092 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 1 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:17,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:17,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-11-23 11:52:17,112 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 70 [2018-11-23 11:52:17,112 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:17,112 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 11:52:17,181 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:17,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 11:52:17,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 11:52:17,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:52:17,182 INFO L87 Difference]: Start difference. First operand 129 states and 168 transitions. Second operand 22 states. [2018-11-23 11:52:17,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:17,536 INFO L93 Difference]: Finished difference Result 262 states and 346 transitions. [2018-11-23 11:52:17,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 11:52:17,536 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 70 [2018-11-23 11:52:17,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:17,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:52:17,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 125 transitions. [2018-11-23 11:52:17,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:52:17,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 125 transitions. [2018-11-23 11:52:17,538 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 125 transitions. [2018-11-23 11:52:17,660 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:17,663 INFO L225 Difference]: With dead ends: 262 [2018-11-23 11:52:17,663 INFO L226 Difference]: Without dead ends: 139 [2018-11-23 11:52:17,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:52:17,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-23 11:52:17,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2018-11-23 11:52:17,730 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:17,730 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand 135 states. [2018-11-23 11:52:17,730 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand 135 states. [2018-11-23 11:52:17,730 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 135 states. [2018-11-23 11:52:17,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:17,733 INFO L93 Difference]: Finished difference Result 139 states and 182 transitions. [2018-11-23 11:52:17,733 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 182 transitions. [2018-11-23 11:52:17,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:17,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:17,734 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand 139 states. [2018-11-23 11:52:17,734 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 139 states. [2018-11-23 11:52:17,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:17,737 INFO L93 Difference]: Finished difference Result 139 states and 182 transitions. [2018-11-23 11:52:17,737 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 182 transitions. [2018-11-23 11:52:17,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:17,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:17,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:17,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:17,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-23 11:52:17,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 176 transitions. [2018-11-23 11:52:17,740 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 176 transitions. Word has length 70 [2018-11-23 11:52:17,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:17,740 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 176 transitions. [2018-11-23 11:52:17,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 11:52:17,740 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 176 transitions. [2018-11-23 11:52:17,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 11:52:17,741 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:17,741 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:17,741 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:17,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:17,742 INFO L82 PathProgramCache]: Analyzing trace with hash -369649816, now seen corresponding path program 19 times [2018-11-23 11:52:17,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:17,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:17,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:17,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:17,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:17,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:18,072 INFO L256 TraceCheckUtils]: 0: Hoare triple {12324#true} call ULTIMATE.init(); {12324#true} is VALID [2018-11-23 11:52:18,072 INFO L273 TraceCheckUtils]: 1: Hoare triple {12324#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12324#true} is VALID [2018-11-23 11:52:18,073 INFO L273 TraceCheckUtils]: 2: Hoare triple {12324#true} assume true; {12324#true} is VALID [2018-11-23 11:52:18,073 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12324#true} {12324#true} #79#return; {12324#true} is VALID [2018-11-23 11:52:18,073 INFO L256 TraceCheckUtils]: 4: Hoare triple {12324#true} call #t~ret8 := main(); {12324#true} is VALID [2018-11-23 11:52:18,073 INFO L273 TraceCheckUtils]: 5: Hoare triple {12324#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {12324#true} is VALID [2018-11-23 11:52:18,073 INFO L273 TraceCheckUtils]: 6: Hoare triple {12324#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {12326#(= main_~i~0 1)} is VALID [2018-11-23 11:52:18,074 INFO L273 TraceCheckUtils]: 7: Hoare triple {12326#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {12326#(= main_~i~0 1)} is VALID [2018-11-23 11:52:18,074 INFO L273 TraceCheckUtils]: 8: Hoare triple {12326#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12326#(= main_~i~0 1)} is VALID [2018-11-23 11:52:18,074 INFO L273 TraceCheckUtils]: 9: Hoare triple {12326#(= main_~i~0 1)} ~i~0 := 1 + ~i~0; {12327#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:18,075 INFO L273 TraceCheckUtils]: 10: Hoare triple {12327#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {12327#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:18,075 INFO L273 TraceCheckUtils]: 11: Hoare triple {12327#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12327#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:18,075 INFO L273 TraceCheckUtils]: 12: Hoare triple {12327#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {12328#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:18,076 INFO L273 TraceCheckUtils]: 13: Hoare triple {12328#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {12328#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:18,076 INFO L273 TraceCheckUtils]: 14: Hoare triple {12328#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12328#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:18,076 INFO L273 TraceCheckUtils]: 15: Hoare triple {12328#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {12329#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:18,077 INFO L273 TraceCheckUtils]: 16: Hoare triple {12329#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {12329#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:18,077 INFO L273 TraceCheckUtils]: 17: Hoare triple {12329#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12329#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:18,078 INFO L273 TraceCheckUtils]: 18: Hoare triple {12329#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {12330#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:18,078 INFO L273 TraceCheckUtils]: 19: Hoare triple {12330#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {12330#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:18,079 INFO L273 TraceCheckUtils]: 20: Hoare triple {12330#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12330#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:18,080 INFO L273 TraceCheckUtils]: 21: Hoare triple {12330#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {12331#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:18,080 INFO L273 TraceCheckUtils]: 22: Hoare triple {12331#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {12331#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:18,081 INFO L273 TraceCheckUtils]: 23: Hoare triple {12331#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12331#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:18,094 INFO L273 TraceCheckUtils]: 24: Hoare triple {12331#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {12332#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:18,094 INFO L273 TraceCheckUtils]: 25: Hoare triple {12332#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {12332#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:18,095 INFO L273 TraceCheckUtils]: 26: Hoare triple {12332#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12332#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:18,095 INFO L273 TraceCheckUtils]: 27: Hoare triple {12332#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {12333#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:18,096 INFO L273 TraceCheckUtils]: 28: Hoare triple {12333#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {12333#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:18,096 INFO L273 TraceCheckUtils]: 29: Hoare triple {12333#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12333#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:18,096 INFO L273 TraceCheckUtils]: 30: Hoare triple {12333#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {12334#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:18,097 INFO L273 TraceCheckUtils]: 31: Hoare triple {12334#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {12334#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:18,097 INFO L273 TraceCheckUtils]: 32: Hoare triple {12334#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12334#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:18,097 INFO L273 TraceCheckUtils]: 33: Hoare triple {12334#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {12335#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:18,098 INFO L273 TraceCheckUtils]: 34: Hoare triple {12335#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {12335#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:18,098 INFO L273 TraceCheckUtils]: 35: Hoare triple {12335#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12335#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:18,099 INFO L273 TraceCheckUtils]: 36: Hoare triple {12335#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {12336#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:18,099 INFO L273 TraceCheckUtils]: 37: Hoare triple {12336#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {12336#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:18,100 INFO L273 TraceCheckUtils]: 38: Hoare triple {12336#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12336#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:18,101 INFO L273 TraceCheckUtils]: 39: Hoare triple {12336#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {12337#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:18,101 INFO L273 TraceCheckUtils]: 40: Hoare triple {12337#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {12337#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:18,102 INFO L273 TraceCheckUtils]: 41: Hoare triple {12337#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12337#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:18,102 INFO L273 TraceCheckUtils]: 42: Hoare triple {12337#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {12338#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:18,103 INFO L273 TraceCheckUtils]: 43: Hoare triple {12338#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {12338#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:18,103 INFO L273 TraceCheckUtils]: 44: Hoare triple {12338#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12338#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:18,104 INFO L273 TraceCheckUtils]: 45: Hoare triple {12338#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {12339#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:18,105 INFO L273 TraceCheckUtils]: 46: Hoare triple {12339#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {12339#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:18,105 INFO L273 TraceCheckUtils]: 47: Hoare triple {12339#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12339#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:18,106 INFO L273 TraceCheckUtils]: 48: Hoare triple {12339#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {12340#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:18,107 INFO L273 TraceCheckUtils]: 49: Hoare triple {12340#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {12340#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:18,107 INFO L273 TraceCheckUtils]: 50: Hoare triple {12340#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12340#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:18,108 INFO L273 TraceCheckUtils]: 51: Hoare triple {12340#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {12341#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:18,108 INFO L273 TraceCheckUtils]: 52: Hoare triple {12341#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {12341#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:18,109 INFO L273 TraceCheckUtils]: 53: Hoare triple {12341#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12341#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:18,110 INFO L273 TraceCheckUtils]: 54: Hoare triple {12341#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {12342#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:18,110 INFO L273 TraceCheckUtils]: 55: Hoare triple {12342#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {12342#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:18,111 INFO L273 TraceCheckUtils]: 56: Hoare triple {12342#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12342#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:18,111 INFO L273 TraceCheckUtils]: 57: Hoare triple {12342#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {12343#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:18,112 INFO L273 TraceCheckUtils]: 58: Hoare triple {12343#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {12343#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:18,113 INFO L273 TraceCheckUtils]: 59: Hoare triple {12343#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12343#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:18,113 INFO L273 TraceCheckUtils]: 60: Hoare triple {12343#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {12344#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:18,114 INFO L273 TraceCheckUtils]: 61: Hoare triple {12344#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {12344#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:18,114 INFO L273 TraceCheckUtils]: 62: Hoare triple {12344#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12344#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:18,115 INFO L273 TraceCheckUtils]: 63: Hoare triple {12344#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {12345#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:18,116 INFO L273 TraceCheckUtils]: 64: Hoare triple {12345#(<= main_~i~0 20)} assume !(~i~0 < 100000); {12325#false} is VALID [2018-11-23 11:52:18,116 INFO L273 TraceCheckUtils]: 65: Hoare triple {12325#false} assume !(0 != ~swapped~0); {12325#false} is VALID [2018-11-23 11:52:18,116 INFO L273 TraceCheckUtils]: 66: Hoare triple {12325#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {12325#false} is VALID [2018-11-23 11:52:18,116 INFO L273 TraceCheckUtils]: 67: Hoare triple {12325#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {12325#false} is VALID [2018-11-23 11:52:18,117 INFO L273 TraceCheckUtils]: 68: Hoare triple {12325#false} assume !!(~y~0 < 100000);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); {12325#false} is VALID [2018-11-23 11:52:18,117 INFO L256 TraceCheckUtils]: 69: Hoare triple {12325#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {12325#false} is VALID [2018-11-23 11:52:18,117 INFO L273 TraceCheckUtils]: 70: Hoare triple {12325#false} ~cond := #in~cond; {12325#false} is VALID [2018-11-23 11:52:18,117 INFO L273 TraceCheckUtils]: 71: Hoare triple {12325#false} assume 0 == ~cond; {12325#false} is VALID [2018-11-23 11:52:18,117 INFO L273 TraceCheckUtils]: 72: Hoare triple {12325#false} assume !false; {12325#false} is VALID [2018-11-23 11:52:18,122 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 1 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:18,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:18,122 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:52:18,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:52:18,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:18,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:18,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:18,558 INFO L256 TraceCheckUtils]: 0: Hoare triple {12324#true} call ULTIMATE.init(); {12324#true} is VALID [2018-11-23 11:52:18,558 INFO L273 TraceCheckUtils]: 1: Hoare triple {12324#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12324#true} is VALID [2018-11-23 11:52:18,558 INFO L273 TraceCheckUtils]: 2: Hoare triple {12324#true} assume true; {12324#true} is VALID [2018-11-23 11:52:18,558 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12324#true} {12324#true} #79#return; {12324#true} is VALID [2018-11-23 11:52:18,558 INFO L256 TraceCheckUtils]: 4: Hoare triple {12324#true} call #t~ret8 := main(); {12324#true} is VALID [2018-11-23 11:52:18,559 INFO L273 TraceCheckUtils]: 5: Hoare triple {12324#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {12324#true} is VALID [2018-11-23 11:52:18,559 INFO L273 TraceCheckUtils]: 6: Hoare triple {12324#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {12367#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:18,560 INFO L273 TraceCheckUtils]: 7: Hoare triple {12367#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {12367#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:18,560 INFO L273 TraceCheckUtils]: 8: Hoare triple {12367#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12367#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:18,563 INFO L273 TraceCheckUtils]: 9: Hoare triple {12367#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {12327#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:18,563 INFO L273 TraceCheckUtils]: 10: Hoare triple {12327#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {12327#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:18,565 INFO L273 TraceCheckUtils]: 11: Hoare triple {12327#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12327#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:18,565 INFO L273 TraceCheckUtils]: 12: Hoare triple {12327#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {12328#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:18,568 INFO L273 TraceCheckUtils]: 13: Hoare triple {12328#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {12328#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:18,568 INFO L273 TraceCheckUtils]: 14: Hoare triple {12328#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12328#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:18,570 INFO L273 TraceCheckUtils]: 15: Hoare triple {12328#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {12329#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:18,570 INFO L273 TraceCheckUtils]: 16: Hoare triple {12329#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {12329#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:18,572 INFO L273 TraceCheckUtils]: 17: Hoare triple {12329#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12329#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:18,572 INFO L273 TraceCheckUtils]: 18: Hoare triple {12329#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {12330#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:18,575 INFO L273 TraceCheckUtils]: 19: Hoare triple {12330#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {12330#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:18,575 INFO L273 TraceCheckUtils]: 20: Hoare triple {12330#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12330#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:18,578 INFO L273 TraceCheckUtils]: 21: Hoare triple {12330#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {12331#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:18,578 INFO L273 TraceCheckUtils]: 22: Hoare triple {12331#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {12331#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:18,581 INFO L273 TraceCheckUtils]: 23: Hoare triple {12331#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12331#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:18,581 INFO L273 TraceCheckUtils]: 24: Hoare triple {12331#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {12332#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:18,583 INFO L273 TraceCheckUtils]: 25: Hoare triple {12332#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {12332#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:18,583 INFO L273 TraceCheckUtils]: 26: Hoare triple {12332#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12332#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:18,585 INFO L273 TraceCheckUtils]: 27: Hoare triple {12332#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {12333#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:18,585 INFO L273 TraceCheckUtils]: 28: Hoare triple {12333#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {12333#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:18,587 INFO L273 TraceCheckUtils]: 29: Hoare triple {12333#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12333#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:18,587 INFO L273 TraceCheckUtils]: 30: Hoare triple {12333#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {12334#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:18,590 INFO L273 TraceCheckUtils]: 31: Hoare triple {12334#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {12334#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:18,590 INFO L273 TraceCheckUtils]: 32: Hoare triple {12334#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12334#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:18,592 INFO L273 TraceCheckUtils]: 33: Hoare triple {12334#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {12335#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:18,592 INFO L273 TraceCheckUtils]: 34: Hoare triple {12335#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {12335#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:18,595 INFO L273 TraceCheckUtils]: 35: Hoare triple {12335#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12335#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:18,595 INFO L273 TraceCheckUtils]: 36: Hoare triple {12335#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {12336#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:18,598 INFO L273 TraceCheckUtils]: 37: Hoare triple {12336#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {12336#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:18,598 INFO L273 TraceCheckUtils]: 38: Hoare triple {12336#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12336#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:18,601 INFO L273 TraceCheckUtils]: 39: Hoare triple {12336#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {12337#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:18,601 INFO L273 TraceCheckUtils]: 40: Hoare triple {12337#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {12337#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:18,604 INFO L273 TraceCheckUtils]: 41: Hoare triple {12337#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12337#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:18,604 INFO L273 TraceCheckUtils]: 42: Hoare triple {12337#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {12338#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:18,607 INFO L273 TraceCheckUtils]: 43: Hoare triple {12338#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {12338#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:18,607 INFO L273 TraceCheckUtils]: 44: Hoare triple {12338#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12338#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:18,609 INFO L273 TraceCheckUtils]: 45: Hoare triple {12338#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {12339#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:18,609 INFO L273 TraceCheckUtils]: 46: Hoare triple {12339#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {12339#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:18,612 INFO L273 TraceCheckUtils]: 47: Hoare triple {12339#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12339#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:18,612 INFO L273 TraceCheckUtils]: 48: Hoare triple {12339#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {12340#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:18,615 INFO L273 TraceCheckUtils]: 49: Hoare triple {12340#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {12340#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:18,615 INFO L273 TraceCheckUtils]: 50: Hoare triple {12340#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12340#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:18,617 INFO L273 TraceCheckUtils]: 51: Hoare triple {12340#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {12341#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:18,617 INFO L273 TraceCheckUtils]: 52: Hoare triple {12341#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {12341#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:18,619 INFO L273 TraceCheckUtils]: 53: Hoare triple {12341#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12341#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:18,619 INFO L273 TraceCheckUtils]: 54: Hoare triple {12341#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {12342#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:18,622 INFO L273 TraceCheckUtils]: 55: Hoare triple {12342#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {12342#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:18,622 INFO L273 TraceCheckUtils]: 56: Hoare triple {12342#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12342#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:18,625 INFO L273 TraceCheckUtils]: 57: Hoare triple {12342#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {12343#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:18,625 INFO L273 TraceCheckUtils]: 58: Hoare triple {12343#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {12343#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:18,627 INFO L273 TraceCheckUtils]: 59: Hoare triple {12343#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12343#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:18,627 INFO L273 TraceCheckUtils]: 60: Hoare triple {12343#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {12344#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:18,629 INFO L273 TraceCheckUtils]: 61: Hoare triple {12344#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {12344#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:18,629 INFO L273 TraceCheckUtils]: 62: Hoare triple {12344#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12344#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:18,631 INFO L273 TraceCheckUtils]: 63: Hoare triple {12344#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {12345#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:18,631 INFO L273 TraceCheckUtils]: 64: Hoare triple {12345#(<= main_~i~0 20)} assume !(~i~0 < 100000); {12325#false} is VALID [2018-11-23 11:52:18,631 INFO L273 TraceCheckUtils]: 65: Hoare triple {12325#false} assume !(0 != ~swapped~0); {12325#false} is VALID [2018-11-23 11:52:18,631 INFO L273 TraceCheckUtils]: 66: Hoare triple {12325#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {12325#false} is VALID [2018-11-23 11:52:18,631 INFO L273 TraceCheckUtils]: 67: Hoare triple {12325#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {12325#false} is VALID [2018-11-23 11:52:18,632 INFO L273 TraceCheckUtils]: 68: Hoare triple {12325#false} assume !!(~y~0 < 100000);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); {12325#false} is VALID [2018-11-23 11:52:18,632 INFO L256 TraceCheckUtils]: 69: Hoare triple {12325#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {12325#false} is VALID [2018-11-23 11:52:18,632 INFO L273 TraceCheckUtils]: 70: Hoare triple {12325#false} ~cond := #in~cond; {12325#false} is VALID [2018-11-23 11:52:18,632 INFO L273 TraceCheckUtils]: 71: Hoare triple {12325#false} assume 0 == ~cond; {12325#false} is VALID [2018-11-23 11:52:18,632 INFO L273 TraceCheckUtils]: 72: Hoare triple {12325#false} assume !false; {12325#false} is VALID [2018-11-23 11:52:18,635 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 1 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:18,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:18,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-23 11:52:18,655 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 73 [2018-11-23 11:52:18,655 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:18,655 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 11:52:18,774 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:18,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 11:52:18,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 11:52:18,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 11:52:18,775 INFO L87 Difference]: Start difference. First operand 135 states and 176 transitions. Second operand 23 states. [2018-11-23 11:52:19,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:19,394 INFO L93 Difference]: Finished difference Result 274 states and 362 transitions. [2018-11-23 11:52:19,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 11:52:19,394 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 73 [2018-11-23 11:52:19,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:19,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:52:19,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 129 transitions. [2018-11-23 11:52:19,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:52:19,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 129 transitions. [2018-11-23 11:52:19,396 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 129 transitions. [2018-11-23 11:52:19,520 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:19,523 INFO L225 Difference]: With dead ends: 274 [2018-11-23 11:52:19,523 INFO L226 Difference]: Without dead ends: 145 [2018-11-23 11:52:19,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 11:52:19,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-11-23 11:52:19,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 141. [2018-11-23 11:52:19,588 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:19,588 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand 141 states. [2018-11-23 11:52:19,588 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand 141 states. [2018-11-23 11:52:19,588 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 141 states. [2018-11-23 11:52:19,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:19,591 INFO L93 Difference]: Finished difference Result 145 states and 190 transitions. [2018-11-23 11:52:19,591 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 190 transitions. [2018-11-23 11:52:19,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:19,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:19,591 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand 145 states. [2018-11-23 11:52:19,591 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 145 states. [2018-11-23 11:52:19,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:19,593 INFO L93 Difference]: Finished difference Result 145 states and 190 transitions. [2018-11-23 11:52:19,593 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 190 transitions. [2018-11-23 11:52:19,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:19,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:19,594 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:19,594 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:19,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-23 11:52:19,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 184 transitions. [2018-11-23 11:52:19,596 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 184 transitions. Word has length 73 [2018-11-23 11:52:19,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:19,597 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 184 transitions. [2018-11-23 11:52:19,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 11:52:19,597 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 184 transitions. [2018-11-23 11:52:19,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 11:52:19,598 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:19,598 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:19,598 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:19,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:19,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1228861679, now seen corresponding path program 20 times [2018-11-23 11:52:19,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:19,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:19,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:19,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:52:19,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:19,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:20,288 INFO L256 TraceCheckUtils]: 0: Hoare triple {13417#true} call ULTIMATE.init(); {13417#true} is VALID [2018-11-23 11:52:20,288 INFO L273 TraceCheckUtils]: 1: Hoare triple {13417#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13417#true} is VALID [2018-11-23 11:52:20,288 INFO L273 TraceCheckUtils]: 2: Hoare triple {13417#true} assume true; {13417#true} is VALID [2018-11-23 11:52:20,288 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13417#true} {13417#true} #79#return; {13417#true} is VALID [2018-11-23 11:52:20,288 INFO L256 TraceCheckUtils]: 4: Hoare triple {13417#true} call #t~ret8 := main(); {13417#true} is VALID [2018-11-23 11:52:20,289 INFO L273 TraceCheckUtils]: 5: Hoare triple {13417#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {13417#true} is VALID [2018-11-23 11:52:20,289 INFO L273 TraceCheckUtils]: 6: Hoare triple {13417#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {13419#(= main_~i~0 1)} is VALID [2018-11-23 11:52:20,290 INFO L273 TraceCheckUtils]: 7: Hoare triple {13419#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {13419#(= main_~i~0 1)} is VALID [2018-11-23 11:52:20,290 INFO L273 TraceCheckUtils]: 8: Hoare triple {13419#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {13419#(= main_~i~0 1)} is VALID [2018-11-23 11:52:20,291 INFO L273 TraceCheckUtils]: 9: Hoare triple {13419#(= main_~i~0 1)} ~i~0 := 1 + ~i~0; {13420#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:20,291 INFO L273 TraceCheckUtils]: 10: Hoare triple {13420#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {13420#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:20,291 INFO L273 TraceCheckUtils]: 11: Hoare triple {13420#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {13420#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:20,292 INFO L273 TraceCheckUtils]: 12: Hoare triple {13420#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {13421#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:20,292 INFO L273 TraceCheckUtils]: 13: Hoare triple {13421#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {13421#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:20,292 INFO L273 TraceCheckUtils]: 14: Hoare triple {13421#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {13421#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:20,293 INFO L273 TraceCheckUtils]: 15: Hoare triple {13421#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {13422#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:20,293 INFO L273 TraceCheckUtils]: 16: Hoare triple {13422#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {13422#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:20,293 INFO L273 TraceCheckUtils]: 17: Hoare triple {13422#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {13422#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:20,294 INFO L273 TraceCheckUtils]: 18: Hoare triple {13422#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {13423#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:20,295 INFO L273 TraceCheckUtils]: 19: Hoare triple {13423#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {13423#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:20,295 INFO L273 TraceCheckUtils]: 20: Hoare triple {13423#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {13423#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:20,296 INFO L273 TraceCheckUtils]: 21: Hoare triple {13423#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {13424#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:20,296 INFO L273 TraceCheckUtils]: 22: Hoare triple {13424#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {13424#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:20,297 INFO L273 TraceCheckUtils]: 23: Hoare triple {13424#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {13424#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:20,297 INFO L273 TraceCheckUtils]: 24: Hoare triple {13424#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {13425#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:20,298 INFO L273 TraceCheckUtils]: 25: Hoare triple {13425#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {13425#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:20,298 INFO L273 TraceCheckUtils]: 26: Hoare triple {13425#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {13425#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:20,299 INFO L273 TraceCheckUtils]: 27: Hoare triple {13425#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {13426#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:20,300 INFO L273 TraceCheckUtils]: 28: Hoare triple {13426#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {13426#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:20,300 INFO L273 TraceCheckUtils]: 29: Hoare triple {13426#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {13426#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:20,301 INFO L273 TraceCheckUtils]: 30: Hoare triple {13426#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {13427#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:20,301 INFO L273 TraceCheckUtils]: 31: Hoare triple {13427#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {13427#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:20,302 INFO L273 TraceCheckUtils]: 32: Hoare triple {13427#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {13427#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:20,302 INFO L273 TraceCheckUtils]: 33: Hoare triple {13427#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {13428#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:20,303 INFO L273 TraceCheckUtils]: 34: Hoare triple {13428#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {13428#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:20,303 INFO L273 TraceCheckUtils]: 35: Hoare triple {13428#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {13428#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:20,304 INFO L273 TraceCheckUtils]: 36: Hoare triple {13428#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {13429#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:20,305 INFO L273 TraceCheckUtils]: 37: Hoare triple {13429#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {13429#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:20,305 INFO L273 TraceCheckUtils]: 38: Hoare triple {13429#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {13429#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:20,306 INFO L273 TraceCheckUtils]: 39: Hoare triple {13429#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {13430#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:20,306 INFO L273 TraceCheckUtils]: 40: Hoare triple {13430#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {13430#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:20,307 INFO L273 TraceCheckUtils]: 41: Hoare triple {13430#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {13430#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:20,307 INFO L273 TraceCheckUtils]: 42: Hoare triple {13430#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {13431#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:20,308 INFO L273 TraceCheckUtils]: 43: Hoare triple {13431#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {13431#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:20,308 INFO L273 TraceCheckUtils]: 44: Hoare triple {13431#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {13431#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:20,309 INFO L273 TraceCheckUtils]: 45: Hoare triple {13431#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {13432#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:20,310 INFO L273 TraceCheckUtils]: 46: Hoare triple {13432#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {13432#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:20,310 INFO L273 TraceCheckUtils]: 47: Hoare triple {13432#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {13432#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:20,311 INFO L273 TraceCheckUtils]: 48: Hoare triple {13432#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {13433#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:20,311 INFO L273 TraceCheckUtils]: 49: Hoare triple {13433#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {13433#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:20,312 INFO L273 TraceCheckUtils]: 50: Hoare triple {13433#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {13433#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:20,313 INFO L273 TraceCheckUtils]: 51: Hoare triple {13433#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {13434#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:20,313 INFO L273 TraceCheckUtils]: 52: Hoare triple {13434#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {13434#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:20,313 INFO L273 TraceCheckUtils]: 53: Hoare triple {13434#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {13434#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:20,314 INFO L273 TraceCheckUtils]: 54: Hoare triple {13434#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {13435#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:20,315 INFO L273 TraceCheckUtils]: 55: Hoare triple {13435#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {13435#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:20,315 INFO L273 TraceCheckUtils]: 56: Hoare triple {13435#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {13435#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:20,316 INFO L273 TraceCheckUtils]: 57: Hoare triple {13435#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {13436#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:20,316 INFO L273 TraceCheckUtils]: 58: Hoare triple {13436#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {13436#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:20,317 INFO L273 TraceCheckUtils]: 59: Hoare triple {13436#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {13436#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:20,318 INFO L273 TraceCheckUtils]: 60: Hoare triple {13436#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {13437#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:20,318 INFO L273 TraceCheckUtils]: 61: Hoare triple {13437#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {13437#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:20,319 INFO L273 TraceCheckUtils]: 62: Hoare triple {13437#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {13437#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:20,319 INFO L273 TraceCheckUtils]: 63: Hoare triple {13437#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {13438#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:20,320 INFO L273 TraceCheckUtils]: 64: Hoare triple {13438#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {13438#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:20,320 INFO L273 TraceCheckUtils]: 65: Hoare triple {13438#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {13438#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:20,321 INFO L273 TraceCheckUtils]: 66: Hoare triple {13438#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {13439#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:20,322 INFO L273 TraceCheckUtils]: 67: Hoare triple {13439#(<= main_~i~0 21)} assume !(~i~0 < 100000); {13418#false} is VALID [2018-11-23 11:52:20,322 INFO L273 TraceCheckUtils]: 68: Hoare triple {13418#false} assume !(0 != ~swapped~0); {13418#false} is VALID [2018-11-23 11:52:20,322 INFO L273 TraceCheckUtils]: 69: Hoare triple {13418#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {13418#false} is VALID [2018-11-23 11:52:20,322 INFO L273 TraceCheckUtils]: 70: Hoare triple {13418#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {13418#false} is VALID [2018-11-23 11:52:20,322 INFO L273 TraceCheckUtils]: 71: Hoare triple {13418#false} assume !!(~y~0 < 100000);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); {13418#false} is VALID [2018-11-23 11:52:20,323 INFO L256 TraceCheckUtils]: 72: Hoare triple {13418#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {13418#false} is VALID [2018-11-23 11:52:20,323 INFO L273 TraceCheckUtils]: 73: Hoare triple {13418#false} ~cond := #in~cond; {13418#false} is VALID [2018-11-23 11:52:20,323 INFO L273 TraceCheckUtils]: 74: Hoare triple {13418#false} assume 0 == ~cond; {13418#false} is VALID [2018-11-23 11:52:20,323 INFO L273 TraceCheckUtils]: 75: Hoare triple {13418#false} assume !false; {13418#false} is VALID [2018-11-23 11:52:20,328 INFO L134 CoverageAnalysis]: Checked inductivity of 591 backedges. 1 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:20,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:20,328 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:52:20,336 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:52:20,395 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:52:20,395 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:20,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:20,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:20,636 INFO L256 TraceCheckUtils]: 0: Hoare triple {13417#true} call ULTIMATE.init(); {13417#true} is VALID [2018-11-23 11:52:20,636 INFO L273 TraceCheckUtils]: 1: Hoare triple {13417#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13417#true} is VALID [2018-11-23 11:52:20,637 INFO L273 TraceCheckUtils]: 2: Hoare triple {13417#true} assume true; {13417#true} is VALID [2018-11-23 11:52:20,637 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13417#true} {13417#true} #79#return; {13417#true} is VALID [2018-11-23 11:52:20,637 INFO L256 TraceCheckUtils]: 4: Hoare triple {13417#true} call #t~ret8 := main(); {13417#true} is VALID [2018-11-23 11:52:20,637 INFO L273 TraceCheckUtils]: 5: Hoare triple {13417#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {13417#true} is VALID [2018-11-23 11:52:20,638 INFO L273 TraceCheckUtils]: 6: Hoare triple {13417#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {13461#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:20,638 INFO L273 TraceCheckUtils]: 7: Hoare triple {13461#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {13461#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:20,639 INFO L273 TraceCheckUtils]: 8: Hoare triple {13461#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {13461#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:20,639 INFO L273 TraceCheckUtils]: 9: Hoare triple {13461#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {13420#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:20,640 INFO L273 TraceCheckUtils]: 10: Hoare triple {13420#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {13420#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:20,640 INFO L273 TraceCheckUtils]: 11: Hoare triple {13420#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {13420#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:20,640 INFO L273 TraceCheckUtils]: 12: Hoare triple {13420#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {13421#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:20,641 INFO L273 TraceCheckUtils]: 13: Hoare triple {13421#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {13421#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:20,641 INFO L273 TraceCheckUtils]: 14: Hoare triple {13421#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {13421#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:20,642 INFO L273 TraceCheckUtils]: 15: Hoare triple {13421#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {13422#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:20,642 INFO L273 TraceCheckUtils]: 16: Hoare triple {13422#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {13422#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:20,643 INFO L273 TraceCheckUtils]: 17: Hoare triple {13422#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {13422#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:20,644 INFO L273 TraceCheckUtils]: 18: Hoare triple {13422#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {13423#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:20,644 INFO L273 TraceCheckUtils]: 19: Hoare triple {13423#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {13423#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:20,645 INFO L273 TraceCheckUtils]: 20: Hoare triple {13423#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {13423#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:20,645 INFO L273 TraceCheckUtils]: 21: Hoare triple {13423#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {13424#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:20,646 INFO L273 TraceCheckUtils]: 22: Hoare triple {13424#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {13424#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:20,647 INFO L273 TraceCheckUtils]: 23: Hoare triple {13424#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {13424#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:20,647 INFO L273 TraceCheckUtils]: 24: Hoare triple {13424#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {13425#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:20,648 INFO L273 TraceCheckUtils]: 25: Hoare triple {13425#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {13425#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:20,648 INFO L273 TraceCheckUtils]: 26: Hoare triple {13425#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {13425#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:20,649 INFO L273 TraceCheckUtils]: 27: Hoare triple {13425#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {13426#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:20,650 INFO L273 TraceCheckUtils]: 28: Hoare triple {13426#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {13426#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:20,650 INFO L273 TraceCheckUtils]: 29: Hoare triple {13426#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {13426#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:20,651 INFO L273 TraceCheckUtils]: 30: Hoare triple {13426#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {13427#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:20,651 INFO L273 TraceCheckUtils]: 31: Hoare triple {13427#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {13427#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:20,652 INFO L273 TraceCheckUtils]: 32: Hoare triple {13427#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {13427#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:20,653 INFO L273 TraceCheckUtils]: 33: Hoare triple {13427#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {13428#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:20,653 INFO L273 TraceCheckUtils]: 34: Hoare triple {13428#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {13428#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:20,654 INFO L273 TraceCheckUtils]: 35: Hoare triple {13428#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {13428#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:20,654 INFO L273 TraceCheckUtils]: 36: Hoare triple {13428#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {13429#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:20,655 INFO L273 TraceCheckUtils]: 37: Hoare triple {13429#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {13429#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:20,655 INFO L273 TraceCheckUtils]: 38: Hoare triple {13429#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {13429#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:20,656 INFO L273 TraceCheckUtils]: 39: Hoare triple {13429#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {13430#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:20,657 INFO L273 TraceCheckUtils]: 40: Hoare triple {13430#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {13430#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:20,657 INFO L273 TraceCheckUtils]: 41: Hoare triple {13430#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {13430#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:20,658 INFO L273 TraceCheckUtils]: 42: Hoare triple {13430#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {13431#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:20,658 INFO L273 TraceCheckUtils]: 43: Hoare triple {13431#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {13431#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:20,659 INFO L273 TraceCheckUtils]: 44: Hoare triple {13431#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {13431#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:20,660 INFO L273 TraceCheckUtils]: 45: Hoare triple {13431#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {13432#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:20,660 INFO L273 TraceCheckUtils]: 46: Hoare triple {13432#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {13432#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:20,661 INFO L273 TraceCheckUtils]: 47: Hoare triple {13432#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {13432#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:20,661 INFO L273 TraceCheckUtils]: 48: Hoare triple {13432#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {13433#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:20,662 INFO L273 TraceCheckUtils]: 49: Hoare triple {13433#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {13433#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:20,662 INFO L273 TraceCheckUtils]: 50: Hoare triple {13433#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {13433#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:20,663 INFO L273 TraceCheckUtils]: 51: Hoare triple {13433#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {13434#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:20,664 INFO L273 TraceCheckUtils]: 52: Hoare triple {13434#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {13434#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:20,664 INFO L273 TraceCheckUtils]: 53: Hoare triple {13434#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {13434#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:20,665 INFO L273 TraceCheckUtils]: 54: Hoare triple {13434#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {13435#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:20,665 INFO L273 TraceCheckUtils]: 55: Hoare triple {13435#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {13435#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:20,666 INFO L273 TraceCheckUtils]: 56: Hoare triple {13435#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {13435#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:20,667 INFO L273 TraceCheckUtils]: 57: Hoare triple {13435#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {13436#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:20,667 INFO L273 TraceCheckUtils]: 58: Hoare triple {13436#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {13436#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:20,668 INFO L273 TraceCheckUtils]: 59: Hoare triple {13436#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {13436#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:20,669 INFO L273 TraceCheckUtils]: 60: Hoare triple {13436#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {13437#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:20,669 INFO L273 TraceCheckUtils]: 61: Hoare triple {13437#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {13437#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:20,670 INFO L273 TraceCheckUtils]: 62: Hoare triple {13437#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {13437#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:20,670 INFO L273 TraceCheckUtils]: 63: Hoare triple {13437#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {13438#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:20,671 INFO L273 TraceCheckUtils]: 64: Hoare triple {13438#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {13438#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:20,671 INFO L273 TraceCheckUtils]: 65: Hoare triple {13438#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {13438#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:20,672 INFO L273 TraceCheckUtils]: 66: Hoare triple {13438#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {13439#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:20,673 INFO L273 TraceCheckUtils]: 67: Hoare triple {13439#(<= main_~i~0 21)} assume !(~i~0 < 100000); {13418#false} is VALID [2018-11-23 11:52:20,673 INFO L273 TraceCheckUtils]: 68: Hoare triple {13418#false} assume !(0 != ~swapped~0); {13418#false} is VALID [2018-11-23 11:52:20,673 INFO L273 TraceCheckUtils]: 69: Hoare triple {13418#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {13418#false} is VALID [2018-11-23 11:52:20,673 INFO L273 TraceCheckUtils]: 70: Hoare triple {13418#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {13418#false} is VALID [2018-11-23 11:52:20,674 INFO L273 TraceCheckUtils]: 71: Hoare triple {13418#false} assume !!(~y~0 < 100000);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); {13418#false} is VALID [2018-11-23 11:52:20,674 INFO L256 TraceCheckUtils]: 72: Hoare triple {13418#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {13418#false} is VALID [2018-11-23 11:52:20,674 INFO L273 TraceCheckUtils]: 73: Hoare triple {13418#false} ~cond := #in~cond; {13418#false} is VALID [2018-11-23 11:52:20,674 INFO L273 TraceCheckUtils]: 74: Hoare triple {13418#false} assume 0 == ~cond; {13418#false} is VALID [2018-11-23 11:52:20,674 INFO L273 TraceCheckUtils]: 75: Hoare triple {13418#false} assume !false; {13418#false} is VALID [2018-11-23 11:52:20,679 INFO L134 CoverageAnalysis]: Checked inductivity of 591 backedges. 1 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:20,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:20,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-23 11:52:20,699 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 76 [2018-11-23 11:52:20,699 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:20,699 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 11:52:20,775 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:20,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 11:52:20,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 11:52:20,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 11:52:20,776 INFO L87 Difference]: Start difference. First operand 141 states and 184 transitions. Second operand 24 states. [2018-11-23 11:52:21,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:21,352 INFO L93 Difference]: Finished difference Result 286 states and 378 transitions. [2018-11-23 11:52:21,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 11:52:21,353 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 76 [2018-11-23 11:52:21,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:21,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:52:21,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 133 transitions. [2018-11-23 11:52:21,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:52:21,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 133 transitions. [2018-11-23 11:52:21,355 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 133 transitions. [2018-11-23 11:52:21,477 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:21,480 INFO L225 Difference]: With dead ends: 286 [2018-11-23 11:52:21,480 INFO L226 Difference]: Without dead ends: 151 [2018-11-23 11:52:21,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 11:52:21,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-11-23 11:52:21,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 147. [2018-11-23 11:52:21,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:21,529 INFO L82 GeneralOperation]: Start isEquivalent. First operand 151 states. Second operand 147 states. [2018-11-23 11:52:21,529 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand 147 states. [2018-11-23 11:52:21,529 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 147 states. [2018-11-23 11:52:21,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:21,532 INFO L93 Difference]: Finished difference Result 151 states and 198 transitions. [2018-11-23 11:52:21,532 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 198 transitions. [2018-11-23 11:52:21,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:21,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:21,533 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand 151 states. [2018-11-23 11:52:21,533 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 151 states. [2018-11-23 11:52:21,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:21,535 INFO L93 Difference]: Finished difference Result 151 states and 198 transitions. [2018-11-23 11:52:21,535 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 198 transitions. [2018-11-23 11:52:21,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:21,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:21,536 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:21,536 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:21,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-23 11:52:21,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 192 transitions. [2018-11-23 11:52:21,539 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 192 transitions. Word has length 76 [2018-11-23 11:52:21,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:21,539 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 192 transitions. [2018-11-23 11:52:21,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 11:52:21,540 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 192 transitions. [2018-11-23 11:52:21,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 11:52:21,541 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:21,541 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:21,541 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:21,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:21,541 INFO L82 PathProgramCache]: Analyzing trace with hash -4388152, now seen corresponding path program 21 times [2018-11-23 11:52:21,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:21,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:21,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:21,542 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:21,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:21,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:21,945 INFO L256 TraceCheckUtils]: 0: Hoare triple {14556#true} call ULTIMATE.init(); {14556#true} is VALID [2018-11-23 11:52:21,946 INFO L273 TraceCheckUtils]: 1: Hoare triple {14556#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14556#true} is VALID [2018-11-23 11:52:21,946 INFO L273 TraceCheckUtils]: 2: Hoare triple {14556#true} assume true; {14556#true} is VALID [2018-11-23 11:52:21,946 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14556#true} {14556#true} #79#return; {14556#true} is VALID [2018-11-23 11:52:21,946 INFO L256 TraceCheckUtils]: 4: Hoare triple {14556#true} call #t~ret8 := main(); {14556#true} is VALID [2018-11-23 11:52:21,946 INFO L273 TraceCheckUtils]: 5: Hoare triple {14556#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {14556#true} is VALID [2018-11-23 11:52:21,947 INFO L273 TraceCheckUtils]: 6: Hoare triple {14556#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {14558#(= main_~i~0 1)} is VALID [2018-11-23 11:52:21,947 INFO L273 TraceCheckUtils]: 7: Hoare triple {14558#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {14558#(= main_~i~0 1)} is VALID [2018-11-23 11:52:21,948 INFO L273 TraceCheckUtils]: 8: Hoare triple {14558#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14558#(= main_~i~0 1)} is VALID [2018-11-23 11:52:21,948 INFO L273 TraceCheckUtils]: 9: Hoare triple {14558#(= main_~i~0 1)} ~i~0 := 1 + ~i~0; {14559#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:21,949 INFO L273 TraceCheckUtils]: 10: Hoare triple {14559#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {14559#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:21,949 INFO L273 TraceCheckUtils]: 11: Hoare triple {14559#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14559#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:21,949 INFO L273 TraceCheckUtils]: 12: Hoare triple {14559#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {14560#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:21,950 INFO L273 TraceCheckUtils]: 13: Hoare triple {14560#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {14560#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:21,950 INFO L273 TraceCheckUtils]: 14: Hoare triple {14560#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14560#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:21,951 INFO L273 TraceCheckUtils]: 15: Hoare triple {14560#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {14561#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:21,951 INFO L273 TraceCheckUtils]: 16: Hoare triple {14561#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {14561#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:21,952 INFO L273 TraceCheckUtils]: 17: Hoare triple {14561#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14561#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:21,953 INFO L273 TraceCheckUtils]: 18: Hoare triple {14561#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {14562#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:21,953 INFO L273 TraceCheckUtils]: 19: Hoare triple {14562#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {14562#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:21,954 INFO L273 TraceCheckUtils]: 20: Hoare triple {14562#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14562#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:21,954 INFO L273 TraceCheckUtils]: 21: Hoare triple {14562#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {14563#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:21,955 INFO L273 TraceCheckUtils]: 22: Hoare triple {14563#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {14563#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:21,955 INFO L273 TraceCheckUtils]: 23: Hoare triple {14563#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14563#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:21,956 INFO L273 TraceCheckUtils]: 24: Hoare triple {14563#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {14564#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:21,957 INFO L273 TraceCheckUtils]: 25: Hoare triple {14564#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {14564#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:21,957 INFO L273 TraceCheckUtils]: 26: Hoare triple {14564#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14564#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:21,958 INFO L273 TraceCheckUtils]: 27: Hoare triple {14564#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {14565#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:21,959 INFO L273 TraceCheckUtils]: 28: Hoare triple {14565#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {14565#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:21,959 INFO L273 TraceCheckUtils]: 29: Hoare triple {14565#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14565#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:21,960 INFO L273 TraceCheckUtils]: 30: Hoare triple {14565#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {14566#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:21,960 INFO L273 TraceCheckUtils]: 31: Hoare triple {14566#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {14566#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:21,961 INFO L273 TraceCheckUtils]: 32: Hoare triple {14566#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14566#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:21,962 INFO L273 TraceCheckUtils]: 33: Hoare triple {14566#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {14567#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:21,962 INFO L273 TraceCheckUtils]: 34: Hoare triple {14567#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {14567#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:21,963 INFO L273 TraceCheckUtils]: 35: Hoare triple {14567#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14567#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:21,963 INFO L273 TraceCheckUtils]: 36: Hoare triple {14567#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {14568#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:21,964 INFO L273 TraceCheckUtils]: 37: Hoare triple {14568#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {14568#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:21,964 INFO L273 TraceCheckUtils]: 38: Hoare triple {14568#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14568#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:21,965 INFO L273 TraceCheckUtils]: 39: Hoare triple {14568#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {14569#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:21,966 INFO L273 TraceCheckUtils]: 40: Hoare triple {14569#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {14569#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:21,966 INFO L273 TraceCheckUtils]: 41: Hoare triple {14569#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14569#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:21,967 INFO L273 TraceCheckUtils]: 42: Hoare triple {14569#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {14570#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:21,967 INFO L273 TraceCheckUtils]: 43: Hoare triple {14570#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {14570#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:21,968 INFO L273 TraceCheckUtils]: 44: Hoare triple {14570#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14570#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:21,969 INFO L273 TraceCheckUtils]: 45: Hoare triple {14570#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {14571#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:21,969 INFO L273 TraceCheckUtils]: 46: Hoare triple {14571#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {14571#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:21,970 INFO L273 TraceCheckUtils]: 47: Hoare triple {14571#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14571#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:21,970 INFO L273 TraceCheckUtils]: 48: Hoare triple {14571#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {14572#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:21,971 INFO L273 TraceCheckUtils]: 49: Hoare triple {14572#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {14572#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:21,972 INFO L273 TraceCheckUtils]: 50: Hoare triple {14572#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14572#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:21,972 INFO L273 TraceCheckUtils]: 51: Hoare triple {14572#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {14573#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:21,973 INFO L273 TraceCheckUtils]: 52: Hoare triple {14573#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {14573#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:21,973 INFO L273 TraceCheckUtils]: 53: Hoare triple {14573#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14573#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:21,974 INFO L273 TraceCheckUtils]: 54: Hoare triple {14573#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {14574#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:21,975 INFO L273 TraceCheckUtils]: 55: Hoare triple {14574#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {14574#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:21,975 INFO L273 TraceCheckUtils]: 56: Hoare triple {14574#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14574#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:21,976 INFO L273 TraceCheckUtils]: 57: Hoare triple {14574#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {14575#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:21,976 INFO L273 TraceCheckUtils]: 58: Hoare triple {14575#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {14575#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:21,977 INFO L273 TraceCheckUtils]: 59: Hoare triple {14575#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14575#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:21,978 INFO L273 TraceCheckUtils]: 60: Hoare triple {14575#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {14576#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:21,978 INFO L273 TraceCheckUtils]: 61: Hoare triple {14576#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {14576#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:21,979 INFO L273 TraceCheckUtils]: 62: Hoare triple {14576#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14576#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:21,979 INFO L273 TraceCheckUtils]: 63: Hoare triple {14576#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {14577#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:21,980 INFO L273 TraceCheckUtils]: 64: Hoare triple {14577#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {14577#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:21,981 INFO L273 TraceCheckUtils]: 65: Hoare triple {14577#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14577#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:21,981 INFO L273 TraceCheckUtils]: 66: Hoare triple {14577#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {14578#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:21,982 INFO L273 TraceCheckUtils]: 67: Hoare triple {14578#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {14578#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:21,982 INFO L273 TraceCheckUtils]: 68: Hoare triple {14578#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14578#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:21,983 INFO L273 TraceCheckUtils]: 69: Hoare triple {14578#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {14579#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:21,984 INFO L273 TraceCheckUtils]: 70: Hoare triple {14579#(<= main_~i~0 22)} assume !(~i~0 < 100000); {14557#false} is VALID [2018-11-23 11:52:21,984 INFO L273 TraceCheckUtils]: 71: Hoare triple {14557#false} assume !(0 != ~swapped~0); {14557#false} is VALID [2018-11-23 11:52:21,984 INFO L273 TraceCheckUtils]: 72: Hoare triple {14557#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {14557#false} is VALID [2018-11-23 11:52:21,984 INFO L273 TraceCheckUtils]: 73: Hoare triple {14557#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {14557#false} is VALID [2018-11-23 11:52:21,985 INFO L273 TraceCheckUtils]: 74: Hoare triple {14557#false} assume !!(~y~0 < 100000);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); {14557#false} is VALID [2018-11-23 11:52:21,985 INFO L256 TraceCheckUtils]: 75: Hoare triple {14557#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {14557#false} is VALID [2018-11-23 11:52:21,985 INFO L273 TraceCheckUtils]: 76: Hoare triple {14557#false} ~cond := #in~cond; {14557#false} is VALID [2018-11-23 11:52:21,985 INFO L273 TraceCheckUtils]: 77: Hoare triple {14557#false} assume 0 == ~cond; {14557#false} is VALID [2018-11-23 11:52:21,985 INFO L273 TraceCheckUtils]: 78: Hoare triple {14557#false} assume !false; {14557#false} is VALID [2018-11-23 11:52:21,991 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 1 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:21,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:21,992 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:52:22,008 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:52:22,067 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-11-23 11:52:22,067 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:22,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:22,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:22,272 INFO L256 TraceCheckUtils]: 0: Hoare triple {14556#true} call ULTIMATE.init(); {14556#true} is VALID [2018-11-23 11:52:22,272 INFO L273 TraceCheckUtils]: 1: Hoare triple {14556#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14556#true} is VALID [2018-11-23 11:52:22,272 INFO L273 TraceCheckUtils]: 2: Hoare triple {14556#true} assume true; {14556#true} is VALID [2018-11-23 11:52:22,273 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14556#true} {14556#true} #79#return; {14556#true} is VALID [2018-11-23 11:52:22,273 INFO L256 TraceCheckUtils]: 4: Hoare triple {14556#true} call #t~ret8 := main(); {14556#true} is VALID [2018-11-23 11:52:22,273 INFO L273 TraceCheckUtils]: 5: Hoare triple {14556#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {14556#true} is VALID [2018-11-23 11:52:22,274 INFO L273 TraceCheckUtils]: 6: Hoare triple {14556#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {14601#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:22,274 INFO L273 TraceCheckUtils]: 7: Hoare triple {14601#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {14601#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:22,274 INFO L273 TraceCheckUtils]: 8: Hoare triple {14601#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14601#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:22,275 INFO L273 TraceCheckUtils]: 9: Hoare triple {14601#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {14559#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:22,275 INFO L273 TraceCheckUtils]: 10: Hoare triple {14559#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {14559#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:22,275 INFO L273 TraceCheckUtils]: 11: Hoare triple {14559#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14559#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:22,276 INFO L273 TraceCheckUtils]: 12: Hoare triple {14559#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {14560#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:22,276 INFO L273 TraceCheckUtils]: 13: Hoare triple {14560#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {14560#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:22,277 INFO L273 TraceCheckUtils]: 14: Hoare triple {14560#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14560#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:22,278 INFO L273 TraceCheckUtils]: 15: Hoare triple {14560#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {14561#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:22,278 INFO L273 TraceCheckUtils]: 16: Hoare triple {14561#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {14561#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:22,279 INFO L273 TraceCheckUtils]: 17: Hoare triple {14561#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14561#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:22,279 INFO L273 TraceCheckUtils]: 18: Hoare triple {14561#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {14562#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:22,280 INFO L273 TraceCheckUtils]: 19: Hoare triple {14562#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {14562#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:22,280 INFO L273 TraceCheckUtils]: 20: Hoare triple {14562#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14562#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:22,281 INFO L273 TraceCheckUtils]: 21: Hoare triple {14562#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {14563#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:22,281 INFO L273 TraceCheckUtils]: 22: Hoare triple {14563#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {14563#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:22,282 INFO L273 TraceCheckUtils]: 23: Hoare triple {14563#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14563#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:22,283 INFO L273 TraceCheckUtils]: 24: Hoare triple {14563#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {14564#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:22,283 INFO L273 TraceCheckUtils]: 25: Hoare triple {14564#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {14564#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:22,284 INFO L273 TraceCheckUtils]: 26: Hoare triple {14564#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14564#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:22,284 INFO L273 TraceCheckUtils]: 27: Hoare triple {14564#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {14565#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:22,285 INFO L273 TraceCheckUtils]: 28: Hoare triple {14565#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {14565#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:22,285 INFO L273 TraceCheckUtils]: 29: Hoare triple {14565#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14565#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:22,286 INFO L273 TraceCheckUtils]: 30: Hoare triple {14565#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {14566#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:22,286 INFO L273 TraceCheckUtils]: 31: Hoare triple {14566#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {14566#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:22,287 INFO L273 TraceCheckUtils]: 32: Hoare triple {14566#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14566#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:22,288 INFO L273 TraceCheckUtils]: 33: Hoare triple {14566#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {14567#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:22,288 INFO L273 TraceCheckUtils]: 34: Hoare triple {14567#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {14567#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:22,288 INFO L273 TraceCheckUtils]: 35: Hoare triple {14567#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14567#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:22,289 INFO L273 TraceCheckUtils]: 36: Hoare triple {14567#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {14568#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:22,290 INFO L273 TraceCheckUtils]: 37: Hoare triple {14568#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {14568#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:22,290 INFO L273 TraceCheckUtils]: 38: Hoare triple {14568#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14568#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:22,291 INFO L273 TraceCheckUtils]: 39: Hoare triple {14568#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {14569#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:22,291 INFO L273 TraceCheckUtils]: 40: Hoare triple {14569#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {14569#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:22,292 INFO L273 TraceCheckUtils]: 41: Hoare triple {14569#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14569#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:22,293 INFO L273 TraceCheckUtils]: 42: Hoare triple {14569#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {14570#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:22,293 INFO L273 TraceCheckUtils]: 43: Hoare triple {14570#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {14570#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:22,294 INFO L273 TraceCheckUtils]: 44: Hoare triple {14570#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14570#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:22,294 INFO L273 TraceCheckUtils]: 45: Hoare triple {14570#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {14571#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:22,295 INFO L273 TraceCheckUtils]: 46: Hoare triple {14571#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {14571#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:22,296 INFO L273 TraceCheckUtils]: 47: Hoare triple {14571#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14571#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:22,296 INFO L273 TraceCheckUtils]: 48: Hoare triple {14571#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {14572#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:22,297 INFO L273 TraceCheckUtils]: 49: Hoare triple {14572#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {14572#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:22,297 INFO L273 TraceCheckUtils]: 50: Hoare triple {14572#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14572#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:22,298 INFO L273 TraceCheckUtils]: 51: Hoare triple {14572#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {14573#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:22,299 INFO L273 TraceCheckUtils]: 52: Hoare triple {14573#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {14573#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:22,299 INFO L273 TraceCheckUtils]: 53: Hoare triple {14573#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14573#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:22,300 INFO L273 TraceCheckUtils]: 54: Hoare triple {14573#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {14574#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:22,300 INFO L273 TraceCheckUtils]: 55: Hoare triple {14574#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {14574#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:22,301 INFO L273 TraceCheckUtils]: 56: Hoare triple {14574#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14574#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:22,302 INFO L273 TraceCheckUtils]: 57: Hoare triple {14574#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {14575#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:22,302 INFO L273 TraceCheckUtils]: 58: Hoare triple {14575#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {14575#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:22,303 INFO L273 TraceCheckUtils]: 59: Hoare triple {14575#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14575#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:22,303 INFO L273 TraceCheckUtils]: 60: Hoare triple {14575#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {14576#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:22,304 INFO L273 TraceCheckUtils]: 61: Hoare triple {14576#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {14576#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:22,304 INFO L273 TraceCheckUtils]: 62: Hoare triple {14576#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14576#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:22,305 INFO L273 TraceCheckUtils]: 63: Hoare triple {14576#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {14577#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:22,306 INFO L273 TraceCheckUtils]: 64: Hoare triple {14577#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {14577#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:22,306 INFO L273 TraceCheckUtils]: 65: Hoare triple {14577#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14577#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:22,307 INFO L273 TraceCheckUtils]: 66: Hoare triple {14577#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {14578#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:22,307 INFO L273 TraceCheckUtils]: 67: Hoare triple {14578#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {14578#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:22,308 INFO L273 TraceCheckUtils]: 68: Hoare triple {14578#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14578#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:22,308 INFO L273 TraceCheckUtils]: 69: Hoare triple {14578#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {14579#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:22,309 INFO L273 TraceCheckUtils]: 70: Hoare triple {14579#(<= main_~i~0 22)} assume !(~i~0 < 100000); {14557#false} is VALID [2018-11-23 11:52:22,309 INFO L273 TraceCheckUtils]: 71: Hoare triple {14557#false} assume !(0 != ~swapped~0); {14557#false} is VALID [2018-11-23 11:52:22,309 INFO L273 TraceCheckUtils]: 72: Hoare triple {14557#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {14557#false} is VALID [2018-11-23 11:52:22,310 INFO L273 TraceCheckUtils]: 73: Hoare triple {14557#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {14557#false} is VALID [2018-11-23 11:52:22,310 INFO L273 TraceCheckUtils]: 74: Hoare triple {14557#false} assume !!(~y~0 < 100000);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); {14557#false} is VALID [2018-11-23 11:52:22,310 INFO L256 TraceCheckUtils]: 75: Hoare triple {14557#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {14557#false} is VALID [2018-11-23 11:52:22,310 INFO L273 TraceCheckUtils]: 76: Hoare triple {14557#false} ~cond := #in~cond; {14557#false} is VALID [2018-11-23 11:52:22,311 INFO L273 TraceCheckUtils]: 77: Hoare triple {14557#false} assume 0 == ~cond; {14557#false} is VALID [2018-11-23 11:52:22,311 INFO L273 TraceCheckUtils]: 78: Hoare triple {14557#false} assume !false; {14557#false} is VALID [2018-11-23 11:52:22,315 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 1 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:22,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:22,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-11-23 11:52:22,335 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 79 [2018-11-23 11:52:22,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:22,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 11:52:22,426 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:22,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 11:52:22,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 11:52:22,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 11:52:22,427 INFO L87 Difference]: Start difference. First operand 147 states and 192 transitions. Second operand 25 states. [2018-11-23 11:52:23,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:23,679 INFO L93 Difference]: Finished difference Result 298 states and 394 transitions. [2018-11-23 11:52:23,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 11:52:23,679 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 79 [2018-11-23 11:52:23,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:23,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:52:23,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 137 transitions. [2018-11-23 11:52:23,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:52:23,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 137 transitions. [2018-11-23 11:52:23,682 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 137 transitions. [2018-11-23 11:52:23,853 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:23,856 INFO L225 Difference]: With dead ends: 298 [2018-11-23 11:52:23,856 INFO L226 Difference]: Without dead ends: 157 [2018-11-23 11:52:23,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 11:52:23,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-11-23 11:52:24,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 153. [2018-11-23 11:52:24,036 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:24,036 INFO L82 GeneralOperation]: Start isEquivalent. First operand 157 states. Second operand 153 states. [2018-11-23 11:52:24,036 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand 153 states. [2018-11-23 11:52:24,037 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 153 states. [2018-11-23 11:52:24,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:24,040 INFO L93 Difference]: Finished difference Result 157 states and 206 transitions. [2018-11-23 11:52:24,040 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 206 transitions. [2018-11-23 11:52:24,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:24,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:24,041 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 157 states. [2018-11-23 11:52:24,041 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 157 states. [2018-11-23 11:52:24,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:24,044 INFO L93 Difference]: Finished difference Result 157 states and 206 transitions. [2018-11-23 11:52:24,044 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 206 transitions. [2018-11-23 11:52:24,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:24,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:24,045 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:24,045 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:24,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-11-23 11:52:24,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 200 transitions. [2018-11-23 11:52:24,048 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 200 transitions. Word has length 79 [2018-11-23 11:52:24,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:24,048 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 200 transitions. [2018-11-23 11:52:24,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 11:52:24,048 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 200 transitions. [2018-11-23 11:52:24,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-23 11:52:24,049 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:24,049 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:24,049 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:24,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:24,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1129209777, now seen corresponding path program 22 times [2018-11-23 11:52:24,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:24,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:24,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:24,051 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:24,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:24,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:24,461 INFO L256 TraceCheckUtils]: 0: Hoare triple {15741#true} call ULTIMATE.init(); {15741#true} is VALID [2018-11-23 11:52:24,462 INFO L273 TraceCheckUtils]: 1: Hoare triple {15741#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15741#true} is VALID [2018-11-23 11:52:24,462 INFO L273 TraceCheckUtils]: 2: Hoare triple {15741#true} assume true; {15741#true} is VALID [2018-11-23 11:52:24,462 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15741#true} {15741#true} #79#return; {15741#true} is VALID [2018-11-23 11:52:24,462 INFO L256 TraceCheckUtils]: 4: Hoare triple {15741#true} call #t~ret8 := main(); {15741#true} is VALID [2018-11-23 11:52:24,463 INFO L273 TraceCheckUtils]: 5: Hoare triple {15741#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {15741#true} is VALID [2018-11-23 11:52:24,463 INFO L273 TraceCheckUtils]: 6: Hoare triple {15741#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {15743#(= main_~i~0 1)} is VALID [2018-11-23 11:52:24,464 INFO L273 TraceCheckUtils]: 7: Hoare triple {15743#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {15743#(= main_~i~0 1)} is VALID [2018-11-23 11:52:24,464 INFO L273 TraceCheckUtils]: 8: Hoare triple {15743#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15743#(= main_~i~0 1)} is VALID [2018-11-23 11:52:24,465 INFO L273 TraceCheckUtils]: 9: Hoare triple {15743#(= main_~i~0 1)} ~i~0 := 1 + ~i~0; {15744#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:24,465 INFO L273 TraceCheckUtils]: 10: Hoare triple {15744#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {15744#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:24,466 INFO L273 TraceCheckUtils]: 11: Hoare triple {15744#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15744#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:24,467 INFO L273 TraceCheckUtils]: 12: Hoare triple {15744#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {15745#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:24,467 INFO L273 TraceCheckUtils]: 13: Hoare triple {15745#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {15745#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:24,467 INFO L273 TraceCheckUtils]: 14: Hoare triple {15745#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15745#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:24,468 INFO L273 TraceCheckUtils]: 15: Hoare triple {15745#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {15746#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:24,469 INFO L273 TraceCheckUtils]: 16: Hoare triple {15746#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {15746#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:24,469 INFO L273 TraceCheckUtils]: 17: Hoare triple {15746#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15746#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:24,470 INFO L273 TraceCheckUtils]: 18: Hoare triple {15746#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {15747#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:24,470 INFO L273 TraceCheckUtils]: 19: Hoare triple {15747#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {15747#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:24,471 INFO L273 TraceCheckUtils]: 20: Hoare triple {15747#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15747#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:24,471 INFO L273 TraceCheckUtils]: 21: Hoare triple {15747#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {15748#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:24,472 INFO L273 TraceCheckUtils]: 22: Hoare triple {15748#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {15748#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:24,472 INFO L273 TraceCheckUtils]: 23: Hoare triple {15748#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15748#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:24,473 INFO L273 TraceCheckUtils]: 24: Hoare triple {15748#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {15749#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:24,474 INFO L273 TraceCheckUtils]: 25: Hoare triple {15749#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {15749#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:24,474 INFO L273 TraceCheckUtils]: 26: Hoare triple {15749#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15749#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:24,475 INFO L273 TraceCheckUtils]: 27: Hoare triple {15749#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {15750#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:24,475 INFO L273 TraceCheckUtils]: 28: Hoare triple {15750#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {15750#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:24,476 INFO L273 TraceCheckUtils]: 29: Hoare triple {15750#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15750#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:24,477 INFO L273 TraceCheckUtils]: 30: Hoare triple {15750#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {15751#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:24,477 INFO L273 TraceCheckUtils]: 31: Hoare triple {15751#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {15751#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:24,477 INFO L273 TraceCheckUtils]: 32: Hoare triple {15751#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15751#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:24,478 INFO L273 TraceCheckUtils]: 33: Hoare triple {15751#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {15752#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:24,479 INFO L273 TraceCheckUtils]: 34: Hoare triple {15752#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {15752#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:24,479 INFO L273 TraceCheckUtils]: 35: Hoare triple {15752#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15752#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:24,480 INFO L273 TraceCheckUtils]: 36: Hoare triple {15752#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {15753#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:24,480 INFO L273 TraceCheckUtils]: 37: Hoare triple {15753#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {15753#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:24,481 INFO L273 TraceCheckUtils]: 38: Hoare triple {15753#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15753#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:24,482 INFO L273 TraceCheckUtils]: 39: Hoare triple {15753#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {15754#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:24,482 INFO L273 TraceCheckUtils]: 40: Hoare triple {15754#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {15754#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:24,483 INFO L273 TraceCheckUtils]: 41: Hoare triple {15754#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15754#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:24,483 INFO L273 TraceCheckUtils]: 42: Hoare triple {15754#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {15755#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:24,484 INFO L273 TraceCheckUtils]: 43: Hoare triple {15755#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {15755#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:24,484 INFO L273 TraceCheckUtils]: 44: Hoare triple {15755#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15755#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:24,485 INFO L273 TraceCheckUtils]: 45: Hoare triple {15755#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {15756#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:24,485 INFO L273 TraceCheckUtils]: 46: Hoare triple {15756#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {15756#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:24,486 INFO L273 TraceCheckUtils]: 47: Hoare triple {15756#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15756#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:24,487 INFO L273 TraceCheckUtils]: 48: Hoare triple {15756#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {15757#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:24,487 INFO L273 TraceCheckUtils]: 49: Hoare triple {15757#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {15757#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:24,488 INFO L273 TraceCheckUtils]: 50: Hoare triple {15757#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15757#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:24,488 INFO L273 TraceCheckUtils]: 51: Hoare triple {15757#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {15758#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:24,489 INFO L273 TraceCheckUtils]: 52: Hoare triple {15758#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {15758#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:24,489 INFO L273 TraceCheckUtils]: 53: Hoare triple {15758#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15758#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:24,490 INFO L273 TraceCheckUtils]: 54: Hoare triple {15758#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {15759#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:24,490 INFO L273 TraceCheckUtils]: 55: Hoare triple {15759#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {15759#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:24,491 INFO L273 TraceCheckUtils]: 56: Hoare triple {15759#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15759#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:24,492 INFO L273 TraceCheckUtils]: 57: Hoare triple {15759#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {15760#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:24,492 INFO L273 TraceCheckUtils]: 58: Hoare triple {15760#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {15760#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:24,493 INFO L273 TraceCheckUtils]: 59: Hoare triple {15760#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15760#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:24,493 INFO L273 TraceCheckUtils]: 60: Hoare triple {15760#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {15761#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:24,494 INFO L273 TraceCheckUtils]: 61: Hoare triple {15761#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {15761#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:24,494 INFO L273 TraceCheckUtils]: 62: Hoare triple {15761#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15761#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:24,495 INFO L273 TraceCheckUtils]: 63: Hoare triple {15761#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {15762#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:24,495 INFO L273 TraceCheckUtils]: 64: Hoare triple {15762#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {15762#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:24,496 INFO L273 TraceCheckUtils]: 65: Hoare triple {15762#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15762#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:24,497 INFO L273 TraceCheckUtils]: 66: Hoare triple {15762#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {15763#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:24,497 INFO L273 TraceCheckUtils]: 67: Hoare triple {15763#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {15763#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:24,498 INFO L273 TraceCheckUtils]: 68: Hoare triple {15763#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15763#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:24,498 INFO L273 TraceCheckUtils]: 69: Hoare triple {15763#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {15764#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:24,499 INFO L273 TraceCheckUtils]: 70: Hoare triple {15764#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {15764#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:24,499 INFO L273 TraceCheckUtils]: 71: Hoare triple {15764#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15764#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:24,500 INFO L273 TraceCheckUtils]: 72: Hoare triple {15764#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {15765#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:24,501 INFO L273 TraceCheckUtils]: 73: Hoare triple {15765#(<= main_~i~0 23)} assume !(~i~0 < 100000); {15742#false} is VALID [2018-11-23 11:52:24,501 INFO L273 TraceCheckUtils]: 74: Hoare triple {15742#false} assume !(0 != ~swapped~0); {15742#false} is VALID [2018-11-23 11:52:24,501 INFO L273 TraceCheckUtils]: 75: Hoare triple {15742#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {15742#false} is VALID [2018-11-23 11:52:24,501 INFO L273 TraceCheckUtils]: 76: Hoare triple {15742#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {15742#false} is VALID [2018-11-23 11:52:24,501 INFO L273 TraceCheckUtils]: 77: Hoare triple {15742#false} assume !!(~y~0 < 100000);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); {15742#false} is VALID [2018-11-23 11:52:24,501 INFO L256 TraceCheckUtils]: 78: Hoare triple {15742#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {15742#false} is VALID [2018-11-23 11:52:24,502 INFO L273 TraceCheckUtils]: 79: Hoare triple {15742#false} ~cond := #in~cond; {15742#false} is VALID [2018-11-23 11:52:24,502 INFO L273 TraceCheckUtils]: 80: Hoare triple {15742#false} assume 0 == ~cond; {15742#false} is VALID [2018-11-23 11:52:24,502 INFO L273 TraceCheckUtils]: 81: Hoare triple {15742#false} assume !false; {15742#false} is VALID [2018-11-23 11:52:24,507 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 1 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:24,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:24,508 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:52:24,517 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:52:24,556 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:52:24,556 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:24,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:24,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:24,803 INFO L256 TraceCheckUtils]: 0: Hoare triple {15741#true} call ULTIMATE.init(); {15741#true} is VALID [2018-11-23 11:52:24,804 INFO L273 TraceCheckUtils]: 1: Hoare triple {15741#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15741#true} is VALID [2018-11-23 11:52:24,804 INFO L273 TraceCheckUtils]: 2: Hoare triple {15741#true} assume true; {15741#true} is VALID [2018-11-23 11:52:24,804 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15741#true} {15741#true} #79#return; {15741#true} is VALID [2018-11-23 11:52:24,804 INFO L256 TraceCheckUtils]: 4: Hoare triple {15741#true} call #t~ret8 := main(); {15741#true} is VALID [2018-11-23 11:52:24,805 INFO L273 TraceCheckUtils]: 5: Hoare triple {15741#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {15741#true} is VALID [2018-11-23 11:52:24,805 INFO L273 TraceCheckUtils]: 6: Hoare triple {15741#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {15787#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:24,806 INFO L273 TraceCheckUtils]: 7: Hoare triple {15787#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {15787#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:24,806 INFO L273 TraceCheckUtils]: 8: Hoare triple {15787#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15787#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:24,807 INFO L273 TraceCheckUtils]: 9: Hoare triple {15787#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {15744#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:24,807 INFO L273 TraceCheckUtils]: 10: Hoare triple {15744#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {15744#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:24,807 INFO L273 TraceCheckUtils]: 11: Hoare triple {15744#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15744#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:24,808 INFO L273 TraceCheckUtils]: 12: Hoare triple {15744#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {15745#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:24,808 INFO L273 TraceCheckUtils]: 13: Hoare triple {15745#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {15745#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:24,809 INFO L273 TraceCheckUtils]: 14: Hoare triple {15745#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15745#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:24,810 INFO L273 TraceCheckUtils]: 15: Hoare triple {15745#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {15746#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:24,810 INFO L273 TraceCheckUtils]: 16: Hoare triple {15746#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {15746#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:24,811 INFO L273 TraceCheckUtils]: 17: Hoare triple {15746#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15746#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:24,812 INFO L273 TraceCheckUtils]: 18: Hoare triple {15746#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {15747#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:24,812 INFO L273 TraceCheckUtils]: 19: Hoare triple {15747#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {15747#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:24,813 INFO L273 TraceCheckUtils]: 20: Hoare triple {15747#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15747#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:24,813 INFO L273 TraceCheckUtils]: 21: Hoare triple {15747#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {15748#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:24,814 INFO L273 TraceCheckUtils]: 22: Hoare triple {15748#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {15748#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:24,815 INFO L273 TraceCheckUtils]: 23: Hoare triple {15748#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15748#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:24,815 INFO L273 TraceCheckUtils]: 24: Hoare triple {15748#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {15749#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:24,816 INFO L273 TraceCheckUtils]: 25: Hoare triple {15749#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {15749#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:24,817 INFO L273 TraceCheckUtils]: 26: Hoare triple {15749#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15749#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:24,817 INFO L273 TraceCheckUtils]: 27: Hoare triple {15749#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {15750#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:24,818 INFO L273 TraceCheckUtils]: 28: Hoare triple {15750#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {15750#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:24,819 INFO L273 TraceCheckUtils]: 29: Hoare triple {15750#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15750#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:24,819 INFO L273 TraceCheckUtils]: 30: Hoare triple {15750#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {15751#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:24,820 INFO L273 TraceCheckUtils]: 31: Hoare triple {15751#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {15751#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:24,820 INFO L273 TraceCheckUtils]: 32: Hoare triple {15751#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15751#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:24,821 INFO L273 TraceCheckUtils]: 33: Hoare triple {15751#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {15752#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:24,822 INFO L273 TraceCheckUtils]: 34: Hoare triple {15752#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {15752#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:24,822 INFO L273 TraceCheckUtils]: 35: Hoare triple {15752#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15752#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:24,823 INFO L273 TraceCheckUtils]: 36: Hoare triple {15752#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {15753#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:24,824 INFO L273 TraceCheckUtils]: 37: Hoare triple {15753#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {15753#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:24,824 INFO L273 TraceCheckUtils]: 38: Hoare triple {15753#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15753#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:24,825 INFO L273 TraceCheckUtils]: 39: Hoare triple {15753#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {15754#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:24,826 INFO L273 TraceCheckUtils]: 40: Hoare triple {15754#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {15754#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:24,826 INFO L273 TraceCheckUtils]: 41: Hoare triple {15754#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15754#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:24,827 INFO L273 TraceCheckUtils]: 42: Hoare triple {15754#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {15755#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:24,828 INFO L273 TraceCheckUtils]: 43: Hoare triple {15755#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {15755#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:24,828 INFO L273 TraceCheckUtils]: 44: Hoare triple {15755#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15755#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:24,829 INFO L273 TraceCheckUtils]: 45: Hoare triple {15755#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {15756#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:24,830 INFO L273 TraceCheckUtils]: 46: Hoare triple {15756#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {15756#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:24,830 INFO L273 TraceCheckUtils]: 47: Hoare triple {15756#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15756#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:24,831 INFO L273 TraceCheckUtils]: 48: Hoare triple {15756#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {15757#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:24,832 INFO L273 TraceCheckUtils]: 49: Hoare triple {15757#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {15757#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:24,832 INFO L273 TraceCheckUtils]: 50: Hoare triple {15757#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15757#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:24,833 INFO L273 TraceCheckUtils]: 51: Hoare triple {15757#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {15758#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:24,833 INFO L273 TraceCheckUtils]: 52: Hoare triple {15758#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {15758#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:24,834 INFO L273 TraceCheckUtils]: 53: Hoare triple {15758#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15758#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:24,835 INFO L273 TraceCheckUtils]: 54: Hoare triple {15758#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {15759#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:24,835 INFO L273 TraceCheckUtils]: 55: Hoare triple {15759#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {15759#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:24,836 INFO L273 TraceCheckUtils]: 56: Hoare triple {15759#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15759#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:24,837 INFO L273 TraceCheckUtils]: 57: Hoare triple {15759#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {15760#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:24,837 INFO L273 TraceCheckUtils]: 58: Hoare triple {15760#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {15760#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:24,838 INFO L273 TraceCheckUtils]: 59: Hoare triple {15760#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15760#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:24,839 INFO L273 TraceCheckUtils]: 60: Hoare triple {15760#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {15761#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:24,839 INFO L273 TraceCheckUtils]: 61: Hoare triple {15761#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {15761#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:24,840 INFO L273 TraceCheckUtils]: 62: Hoare triple {15761#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15761#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:24,841 INFO L273 TraceCheckUtils]: 63: Hoare triple {15761#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {15762#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:24,841 INFO L273 TraceCheckUtils]: 64: Hoare triple {15762#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {15762#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:24,842 INFO L273 TraceCheckUtils]: 65: Hoare triple {15762#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15762#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:24,842 INFO L273 TraceCheckUtils]: 66: Hoare triple {15762#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {15763#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:24,843 INFO L273 TraceCheckUtils]: 67: Hoare triple {15763#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {15763#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:24,843 INFO L273 TraceCheckUtils]: 68: Hoare triple {15763#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15763#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:24,844 INFO L273 TraceCheckUtils]: 69: Hoare triple {15763#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {15764#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:24,844 INFO L273 TraceCheckUtils]: 70: Hoare triple {15764#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {15764#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:24,845 INFO L273 TraceCheckUtils]: 71: Hoare triple {15764#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15764#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:24,846 INFO L273 TraceCheckUtils]: 72: Hoare triple {15764#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {15765#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:24,846 INFO L273 TraceCheckUtils]: 73: Hoare triple {15765#(<= main_~i~0 23)} assume !(~i~0 < 100000); {15742#false} is VALID [2018-11-23 11:52:24,847 INFO L273 TraceCheckUtils]: 74: Hoare triple {15742#false} assume !(0 != ~swapped~0); {15742#false} is VALID [2018-11-23 11:52:24,847 INFO L273 TraceCheckUtils]: 75: Hoare triple {15742#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {15742#false} is VALID [2018-11-23 11:52:24,847 INFO L273 TraceCheckUtils]: 76: Hoare triple {15742#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {15742#false} is VALID [2018-11-23 11:52:24,847 INFO L273 TraceCheckUtils]: 77: Hoare triple {15742#false} assume !!(~y~0 < 100000);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); {15742#false} is VALID [2018-11-23 11:52:24,847 INFO L256 TraceCheckUtils]: 78: Hoare triple {15742#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {15742#false} is VALID [2018-11-23 11:52:24,847 INFO L273 TraceCheckUtils]: 79: Hoare triple {15742#false} ~cond := #in~cond; {15742#false} is VALID [2018-11-23 11:52:24,848 INFO L273 TraceCheckUtils]: 80: Hoare triple {15742#false} assume 0 == ~cond; {15742#false} is VALID [2018-11-23 11:52:24,848 INFO L273 TraceCheckUtils]: 81: Hoare triple {15742#false} assume !false; {15742#false} is VALID [2018-11-23 11:52:24,853 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 1 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:24,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:24,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-11-23 11:52:24,872 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 82 [2018-11-23 11:52:24,872 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:24,873 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 11:52:25,000 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:25,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 11:52:25,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 11:52:25,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 11:52:25,002 INFO L87 Difference]: Start difference. First operand 153 states and 200 transitions. Second operand 26 states. [2018-11-23 11:52:25,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:25,688 INFO L93 Difference]: Finished difference Result 310 states and 410 transitions. [2018-11-23 11:52:25,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 11:52:25,688 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 82 [2018-11-23 11:52:25,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:25,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 11:52:25,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 141 transitions. [2018-11-23 11:52:25,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 11:52:25,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 141 transitions. [2018-11-23 11:52:25,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 141 transitions. [2018-11-23 11:52:25,831 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:25,834 INFO L225 Difference]: With dead ends: 310 [2018-11-23 11:52:25,834 INFO L226 Difference]: Without dead ends: 163 [2018-11-23 11:52:25,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 11:52:25,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-11-23 11:52:25,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 159. [2018-11-23 11:52:25,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:25,885 INFO L82 GeneralOperation]: Start isEquivalent. First operand 163 states. Second operand 159 states. [2018-11-23 11:52:25,885 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand 159 states. [2018-11-23 11:52:25,885 INFO L87 Difference]: Start difference. First operand 163 states. Second operand 159 states. [2018-11-23 11:52:25,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:25,888 INFO L93 Difference]: Finished difference Result 163 states and 214 transitions. [2018-11-23 11:52:25,888 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 214 transitions. [2018-11-23 11:52:25,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:25,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:25,888 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand 163 states. [2018-11-23 11:52:25,889 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 163 states. [2018-11-23 11:52:25,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:25,891 INFO L93 Difference]: Finished difference Result 163 states and 214 transitions. [2018-11-23 11:52:25,891 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 214 transitions. [2018-11-23 11:52:25,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:25,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:25,891 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:25,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:25,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-11-23 11:52:25,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 208 transitions. [2018-11-23 11:52:25,894 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 208 transitions. Word has length 82 [2018-11-23 11:52:25,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:25,895 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 208 transitions. [2018-11-23 11:52:25,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 11:52:25,895 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 208 transitions. [2018-11-23 11:52:25,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-23 11:52:25,896 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:25,896 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:25,896 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:25,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:25,896 INFO L82 PathProgramCache]: Analyzing trace with hash 817264168, now seen corresponding path program 23 times [2018-11-23 11:52:25,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:25,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:25,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:25,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:25,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:25,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:26,340 INFO L256 TraceCheckUtils]: 0: Hoare triple {16972#true} call ULTIMATE.init(); {16972#true} is VALID [2018-11-23 11:52:26,341 INFO L273 TraceCheckUtils]: 1: Hoare triple {16972#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16972#true} is VALID [2018-11-23 11:52:26,341 INFO L273 TraceCheckUtils]: 2: Hoare triple {16972#true} assume true; {16972#true} is VALID [2018-11-23 11:52:26,341 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16972#true} {16972#true} #79#return; {16972#true} is VALID [2018-11-23 11:52:26,341 INFO L256 TraceCheckUtils]: 4: Hoare triple {16972#true} call #t~ret8 := main(); {16972#true} is VALID [2018-11-23 11:52:26,342 INFO L273 TraceCheckUtils]: 5: Hoare triple {16972#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {16972#true} is VALID [2018-11-23 11:52:26,342 INFO L273 TraceCheckUtils]: 6: Hoare triple {16972#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {16974#(= main_~i~0 1)} is VALID [2018-11-23 11:52:26,343 INFO L273 TraceCheckUtils]: 7: Hoare triple {16974#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {16974#(= main_~i~0 1)} is VALID [2018-11-23 11:52:26,343 INFO L273 TraceCheckUtils]: 8: Hoare triple {16974#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16974#(= main_~i~0 1)} is VALID [2018-11-23 11:52:26,343 INFO L273 TraceCheckUtils]: 9: Hoare triple {16974#(= main_~i~0 1)} ~i~0 := 1 + ~i~0; {16975#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:26,344 INFO L273 TraceCheckUtils]: 10: Hoare triple {16975#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {16975#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:26,344 INFO L273 TraceCheckUtils]: 11: Hoare triple {16975#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16975#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:26,345 INFO L273 TraceCheckUtils]: 12: Hoare triple {16975#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {16976#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:26,345 INFO L273 TraceCheckUtils]: 13: Hoare triple {16976#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {16976#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:26,345 INFO L273 TraceCheckUtils]: 14: Hoare triple {16976#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16976#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:26,346 INFO L273 TraceCheckUtils]: 15: Hoare triple {16976#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {16977#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:26,347 INFO L273 TraceCheckUtils]: 16: Hoare triple {16977#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {16977#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:26,347 INFO L273 TraceCheckUtils]: 17: Hoare triple {16977#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16977#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:26,348 INFO L273 TraceCheckUtils]: 18: Hoare triple {16977#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {16978#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:26,348 INFO L273 TraceCheckUtils]: 19: Hoare triple {16978#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {16978#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:26,349 INFO L273 TraceCheckUtils]: 20: Hoare triple {16978#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16978#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:26,350 INFO L273 TraceCheckUtils]: 21: Hoare triple {16978#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {16979#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:26,350 INFO L273 TraceCheckUtils]: 22: Hoare triple {16979#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {16979#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:26,351 INFO L273 TraceCheckUtils]: 23: Hoare triple {16979#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16979#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:26,352 INFO L273 TraceCheckUtils]: 24: Hoare triple {16979#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {16980#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:26,352 INFO L273 TraceCheckUtils]: 25: Hoare triple {16980#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {16980#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:26,353 INFO L273 TraceCheckUtils]: 26: Hoare triple {16980#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16980#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:26,353 INFO L273 TraceCheckUtils]: 27: Hoare triple {16980#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {16981#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:26,354 INFO L273 TraceCheckUtils]: 28: Hoare triple {16981#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {16981#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:26,355 INFO L273 TraceCheckUtils]: 29: Hoare triple {16981#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16981#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:26,355 INFO L273 TraceCheckUtils]: 30: Hoare triple {16981#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {16982#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:26,356 INFO L273 TraceCheckUtils]: 31: Hoare triple {16982#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {16982#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:26,356 INFO L273 TraceCheckUtils]: 32: Hoare triple {16982#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16982#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:26,357 INFO L273 TraceCheckUtils]: 33: Hoare triple {16982#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {16983#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:26,358 INFO L273 TraceCheckUtils]: 34: Hoare triple {16983#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {16983#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:26,358 INFO L273 TraceCheckUtils]: 35: Hoare triple {16983#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16983#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:26,359 INFO L273 TraceCheckUtils]: 36: Hoare triple {16983#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {16984#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:26,360 INFO L273 TraceCheckUtils]: 37: Hoare triple {16984#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {16984#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:26,360 INFO L273 TraceCheckUtils]: 38: Hoare triple {16984#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16984#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:26,361 INFO L273 TraceCheckUtils]: 39: Hoare triple {16984#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {16985#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:26,362 INFO L273 TraceCheckUtils]: 40: Hoare triple {16985#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {16985#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:26,362 INFO L273 TraceCheckUtils]: 41: Hoare triple {16985#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16985#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:26,363 INFO L273 TraceCheckUtils]: 42: Hoare triple {16985#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {16986#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:26,363 INFO L273 TraceCheckUtils]: 43: Hoare triple {16986#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {16986#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:26,364 INFO L273 TraceCheckUtils]: 44: Hoare triple {16986#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16986#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:26,365 INFO L273 TraceCheckUtils]: 45: Hoare triple {16986#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {16987#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:26,365 INFO L273 TraceCheckUtils]: 46: Hoare triple {16987#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {16987#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:26,366 INFO L273 TraceCheckUtils]: 47: Hoare triple {16987#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16987#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:26,367 INFO L273 TraceCheckUtils]: 48: Hoare triple {16987#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {16988#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:26,367 INFO L273 TraceCheckUtils]: 49: Hoare triple {16988#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {16988#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:26,368 INFO L273 TraceCheckUtils]: 50: Hoare triple {16988#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16988#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:26,368 INFO L273 TraceCheckUtils]: 51: Hoare triple {16988#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {16989#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:26,369 INFO L273 TraceCheckUtils]: 52: Hoare triple {16989#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {16989#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:26,369 INFO L273 TraceCheckUtils]: 53: Hoare triple {16989#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16989#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:26,370 INFO L273 TraceCheckUtils]: 54: Hoare triple {16989#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {16990#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:26,371 INFO L273 TraceCheckUtils]: 55: Hoare triple {16990#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {16990#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:26,371 INFO L273 TraceCheckUtils]: 56: Hoare triple {16990#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16990#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:26,372 INFO L273 TraceCheckUtils]: 57: Hoare triple {16990#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {16991#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:26,373 INFO L273 TraceCheckUtils]: 58: Hoare triple {16991#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {16991#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:26,373 INFO L273 TraceCheckUtils]: 59: Hoare triple {16991#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16991#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:26,374 INFO L273 TraceCheckUtils]: 60: Hoare triple {16991#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {16992#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:26,374 INFO L273 TraceCheckUtils]: 61: Hoare triple {16992#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {16992#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:26,375 INFO L273 TraceCheckUtils]: 62: Hoare triple {16992#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16992#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:26,376 INFO L273 TraceCheckUtils]: 63: Hoare triple {16992#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {16993#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:26,376 INFO L273 TraceCheckUtils]: 64: Hoare triple {16993#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {16993#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:26,377 INFO L273 TraceCheckUtils]: 65: Hoare triple {16993#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16993#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:26,377 INFO L273 TraceCheckUtils]: 66: Hoare triple {16993#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {16994#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:26,378 INFO L273 TraceCheckUtils]: 67: Hoare triple {16994#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {16994#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:26,378 INFO L273 TraceCheckUtils]: 68: Hoare triple {16994#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16994#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:26,379 INFO L273 TraceCheckUtils]: 69: Hoare triple {16994#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {16995#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:26,380 INFO L273 TraceCheckUtils]: 70: Hoare triple {16995#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {16995#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:26,380 INFO L273 TraceCheckUtils]: 71: Hoare triple {16995#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16995#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:26,381 INFO L273 TraceCheckUtils]: 72: Hoare triple {16995#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {16996#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:26,382 INFO L273 TraceCheckUtils]: 73: Hoare triple {16996#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {16996#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:26,382 INFO L273 TraceCheckUtils]: 74: Hoare triple {16996#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16996#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:26,383 INFO L273 TraceCheckUtils]: 75: Hoare triple {16996#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {16997#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:26,383 INFO L273 TraceCheckUtils]: 76: Hoare triple {16997#(<= main_~i~0 24)} assume !(~i~0 < 100000); {16973#false} is VALID [2018-11-23 11:52:26,384 INFO L273 TraceCheckUtils]: 77: Hoare triple {16973#false} assume !(0 != ~swapped~0); {16973#false} is VALID [2018-11-23 11:52:26,384 INFO L273 TraceCheckUtils]: 78: Hoare triple {16973#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {16973#false} is VALID [2018-11-23 11:52:26,384 INFO L273 TraceCheckUtils]: 79: Hoare triple {16973#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {16973#false} is VALID [2018-11-23 11:52:26,384 INFO L273 TraceCheckUtils]: 80: Hoare triple {16973#false} assume !!(~y~0 < 100000);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); {16973#false} is VALID [2018-11-23 11:52:26,385 INFO L256 TraceCheckUtils]: 81: Hoare triple {16973#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {16973#false} is VALID [2018-11-23 11:52:26,385 INFO L273 TraceCheckUtils]: 82: Hoare triple {16973#false} ~cond := #in~cond; {16973#false} is VALID [2018-11-23 11:52:26,385 INFO L273 TraceCheckUtils]: 83: Hoare triple {16973#false} assume 0 == ~cond; {16973#false} is VALID [2018-11-23 11:52:26,385 INFO L273 TraceCheckUtils]: 84: Hoare triple {16973#false} assume !false; {16973#false} is VALID [2018-11-23 11:52:26,391 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 1 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:26,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:26,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 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:52:26,400 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:52:26,467 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-11-23 11:52:26,467 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:26,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:26,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:26,696 INFO L256 TraceCheckUtils]: 0: Hoare triple {16972#true} call ULTIMATE.init(); {16972#true} is VALID [2018-11-23 11:52:26,696 INFO L273 TraceCheckUtils]: 1: Hoare triple {16972#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16972#true} is VALID [2018-11-23 11:52:26,696 INFO L273 TraceCheckUtils]: 2: Hoare triple {16972#true} assume true; {16972#true} is VALID [2018-11-23 11:52:26,697 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16972#true} {16972#true} #79#return; {16972#true} is VALID [2018-11-23 11:52:26,697 INFO L256 TraceCheckUtils]: 4: Hoare triple {16972#true} call #t~ret8 := main(); {16972#true} is VALID [2018-11-23 11:52:26,697 INFO L273 TraceCheckUtils]: 5: Hoare triple {16972#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {16972#true} is VALID [2018-11-23 11:52:26,697 INFO L273 TraceCheckUtils]: 6: Hoare triple {16972#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {17019#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:26,698 INFO L273 TraceCheckUtils]: 7: Hoare triple {17019#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {17019#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:26,698 INFO L273 TraceCheckUtils]: 8: Hoare triple {17019#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {17019#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:26,699 INFO L273 TraceCheckUtils]: 9: Hoare triple {17019#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {16975#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:26,699 INFO L273 TraceCheckUtils]: 10: Hoare triple {16975#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {16975#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:26,699 INFO L273 TraceCheckUtils]: 11: Hoare triple {16975#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16975#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:26,700 INFO L273 TraceCheckUtils]: 12: Hoare triple {16975#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {16976#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:26,700 INFO L273 TraceCheckUtils]: 13: Hoare triple {16976#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {16976#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:26,701 INFO L273 TraceCheckUtils]: 14: Hoare triple {16976#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16976#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:26,701 INFO L273 TraceCheckUtils]: 15: Hoare triple {16976#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {16977#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:26,702 INFO L273 TraceCheckUtils]: 16: Hoare triple {16977#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {16977#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:26,702 INFO L273 TraceCheckUtils]: 17: Hoare triple {16977#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16977#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:26,703 INFO L273 TraceCheckUtils]: 18: Hoare triple {16977#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {16978#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:26,704 INFO L273 TraceCheckUtils]: 19: Hoare triple {16978#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {16978#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:26,704 INFO L273 TraceCheckUtils]: 20: Hoare triple {16978#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16978#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:26,705 INFO L273 TraceCheckUtils]: 21: Hoare triple {16978#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {16979#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:26,705 INFO L273 TraceCheckUtils]: 22: Hoare triple {16979#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {16979#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:26,706 INFO L273 TraceCheckUtils]: 23: Hoare triple {16979#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16979#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:26,706 INFO L273 TraceCheckUtils]: 24: Hoare triple {16979#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {16980#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:26,707 INFO L273 TraceCheckUtils]: 25: Hoare triple {16980#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {16980#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:26,708 INFO L273 TraceCheckUtils]: 26: Hoare triple {16980#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16980#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:26,708 INFO L273 TraceCheckUtils]: 27: Hoare triple {16980#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {16981#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:26,709 INFO L273 TraceCheckUtils]: 28: Hoare triple {16981#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {16981#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:26,709 INFO L273 TraceCheckUtils]: 29: Hoare triple {16981#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16981#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:26,710 INFO L273 TraceCheckUtils]: 30: Hoare triple {16981#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {16982#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:26,711 INFO L273 TraceCheckUtils]: 31: Hoare triple {16982#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {16982#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:26,711 INFO L273 TraceCheckUtils]: 32: Hoare triple {16982#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16982#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:26,712 INFO L273 TraceCheckUtils]: 33: Hoare triple {16982#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {16983#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:26,712 INFO L273 TraceCheckUtils]: 34: Hoare triple {16983#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {16983#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:26,713 INFO L273 TraceCheckUtils]: 35: Hoare triple {16983#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16983#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:26,714 INFO L273 TraceCheckUtils]: 36: Hoare triple {16983#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {16984#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:26,714 INFO L273 TraceCheckUtils]: 37: Hoare triple {16984#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {16984#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:26,715 INFO L273 TraceCheckUtils]: 38: Hoare triple {16984#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16984#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:26,715 INFO L273 TraceCheckUtils]: 39: Hoare triple {16984#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {16985#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:26,716 INFO L273 TraceCheckUtils]: 40: Hoare triple {16985#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {16985#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:26,716 INFO L273 TraceCheckUtils]: 41: Hoare triple {16985#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16985#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:26,717 INFO L273 TraceCheckUtils]: 42: Hoare triple {16985#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {16986#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:26,718 INFO L273 TraceCheckUtils]: 43: Hoare triple {16986#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {16986#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:26,718 INFO L273 TraceCheckUtils]: 44: Hoare triple {16986#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16986#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:26,719 INFO L273 TraceCheckUtils]: 45: Hoare triple {16986#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {16987#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:26,719 INFO L273 TraceCheckUtils]: 46: Hoare triple {16987#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {16987#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:26,720 INFO L273 TraceCheckUtils]: 47: Hoare triple {16987#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16987#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:26,721 INFO L273 TraceCheckUtils]: 48: Hoare triple {16987#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {16988#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:26,721 INFO L273 TraceCheckUtils]: 49: Hoare triple {16988#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {16988#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:26,722 INFO L273 TraceCheckUtils]: 50: Hoare triple {16988#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16988#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:26,723 INFO L273 TraceCheckUtils]: 51: Hoare triple {16988#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {16989#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:26,723 INFO L273 TraceCheckUtils]: 52: Hoare triple {16989#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {16989#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:26,724 INFO L273 TraceCheckUtils]: 53: Hoare triple {16989#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16989#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:26,724 INFO L273 TraceCheckUtils]: 54: Hoare triple {16989#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {16990#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:26,725 INFO L273 TraceCheckUtils]: 55: Hoare triple {16990#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {16990#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:26,725 INFO L273 TraceCheckUtils]: 56: Hoare triple {16990#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16990#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:26,726 INFO L273 TraceCheckUtils]: 57: Hoare triple {16990#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {16991#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:26,727 INFO L273 TraceCheckUtils]: 58: Hoare triple {16991#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {16991#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:26,727 INFO L273 TraceCheckUtils]: 59: Hoare triple {16991#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16991#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:26,728 INFO L273 TraceCheckUtils]: 60: Hoare triple {16991#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {16992#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:26,728 INFO L273 TraceCheckUtils]: 61: Hoare triple {16992#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {16992#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:26,729 INFO L273 TraceCheckUtils]: 62: Hoare triple {16992#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16992#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:26,730 INFO L273 TraceCheckUtils]: 63: Hoare triple {16992#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {16993#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:26,730 INFO L273 TraceCheckUtils]: 64: Hoare triple {16993#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {16993#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:26,731 INFO L273 TraceCheckUtils]: 65: Hoare triple {16993#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16993#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:26,732 INFO L273 TraceCheckUtils]: 66: Hoare triple {16993#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {16994#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:26,732 INFO L273 TraceCheckUtils]: 67: Hoare triple {16994#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {16994#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:26,733 INFO L273 TraceCheckUtils]: 68: Hoare triple {16994#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16994#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:26,733 INFO L273 TraceCheckUtils]: 69: Hoare triple {16994#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {16995#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:26,734 INFO L273 TraceCheckUtils]: 70: Hoare triple {16995#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {16995#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:26,734 INFO L273 TraceCheckUtils]: 71: Hoare triple {16995#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16995#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:26,735 INFO L273 TraceCheckUtils]: 72: Hoare triple {16995#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {16996#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:26,736 INFO L273 TraceCheckUtils]: 73: Hoare triple {16996#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {16996#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:26,736 INFO L273 TraceCheckUtils]: 74: Hoare triple {16996#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16996#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:26,737 INFO L273 TraceCheckUtils]: 75: Hoare triple {16996#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {16997#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:26,738 INFO L273 TraceCheckUtils]: 76: Hoare triple {16997#(<= main_~i~0 24)} assume !(~i~0 < 100000); {16973#false} is VALID [2018-11-23 11:52:26,738 INFO L273 TraceCheckUtils]: 77: Hoare triple {16973#false} assume !(0 != ~swapped~0); {16973#false} is VALID [2018-11-23 11:52:26,738 INFO L273 TraceCheckUtils]: 78: Hoare triple {16973#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {16973#false} is VALID [2018-11-23 11:52:26,738 INFO L273 TraceCheckUtils]: 79: Hoare triple {16973#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {16973#false} is VALID [2018-11-23 11:52:26,738 INFO L273 TraceCheckUtils]: 80: Hoare triple {16973#false} assume !!(~y~0 < 100000);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); {16973#false} is VALID [2018-11-23 11:52:26,739 INFO L256 TraceCheckUtils]: 81: Hoare triple {16973#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {16973#false} is VALID [2018-11-23 11:52:26,739 INFO L273 TraceCheckUtils]: 82: Hoare triple {16973#false} ~cond := #in~cond; {16973#false} is VALID [2018-11-23 11:52:26,739 INFO L273 TraceCheckUtils]: 83: Hoare triple {16973#false} assume 0 == ~cond; {16973#false} is VALID [2018-11-23 11:52:26,739 INFO L273 TraceCheckUtils]: 84: Hoare triple {16973#false} assume !false; {16973#false} is VALID [2018-11-23 11:52:26,745 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 1 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:26,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:26,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2018-11-23 11:52:26,764 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 85 [2018-11-23 11:52:26,764 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:26,765 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-23 11:52:26,851 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:26,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-23 11:52:26,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 11:52:26,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-23 11:52:26,852 INFO L87 Difference]: Start difference. First operand 159 states and 208 transitions. Second operand 27 states. [2018-11-23 11:52:27,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:27,521 INFO L93 Difference]: Finished difference Result 322 states and 426 transitions. [2018-11-23 11:52:27,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 11:52:27,521 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 85 [2018-11-23 11:52:27,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:27,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 11:52:27,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 145 transitions. [2018-11-23 11:52:27,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 11:52:27,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 145 transitions. [2018-11-23 11:52:27,525 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 145 transitions. [2018-11-23 11:52:27,672 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:27,675 INFO L225 Difference]: With dead ends: 322 [2018-11-23 11:52:27,675 INFO L226 Difference]: Without dead ends: 169 [2018-11-23 11:52:27,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-23 11:52:27,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-11-23 11:52:27,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 165. [2018-11-23 11:52:27,738 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:27,738 INFO L82 GeneralOperation]: Start isEquivalent. First operand 169 states. Second operand 165 states. [2018-11-23 11:52:27,738 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand 165 states. [2018-11-23 11:52:27,739 INFO L87 Difference]: Start difference. First operand 169 states. Second operand 165 states. [2018-11-23 11:52:27,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:27,742 INFO L93 Difference]: Finished difference Result 169 states and 222 transitions. [2018-11-23 11:52:27,743 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 222 transitions. [2018-11-23 11:52:27,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:27,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:27,743 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand 169 states. [2018-11-23 11:52:27,743 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 169 states. [2018-11-23 11:52:27,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:27,746 INFO L93 Difference]: Finished difference Result 169 states and 222 transitions. [2018-11-23 11:52:27,747 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 222 transitions. [2018-11-23 11:52:27,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:27,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:27,747 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:27,747 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:27,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-23 11:52:27,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 216 transitions. [2018-11-23 11:52:27,750 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 216 transitions. Word has length 85 [2018-11-23 11:52:27,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:27,751 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 216 transitions. [2018-11-23 11:52:27,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-23 11:52:27,751 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 216 transitions. [2018-11-23 11:52:27,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-23 11:52:27,752 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:27,752 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:27,752 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:27,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:27,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1954854993, now seen corresponding path program 24 times [2018-11-23 11:52:27,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:27,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:27,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:27,753 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:27,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:27,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:28,927 INFO L256 TraceCheckUtils]: 0: Hoare triple {18249#true} call ULTIMATE.init(); {18249#true} is VALID [2018-11-23 11:52:28,927 INFO L273 TraceCheckUtils]: 1: Hoare triple {18249#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {18249#true} is VALID [2018-11-23 11:52:28,927 INFO L273 TraceCheckUtils]: 2: Hoare triple {18249#true} assume true; {18249#true} is VALID [2018-11-23 11:52:28,927 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18249#true} {18249#true} #79#return; {18249#true} is VALID [2018-11-23 11:52:28,927 INFO L256 TraceCheckUtils]: 4: Hoare triple {18249#true} call #t~ret8 := main(); {18249#true} is VALID [2018-11-23 11:52:28,928 INFO L273 TraceCheckUtils]: 5: Hoare triple {18249#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {18249#true} is VALID [2018-11-23 11:52:28,928 INFO L273 TraceCheckUtils]: 6: Hoare triple {18249#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {18251#(= main_~i~0 1)} is VALID [2018-11-23 11:52:28,929 INFO L273 TraceCheckUtils]: 7: Hoare triple {18251#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {18251#(= main_~i~0 1)} is VALID [2018-11-23 11:52:28,929 INFO L273 TraceCheckUtils]: 8: Hoare triple {18251#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18251#(= main_~i~0 1)} is VALID [2018-11-23 11:52:28,930 INFO L273 TraceCheckUtils]: 9: Hoare triple {18251#(= main_~i~0 1)} ~i~0 := 1 + ~i~0; {18252#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:28,930 INFO L273 TraceCheckUtils]: 10: Hoare triple {18252#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {18252#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:28,930 INFO L273 TraceCheckUtils]: 11: Hoare triple {18252#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18252#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:28,931 INFO L273 TraceCheckUtils]: 12: Hoare triple {18252#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {18253#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:28,931 INFO L273 TraceCheckUtils]: 13: Hoare triple {18253#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {18253#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:28,931 INFO L273 TraceCheckUtils]: 14: Hoare triple {18253#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18253#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:28,932 INFO L273 TraceCheckUtils]: 15: Hoare triple {18253#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {18254#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:28,932 INFO L273 TraceCheckUtils]: 16: Hoare triple {18254#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {18254#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:28,933 INFO L273 TraceCheckUtils]: 17: Hoare triple {18254#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18254#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:28,934 INFO L273 TraceCheckUtils]: 18: Hoare triple {18254#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {18255#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:28,934 INFO L273 TraceCheckUtils]: 19: Hoare triple {18255#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {18255#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:28,935 INFO L273 TraceCheckUtils]: 20: Hoare triple {18255#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18255#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:28,935 INFO L273 TraceCheckUtils]: 21: Hoare triple {18255#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {18256#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:28,936 INFO L273 TraceCheckUtils]: 22: Hoare triple {18256#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {18256#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:28,936 INFO L273 TraceCheckUtils]: 23: Hoare triple {18256#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18256#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:28,937 INFO L273 TraceCheckUtils]: 24: Hoare triple {18256#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {18257#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:28,937 INFO L273 TraceCheckUtils]: 25: Hoare triple {18257#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {18257#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:28,938 INFO L273 TraceCheckUtils]: 26: Hoare triple {18257#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18257#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:28,939 INFO L273 TraceCheckUtils]: 27: Hoare triple {18257#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {18258#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:28,939 INFO L273 TraceCheckUtils]: 28: Hoare triple {18258#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {18258#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:28,940 INFO L273 TraceCheckUtils]: 29: Hoare triple {18258#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18258#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:28,940 INFO L273 TraceCheckUtils]: 30: Hoare triple {18258#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {18259#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:28,941 INFO L273 TraceCheckUtils]: 31: Hoare triple {18259#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {18259#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:28,941 INFO L273 TraceCheckUtils]: 32: Hoare triple {18259#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18259#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:28,942 INFO L273 TraceCheckUtils]: 33: Hoare triple {18259#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {18260#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:28,942 INFO L273 TraceCheckUtils]: 34: Hoare triple {18260#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {18260#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:28,943 INFO L273 TraceCheckUtils]: 35: Hoare triple {18260#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18260#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:28,944 INFO L273 TraceCheckUtils]: 36: Hoare triple {18260#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {18261#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:28,944 INFO L273 TraceCheckUtils]: 37: Hoare triple {18261#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {18261#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:28,945 INFO L273 TraceCheckUtils]: 38: Hoare triple {18261#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18261#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:28,945 INFO L273 TraceCheckUtils]: 39: Hoare triple {18261#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {18262#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:28,946 INFO L273 TraceCheckUtils]: 40: Hoare triple {18262#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {18262#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:28,946 INFO L273 TraceCheckUtils]: 41: Hoare triple {18262#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18262#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:28,947 INFO L273 TraceCheckUtils]: 42: Hoare triple {18262#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {18263#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:28,947 INFO L273 TraceCheckUtils]: 43: Hoare triple {18263#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {18263#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:28,948 INFO L273 TraceCheckUtils]: 44: Hoare triple {18263#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18263#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:28,949 INFO L273 TraceCheckUtils]: 45: Hoare triple {18263#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {18264#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:28,949 INFO L273 TraceCheckUtils]: 46: Hoare triple {18264#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {18264#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:28,950 INFO L273 TraceCheckUtils]: 47: Hoare triple {18264#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18264#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:28,950 INFO L273 TraceCheckUtils]: 48: Hoare triple {18264#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {18265#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:28,951 INFO L273 TraceCheckUtils]: 49: Hoare triple {18265#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {18265#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:28,951 INFO L273 TraceCheckUtils]: 50: Hoare triple {18265#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18265#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:28,952 INFO L273 TraceCheckUtils]: 51: Hoare triple {18265#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {18266#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:28,952 INFO L273 TraceCheckUtils]: 52: Hoare triple {18266#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {18266#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:28,953 INFO L273 TraceCheckUtils]: 53: Hoare triple {18266#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18266#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:28,954 INFO L273 TraceCheckUtils]: 54: Hoare triple {18266#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {18267#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:28,954 INFO L273 TraceCheckUtils]: 55: Hoare triple {18267#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {18267#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:28,955 INFO L273 TraceCheckUtils]: 56: Hoare triple {18267#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18267#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:28,955 INFO L273 TraceCheckUtils]: 57: Hoare triple {18267#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {18268#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:28,956 INFO L273 TraceCheckUtils]: 58: Hoare triple {18268#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {18268#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:28,956 INFO L273 TraceCheckUtils]: 59: Hoare triple {18268#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18268#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:28,957 INFO L273 TraceCheckUtils]: 60: Hoare triple {18268#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {18269#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:28,958 INFO L273 TraceCheckUtils]: 61: Hoare triple {18269#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {18269#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:28,958 INFO L273 TraceCheckUtils]: 62: Hoare triple {18269#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18269#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:28,959 INFO L273 TraceCheckUtils]: 63: Hoare triple {18269#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {18270#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:28,959 INFO L273 TraceCheckUtils]: 64: Hoare triple {18270#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {18270#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:28,960 INFO L273 TraceCheckUtils]: 65: Hoare triple {18270#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18270#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:28,960 INFO L273 TraceCheckUtils]: 66: Hoare triple {18270#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {18271#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:28,961 INFO L273 TraceCheckUtils]: 67: Hoare triple {18271#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {18271#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:28,961 INFO L273 TraceCheckUtils]: 68: Hoare triple {18271#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18271#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:28,962 INFO L273 TraceCheckUtils]: 69: Hoare triple {18271#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {18272#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:28,963 INFO L273 TraceCheckUtils]: 70: Hoare triple {18272#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {18272#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:28,963 INFO L273 TraceCheckUtils]: 71: Hoare triple {18272#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18272#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:28,964 INFO L273 TraceCheckUtils]: 72: Hoare triple {18272#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {18273#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:28,964 INFO L273 TraceCheckUtils]: 73: Hoare triple {18273#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {18273#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:28,965 INFO L273 TraceCheckUtils]: 74: Hoare triple {18273#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18273#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:28,965 INFO L273 TraceCheckUtils]: 75: Hoare triple {18273#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {18274#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:28,966 INFO L273 TraceCheckUtils]: 76: Hoare triple {18274#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {18274#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:28,966 INFO L273 TraceCheckUtils]: 77: Hoare triple {18274#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18274#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:28,967 INFO L273 TraceCheckUtils]: 78: Hoare triple {18274#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {18275#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:28,968 INFO L273 TraceCheckUtils]: 79: Hoare triple {18275#(<= main_~i~0 25)} assume !(~i~0 < 100000); {18250#false} is VALID [2018-11-23 11:52:28,968 INFO L273 TraceCheckUtils]: 80: Hoare triple {18250#false} assume !(0 != ~swapped~0); {18250#false} is VALID [2018-11-23 11:52:28,968 INFO L273 TraceCheckUtils]: 81: Hoare triple {18250#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {18250#false} is VALID [2018-11-23 11:52:28,968 INFO L273 TraceCheckUtils]: 82: Hoare triple {18250#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {18250#false} is VALID [2018-11-23 11:52:28,968 INFO L273 TraceCheckUtils]: 83: Hoare triple {18250#false} assume !!(~y~0 < 100000);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); {18250#false} is VALID [2018-11-23 11:52:28,969 INFO L256 TraceCheckUtils]: 84: Hoare triple {18250#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {18250#false} is VALID [2018-11-23 11:52:28,969 INFO L273 TraceCheckUtils]: 85: Hoare triple {18250#false} ~cond := #in~cond; {18250#false} is VALID [2018-11-23 11:52:28,969 INFO L273 TraceCheckUtils]: 86: Hoare triple {18250#false} assume 0 == ~cond; {18250#false} is VALID [2018-11-23 11:52:28,969 INFO L273 TraceCheckUtils]: 87: Hoare triple {18250#false} assume !false; {18250#false} is VALID [2018-11-23 11:52:28,974 INFO L134 CoverageAnalysis]: Checked inductivity of 853 backedges. 1 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:28,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:28,975 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:52:28,985 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:52:29,052 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 26 check-sat command(s) [2018-11-23 11:52:29,053 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:29,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:29,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:29,273 INFO L256 TraceCheckUtils]: 0: Hoare triple {18249#true} call ULTIMATE.init(); {18249#true} is VALID [2018-11-23 11:52:29,273 INFO L273 TraceCheckUtils]: 1: Hoare triple {18249#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {18249#true} is VALID [2018-11-23 11:52:29,273 INFO L273 TraceCheckUtils]: 2: Hoare triple {18249#true} assume true; {18249#true} is VALID [2018-11-23 11:52:29,273 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18249#true} {18249#true} #79#return; {18249#true} is VALID [2018-11-23 11:52:29,274 INFO L256 TraceCheckUtils]: 4: Hoare triple {18249#true} call #t~ret8 := main(); {18249#true} is VALID [2018-11-23 11:52:29,274 INFO L273 TraceCheckUtils]: 5: Hoare triple {18249#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {18249#true} is VALID [2018-11-23 11:52:29,274 INFO L273 TraceCheckUtils]: 6: Hoare triple {18249#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {18297#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:29,275 INFO L273 TraceCheckUtils]: 7: Hoare triple {18297#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {18297#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:29,275 INFO L273 TraceCheckUtils]: 8: Hoare triple {18297#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18297#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:29,276 INFO L273 TraceCheckUtils]: 9: Hoare triple {18297#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {18252#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:29,276 INFO L273 TraceCheckUtils]: 10: Hoare triple {18252#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {18252#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:29,276 INFO L273 TraceCheckUtils]: 11: Hoare triple {18252#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18252#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:29,277 INFO L273 TraceCheckUtils]: 12: Hoare triple {18252#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {18253#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:29,277 INFO L273 TraceCheckUtils]: 13: Hoare triple {18253#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {18253#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:29,277 INFO L273 TraceCheckUtils]: 14: Hoare triple {18253#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18253#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:29,278 INFO L273 TraceCheckUtils]: 15: Hoare triple {18253#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {18254#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:29,278 INFO L273 TraceCheckUtils]: 16: Hoare triple {18254#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {18254#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:29,279 INFO L273 TraceCheckUtils]: 17: Hoare triple {18254#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18254#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:29,280 INFO L273 TraceCheckUtils]: 18: Hoare triple {18254#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {18255#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:29,280 INFO L273 TraceCheckUtils]: 19: Hoare triple {18255#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {18255#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:29,281 INFO L273 TraceCheckUtils]: 20: Hoare triple {18255#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18255#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:29,281 INFO L273 TraceCheckUtils]: 21: Hoare triple {18255#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {18256#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:29,282 INFO L273 TraceCheckUtils]: 22: Hoare triple {18256#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {18256#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:29,282 INFO L273 TraceCheckUtils]: 23: Hoare triple {18256#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18256#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:29,283 INFO L273 TraceCheckUtils]: 24: Hoare triple {18256#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {18257#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:29,284 INFO L273 TraceCheckUtils]: 25: Hoare triple {18257#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {18257#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:29,284 INFO L273 TraceCheckUtils]: 26: Hoare triple {18257#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18257#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:29,285 INFO L273 TraceCheckUtils]: 27: Hoare triple {18257#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {18258#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:29,286 INFO L273 TraceCheckUtils]: 28: Hoare triple {18258#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {18258#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:29,286 INFO L273 TraceCheckUtils]: 29: Hoare triple {18258#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18258#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:29,287 INFO L273 TraceCheckUtils]: 30: Hoare triple {18258#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {18259#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:29,287 INFO L273 TraceCheckUtils]: 31: Hoare triple {18259#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {18259#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:29,288 INFO L273 TraceCheckUtils]: 32: Hoare triple {18259#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18259#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:29,289 INFO L273 TraceCheckUtils]: 33: Hoare triple {18259#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {18260#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:29,289 INFO L273 TraceCheckUtils]: 34: Hoare triple {18260#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {18260#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:29,290 INFO L273 TraceCheckUtils]: 35: Hoare triple {18260#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18260#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:29,290 INFO L273 TraceCheckUtils]: 36: Hoare triple {18260#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {18261#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:29,291 INFO L273 TraceCheckUtils]: 37: Hoare triple {18261#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {18261#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:29,291 INFO L273 TraceCheckUtils]: 38: Hoare triple {18261#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18261#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:29,292 INFO L273 TraceCheckUtils]: 39: Hoare triple {18261#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {18262#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:29,293 INFO L273 TraceCheckUtils]: 40: Hoare triple {18262#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {18262#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:29,293 INFO L273 TraceCheckUtils]: 41: Hoare triple {18262#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18262#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:29,294 INFO L273 TraceCheckUtils]: 42: Hoare triple {18262#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {18263#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:29,294 INFO L273 TraceCheckUtils]: 43: Hoare triple {18263#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {18263#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:29,295 INFO L273 TraceCheckUtils]: 44: Hoare triple {18263#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18263#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:29,296 INFO L273 TraceCheckUtils]: 45: Hoare triple {18263#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {18264#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:29,296 INFO L273 TraceCheckUtils]: 46: Hoare triple {18264#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {18264#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:29,297 INFO L273 TraceCheckUtils]: 47: Hoare triple {18264#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18264#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:29,297 INFO L273 TraceCheckUtils]: 48: Hoare triple {18264#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {18265#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:29,298 INFO L273 TraceCheckUtils]: 49: Hoare triple {18265#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {18265#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:29,299 INFO L273 TraceCheckUtils]: 50: Hoare triple {18265#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18265#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:29,299 INFO L273 TraceCheckUtils]: 51: Hoare triple {18265#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {18266#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:29,300 INFO L273 TraceCheckUtils]: 52: Hoare triple {18266#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {18266#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:29,300 INFO L273 TraceCheckUtils]: 53: Hoare triple {18266#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18266#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:29,301 INFO L273 TraceCheckUtils]: 54: Hoare triple {18266#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {18267#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:29,302 INFO L273 TraceCheckUtils]: 55: Hoare triple {18267#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {18267#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:29,302 INFO L273 TraceCheckUtils]: 56: Hoare triple {18267#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18267#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:29,303 INFO L273 TraceCheckUtils]: 57: Hoare triple {18267#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {18268#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:29,303 INFO L273 TraceCheckUtils]: 58: Hoare triple {18268#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {18268#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:29,304 INFO L273 TraceCheckUtils]: 59: Hoare triple {18268#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18268#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:29,305 INFO L273 TraceCheckUtils]: 60: Hoare triple {18268#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {18269#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:29,305 INFO L273 TraceCheckUtils]: 61: Hoare triple {18269#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {18269#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:29,306 INFO L273 TraceCheckUtils]: 62: Hoare triple {18269#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18269#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:29,306 INFO L273 TraceCheckUtils]: 63: Hoare triple {18269#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {18270#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:29,307 INFO L273 TraceCheckUtils]: 64: Hoare triple {18270#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {18270#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:29,308 INFO L273 TraceCheckUtils]: 65: Hoare triple {18270#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18270#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:29,308 INFO L273 TraceCheckUtils]: 66: Hoare triple {18270#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {18271#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:29,309 INFO L273 TraceCheckUtils]: 67: Hoare triple {18271#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {18271#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:29,309 INFO L273 TraceCheckUtils]: 68: Hoare triple {18271#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18271#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:29,310 INFO L273 TraceCheckUtils]: 69: Hoare triple {18271#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {18272#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:29,311 INFO L273 TraceCheckUtils]: 70: Hoare triple {18272#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {18272#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:29,311 INFO L273 TraceCheckUtils]: 71: Hoare triple {18272#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18272#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:29,312 INFO L273 TraceCheckUtils]: 72: Hoare triple {18272#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {18273#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:29,312 INFO L273 TraceCheckUtils]: 73: Hoare triple {18273#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {18273#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:29,313 INFO L273 TraceCheckUtils]: 74: Hoare triple {18273#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18273#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:29,314 INFO L273 TraceCheckUtils]: 75: Hoare triple {18273#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {18274#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:29,314 INFO L273 TraceCheckUtils]: 76: Hoare triple {18274#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {18274#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:29,315 INFO L273 TraceCheckUtils]: 77: Hoare triple {18274#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18274#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:29,315 INFO L273 TraceCheckUtils]: 78: Hoare triple {18274#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {18275#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:29,316 INFO L273 TraceCheckUtils]: 79: Hoare triple {18275#(<= main_~i~0 25)} assume !(~i~0 < 100000); {18250#false} is VALID [2018-11-23 11:52:29,316 INFO L273 TraceCheckUtils]: 80: Hoare triple {18250#false} assume !(0 != ~swapped~0); {18250#false} is VALID [2018-11-23 11:52:29,317 INFO L273 TraceCheckUtils]: 81: Hoare triple {18250#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {18250#false} is VALID [2018-11-23 11:52:29,317 INFO L273 TraceCheckUtils]: 82: Hoare triple {18250#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {18250#false} is VALID [2018-11-23 11:52:29,317 INFO L273 TraceCheckUtils]: 83: Hoare triple {18250#false} assume !!(~y~0 < 100000);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); {18250#false} is VALID [2018-11-23 11:52:29,317 INFO L256 TraceCheckUtils]: 84: Hoare triple {18250#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {18250#false} is VALID [2018-11-23 11:52:29,317 INFO L273 TraceCheckUtils]: 85: Hoare triple {18250#false} ~cond := #in~cond; {18250#false} is VALID [2018-11-23 11:52:29,318 INFO L273 TraceCheckUtils]: 86: Hoare triple {18250#false} assume 0 == ~cond; {18250#false} is VALID [2018-11-23 11:52:29,318 INFO L273 TraceCheckUtils]: 87: Hoare triple {18250#false} assume !false; {18250#false} is VALID [2018-11-23 11:52:29,324 INFO L134 CoverageAnalysis]: Checked inductivity of 853 backedges. 1 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:29,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:29,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2018-11-23 11:52:29,343 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 88 [2018-11-23 11:52:29,344 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:29,344 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-23 11:52:29,426 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:29,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 11:52:29,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 11:52:29,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-23 11:52:29,427 INFO L87 Difference]: Start difference. First operand 165 states and 216 transitions. Second operand 28 states. [2018-11-23 11:52:30,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:30,267 INFO L93 Difference]: Finished difference Result 334 states and 442 transitions. [2018-11-23 11:52:30,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 11:52:30,267 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 88 [2018-11-23 11:52:30,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:30,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:52:30,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 149 transitions. [2018-11-23 11:52:30,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:52:30,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 149 transitions. [2018-11-23 11:52:30,269 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 149 transitions. [2018-11-23 11:52:31,325 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:31,328 INFO L225 Difference]: With dead ends: 334 [2018-11-23 11:52:31,328 INFO L226 Difference]: Without dead ends: 175 [2018-11-23 11:52:31,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-23 11:52:31,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-11-23 11:52:31,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 171. [2018-11-23 11:52:31,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:31,529 INFO L82 GeneralOperation]: Start isEquivalent. First operand 175 states. Second operand 171 states. [2018-11-23 11:52:31,529 INFO L74 IsIncluded]: Start isIncluded. First operand 175 states. Second operand 171 states. [2018-11-23 11:52:31,529 INFO L87 Difference]: Start difference. First operand 175 states. Second operand 171 states. [2018-11-23 11:52:31,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:31,532 INFO L93 Difference]: Finished difference Result 175 states and 230 transitions. [2018-11-23 11:52:31,532 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 230 transitions. [2018-11-23 11:52:31,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:31,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:31,533 INFO L74 IsIncluded]: Start isIncluded. First operand 171 states. Second operand 175 states. [2018-11-23 11:52:31,533 INFO L87 Difference]: Start difference. First operand 171 states. Second operand 175 states. [2018-11-23 11:52:31,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:31,535 INFO L93 Difference]: Finished difference Result 175 states and 230 transitions. [2018-11-23 11:52:31,535 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 230 transitions. [2018-11-23 11:52:31,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:31,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:31,536 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:31,536 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:31,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-11-23 11:52:31,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 224 transitions. [2018-11-23 11:52:31,538 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 224 transitions. Word has length 88 [2018-11-23 11:52:31,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:31,538 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 224 transitions. [2018-11-23 11:52:31,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-23 11:52:31,538 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 224 transitions. [2018-11-23 11:52:31,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 11:52:31,539 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:31,539 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:31,540 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:31,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:31,540 INFO L82 PathProgramCache]: Analyzing trace with hash 336189832, now seen corresponding path program 25 times [2018-11-23 11:52:31,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:31,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:31,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:31,541 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:31,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:31,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:32,344 INFO L256 TraceCheckUtils]: 0: Hoare triple {19572#true} call ULTIMATE.init(); {19572#true} is VALID [2018-11-23 11:52:32,345 INFO L273 TraceCheckUtils]: 1: Hoare triple {19572#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19572#true} is VALID [2018-11-23 11:52:32,345 INFO L273 TraceCheckUtils]: 2: Hoare triple {19572#true} assume true; {19572#true} is VALID [2018-11-23 11:52:32,345 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19572#true} {19572#true} #79#return; {19572#true} is VALID [2018-11-23 11:52:32,345 INFO L256 TraceCheckUtils]: 4: Hoare triple {19572#true} call #t~ret8 := main(); {19572#true} is VALID [2018-11-23 11:52:32,345 INFO L273 TraceCheckUtils]: 5: Hoare triple {19572#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {19572#true} is VALID [2018-11-23 11:52:32,346 INFO L273 TraceCheckUtils]: 6: Hoare triple {19572#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {19574#(= main_~i~0 1)} is VALID [2018-11-23 11:52:32,346 INFO L273 TraceCheckUtils]: 7: Hoare triple {19574#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {19574#(= main_~i~0 1)} is VALID [2018-11-23 11:52:32,347 INFO L273 TraceCheckUtils]: 8: Hoare triple {19574#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19574#(= main_~i~0 1)} is VALID [2018-11-23 11:52:32,347 INFO L273 TraceCheckUtils]: 9: Hoare triple {19574#(= main_~i~0 1)} ~i~0 := 1 + ~i~0; {19575#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:32,348 INFO L273 TraceCheckUtils]: 10: Hoare triple {19575#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {19575#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:32,348 INFO L273 TraceCheckUtils]: 11: Hoare triple {19575#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19575#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:32,349 INFO L273 TraceCheckUtils]: 12: Hoare triple {19575#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {19576#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:32,349 INFO L273 TraceCheckUtils]: 13: Hoare triple {19576#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {19576#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:32,349 INFO L273 TraceCheckUtils]: 14: Hoare triple {19576#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19576#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:32,357 INFO L273 TraceCheckUtils]: 15: Hoare triple {19576#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {19577#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:32,358 INFO L273 TraceCheckUtils]: 16: Hoare triple {19577#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {19577#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:32,358 INFO L273 TraceCheckUtils]: 17: Hoare triple {19577#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19577#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:32,359 INFO L273 TraceCheckUtils]: 18: Hoare triple {19577#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {19578#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:32,359 INFO L273 TraceCheckUtils]: 19: Hoare triple {19578#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {19578#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:32,359 INFO L273 TraceCheckUtils]: 20: Hoare triple {19578#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19578#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:32,360 INFO L273 TraceCheckUtils]: 21: Hoare triple {19578#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {19579#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:32,360 INFO L273 TraceCheckUtils]: 22: Hoare triple {19579#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {19579#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:32,361 INFO L273 TraceCheckUtils]: 23: Hoare triple {19579#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19579#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:32,361 INFO L273 TraceCheckUtils]: 24: Hoare triple {19579#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {19580#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:32,362 INFO L273 TraceCheckUtils]: 25: Hoare triple {19580#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {19580#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:32,362 INFO L273 TraceCheckUtils]: 26: Hoare triple {19580#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19580#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:32,363 INFO L273 TraceCheckUtils]: 27: Hoare triple {19580#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {19581#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:32,364 INFO L273 TraceCheckUtils]: 28: Hoare triple {19581#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {19581#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:32,364 INFO L273 TraceCheckUtils]: 29: Hoare triple {19581#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19581#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:32,365 INFO L273 TraceCheckUtils]: 30: Hoare triple {19581#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {19582#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:32,365 INFO L273 TraceCheckUtils]: 31: Hoare triple {19582#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {19582#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:32,366 INFO L273 TraceCheckUtils]: 32: Hoare triple {19582#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19582#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:32,367 INFO L273 TraceCheckUtils]: 33: Hoare triple {19582#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {19583#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:32,367 INFO L273 TraceCheckUtils]: 34: Hoare triple {19583#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {19583#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:32,368 INFO L273 TraceCheckUtils]: 35: Hoare triple {19583#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19583#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:32,368 INFO L273 TraceCheckUtils]: 36: Hoare triple {19583#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {19584#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:32,369 INFO L273 TraceCheckUtils]: 37: Hoare triple {19584#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {19584#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:32,369 INFO L273 TraceCheckUtils]: 38: Hoare triple {19584#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19584#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:32,370 INFO L273 TraceCheckUtils]: 39: Hoare triple {19584#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {19585#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:32,371 INFO L273 TraceCheckUtils]: 40: Hoare triple {19585#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {19585#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:32,371 INFO L273 TraceCheckUtils]: 41: Hoare triple {19585#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19585#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:32,372 INFO L273 TraceCheckUtils]: 42: Hoare triple {19585#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {19586#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:32,372 INFO L273 TraceCheckUtils]: 43: Hoare triple {19586#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {19586#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:32,373 INFO L273 TraceCheckUtils]: 44: Hoare triple {19586#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19586#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:32,374 INFO L273 TraceCheckUtils]: 45: Hoare triple {19586#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {19587#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:32,374 INFO L273 TraceCheckUtils]: 46: Hoare triple {19587#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {19587#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:32,375 INFO L273 TraceCheckUtils]: 47: Hoare triple {19587#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19587#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:32,375 INFO L273 TraceCheckUtils]: 48: Hoare triple {19587#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {19588#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:32,376 INFO L273 TraceCheckUtils]: 49: Hoare triple {19588#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {19588#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:32,377 INFO L273 TraceCheckUtils]: 50: Hoare triple {19588#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19588#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:32,377 INFO L273 TraceCheckUtils]: 51: Hoare triple {19588#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {19589#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:32,378 INFO L273 TraceCheckUtils]: 52: Hoare triple {19589#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {19589#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:32,378 INFO L273 TraceCheckUtils]: 53: Hoare triple {19589#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19589#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:32,379 INFO L273 TraceCheckUtils]: 54: Hoare triple {19589#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {19590#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:32,380 INFO L273 TraceCheckUtils]: 55: Hoare triple {19590#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {19590#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:32,380 INFO L273 TraceCheckUtils]: 56: Hoare triple {19590#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19590#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:32,381 INFO L273 TraceCheckUtils]: 57: Hoare triple {19590#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {19591#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:32,381 INFO L273 TraceCheckUtils]: 58: Hoare triple {19591#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {19591#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:32,382 INFO L273 TraceCheckUtils]: 59: Hoare triple {19591#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19591#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:32,383 INFO L273 TraceCheckUtils]: 60: Hoare triple {19591#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {19592#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:32,383 INFO L273 TraceCheckUtils]: 61: Hoare triple {19592#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {19592#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:32,384 INFO L273 TraceCheckUtils]: 62: Hoare triple {19592#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19592#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:32,384 INFO L273 TraceCheckUtils]: 63: Hoare triple {19592#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {19593#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:32,385 INFO L273 TraceCheckUtils]: 64: Hoare triple {19593#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {19593#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:32,385 INFO L273 TraceCheckUtils]: 65: Hoare triple {19593#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19593#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:32,386 INFO L273 TraceCheckUtils]: 66: Hoare triple {19593#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {19594#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:32,387 INFO L273 TraceCheckUtils]: 67: Hoare triple {19594#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {19594#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:32,387 INFO L273 TraceCheckUtils]: 68: Hoare triple {19594#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19594#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:32,388 INFO L273 TraceCheckUtils]: 69: Hoare triple {19594#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {19595#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:32,388 INFO L273 TraceCheckUtils]: 70: Hoare triple {19595#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {19595#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:32,389 INFO L273 TraceCheckUtils]: 71: Hoare triple {19595#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19595#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:32,390 INFO L273 TraceCheckUtils]: 72: Hoare triple {19595#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {19596#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:32,390 INFO L273 TraceCheckUtils]: 73: Hoare triple {19596#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {19596#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:32,391 INFO L273 TraceCheckUtils]: 74: Hoare triple {19596#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19596#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:32,391 INFO L273 TraceCheckUtils]: 75: Hoare triple {19596#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {19597#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:32,392 INFO L273 TraceCheckUtils]: 76: Hoare triple {19597#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {19597#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:32,392 INFO L273 TraceCheckUtils]: 77: Hoare triple {19597#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19597#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:32,393 INFO L273 TraceCheckUtils]: 78: Hoare triple {19597#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {19598#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:32,394 INFO L273 TraceCheckUtils]: 79: Hoare triple {19598#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {19598#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:32,394 INFO L273 TraceCheckUtils]: 80: Hoare triple {19598#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19598#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:32,395 INFO L273 TraceCheckUtils]: 81: Hoare triple {19598#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {19599#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:32,396 INFO L273 TraceCheckUtils]: 82: Hoare triple {19599#(<= main_~i~0 26)} assume !(~i~0 < 100000); {19573#false} is VALID [2018-11-23 11:52:32,396 INFO L273 TraceCheckUtils]: 83: Hoare triple {19573#false} assume !(0 != ~swapped~0); {19573#false} is VALID [2018-11-23 11:52:32,396 INFO L273 TraceCheckUtils]: 84: Hoare triple {19573#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {19573#false} is VALID [2018-11-23 11:52:32,396 INFO L273 TraceCheckUtils]: 85: Hoare triple {19573#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {19573#false} is VALID [2018-11-23 11:52:32,396 INFO L273 TraceCheckUtils]: 86: Hoare triple {19573#false} assume !!(~y~0 < 100000);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); {19573#false} is VALID [2018-11-23 11:52:32,397 INFO L256 TraceCheckUtils]: 87: Hoare triple {19573#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {19573#false} is VALID [2018-11-23 11:52:32,397 INFO L273 TraceCheckUtils]: 88: Hoare triple {19573#false} ~cond := #in~cond; {19573#false} is VALID [2018-11-23 11:52:32,397 INFO L273 TraceCheckUtils]: 89: Hoare triple {19573#false} assume 0 == ~cond; {19573#false} is VALID [2018-11-23 11:52:32,397 INFO L273 TraceCheckUtils]: 90: Hoare triple {19573#false} assume !false; {19573#false} is VALID [2018-11-23 11:52:32,404 INFO L134 CoverageAnalysis]: Checked inductivity of 926 backedges. 1 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:32,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:32,404 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:52:32,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:52:32,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:32,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:32,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:32,680 INFO L256 TraceCheckUtils]: 0: Hoare triple {19572#true} call ULTIMATE.init(); {19572#true} is VALID [2018-11-23 11:52:32,681 INFO L273 TraceCheckUtils]: 1: Hoare triple {19572#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19572#true} is VALID [2018-11-23 11:52:32,681 INFO L273 TraceCheckUtils]: 2: Hoare triple {19572#true} assume true; {19572#true} is VALID [2018-11-23 11:52:32,681 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19572#true} {19572#true} #79#return; {19572#true} is VALID [2018-11-23 11:52:32,681 INFO L256 TraceCheckUtils]: 4: Hoare triple {19572#true} call #t~ret8 := main(); {19572#true} is VALID [2018-11-23 11:52:32,681 INFO L273 TraceCheckUtils]: 5: Hoare triple {19572#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {19572#true} is VALID [2018-11-23 11:52:32,682 INFO L273 TraceCheckUtils]: 6: Hoare triple {19572#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {19621#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:32,683 INFO L273 TraceCheckUtils]: 7: Hoare triple {19621#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {19621#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:32,683 INFO L273 TraceCheckUtils]: 8: Hoare triple {19621#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19621#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:32,684 INFO L273 TraceCheckUtils]: 9: Hoare triple {19621#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {19575#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:32,684 INFO L273 TraceCheckUtils]: 10: Hoare triple {19575#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {19575#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:32,684 INFO L273 TraceCheckUtils]: 11: Hoare triple {19575#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19575#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:32,685 INFO L273 TraceCheckUtils]: 12: Hoare triple {19575#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {19576#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:32,685 INFO L273 TraceCheckUtils]: 13: Hoare triple {19576#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {19576#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:32,685 INFO L273 TraceCheckUtils]: 14: Hoare triple {19576#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19576#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:32,686 INFO L273 TraceCheckUtils]: 15: Hoare triple {19576#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {19577#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:32,686 INFO L273 TraceCheckUtils]: 16: Hoare triple {19577#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {19577#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:32,686 INFO L273 TraceCheckUtils]: 17: Hoare triple {19577#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19577#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:32,687 INFO L273 TraceCheckUtils]: 18: Hoare triple {19577#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {19578#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:32,688 INFO L273 TraceCheckUtils]: 19: Hoare triple {19578#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {19578#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:32,688 INFO L273 TraceCheckUtils]: 20: Hoare triple {19578#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19578#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:32,689 INFO L273 TraceCheckUtils]: 21: Hoare triple {19578#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {19579#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:32,689 INFO L273 TraceCheckUtils]: 22: Hoare triple {19579#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {19579#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:32,708 INFO L273 TraceCheckUtils]: 23: Hoare triple {19579#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19579#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:32,717 INFO L273 TraceCheckUtils]: 24: Hoare triple {19579#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {19580#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:32,718 INFO L273 TraceCheckUtils]: 25: Hoare triple {19580#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {19580#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:32,718 INFO L273 TraceCheckUtils]: 26: Hoare triple {19580#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19580#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:32,719 INFO L273 TraceCheckUtils]: 27: Hoare triple {19580#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {19581#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:32,719 INFO L273 TraceCheckUtils]: 28: Hoare triple {19581#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {19581#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:32,719 INFO L273 TraceCheckUtils]: 29: Hoare triple {19581#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19581#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:32,720 INFO L273 TraceCheckUtils]: 30: Hoare triple {19581#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {19582#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:32,720 INFO L273 TraceCheckUtils]: 31: Hoare triple {19582#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {19582#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:32,720 INFO L273 TraceCheckUtils]: 32: Hoare triple {19582#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19582#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:32,721 INFO L273 TraceCheckUtils]: 33: Hoare triple {19582#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {19583#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:32,721 INFO L273 TraceCheckUtils]: 34: Hoare triple {19583#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {19583#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:32,722 INFO L273 TraceCheckUtils]: 35: Hoare triple {19583#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19583#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:32,722 INFO L273 TraceCheckUtils]: 36: Hoare triple {19583#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {19584#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:32,723 INFO L273 TraceCheckUtils]: 37: Hoare triple {19584#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {19584#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:32,723 INFO L273 TraceCheckUtils]: 38: Hoare triple {19584#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19584#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:32,724 INFO L273 TraceCheckUtils]: 39: Hoare triple {19584#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {19585#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:32,725 INFO L273 TraceCheckUtils]: 40: Hoare triple {19585#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {19585#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:32,725 INFO L273 TraceCheckUtils]: 41: Hoare triple {19585#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19585#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:32,726 INFO L273 TraceCheckUtils]: 42: Hoare triple {19585#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {19586#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:32,726 INFO L273 TraceCheckUtils]: 43: Hoare triple {19586#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {19586#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:32,727 INFO L273 TraceCheckUtils]: 44: Hoare triple {19586#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19586#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:32,728 INFO L273 TraceCheckUtils]: 45: Hoare triple {19586#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {19587#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:32,728 INFO L273 TraceCheckUtils]: 46: Hoare triple {19587#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {19587#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:32,729 INFO L273 TraceCheckUtils]: 47: Hoare triple {19587#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19587#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:32,729 INFO L273 TraceCheckUtils]: 48: Hoare triple {19587#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {19588#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:32,732 INFO L273 TraceCheckUtils]: 49: Hoare triple {19588#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {19588#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:32,733 INFO L273 TraceCheckUtils]: 50: Hoare triple {19588#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19588#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:32,733 INFO L273 TraceCheckUtils]: 51: Hoare triple {19588#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {19589#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:32,733 INFO L273 TraceCheckUtils]: 52: Hoare triple {19589#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {19589#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:32,734 INFO L273 TraceCheckUtils]: 53: Hoare triple {19589#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19589#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:32,734 INFO L273 TraceCheckUtils]: 54: Hoare triple {19589#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {19590#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:32,734 INFO L273 TraceCheckUtils]: 55: Hoare triple {19590#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {19590#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:32,735 INFO L273 TraceCheckUtils]: 56: Hoare triple {19590#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19590#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:32,735 INFO L273 TraceCheckUtils]: 57: Hoare triple {19590#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {19591#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:32,736 INFO L273 TraceCheckUtils]: 58: Hoare triple {19591#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {19591#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:32,736 INFO L273 TraceCheckUtils]: 59: Hoare triple {19591#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19591#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:32,737 INFO L273 TraceCheckUtils]: 60: Hoare triple {19591#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {19592#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:32,737 INFO L273 TraceCheckUtils]: 61: Hoare triple {19592#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {19592#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:32,738 INFO L273 TraceCheckUtils]: 62: Hoare triple {19592#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19592#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:32,739 INFO L273 TraceCheckUtils]: 63: Hoare triple {19592#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {19593#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:32,739 INFO L273 TraceCheckUtils]: 64: Hoare triple {19593#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {19593#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:32,740 INFO L273 TraceCheckUtils]: 65: Hoare triple {19593#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19593#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:32,740 INFO L273 TraceCheckUtils]: 66: Hoare triple {19593#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {19594#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:32,741 INFO L273 TraceCheckUtils]: 67: Hoare triple {19594#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {19594#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:32,741 INFO L273 TraceCheckUtils]: 68: Hoare triple {19594#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19594#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:32,742 INFO L273 TraceCheckUtils]: 69: Hoare triple {19594#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {19595#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:32,743 INFO L273 TraceCheckUtils]: 70: Hoare triple {19595#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {19595#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:32,743 INFO L273 TraceCheckUtils]: 71: Hoare triple {19595#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19595#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:32,744 INFO L273 TraceCheckUtils]: 72: Hoare triple {19595#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {19596#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:32,744 INFO L273 TraceCheckUtils]: 73: Hoare triple {19596#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {19596#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:32,745 INFO L273 TraceCheckUtils]: 74: Hoare triple {19596#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19596#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:32,746 INFO L273 TraceCheckUtils]: 75: Hoare triple {19596#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {19597#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:32,746 INFO L273 TraceCheckUtils]: 76: Hoare triple {19597#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {19597#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:32,747 INFO L273 TraceCheckUtils]: 77: Hoare triple {19597#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19597#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:32,747 INFO L273 TraceCheckUtils]: 78: Hoare triple {19597#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {19598#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:32,748 INFO L273 TraceCheckUtils]: 79: Hoare triple {19598#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {19598#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:32,749 INFO L273 TraceCheckUtils]: 80: Hoare triple {19598#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19598#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:32,749 INFO L273 TraceCheckUtils]: 81: Hoare triple {19598#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {19599#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:32,750 INFO L273 TraceCheckUtils]: 82: Hoare triple {19599#(<= main_~i~0 26)} assume !(~i~0 < 100000); {19573#false} is VALID [2018-11-23 11:52:32,750 INFO L273 TraceCheckUtils]: 83: Hoare triple {19573#false} assume !(0 != ~swapped~0); {19573#false} is VALID [2018-11-23 11:52:32,750 INFO L273 TraceCheckUtils]: 84: Hoare triple {19573#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {19573#false} is VALID [2018-11-23 11:52:32,751 INFO L273 TraceCheckUtils]: 85: Hoare triple {19573#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {19573#false} is VALID [2018-11-23 11:52:32,751 INFO L273 TraceCheckUtils]: 86: Hoare triple {19573#false} assume !!(~y~0 < 100000);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); {19573#false} is VALID [2018-11-23 11:52:32,751 INFO L256 TraceCheckUtils]: 87: Hoare triple {19573#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {19573#false} is VALID [2018-11-23 11:52:32,751 INFO L273 TraceCheckUtils]: 88: Hoare triple {19573#false} ~cond := #in~cond; {19573#false} is VALID [2018-11-23 11:52:32,751 INFO L273 TraceCheckUtils]: 89: Hoare triple {19573#false} assume 0 == ~cond; {19573#false} is VALID [2018-11-23 11:52:32,752 INFO L273 TraceCheckUtils]: 90: Hoare triple {19573#false} assume !false; {19573#false} is VALID [2018-11-23 11:52:32,758 INFO L134 CoverageAnalysis]: Checked inductivity of 926 backedges. 1 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:32,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:32,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-11-23 11:52:32,794 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 91 [2018-11-23 11:52:32,795 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:32,795 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-23 11:52:32,887 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:32,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 11:52:32,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 11:52:32,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 11:52:32,889 INFO L87 Difference]: Start difference. First operand 171 states and 224 transitions. Second operand 29 states. [2018-11-23 11:52:33,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:33,461 INFO L93 Difference]: Finished difference Result 346 states and 458 transitions. [2018-11-23 11:52:33,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 11:52:33,461 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 91 [2018-11-23 11:52:33,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:33,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 11:52:33,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 153 transitions. [2018-11-23 11:52:33,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 11:52:33,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 153 transitions. [2018-11-23 11:52:33,464 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 153 transitions. [2018-11-23 11:52:33,629 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:33,633 INFO L225 Difference]: With dead ends: 346 [2018-11-23 11:52:33,633 INFO L226 Difference]: Without dead ends: 181 [2018-11-23 11:52:33,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 11:52:33,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-11-23 11:52:33,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 177. [2018-11-23 11:52:33,771 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:33,771 INFO L82 GeneralOperation]: Start isEquivalent. First operand 181 states. Second operand 177 states. [2018-11-23 11:52:33,771 INFO L74 IsIncluded]: Start isIncluded. First operand 181 states. Second operand 177 states. [2018-11-23 11:52:33,771 INFO L87 Difference]: Start difference. First operand 181 states. Second operand 177 states. [2018-11-23 11:52:33,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:33,774 INFO L93 Difference]: Finished difference Result 181 states and 238 transitions. [2018-11-23 11:52:33,774 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 238 transitions. [2018-11-23 11:52:33,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:33,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:33,774 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand 181 states. [2018-11-23 11:52:33,774 INFO L87 Difference]: Start difference. First operand 177 states. Second operand 181 states. [2018-11-23 11:52:33,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:33,777 INFO L93 Difference]: Finished difference Result 181 states and 238 transitions. [2018-11-23 11:52:33,777 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 238 transitions. [2018-11-23 11:52:33,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:33,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:33,778 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:33,778 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:33,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-11-23 11:52:33,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 232 transitions. [2018-11-23 11:52:33,780 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 232 transitions. Word has length 91 [2018-11-23 11:52:33,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:33,780 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 232 transitions. [2018-11-23 11:52:33,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 11:52:33,781 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 232 transitions. [2018-11-23 11:52:33,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-23 11:52:33,781 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:33,781 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:33,781 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:33,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:33,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1719789327, now seen corresponding path program 26 times [2018-11-23 11:52:33,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:33,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:33,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:33,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:52:33,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:33,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:35,786 INFO L256 TraceCheckUtils]: 0: Hoare triple {20941#true} call ULTIMATE.init(); {20941#true} is VALID [2018-11-23 11:52:35,787 INFO L273 TraceCheckUtils]: 1: Hoare triple {20941#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20941#true} is VALID [2018-11-23 11:52:35,787 INFO L273 TraceCheckUtils]: 2: Hoare triple {20941#true} assume true; {20941#true} is VALID [2018-11-23 11:52:35,787 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20941#true} {20941#true} #79#return; {20941#true} is VALID [2018-11-23 11:52:35,788 INFO L256 TraceCheckUtils]: 4: Hoare triple {20941#true} call #t~ret8 := main(); {20941#true} is VALID [2018-11-23 11:52:35,788 INFO L273 TraceCheckUtils]: 5: Hoare triple {20941#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {20941#true} is VALID [2018-11-23 11:52:35,788 INFO L273 TraceCheckUtils]: 6: Hoare triple {20941#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {20943#(= main_~i~0 1)} is VALID [2018-11-23 11:52:35,789 INFO L273 TraceCheckUtils]: 7: Hoare triple {20943#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {20943#(= main_~i~0 1)} is VALID [2018-11-23 11:52:35,789 INFO L273 TraceCheckUtils]: 8: Hoare triple {20943#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {20943#(= main_~i~0 1)} is VALID [2018-11-23 11:52:35,790 INFO L273 TraceCheckUtils]: 9: Hoare triple {20943#(= main_~i~0 1)} ~i~0 := 1 + ~i~0; {20944#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:35,790 INFO L273 TraceCheckUtils]: 10: Hoare triple {20944#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {20944#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:35,790 INFO L273 TraceCheckUtils]: 11: Hoare triple {20944#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {20944#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:35,791 INFO L273 TraceCheckUtils]: 12: Hoare triple {20944#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {20945#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:35,791 INFO L273 TraceCheckUtils]: 13: Hoare triple {20945#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {20945#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:35,792 INFO L273 TraceCheckUtils]: 14: Hoare triple {20945#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {20945#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:35,792 INFO L273 TraceCheckUtils]: 15: Hoare triple {20945#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {20946#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:35,793 INFO L273 TraceCheckUtils]: 16: Hoare triple {20946#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {20946#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:35,793 INFO L273 TraceCheckUtils]: 17: Hoare triple {20946#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {20946#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:35,794 INFO L273 TraceCheckUtils]: 18: Hoare triple {20946#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {20947#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:35,795 INFO L273 TraceCheckUtils]: 19: Hoare triple {20947#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {20947#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:35,795 INFO L273 TraceCheckUtils]: 20: Hoare triple {20947#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {20947#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:35,796 INFO L273 TraceCheckUtils]: 21: Hoare triple {20947#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {20948#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:35,796 INFO L273 TraceCheckUtils]: 22: Hoare triple {20948#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {20948#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:35,797 INFO L273 TraceCheckUtils]: 23: Hoare triple {20948#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {20948#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:35,798 INFO L273 TraceCheckUtils]: 24: Hoare triple {20948#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {20949#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:35,798 INFO L273 TraceCheckUtils]: 25: Hoare triple {20949#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {20949#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:35,799 INFO L273 TraceCheckUtils]: 26: Hoare triple {20949#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {20949#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:35,799 INFO L273 TraceCheckUtils]: 27: Hoare triple {20949#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {20950#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:35,800 INFO L273 TraceCheckUtils]: 28: Hoare triple {20950#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {20950#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:35,801 INFO L273 TraceCheckUtils]: 29: Hoare triple {20950#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {20950#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:35,801 INFO L273 TraceCheckUtils]: 30: Hoare triple {20950#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {20951#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:35,802 INFO L273 TraceCheckUtils]: 31: Hoare triple {20951#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {20951#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:35,802 INFO L273 TraceCheckUtils]: 32: Hoare triple {20951#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {20951#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:35,803 INFO L273 TraceCheckUtils]: 33: Hoare triple {20951#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {20952#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:35,804 INFO L273 TraceCheckUtils]: 34: Hoare triple {20952#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {20952#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:35,804 INFO L273 TraceCheckUtils]: 35: Hoare triple {20952#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {20952#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:35,805 INFO L273 TraceCheckUtils]: 36: Hoare triple {20952#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {20953#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:35,805 INFO L273 TraceCheckUtils]: 37: Hoare triple {20953#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {20953#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:35,806 INFO L273 TraceCheckUtils]: 38: Hoare triple {20953#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {20953#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:35,807 INFO L273 TraceCheckUtils]: 39: Hoare triple {20953#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {20954#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:35,807 INFO L273 TraceCheckUtils]: 40: Hoare triple {20954#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {20954#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:35,808 INFO L273 TraceCheckUtils]: 41: Hoare triple {20954#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {20954#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:35,808 INFO L273 TraceCheckUtils]: 42: Hoare triple {20954#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {20955#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:35,809 INFO L273 TraceCheckUtils]: 43: Hoare triple {20955#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {20955#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:35,809 INFO L273 TraceCheckUtils]: 44: Hoare triple {20955#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {20955#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:35,810 INFO L273 TraceCheckUtils]: 45: Hoare triple {20955#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {20956#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:35,811 INFO L273 TraceCheckUtils]: 46: Hoare triple {20956#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {20956#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:35,811 INFO L273 TraceCheckUtils]: 47: Hoare triple {20956#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {20956#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:35,812 INFO L273 TraceCheckUtils]: 48: Hoare triple {20956#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {20957#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:35,813 INFO L273 TraceCheckUtils]: 49: Hoare triple {20957#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {20957#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:35,813 INFO L273 TraceCheckUtils]: 50: Hoare triple {20957#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {20957#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:35,814 INFO L273 TraceCheckUtils]: 51: Hoare triple {20957#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {20958#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:35,814 INFO L273 TraceCheckUtils]: 52: Hoare triple {20958#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {20958#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:35,815 INFO L273 TraceCheckUtils]: 53: Hoare triple {20958#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {20958#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:35,816 INFO L273 TraceCheckUtils]: 54: Hoare triple {20958#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {20959#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:35,816 INFO L273 TraceCheckUtils]: 55: Hoare triple {20959#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {20959#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:35,817 INFO L273 TraceCheckUtils]: 56: Hoare triple {20959#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {20959#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:35,817 INFO L273 TraceCheckUtils]: 57: Hoare triple {20959#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {20960#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:35,818 INFO L273 TraceCheckUtils]: 58: Hoare triple {20960#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {20960#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:35,818 INFO L273 TraceCheckUtils]: 59: Hoare triple {20960#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {20960#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:35,819 INFO L273 TraceCheckUtils]: 60: Hoare triple {20960#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {20961#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:35,820 INFO L273 TraceCheckUtils]: 61: Hoare triple {20961#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {20961#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:35,820 INFO L273 TraceCheckUtils]: 62: Hoare triple {20961#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {20961#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:35,821 INFO L273 TraceCheckUtils]: 63: Hoare triple {20961#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {20962#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:35,821 INFO L273 TraceCheckUtils]: 64: Hoare triple {20962#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {20962#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:35,822 INFO L273 TraceCheckUtils]: 65: Hoare triple {20962#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {20962#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:35,823 INFO L273 TraceCheckUtils]: 66: Hoare triple {20962#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {20963#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:35,823 INFO L273 TraceCheckUtils]: 67: Hoare triple {20963#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {20963#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:35,824 INFO L273 TraceCheckUtils]: 68: Hoare triple {20963#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {20963#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:35,824 INFO L273 TraceCheckUtils]: 69: Hoare triple {20963#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {20964#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:35,825 INFO L273 TraceCheckUtils]: 70: Hoare triple {20964#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {20964#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:35,825 INFO L273 TraceCheckUtils]: 71: Hoare triple {20964#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {20964#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:35,826 INFO L273 TraceCheckUtils]: 72: Hoare triple {20964#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {20965#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:35,827 INFO L273 TraceCheckUtils]: 73: Hoare triple {20965#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {20965#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:35,827 INFO L273 TraceCheckUtils]: 74: Hoare triple {20965#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {20965#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:35,828 INFO L273 TraceCheckUtils]: 75: Hoare triple {20965#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {20966#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:35,828 INFO L273 TraceCheckUtils]: 76: Hoare triple {20966#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {20966#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:35,829 INFO L273 TraceCheckUtils]: 77: Hoare triple {20966#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {20966#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:35,830 INFO L273 TraceCheckUtils]: 78: Hoare triple {20966#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {20967#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:35,830 INFO L273 TraceCheckUtils]: 79: Hoare triple {20967#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {20967#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:35,831 INFO L273 TraceCheckUtils]: 80: Hoare triple {20967#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {20967#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:35,831 INFO L273 TraceCheckUtils]: 81: Hoare triple {20967#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {20968#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:35,832 INFO L273 TraceCheckUtils]: 82: Hoare triple {20968#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {20968#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:35,832 INFO L273 TraceCheckUtils]: 83: Hoare triple {20968#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {20968#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:35,833 INFO L273 TraceCheckUtils]: 84: Hoare triple {20968#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {20969#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:35,834 INFO L273 TraceCheckUtils]: 85: Hoare triple {20969#(<= main_~i~0 27)} assume !(~i~0 < 100000); {20942#false} is VALID [2018-11-23 11:52:35,834 INFO L273 TraceCheckUtils]: 86: Hoare triple {20942#false} assume !(0 != ~swapped~0); {20942#false} is VALID [2018-11-23 11:52:35,834 INFO L273 TraceCheckUtils]: 87: Hoare triple {20942#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {20942#false} is VALID [2018-11-23 11:52:35,835 INFO L273 TraceCheckUtils]: 88: Hoare triple {20942#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {20942#false} is VALID [2018-11-23 11:52:35,835 INFO L273 TraceCheckUtils]: 89: Hoare triple {20942#false} assume !!(~y~0 < 100000);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); {20942#false} is VALID [2018-11-23 11:52:35,835 INFO L256 TraceCheckUtils]: 90: Hoare triple {20942#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {20942#false} is VALID [2018-11-23 11:52:35,835 INFO L273 TraceCheckUtils]: 91: Hoare triple {20942#false} ~cond := #in~cond; {20942#false} is VALID [2018-11-23 11:52:35,835 INFO L273 TraceCheckUtils]: 92: Hoare triple {20942#false} assume 0 == ~cond; {20942#false} is VALID [2018-11-23 11:52:35,836 INFO L273 TraceCheckUtils]: 93: Hoare triple {20942#false} assume !false; {20942#false} is VALID [2018-11-23 11:52:35,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1002 backedges. 1 proven. 1001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:35,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:35,842 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:52:35,851 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:52:35,897 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:52:35,897 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:35,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:35,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:36,135 INFO L256 TraceCheckUtils]: 0: Hoare triple {20941#true} call ULTIMATE.init(); {20941#true} is VALID [2018-11-23 11:52:36,135 INFO L273 TraceCheckUtils]: 1: Hoare triple {20941#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20941#true} is VALID [2018-11-23 11:52:36,135 INFO L273 TraceCheckUtils]: 2: Hoare triple {20941#true} assume true; {20941#true} is VALID [2018-11-23 11:52:36,135 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20941#true} {20941#true} #79#return; {20941#true} is VALID [2018-11-23 11:52:36,136 INFO L256 TraceCheckUtils]: 4: Hoare triple {20941#true} call #t~ret8 := main(); {20941#true} is VALID [2018-11-23 11:52:36,136 INFO L273 TraceCheckUtils]: 5: Hoare triple {20941#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {20941#true} is VALID [2018-11-23 11:52:36,136 INFO L273 TraceCheckUtils]: 6: Hoare triple {20941#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {20991#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:36,137 INFO L273 TraceCheckUtils]: 7: Hoare triple {20991#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {20991#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:36,137 INFO L273 TraceCheckUtils]: 8: Hoare triple {20991#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {20991#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:36,138 INFO L273 TraceCheckUtils]: 9: Hoare triple {20991#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {20944#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:36,138 INFO L273 TraceCheckUtils]: 10: Hoare triple {20944#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {20944#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:36,139 INFO L273 TraceCheckUtils]: 11: Hoare triple {20944#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {20944#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:36,139 INFO L273 TraceCheckUtils]: 12: Hoare triple {20944#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {20945#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:36,140 INFO L273 TraceCheckUtils]: 13: Hoare triple {20945#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {20945#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:36,140 INFO L273 TraceCheckUtils]: 14: Hoare triple {20945#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {20945#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:36,141 INFO L273 TraceCheckUtils]: 15: Hoare triple {20945#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {20946#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:36,141 INFO L273 TraceCheckUtils]: 16: Hoare triple {20946#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {20946#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:36,142 INFO L273 TraceCheckUtils]: 17: Hoare triple {20946#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {20946#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:36,142 INFO L273 TraceCheckUtils]: 18: Hoare triple {20946#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {20947#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:36,143 INFO L273 TraceCheckUtils]: 19: Hoare triple {20947#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {20947#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:36,143 INFO L273 TraceCheckUtils]: 20: Hoare triple {20947#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {20947#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:36,144 INFO L273 TraceCheckUtils]: 21: Hoare triple {20947#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {20948#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:36,145 INFO L273 TraceCheckUtils]: 22: Hoare triple {20948#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {20948#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:36,145 INFO L273 TraceCheckUtils]: 23: Hoare triple {20948#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {20948#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:36,146 INFO L273 TraceCheckUtils]: 24: Hoare triple {20948#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {20949#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:36,146 INFO L273 TraceCheckUtils]: 25: Hoare triple {20949#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {20949#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:36,147 INFO L273 TraceCheckUtils]: 26: Hoare triple {20949#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {20949#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:36,148 INFO L273 TraceCheckUtils]: 27: Hoare triple {20949#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {20950#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:36,148 INFO L273 TraceCheckUtils]: 28: Hoare triple {20950#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {20950#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:36,149 INFO L273 TraceCheckUtils]: 29: Hoare triple {20950#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {20950#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:36,149 INFO L273 TraceCheckUtils]: 30: Hoare triple {20950#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {20951#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:36,150 INFO L273 TraceCheckUtils]: 31: Hoare triple {20951#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {20951#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:36,150 INFO L273 TraceCheckUtils]: 32: Hoare triple {20951#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {20951#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:36,151 INFO L273 TraceCheckUtils]: 33: Hoare triple {20951#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {20952#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:36,152 INFO L273 TraceCheckUtils]: 34: Hoare triple {20952#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {20952#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:36,152 INFO L273 TraceCheckUtils]: 35: Hoare triple {20952#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {20952#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:36,153 INFO L273 TraceCheckUtils]: 36: Hoare triple {20952#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {20953#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:36,154 INFO L273 TraceCheckUtils]: 37: Hoare triple {20953#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {20953#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:36,154 INFO L273 TraceCheckUtils]: 38: Hoare triple {20953#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {20953#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:36,155 INFO L273 TraceCheckUtils]: 39: Hoare triple {20953#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {20954#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:36,155 INFO L273 TraceCheckUtils]: 40: Hoare triple {20954#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {20954#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:36,156 INFO L273 TraceCheckUtils]: 41: Hoare triple {20954#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {20954#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:36,157 INFO L273 TraceCheckUtils]: 42: Hoare triple {20954#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {20955#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:36,157 INFO L273 TraceCheckUtils]: 43: Hoare triple {20955#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {20955#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:36,158 INFO L273 TraceCheckUtils]: 44: Hoare triple {20955#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {20955#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:36,158 INFO L273 TraceCheckUtils]: 45: Hoare triple {20955#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {20956#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:36,159 INFO L273 TraceCheckUtils]: 46: Hoare triple {20956#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {20956#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:36,159 INFO L273 TraceCheckUtils]: 47: Hoare triple {20956#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {20956#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:36,160 INFO L273 TraceCheckUtils]: 48: Hoare triple {20956#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {20957#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:36,161 INFO L273 TraceCheckUtils]: 49: Hoare triple {20957#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {20957#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:36,161 INFO L273 TraceCheckUtils]: 50: Hoare triple {20957#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {20957#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:36,162 INFO L273 TraceCheckUtils]: 51: Hoare triple {20957#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {20958#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:36,162 INFO L273 TraceCheckUtils]: 52: Hoare triple {20958#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {20958#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:36,163 INFO L273 TraceCheckUtils]: 53: Hoare triple {20958#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {20958#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:36,164 INFO L273 TraceCheckUtils]: 54: Hoare triple {20958#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {20959#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:36,164 INFO L273 TraceCheckUtils]: 55: Hoare triple {20959#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {20959#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:36,165 INFO L273 TraceCheckUtils]: 56: Hoare triple {20959#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {20959#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:36,165 INFO L273 TraceCheckUtils]: 57: Hoare triple {20959#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {20960#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:36,166 INFO L273 TraceCheckUtils]: 58: Hoare triple {20960#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {20960#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:36,166 INFO L273 TraceCheckUtils]: 59: Hoare triple {20960#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {20960#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:36,167 INFO L273 TraceCheckUtils]: 60: Hoare triple {20960#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {20961#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:36,168 INFO L273 TraceCheckUtils]: 61: Hoare triple {20961#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {20961#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:36,168 INFO L273 TraceCheckUtils]: 62: Hoare triple {20961#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {20961#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:36,169 INFO L273 TraceCheckUtils]: 63: Hoare triple {20961#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {20962#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:36,170 INFO L273 TraceCheckUtils]: 64: Hoare triple {20962#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {20962#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:36,170 INFO L273 TraceCheckUtils]: 65: Hoare triple {20962#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {20962#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:36,171 INFO L273 TraceCheckUtils]: 66: Hoare triple {20962#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {20963#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:36,171 INFO L273 TraceCheckUtils]: 67: Hoare triple {20963#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {20963#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:36,172 INFO L273 TraceCheckUtils]: 68: Hoare triple {20963#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {20963#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:36,173 INFO L273 TraceCheckUtils]: 69: Hoare triple {20963#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {20964#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:36,173 INFO L273 TraceCheckUtils]: 70: Hoare triple {20964#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {20964#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:36,174 INFO L273 TraceCheckUtils]: 71: Hoare triple {20964#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {20964#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:36,174 INFO L273 TraceCheckUtils]: 72: Hoare triple {20964#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {20965#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:36,175 INFO L273 TraceCheckUtils]: 73: Hoare triple {20965#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {20965#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:36,175 INFO L273 TraceCheckUtils]: 74: Hoare triple {20965#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {20965#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:36,176 INFO L273 TraceCheckUtils]: 75: Hoare triple {20965#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {20966#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:36,177 INFO L273 TraceCheckUtils]: 76: Hoare triple {20966#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {20966#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:36,177 INFO L273 TraceCheckUtils]: 77: Hoare triple {20966#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {20966#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:36,178 INFO L273 TraceCheckUtils]: 78: Hoare triple {20966#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {20967#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:36,178 INFO L273 TraceCheckUtils]: 79: Hoare triple {20967#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {20967#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:36,179 INFO L273 TraceCheckUtils]: 80: Hoare triple {20967#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {20967#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:36,180 INFO L273 TraceCheckUtils]: 81: Hoare triple {20967#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {20968#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:36,180 INFO L273 TraceCheckUtils]: 82: Hoare triple {20968#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {20968#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:36,181 INFO L273 TraceCheckUtils]: 83: Hoare triple {20968#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {20968#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:36,181 INFO L273 TraceCheckUtils]: 84: Hoare triple {20968#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {20969#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:36,182 INFO L273 TraceCheckUtils]: 85: Hoare triple {20969#(<= main_~i~0 27)} assume !(~i~0 < 100000); {20942#false} is VALID [2018-11-23 11:52:36,182 INFO L273 TraceCheckUtils]: 86: Hoare triple {20942#false} assume !(0 != ~swapped~0); {20942#false} is VALID [2018-11-23 11:52:36,183 INFO L273 TraceCheckUtils]: 87: Hoare triple {20942#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {20942#false} is VALID [2018-11-23 11:52:36,183 INFO L273 TraceCheckUtils]: 88: Hoare triple {20942#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {20942#false} is VALID [2018-11-23 11:52:36,183 INFO L273 TraceCheckUtils]: 89: Hoare triple {20942#false} assume !!(~y~0 < 100000);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); {20942#false} is VALID [2018-11-23 11:52:36,183 INFO L256 TraceCheckUtils]: 90: Hoare triple {20942#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {20942#false} is VALID [2018-11-23 11:52:36,183 INFO L273 TraceCheckUtils]: 91: Hoare triple {20942#false} ~cond := #in~cond; {20942#false} is VALID [2018-11-23 11:52:36,184 INFO L273 TraceCheckUtils]: 92: Hoare triple {20942#false} assume 0 == ~cond; {20942#false} is VALID [2018-11-23 11:52:36,184 INFO L273 TraceCheckUtils]: 93: Hoare triple {20942#false} assume !false; {20942#false} is VALID [2018-11-23 11:52:36,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1002 backedges. 1 proven. 1001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:36,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:36,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2018-11-23 11:52:36,210 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 94 [2018-11-23 11:52:36,210 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:36,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 11:52:36,303 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:36,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 11:52:36,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 11:52:36,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 11:52:36,304 INFO L87 Difference]: Start difference. First operand 177 states and 232 transitions. Second operand 30 states. [2018-11-23 11:52:37,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:37,033 INFO L93 Difference]: Finished difference Result 358 states and 474 transitions. [2018-11-23 11:52:37,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 11:52:37,033 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 94 [2018-11-23 11:52:37,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:37,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:52:37,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 157 transitions. [2018-11-23 11:52:37,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:52:37,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 157 transitions. [2018-11-23 11:52:37,036 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 157 transitions. [2018-11-23 11:52:37,178 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:37,182 INFO L225 Difference]: With dead ends: 358 [2018-11-23 11:52:37,182 INFO L226 Difference]: Without dead ends: 187 [2018-11-23 11:52:37,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 11:52:37,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-11-23 11:52:37,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 183. [2018-11-23 11:52:37,558 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:37,558 INFO L82 GeneralOperation]: Start isEquivalent. First operand 187 states. Second operand 183 states. [2018-11-23 11:52:37,558 INFO L74 IsIncluded]: Start isIncluded. First operand 187 states. Second operand 183 states. [2018-11-23 11:52:37,558 INFO L87 Difference]: Start difference. First operand 187 states. Second operand 183 states. [2018-11-23 11:52:37,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:37,562 INFO L93 Difference]: Finished difference Result 187 states and 246 transitions. [2018-11-23 11:52:37,562 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 246 transitions. [2018-11-23 11:52:37,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:37,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:37,563 INFO L74 IsIncluded]: Start isIncluded. First operand 183 states. Second operand 187 states. [2018-11-23 11:52:37,563 INFO L87 Difference]: Start difference. First operand 183 states. Second operand 187 states. [2018-11-23 11:52:37,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:37,565 INFO L93 Difference]: Finished difference Result 187 states and 246 transitions. [2018-11-23 11:52:37,565 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 246 transitions. [2018-11-23 11:52:37,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:37,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:37,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:37,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:37,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-11-23 11:52:37,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 240 transitions. [2018-11-23 11:52:37,569 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 240 transitions. Word has length 94 [2018-11-23 11:52:37,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:37,569 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 240 transitions. [2018-11-23 11:52:37,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 11:52:37,569 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 240 transitions. [2018-11-23 11:52:37,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-23 11:52:37,569 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:37,570 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:37,570 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:37,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:37,570 INFO L82 PathProgramCache]: Analyzing trace with hash -866306840, now seen corresponding path program 27 times [2018-11-23 11:52:37,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:37,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:37,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:37,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:37,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:37,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:38,514 INFO L256 TraceCheckUtils]: 0: Hoare triple {22356#true} call ULTIMATE.init(); {22356#true} is VALID [2018-11-23 11:52:38,514 INFO L273 TraceCheckUtils]: 1: Hoare triple {22356#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {22356#true} is VALID [2018-11-23 11:52:38,515 INFO L273 TraceCheckUtils]: 2: Hoare triple {22356#true} assume true; {22356#true} is VALID [2018-11-23 11:52:38,515 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22356#true} {22356#true} #79#return; {22356#true} is VALID [2018-11-23 11:52:38,515 INFO L256 TraceCheckUtils]: 4: Hoare triple {22356#true} call #t~ret8 := main(); {22356#true} is VALID [2018-11-23 11:52:38,515 INFO L273 TraceCheckUtils]: 5: Hoare triple {22356#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {22356#true} is VALID [2018-11-23 11:52:38,517 INFO L273 TraceCheckUtils]: 6: Hoare triple {22356#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {22358#(= main_~i~0 1)} is VALID [2018-11-23 11:52:38,517 INFO L273 TraceCheckUtils]: 7: Hoare triple {22358#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {22358#(= main_~i~0 1)} is VALID [2018-11-23 11:52:38,517 INFO L273 TraceCheckUtils]: 8: Hoare triple {22358#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {22358#(= main_~i~0 1)} is VALID [2018-11-23 11:52:38,518 INFO L273 TraceCheckUtils]: 9: Hoare triple {22358#(= main_~i~0 1)} ~i~0 := 1 + ~i~0; {22359#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:38,518 INFO L273 TraceCheckUtils]: 10: Hoare triple {22359#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {22359#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:38,518 INFO L273 TraceCheckUtils]: 11: Hoare triple {22359#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {22359#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:38,519 INFO L273 TraceCheckUtils]: 12: Hoare triple {22359#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {22360#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:38,519 INFO L273 TraceCheckUtils]: 13: Hoare triple {22360#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {22360#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:38,519 INFO L273 TraceCheckUtils]: 14: Hoare triple {22360#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {22360#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:38,520 INFO L273 TraceCheckUtils]: 15: Hoare triple {22360#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {22361#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:38,520 INFO L273 TraceCheckUtils]: 16: Hoare triple {22361#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {22361#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:38,521 INFO L273 TraceCheckUtils]: 17: Hoare triple {22361#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {22361#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:38,521 INFO L273 TraceCheckUtils]: 18: Hoare triple {22361#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {22362#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:38,521 INFO L273 TraceCheckUtils]: 19: Hoare triple {22362#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {22362#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:38,522 INFO L273 TraceCheckUtils]: 20: Hoare triple {22362#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {22362#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:38,522 INFO L273 TraceCheckUtils]: 21: Hoare triple {22362#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {22363#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:38,523 INFO L273 TraceCheckUtils]: 22: Hoare triple {22363#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {22363#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:38,523 INFO L273 TraceCheckUtils]: 23: Hoare triple {22363#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {22363#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:38,524 INFO L273 TraceCheckUtils]: 24: Hoare triple {22363#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {22364#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:38,525 INFO L273 TraceCheckUtils]: 25: Hoare triple {22364#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {22364#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:38,525 INFO L273 TraceCheckUtils]: 26: Hoare triple {22364#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {22364#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:38,526 INFO L273 TraceCheckUtils]: 27: Hoare triple {22364#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {22365#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:38,526 INFO L273 TraceCheckUtils]: 28: Hoare triple {22365#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {22365#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:38,527 INFO L273 TraceCheckUtils]: 29: Hoare triple {22365#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {22365#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:38,527 INFO L273 TraceCheckUtils]: 30: Hoare triple {22365#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {22366#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:38,529 INFO L273 TraceCheckUtils]: 31: Hoare triple {22366#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {22366#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:38,529 INFO L273 TraceCheckUtils]: 32: Hoare triple {22366#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {22366#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:38,530 INFO L273 TraceCheckUtils]: 33: Hoare triple {22366#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {22367#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:38,531 INFO L273 TraceCheckUtils]: 34: Hoare triple {22367#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {22367#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:38,531 INFO L273 TraceCheckUtils]: 35: Hoare triple {22367#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {22367#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:38,531 INFO L273 TraceCheckUtils]: 36: Hoare triple {22367#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {22368#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:38,532 INFO L273 TraceCheckUtils]: 37: Hoare triple {22368#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {22368#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:38,532 INFO L273 TraceCheckUtils]: 38: Hoare triple {22368#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {22368#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:38,532 INFO L273 TraceCheckUtils]: 39: Hoare triple {22368#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {22369#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:38,533 INFO L273 TraceCheckUtils]: 40: Hoare triple {22369#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {22369#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:38,533 INFO L273 TraceCheckUtils]: 41: Hoare triple {22369#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {22369#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:38,533 INFO L273 TraceCheckUtils]: 42: Hoare triple {22369#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {22370#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:38,534 INFO L273 TraceCheckUtils]: 43: Hoare triple {22370#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {22370#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:38,534 INFO L273 TraceCheckUtils]: 44: Hoare triple {22370#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {22370#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:38,535 INFO L273 TraceCheckUtils]: 45: Hoare triple {22370#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {22371#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:38,536 INFO L273 TraceCheckUtils]: 46: Hoare triple {22371#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {22371#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:38,536 INFO L273 TraceCheckUtils]: 47: Hoare triple {22371#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {22371#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:38,537 INFO L273 TraceCheckUtils]: 48: Hoare triple {22371#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {22372#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:38,537 INFO L273 TraceCheckUtils]: 49: Hoare triple {22372#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {22372#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:38,538 INFO L273 TraceCheckUtils]: 50: Hoare triple {22372#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {22372#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:38,538 INFO L273 TraceCheckUtils]: 51: Hoare triple {22372#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {22373#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:38,539 INFO L273 TraceCheckUtils]: 52: Hoare triple {22373#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {22373#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:38,539 INFO L273 TraceCheckUtils]: 53: Hoare triple {22373#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {22373#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:38,540 INFO L273 TraceCheckUtils]: 54: Hoare triple {22373#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {22374#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:38,541 INFO L273 TraceCheckUtils]: 55: Hoare triple {22374#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {22374#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:38,541 INFO L273 TraceCheckUtils]: 56: Hoare triple {22374#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {22374#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:38,542 INFO L273 TraceCheckUtils]: 57: Hoare triple {22374#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {22375#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:38,542 INFO L273 TraceCheckUtils]: 58: Hoare triple {22375#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {22375#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:38,543 INFO L273 TraceCheckUtils]: 59: Hoare triple {22375#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {22375#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:38,543 INFO L273 TraceCheckUtils]: 60: Hoare triple {22375#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {22376#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:38,544 INFO L273 TraceCheckUtils]: 61: Hoare triple {22376#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {22376#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:38,544 INFO L273 TraceCheckUtils]: 62: Hoare triple {22376#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {22376#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:38,545 INFO L273 TraceCheckUtils]: 63: Hoare triple {22376#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {22377#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:38,546 INFO L273 TraceCheckUtils]: 64: Hoare triple {22377#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {22377#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:38,546 INFO L273 TraceCheckUtils]: 65: Hoare triple {22377#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {22377#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:38,547 INFO L273 TraceCheckUtils]: 66: Hoare triple {22377#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {22378#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:38,547 INFO L273 TraceCheckUtils]: 67: Hoare triple {22378#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {22378#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:38,548 INFO L273 TraceCheckUtils]: 68: Hoare triple {22378#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {22378#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:38,548 INFO L273 TraceCheckUtils]: 69: Hoare triple {22378#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {22379#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:38,549 INFO L273 TraceCheckUtils]: 70: Hoare triple {22379#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {22379#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:38,549 INFO L273 TraceCheckUtils]: 71: Hoare triple {22379#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {22379#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:38,550 INFO L273 TraceCheckUtils]: 72: Hoare triple {22379#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {22380#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:38,551 INFO L273 TraceCheckUtils]: 73: Hoare triple {22380#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {22380#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:38,551 INFO L273 TraceCheckUtils]: 74: Hoare triple {22380#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {22380#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:38,552 INFO L273 TraceCheckUtils]: 75: Hoare triple {22380#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {22381#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:38,552 INFO L273 TraceCheckUtils]: 76: Hoare triple {22381#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {22381#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:38,553 INFO L273 TraceCheckUtils]: 77: Hoare triple {22381#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {22381#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:38,553 INFO L273 TraceCheckUtils]: 78: Hoare triple {22381#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {22382#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:38,554 INFO L273 TraceCheckUtils]: 79: Hoare triple {22382#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {22382#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:38,554 INFO L273 TraceCheckUtils]: 80: Hoare triple {22382#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {22382#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:38,555 INFO L273 TraceCheckUtils]: 81: Hoare triple {22382#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {22383#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:38,556 INFO L273 TraceCheckUtils]: 82: Hoare triple {22383#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {22383#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:38,556 INFO L273 TraceCheckUtils]: 83: Hoare triple {22383#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {22383#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:38,557 INFO L273 TraceCheckUtils]: 84: Hoare triple {22383#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {22384#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:38,557 INFO L273 TraceCheckUtils]: 85: Hoare triple {22384#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {22384#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:38,558 INFO L273 TraceCheckUtils]: 86: Hoare triple {22384#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {22384#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:38,558 INFO L273 TraceCheckUtils]: 87: Hoare triple {22384#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {22385#(<= main_~i~0 28)} is VALID [2018-11-23 11:52:38,559 INFO L273 TraceCheckUtils]: 88: Hoare triple {22385#(<= main_~i~0 28)} assume !(~i~0 < 100000); {22357#false} is VALID [2018-11-23 11:52:38,559 INFO L273 TraceCheckUtils]: 89: Hoare triple {22357#false} assume !(0 != ~swapped~0); {22357#false} is VALID [2018-11-23 11:52:38,559 INFO L273 TraceCheckUtils]: 90: Hoare triple {22357#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {22357#false} is VALID [2018-11-23 11:52:38,560 INFO L273 TraceCheckUtils]: 91: Hoare triple {22357#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {22357#false} is VALID [2018-11-23 11:52:38,560 INFO L273 TraceCheckUtils]: 92: Hoare triple {22357#false} assume !!(~y~0 < 100000);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); {22357#false} is VALID [2018-11-23 11:52:38,560 INFO L256 TraceCheckUtils]: 93: Hoare triple {22357#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {22357#false} is VALID [2018-11-23 11:52:38,560 INFO L273 TraceCheckUtils]: 94: Hoare triple {22357#false} ~cond := #in~cond; {22357#false} is VALID [2018-11-23 11:52:38,560 INFO L273 TraceCheckUtils]: 95: Hoare triple {22357#false} assume 0 == ~cond; {22357#false} is VALID [2018-11-23 11:52:38,561 INFO L273 TraceCheckUtils]: 96: Hoare triple {22357#false} assume !false; {22357#false} is VALID [2018-11-23 11:52:38,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 1 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:38,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:38,568 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:52:38,580 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:52:38,668 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2018-11-23 11:52:38,669 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:38,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:38,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:39,203 INFO L256 TraceCheckUtils]: 0: Hoare triple {22356#true} call ULTIMATE.init(); {22356#true} is VALID [2018-11-23 11:52:39,203 INFO L273 TraceCheckUtils]: 1: Hoare triple {22356#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {22356#true} is VALID [2018-11-23 11:52:39,203 INFO L273 TraceCheckUtils]: 2: Hoare triple {22356#true} assume true; {22356#true} is VALID [2018-11-23 11:52:39,203 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22356#true} {22356#true} #79#return; {22356#true} is VALID [2018-11-23 11:52:39,204 INFO L256 TraceCheckUtils]: 4: Hoare triple {22356#true} call #t~ret8 := main(); {22356#true} is VALID [2018-11-23 11:52:39,204 INFO L273 TraceCheckUtils]: 5: Hoare triple {22356#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {22356#true} is VALID [2018-11-23 11:52:39,205 INFO L273 TraceCheckUtils]: 6: Hoare triple {22356#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {22407#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:39,205 INFO L273 TraceCheckUtils]: 7: Hoare triple {22407#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {22407#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:39,207 INFO L273 TraceCheckUtils]: 8: Hoare triple {22407#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {22407#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:39,207 INFO L273 TraceCheckUtils]: 9: Hoare triple {22407#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {22359#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:39,209 INFO L273 TraceCheckUtils]: 10: Hoare triple {22359#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {22359#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:39,209 INFO L273 TraceCheckUtils]: 11: Hoare triple {22359#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {22359#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:39,211 INFO L273 TraceCheckUtils]: 12: Hoare triple {22359#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {22360#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:39,211 INFO L273 TraceCheckUtils]: 13: Hoare triple {22360#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {22360#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:39,214 INFO L273 TraceCheckUtils]: 14: Hoare triple {22360#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {22360#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:39,214 INFO L273 TraceCheckUtils]: 15: Hoare triple {22360#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {22361#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:39,217 INFO L273 TraceCheckUtils]: 16: Hoare triple {22361#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {22361#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:39,217 INFO L273 TraceCheckUtils]: 17: Hoare triple {22361#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {22361#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:39,219 INFO L273 TraceCheckUtils]: 18: Hoare triple {22361#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {22362#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:39,219 INFO L273 TraceCheckUtils]: 19: Hoare triple {22362#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {22362#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:39,221 INFO L273 TraceCheckUtils]: 20: Hoare triple {22362#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {22362#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:39,221 INFO L273 TraceCheckUtils]: 21: Hoare triple {22362#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {22363#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:39,223 INFO L273 TraceCheckUtils]: 22: Hoare triple {22363#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {22363#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:39,223 INFO L273 TraceCheckUtils]: 23: Hoare triple {22363#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {22363#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:39,223 INFO L273 TraceCheckUtils]: 24: Hoare triple {22363#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {22364#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:39,224 INFO L273 TraceCheckUtils]: 25: Hoare triple {22364#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {22364#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:39,224 INFO L273 TraceCheckUtils]: 26: Hoare triple {22364#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {22364#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:39,224 INFO L273 TraceCheckUtils]: 27: Hoare triple {22364#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {22365#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:39,225 INFO L273 TraceCheckUtils]: 28: Hoare triple {22365#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {22365#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:39,225 INFO L273 TraceCheckUtils]: 29: Hoare triple {22365#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {22365#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:39,225 INFO L273 TraceCheckUtils]: 30: Hoare triple {22365#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {22366#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:39,226 INFO L273 TraceCheckUtils]: 31: Hoare triple {22366#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {22366#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:39,226 INFO L273 TraceCheckUtils]: 32: Hoare triple {22366#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {22366#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:39,227 INFO L273 TraceCheckUtils]: 33: Hoare triple {22366#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {22367#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:39,228 INFO L273 TraceCheckUtils]: 34: Hoare triple {22367#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {22367#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:39,228 INFO L273 TraceCheckUtils]: 35: Hoare triple {22367#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {22367#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:39,229 INFO L273 TraceCheckUtils]: 36: Hoare triple {22367#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {22368#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:39,229 INFO L273 TraceCheckUtils]: 37: Hoare triple {22368#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {22368#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:39,230 INFO L273 TraceCheckUtils]: 38: Hoare triple {22368#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {22368#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:39,231 INFO L273 TraceCheckUtils]: 39: Hoare triple {22368#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {22369#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:39,231 INFO L273 TraceCheckUtils]: 40: Hoare triple {22369#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {22369#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:39,232 INFO L273 TraceCheckUtils]: 41: Hoare triple {22369#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {22369#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:39,232 INFO L273 TraceCheckUtils]: 42: Hoare triple {22369#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {22370#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:39,233 INFO L273 TraceCheckUtils]: 43: Hoare triple {22370#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {22370#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:39,234 INFO L273 TraceCheckUtils]: 44: Hoare triple {22370#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {22370#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:39,234 INFO L273 TraceCheckUtils]: 45: Hoare triple {22370#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {22371#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:39,235 INFO L273 TraceCheckUtils]: 46: Hoare triple {22371#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {22371#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:39,235 INFO L273 TraceCheckUtils]: 47: Hoare triple {22371#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {22371#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:39,236 INFO L273 TraceCheckUtils]: 48: Hoare triple {22371#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {22372#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:39,237 INFO L273 TraceCheckUtils]: 49: Hoare triple {22372#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {22372#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:39,237 INFO L273 TraceCheckUtils]: 50: Hoare triple {22372#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {22372#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:39,238 INFO L273 TraceCheckUtils]: 51: Hoare triple {22372#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {22373#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:39,238 INFO L273 TraceCheckUtils]: 52: Hoare triple {22373#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {22373#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:39,239 INFO L273 TraceCheckUtils]: 53: Hoare triple {22373#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {22373#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:39,240 INFO L273 TraceCheckUtils]: 54: Hoare triple {22373#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {22374#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:39,240 INFO L273 TraceCheckUtils]: 55: Hoare triple {22374#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {22374#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:39,241 INFO L273 TraceCheckUtils]: 56: Hoare triple {22374#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {22374#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:39,241 INFO L273 TraceCheckUtils]: 57: Hoare triple {22374#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {22375#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:39,242 INFO L273 TraceCheckUtils]: 58: Hoare triple {22375#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {22375#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:39,242 INFO L273 TraceCheckUtils]: 59: Hoare triple {22375#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {22375#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:39,243 INFO L273 TraceCheckUtils]: 60: Hoare triple {22375#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {22376#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:39,244 INFO L273 TraceCheckUtils]: 61: Hoare triple {22376#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {22376#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:39,244 INFO L273 TraceCheckUtils]: 62: Hoare triple {22376#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {22376#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:39,245 INFO L273 TraceCheckUtils]: 63: Hoare triple {22376#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {22377#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:39,245 INFO L273 TraceCheckUtils]: 64: Hoare triple {22377#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {22377#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:39,246 INFO L273 TraceCheckUtils]: 65: Hoare triple {22377#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {22377#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:39,250 INFO L273 TraceCheckUtils]: 66: Hoare triple {22377#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {22378#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:39,250 INFO L273 TraceCheckUtils]: 67: Hoare triple {22378#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {22378#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:39,251 INFO L273 TraceCheckUtils]: 68: Hoare triple {22378#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {22378#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:39,251 INFO L273 TraceCheckUtils]: 69: Hoare triple {22378#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {22379#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:39,251 INFO L273 TraceCheckUtils]: 70: Hoare triple {22379#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {22379#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:39,252 INFO L273 TraceCheckUtils]: 71: Hoare triple {22379#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {22379#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:39,252 INFO L273 TraceCheckUtils]: 72: Hoare triple {22379#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {22380#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:39,252 INFO L273 TraceCheckUtils]: 73: Hoare triple {22380#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {22380#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:39,253 INFO L273 TraceCheckUtils]: 74: Hoare triple {22380#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {22380#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:39,253 INFO L273 TraceCheckUtils]: 75: Hoare triple {22380#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {22381#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:39,253 INFO L273 TraceCheckUtils]: 76: Hoare triple {22381#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {22381#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:39,254 INFO L273 TraceCheckUtils]: 77: Hoare triple {22381#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {22381#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:39,254 INFO L273 TraceCheckUtils]: 78: Hoare triple {22381#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {22382#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:39,255 INFO L273 TraceCheckUtils]: 79: Hoare triple {22382#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {22382#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:39,255 INFO L273 TraceCheckUtils]: 80: Hoare triple {22382#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {22382#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:39,256 INFO L273 TraceCheckUtils]: 81: Hoare triple {22382#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {22383#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:39,257 INFO L273 TraceCheckUtils]: 82: Hoare triple {22383#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {22383#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:39,257 INFO L273 TraceCheckUtils]: 83: Hoare triple {22383#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {22383#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:39,258 INFO L273 TraceCheckUtils]: 84: Hoare triple {22383#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {22384#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:39,259 INFO L273 TraceCheckUtils]: 85: Hoare triple {22384#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {22384#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:39,259 INFO L273 TraceCheckUtils]: 86: Hoare triple {22384#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {22384#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:39,260 INFO L273 TraceCheckUtils]: 87: Hoare triple {22384#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {22385#(<= main_~i~0 28)} is VALID [2018-11-23 11:52:39,260 INFO L273 TraceCheckUtils]: 88: Hoare triple {22385#(<= main_~i~0 28)} assume !(~i~0 < 100000); {22357#false} is VALID [2018-11-23 11:52:39,261 INFO L273 TraceCheckUtils]: 89: Hoare triple {22357#false} assume !(0 != ~swapped~0); {22357#false} is VALID [2018-11-23 11:52:39,261 INFO L273 TraceCheckUtils]: 90: Hoare triple {22357#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {22357#false} is VALID [2018-11-23 11:52:39,261 INFO L273 TraceCheckUtils]: 91: Hoare triple {22357#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {22357#false} is VALID [2018-11-23 11:52:39,261 INFO L273 TraceCheckUtils]: 92: Hoare triple {22357#false} assume !!(~y~0 < 100000);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); {22357#false} is VALID [2018-11-23 11:52:39,261 INFO L256 TraceCheckUtils]: 93: Hoare triple {22357#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {22357#false} is VALID [2018-11-23 11:52:39,262 INFO L273 TraceCheckUtils]: 94: Hoare triple {22357#false} ~cond := #in~cond; {22357#false} is VALID [2018-11-23 11:52:39,262 INFO L273 TraceCheckUtils]: 95: Hoare triple {22357#false} assume 0 == ~cond; {22357#false} is VALID [2018-11-23 11:52:39,262 INFO L273 TraceCheckUtils]: 96: Hoare triple {22357#false} assume !false; {22357#false} is VALID [2018-11-23 11:52:39,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 1 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:39,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:39,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2018-11-23 11:52:39,289 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 97 [2018-11-23 11:52:39,289 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:39,289 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-23 11:52:39,385 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:39,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-23 11:52:39,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 11:52:39,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-23 11:52:39,386 INFO L87 Difference]: Start difference. First operand 183 states and 240 transitions. Second operand 31 states. [2018-11-23 11:52:40,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:40,258 INFO L93 Difference]: Finished difference Result 370 states and 490 transitions. [2018-11-23 11:52:40,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 11:52:40,258 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 97 [2018-11-23 11:52:40,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:40,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 11:52:40,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 161 transitions. [2018-11-23 11:52:40,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 11:52:40,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 161 transitions. [2018-11-23 11:52:40,261 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 161 transitions. [2018-11-23 11:52:40,432 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:40,437 INFO L225 Difference]: With dead ends: 370 [2018-11-23 11:52:40,437 INFO L226 Difference]: Without dead ends: 193 [2018-11-23 11:52:40,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-23 11:52:40,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-11-23 11:52:40,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 189. [2018-11-23 11:52:40,612 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:40,612 INFO L82 GeneralOperation]: Start isEquivalent. First operand 193 states. Second operand 189 states. [2018-11-23 11:52:40,612 INFO L74 IsIncluded]: Start isIncluded. First operand 193 states. Second operand 189 states. [2018-11-23 11:52:40,612 INFO L87 Difference]: Start difference. First operand 193 states. Second operand 189 states. [2018-11-23 11:52:40,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:40,615 INFO L93 Difference]: Finished difference Result 193 states and 254 transitions. [2018-11-23 11:52:40,615 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 254 transitions. [2018-11-23 11:52:40,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:40,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:40,616 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand 193 states. [2018-11-23 11:52:40,616 INFO L87 Difference]: Start difference. First operand 189 states. Second operand 193 states. [2018-11-23 11:52:40,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:40,619 INFO L93 Difference]: Finished difference Result 193 states and 254 transitions. [2018-11-23 11:52:40,619 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 254 transitions. [2018-11-23 11:52:40,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:40,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:40,619 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:40,619 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:40,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-11-23 11:52:40,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 248 transitions. [2018-11-23 11:52:40,622 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 248 transitions. Word has length 97 [2018-11-23 11:52:40,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:40,622 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 248 transitions. [2018-11-23 11:52:40,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-23 11:52:40,623 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 248 transitions. [2018-11-23 11:52:40,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-23 11:52:40,623 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:40,623 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:40,624 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:40,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:40,624 INFO L82 PathProgramCache]: Analyzing trace with hash -975928943, now seen corresponding path program 28 times [2018-11-23 11:52:40,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:40,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:40,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:40,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:40,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:40,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:41,492 INFO L256 TraceCheckUtils]: 0: Hoare triple {23817#true} call ULTIMATE.init(); {23817#true} is VALID [2018-11-23 11:52:41,492 INFO L273 TraceCheckUtils]: 1: Hoare triple {23817#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23817#true} is VALID [2018-11-23 11:52:41,492 INFO L273 TraceCheckUtils]: 2: Hoare triple {23817#true} assume true; {23817#true} is VALID [2018-11-23 11:52:41,492 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23817#true} {23817#true} #79#return; {23817#true} is VALID [2018-11-23 11:52:41,493 INFO L256 TraceCheckUtils]: 4: Hoare triple {23817#true} call #t~ret8 := main(); {23817#true} is VALID [2018-11-23 11:52:41,493 INFO L273 TraceCheckUtils]: 5: Hoare triple {23817#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {23817#true} is VALID [2018-11-23 11:52:41,493 INFO L273 TraceCheckUtils]: 6: Hoare triple {23817#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {23819#(= main_~i~0 1)} is VALID [2018-11-23 11:52:41,493 INFO L273 TraceCheckUtils]: 7: Hoare triple {23819#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {23819#(= main_~i~0 1)} is VALID [2018-11-23 11:52:41,494 INFO L273 TraceCheckUtils]: 8: Hoare triple {23819#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23819#(= main_~i~0 1)} is VALID [2018-11-23 11:52:41,494 INFO L273 TraceCheckUtils]: 9: Hoare triple {23819#(= main_~i~0 1)} ~i~0 := 1 + ~i~0; {23820#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:41,495 INFO L273 TraceCheckUtils]: 10: Hoare triple {23820#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {23820#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:41,495 INFO L273 TraceCheckUtils]: 11: Hoare triple {23820#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23820#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:41,496 INFO L273 TraceCheckUtils]: 12: Hoare triple {23820#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {23821#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:41,496 INFO L273 TraceCheckUtils]: 13: Hoare triple {23821#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {23821#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:41,500 INFO L273 TraceCheckUtils]: 14: Hoare triple {23821#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23821#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:41,501 INFO L273 TraceCheckUtils]: 15: Hoare triple {23821#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {23822#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:41,501 INFO L273 TraceCheckUtils]: 16: Hoare triple {23822#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {23822#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:41,502 INFO L273 TraceCheckUtils]: 17: Hoare triple {23822#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23822#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:41,502 INFO L273 TraceCheckUtils]: 18: Hoare triple {23822#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {23823#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:41,503 INFO L273 TraceCheckUtils]: 19: Hoare triple {23823#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {23823#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:41,503 INFO L273 TraceCheckUtils]: 20: Hoare triple {23823#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23823#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:41,503 INFO L273 TraceCheckUtils]: 21: Hoare triple {23823#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {23824#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:41,504 INFO L273 TraceCheckUtils]: 22: Hoare triple {23824#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {23824#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:41,504 INFO L273 TraceCheckUtils]: 23: Hoare triple {23824#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23824#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:41,505 INFO L273 TraceCheckUtils]: 24: Hoare triple {23824#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {23825#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:41,506 INFO L273 TraceCheckUtils]: 25: Hoare triple {23825#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {23825#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:41,506 INFO L273 TraceCheckUtils]: 26: Hoare triple {23825#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23825#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:41,507 INFO L273 TraceCheckUtils]: 27: Hoare triple {23825#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {23826#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:41,508 INFO L273 TraceCheckUtils]: 28: Hoare triple {23826#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {23826#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:41,508 INFO L273 TraceCheckUtils]: 29: Hoare triple {23826#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23826#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:41,509 INFO L273 TraceCheckUtils]: 30: Hoare triple {23826#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {23827#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:41,510 INFO L273 TraceCheckUtils]: 31: Hoare triple {23827#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {23827#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:41,510 INFO L273 TraceCheckUtils]: 32: Hoare triple {23827#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23827#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:41,511 INFO L273 TraceCheckUtils]: 33: Hoare triple {23827#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {23828#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:41,512 INFO L273 TraceCheckUtils]: 34: Hoare triple {23828#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {23828#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:41,512 INFO L273 TraceCheckUtils]: 35: Hoare triple {23828#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23828#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:41,513 INFO L273 TraceCheckUtils]: 36: Hoare triple {23828#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {23829#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:41,514 INFO L273 TraceCheckUtils]: 37: Hoare triple {23829#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {23829#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:41,514 INFO L273 TraceCheckUtils]: 38: Hoare triple {23829#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23829#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:41,515 INFO L273 TraceCheckUtils]: 39: Hoare triple {23829#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {23830#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:41,515 INFO L273 TraceCheckUtils]: 40: Hoare triple {23830#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {23830#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:41,516 INFO L273 TraceCheckUtils]: 41: Hoare triple {23830#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23830#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:41,517 INFO L273 TraceCheckUtils]: 42: Hoare triple {23830#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {23831#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:41,517 INFO L273 TraceCheckUtils]: 43: Hoare triple {23831#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {23831#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:41,518 INFO L273 TraceCheckUtils]: 44: Hoare triple {23831#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23831#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:41,519 INFO L273 TraceCheckUtils]: 45: Hoare triple {23831#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {23832#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:41,520 INFO L273 TraceCheckUtils]: 46: Hoare triple {23832#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {23832#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:41,520 INFO L273 TraceCheckUtils]: 47: Hoare triple {23832#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23832#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:41,521 INFO L273 TraceCheckUtils]: 48: Hoare triple {23832#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {23833#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:41,521 INFO L273 TraceCheckUtils]: 49: Hoare triple {23833#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {23833#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:41,522 INFO L273 TraceCheckUtils]: 50: Hoare triple {23833#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23833#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:41,523 INFO L273 TraceCheckUtils]: 51: Hoare triple {23833#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {23834#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:41,523 INFO L273 TraceCheckUtils]: 52: Hoare triple {23834#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {23834#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:41,524 INFO L273 TraceCheckUtils]: 53: Hoare triple {23834#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23834#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:41,525 INFO L273 TraceCheckUtils]: 54: Hoare triple {23834#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {23835#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:41,525 INFO L273 TraceCheckUtils]: 55: Hoare triple {23835#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {23835#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:41,526 INFO L273 TraceCheckUtils]: 56: Hoare triple {23835#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23835#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:41,527 INFO L273 TraceCheckUtils]: 57: Hoare triple {23835#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {23836#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:41,527 INFO L273 TraceCheckUtils]: 58: Hoare triple {23836#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {23836#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:41,528 INFO L273 TraceCheckUtils]: 59: Hoare triple {23836#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23836#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:41,529 INFO L273 TraceCheckUtils]: 60: Hoare triple {23836#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {23837#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:41,529 INFO L273 TraceCheckUtils]: 61: Hoare triple {23837#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {23837#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:41,530 INFO L273 TraceCheckUtils]: 62: Hoare triple {23837#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23837#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:41,531 INFO L273 TraceCheckUtils]: 63: Hoare triple {23837#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {23838#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:41,531 INFO L273 TraceCheckUtils]: 64: Hoare triple {23838#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {23838#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:41,532 INFO L273 TraceCheckUtils]: 65: Hoare triple {23838#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23838#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:41,533 INFO L273 TraceCheckUtils]: 66: Hoare triple {23838#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {23839#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:41,533 INFO L273 TraceCheckUtils]: 67: Hoare triple {23839#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {23839#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:41,534 INFO L273 TraceCheckUtils]: 68: Hoare triple {23839#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23839#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:41,535 INFO L273 TraceCheckUtils]: 69: Hoare triple {23839#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {23840#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:41,535 INFO L273 TraceCheckUtils]: 70: Hoare triple {23840#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {23840#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:41,536 INFO L273 TraceCheckUtils]: 71: Hoare triple {23840#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23840#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:41,537 INFO L273 TraceCheckUtils]: 72: Hoare triple {23840#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {23841#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:41,537 INFO L273 TraceCheckUtils]: 73: Hoare triple {23841#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {23841#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:41,538 INFO L273 TraceCheckUtils]: 74: Hoare triple {23841#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23841#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:41,538 INFO L273 TraceCheckUtils]: 75: Hoare triple {23841#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {23842#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:41,539 INFO L273 TraceCheckUtils]: 76: Hoare triple {23842#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {23842#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:41,540 INFO L273 TraceCheckUtils]: 77: Hoare triple {23842#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23842#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:41,540 INFO L273 TraceCheckUtils]: 78: Hoare triple {23842#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {23843#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:41,541 INFO L273 TraceCheckUtils]: 79: Hoare triple {23843#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {23843#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:41,542 INFO L273 TraceCheckUtils]: 80: Hoare triple {23843#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23843#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:41,543 INFO L273 TraceCheckUtils]: 81: Hoare triple {23843#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {23844#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:41,543 INFO L273 TraceCheckUtils]: 82: Hoare triple {23844#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {23844#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:41,544 INFO L273 TraceCheckUtils]: 83: Hoare triple {23844#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23844#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:41,545 INFO L273 TraceCheckUtils]: 84: Hoare triple {23844#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {23845#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:41,545 INFO L273 TraceCheckUtils]: 85: Hoare triple {23845#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {23845#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:41,546 INFO L273 TraceCheckUtils]: 86: Hoare triple {23845#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23845#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:41,547 INFO L273 TraceCheckUtils]: 87: Hoare triple {23845#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {23846#(<= main_~i~0 28)} is VALID [2018-11-23 11:52:41,549 INFO L273 TraceCheckUtils]: 88: Hoare triple {23846#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {23846#(<= main_~i~0 28)} is VALID [2018-11-23 11:52:41,550 INFO L273 TraceCheckUtils]: 89: Hoare triple {23846#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23846#(<= main_~i~0 28)} is VALID [2018-11-23 11:52:41,550 INFO L273 TraceCheckUtils]: 90: Hoare triple {23846#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {23847#(<= main_~i~0 29)} is VALID [2018-11-23 11:52:41,551 INFO L273 TraceCheckUtils]: 91: Hoare triple {23847#(<= main_~i~0 29)} assume !(~i~0 < 100000); {23818#false} is VALID [2018-11-23 11:52:41,551 INFO L273 TraceCheckUtils]: 92: Hoare triple {23818#false} assume !(0 != ~swapped~0); {23818#false} is VALID [2018-11-23 11:52:41,551 INFO L273 TraceCheckUtils]: 93: Hoare triple {23818#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {23818#false} is VALID [2018-11-23 11:52:41,551 INFO L273 TraceCheckUtils]: 94: Hoare triple {23818#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {23818#false} is VALID [2018-11-23 11:52:41,551 INFO L273 TraceCheckUtils]: 95: Hoare triple {23818#false} assume !!(~y~0 < 100000);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); {23818#false} is VALID [2018-11-23 11:52:41,552 INFO L256 TraceCheckUtils]: 96: Hoare triple {23818#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {23818#false} is VALID [2018-11-23 11:52:41,552 INFO L273 TraceCheckUtils]: 97: Hoare triple {23818#false} ~cond := #in~cond; {23818#false} is VALID [2018-11-23 11:52:41,552 INFO L273 TraceCheckUtils]: 98: Hoare triple {23818#false} assume 0 == ~cond; {23818#false} is VALID [2018-11-23 11:52:41,552 INFO L273 TraceCheckUtils]: 99: Hoare triple {23818#false} assume !false; {23818#false} is VALID [2018-11-23 11:52:41,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1163 backedges. 1 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:41,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:41,570 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:52:41,606 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:52:41,671 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:52:41,671 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:41,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:41,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:42,000 INFO L256 TraceCheckUtils]: 0: Hoare triple {23817#true} call ULTIMATE.init(); {23817#true} is VALID [2018-11-23 11:52:42,001 INFO L273 TraceCheckUtils]: 1: Hoare triple {23817#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23817#true} is VALID [2018-11-23 11:52:42,001 INFO L273 TraceCheckUtils]: 2: Hoare triple {23817#true} assume true; {23817#true} is VALID [2018-11-23 11:52:42,001 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23817#true} {23817#true} #79#return; {23817#true} is VALID [2018-11-23 11:52:42,001 INFO L256 TraceCheckUtils]: 4: Hoare triple {23817#true} call #t~ret8 := main(); {23817#true} is VALID [2018-11-23 11:52:42,002 INFO L273 TraceCheckUtils]: 5: Hoare triple {23817#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {23817#true} is VALID [2018-11-23 11:52:42,002 INFO L273 TraceCheckUtils]: 6: Hoare triple {23817#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {23869#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:42,003 INFO L273 TraceCheckUtils]: 7: Hoare triple {23869#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {23869#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:42,003 INFO L273 TraceCheckUtils]: 8: Hoare triple {23869#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23869#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:42,004 INFO L273 TraceCheckUtils]: 9: Hoare triple {23869#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {23820#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:42,004 INFO L273 TraceCheckUtils]: 10: Hoare triple {23820#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {23820#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:42,004 INFO L273 TraceCheckUtils]: 11: Hoare triple {23820#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23820#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:42,005 INFO L273 TraceCheckUtils]: 12: Hoare triple {23820#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {23821#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:42,005 INFO L273 TraceCheckUtils]: 13: Hoare triple {23821#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {23821#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:42,005 INFO L273 TraceCheckUtils]: 14: Hoare triple {23821#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23821#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:42,006 INFO L273 TraceCheckUtils]: 15: Hoare triple {23821#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {23822#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:42,006 INFO L273 TraceCheckUtils]: 16: Hoare triple {23822#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {23822#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:42,007 INFO L273 TraceCheckUtils]: 17: Hoare triple {23822#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23822#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:42,007 INFO L273 TraceCheckUtils]: 18: Hoare triple {23822#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {23823#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:42,008 INFO L273 TraceCheckUtils]: 19: Hoare triple {23823#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {23823#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:42,008 INFO L273 TraceCheckUtils]: 20: Hoare triple {23823#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23823#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:42,009 INFO L273 TraceCheckUtils]: 21: Hoare triple {23823#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {23824#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:42,010 INFO L273 TraceCheckUtils]: 22: Hoare triple {23824#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {23824#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:42,010 INFO L273 TraceCheckUtils]: 23: Hoare triple {23824#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23824#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:42,011 INFO L273 TraceCheckUtils]: 24: Hoare triple {23824#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {23825#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:42,011 INFO L273 TraceCheckUtils]: 25: Hoare triple {23825#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {23825#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:42,012 INFO L273 TraceCheckUtils]: 26: Hoare triple {23825#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23825#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:42,013 INFO L273 TraceCheckUtils]: 27: Hoare triple {23825#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {23826#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:42,013 INFO L273 TraceCheckUtils]: 28: Hoare triple {23826#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {23826#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:42,014 INFO L273 TraceCheckUtils]: 29: Hoare triple {23826#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23826#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:42,014 INFO L273 TraceCheckUtils]: 30: Hoare triple {23826#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {23827#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:42,015 INFO L273 TraceCheckUtils]: 31: Hoare triple {23827#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {23827#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:42,015 INFO L273 TraceCheckUtils]: 32: Hoare triple {23827#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23827#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:42,016 INFO L273 TraceCheckUtils]: 33: Hoare triple {23827#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {23828#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:42,017 INFO L273 TraceCheckUtils]: 34: Hoare triple {23828#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {23828#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:42,017 INFO L273 TraceCheckUtils]: 35: Hoare triple {23828#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23828#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:42,018 INFO L273 TraceCheckUtils]: 36: Hoare triple {23828#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {23829#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:42,018 INFO L273 TraceCheckUtils]: 37: Hoare triple {23829#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {23829#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:42,019 INFO L273 TraceCheckUtils]: 38: Hoare triple {23829#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23829#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:42,020 INFO L273 TraceCheckUtils]: 39: Hoare triple {23829#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {23830#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:42,020 INFO L273 TraceCheckUtils]: 40: Hoare triple {23830#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {23830#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:42,021 INFO L273 TraceCheckUtils]: 41: Hoare triple {23830#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23830#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:42,021 INFO L273 TraceCheckUtils]: 42: Hoare triple {23830#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {23831#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:42,022 INFO L273 TraceCheckUtils]: 43: Hoare triple {23831#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {23831#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:42,022 INFO L273 TraceCheckUtils]: 44: Hoare triple {23831#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23831#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:42,023 INFO L273 TraceCheckUtils]: 45: Hoare triple {23831#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {23832#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:42,024 INFO L273 TraceCheckUtils]: 46: Hoare triple {23832#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {23832#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:42,024 INFO L273 TraceCheckUtils]: 47: Hoare triple {23832#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23832#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:42,025 INFO L273 TraceCheckUtils]: 48: Hoare triple {23832#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {23833#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:42,025 INFO L273 TraceCheckUtils]: 49: Hoare triple {23833#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {23833#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:42,026 INFO L273 TraceCheckUtils]: 50: Hoare triple {23833#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23833#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:42,027 INFO L273 TraceCheckUtils]: 51: Hoare triple {23833#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {23834#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:42,038 INFO L273 TraceCheckUtils]: 52: Hoare triple {23834#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {23834#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:42,039 INFO L273 TraceCheckUtils]: 53: Hoare triple {23834#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23834#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:42,039 INFO L273 TraceCheckUtils]: 54: Hoare triple {23834#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {23835#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:42,040 INFO L273 TraceCheckUtils]: 55: Hoare triple {23835#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {23835#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:42,040 INFO L273 TraceCheckUtils]: 56: Hoare triple {23835#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23835#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:42,040 INFO L273 TraceCheckUtils]: 57: Hoare triple {23835#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {23836#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:42,041 INFO L273 TraceCheckUtils]: 58: Hoare triple {23836#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {23836#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:42,041 INFO L273 TraceCheckUtils]: 59: Hoare triple {23836#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23836#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:42,041 INFO L273 TraceCheckUtils]: 60: Hoare triple {23836#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {23837#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:42,042 INFO L273 TraceCheckUtils]: 61: Hoare triple {23837#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {23837#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:42,042 INFO L273 TraceCheckUtils]: 62: Hoare triple {23837#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23837#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:42,043 INFO L273 TraceCheckUtils]: 63: Hoare triple {23837#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {23838#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:42,043 INFO L273 TraceCheckUtils]: 64: Hoare triple {23838#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {23838#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:42,044 INFO L273 TraceCheckUtils]: 65: Hoare triple {23838#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23838#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:42,044 INFO L273 TraceCheckUtils]: 66: Hoare triple {23838#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {23839#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:42,045 INFO L273 TraceCheckUtils]: 67: Hoare triple {23839#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {23839#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:42,045 INFO L273 TraceCheckUtils]: 68: Hoare triple {23839#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23839#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:42,046 INFO L273 TraceCheckUtils]: 69: Hoare triple {23839#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {23840#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:42,047 INFO L273 TraceCheckUtils]: 70: Hoare triple {23840#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {23840#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:42,047 INFO L273 TraceCheckUtils]: 71: Hoare triple {23840#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23840#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:42,048 INFO L273 TraceCheckUtils]: 72: Hoare triple {23840#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {23841#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:42,048 INFO L273 TraceCheckUtils]: 73: Hoare triple {23841#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {23841#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:42,049 INFO L273 TraceCheckUtils]: 74: Hoare triple {23841#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23841#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:42,050 INFO L273 TraceCheckUtils]: 75: Hoare triple {23841#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {23842#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:42,050 INFO L273 TraceCheckUtils]: 76: Hoare triple {23842#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {23842#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:42,051 INFO L273 TraceCheckUtils]: 77: Hoare triple {23842#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23842#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:42,051 INFO L273 TraceCheckUtils]: 78: Hoare triple {23842#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {23843#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:42,052 INFO L273 TraceCheckUtils]: 79: Hoare triple {23843#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {23843#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:42,052 INFO L273 TraceCheckUtils]: 80: Hoare triple {23843#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23843#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:42,053 INFO L273 TraceCheckUtils]: 81: Hoare triple {23843#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {23844#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:42,054 INFO L273 TraceCheckUtils]: 82: Hoare triple {23844#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {23844#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:42,054 INFO L273 TraceCheckUtils]: 83: Hoare triple {23844#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23844#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:42,055 INFO L273 TraceCheckUtils]: 84: Hoare triple {23844#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {23845#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:42,056 INFO L273 TraceCheckUtils]: 85: Hoare triple {23845#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {23845#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:42,056 INFO L273 TraceCheckUtils]: 86: Hoare triple {23845#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23845#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:42,057 INFO L273 TraceCheckUtils]: 87: Hoare triple {23845#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {23846#(<= main_~i~0 28)} is VALID [2018-11-23 11:52:42,057 INFO L273 TraceCheckUtils]: 88: Hoare triple {23846#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {23846#(<= main_~i~0 28)} is VALID [2018-11-23 11:52:42,058 INFO L273 TraceCheckUtils]: 89: Hoare triple {23846#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23846#(<= main_~i~0 28)} is VALID [2018-11-23 11:52:42,058 INFO L273 TraceCheckUtils]: 90: Hoare triple {23846#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {23847#(<= main_~i~0 29)} is VALID [2018-11-23 11:52:42,059 INFO L273 TraceCheckUtils]: 91: Hoare triple {23847#(<= main_~i~0 29)} assume !(~i~0 < 100000); {23818#false} is VALID [2018-11-23 11:52:42,059 INFO L273 TraceCheckUtils]: 92: Hoare triple {23818#false} assume !(0 != ~swapped~0); {23818#false} is VALID [2018-11-23 11:52:42,060 INFO L273 TraceCheckUtils]: 93: Hoare triple {23818#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {23818#false} is VALID [2018-11-23 11:52:42,060 INFO L273 TraceCheckUtils]: 94: Hoare triple {23818#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {23818#false} is VALID [2018-11-23 11:52:42,060 INFO L273 TraceCheckUtils]: 95: Hoare triple {23818#false} assume !!(~y~0 < 100000);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); {23818#false} is VALID [2018-11-23 11:52:42,060 INFO L256 TraceCheckUtils]: 96: Hoare triple {23818#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {23818#false} is VALID [2018-11-23 11:52:42,060 INFO L273 TraceCheckUtils]: 97: Hoare triple {23818#false} ~cond := #in~cond; {23818#false} is VALID [2018-11-23 11:52:42,061 INFO L273 TraceCheckUtils]: 98: Hoare triple {23818#false} assume 0 == ~cond; {23818#false} is VALID [2018-11-23 11:52:42,061 INFO L273 TraceCheckUtils]: 99: Hoare triple {23818#false} assume !false; {23818#false} is VALID [2018-11-23 11:52:42,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1163 backedges. 1 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:42,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:42,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2018-11-23 11:52:42,087 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 100 [2018-11-23 11:52:42,088 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:42,088 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-23 11:52:42,229 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:42,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-23 11:52:42,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-23 11:52:42,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-23 11:52:42,231 INFO L87 Difference]: Start difference. First operand 189 states and 248 transitions. Second operand 32 states. [2018-11-23 11:52:43,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:43,065 INFO L93 Difference]: Finished difference Result 382 states and 506 transitions. [2018-11-23 11:52:43,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 11:52:43,065 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 100 [2018-11-23 11:52:43,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:43,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 11:52:43,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 165 transitions. [2018-11-23 11:52:43,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 11:52:43,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 165 transitions. [2018-11-23 11:52:43,069 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 165 transitions. [2018-11-23 11:52:43,228 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:43,232 INFO L225 Difference]: With dead ends: 382 [2018-11-23 11:52:43,233 INFO L226 Difference]: Without dead ends: 199 [2018-11-23 11:52:43,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-23 11:52:43,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-11-23 11:52:43,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 195. [2018-11-23 11:52:43,297 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:43,297 INFO L82 GeneralOperation]: Start isEquivalent. First operand 199 states. Second operand 195 states. [2018-11-23 11:52:43,297 INFO L74 IsIncluded]: Start isIncluded. First operand 199 states. Second operand 195 states. [2018-11-23 11:52:43,297 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 195 states. [2018-11-23 11:52:43,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:43,300 INFO L93 Difference]: Finished difference Result 199 states and 262 transitions. [2018-11-23 11:52:43,301 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 262 transitions. [2018-11-23 11:52:43,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:43,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:43,301 INFO L74 IsIncluded]: Start isIncluded. First operand 195 states. Second operand 199 states. [2018-11-23 11:52:43,301 INFO L87 Difference]: Start difference. First operand 195 states. Second operand 199 states. [2018-11-23 11:52:43,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:43,305 INFO L93 Difference]: Finished difference Result 199 states and 262 transitions. [2018-11-23 11:52:43,305 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 262 transitions. [2018-11-23 11:52:43,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:43,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:43,306 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:43,306 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:43,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-11-23 11:52:43,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 256 transitions. [2018-11-23 11:52:43,309 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 256 transitions. Word has length 100 [2018-11-23 11:52:43,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:43,310 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 256 transitions. [2018-11-23 11:52:43,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-23 11:52:43,310 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 256 transitions. [2018-11-23 11:52:43,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-23 11:52:43,311 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:43,311 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:43,311 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:43,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:43,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1742112840, now seen corresponding path program 29 times [2018-11-23 11:52:43,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:43,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:43,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:43,313 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:43,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:43,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:43,984 INFO L256 TraceCheckUtils]: 0: Hoare triple {25324#true} call ULTIMATE.init(); {25324#true} is VALID [2018-11-23 11:52:43,984 INFO L273 TraceCheckUtils]: 1: Hoare triple {25324#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {25324#true} is VALID [2018-11-23 11:52:43,984 INFO L273 TraceCheckUtils]: 2: Hoare triple {25324#true} assume true; {25324#true} is VALID [2018-11-23 11:52:43,984 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25324#true} {25324#true} #79#return; {25324#true} is VALID [2018-11-23 11:52:43,984 INFO L256 TraceCheckUtils]: 4: Hoare triple {25324#true} call #t~ret8 := main(); {25324#true} is VALID [2018-11-23 11:52:43,985 INFO L273 TraceCheckUtils]: 5: Hoare triple {25324#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {25324#true} is VALID [2018-11-23 11:52:43,985 INFO L273 TraceCheckUtils]: 6: Hoare triple {25324#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {25326#(= main_~i~0 1)} is VALID [2018-11-23 11:52:43,986 INFO L273 TraceCheckUtils]: 7: Hoare triple {25326#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {25326#(= main_~i~0 1)} is VALID [2018-11-23 11:52:43,986 INFO L273 TraceCheckUtils]: 8: Hoare triple {25326#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {25326#(= main_~i~0 1)} is VALID [2018-11-23 11:52:43,988 INFO L273 TraceCheckUtils]: 9: Hoare triple {25326#(= main_~i~0 1)} ~i~0 := 1 + ~i~0; {25327#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:43,988 INFO L273 TraceCheckUtils]: 10: Hoare triple {25327#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {25327#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:43,991 INFO L273 TraceCheckUtils]: 11: Hoare triple {25327#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {25327#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:43,991 INFO L273 TraceCheckUtils]: 12: Hoare triple {25327#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {25328#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:43,993 INFO L273 TraceCheckUtils]: 13: Hoare triple {25328#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {25328#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:43,993 INFO L273 TraceCheckUtils]: 14: Hoare triple {25328#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {25328#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:43,996 INFO L273 TraceCheckUtils]: 15: Hoare triple {25328#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {25329#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:43,996 INFO L273 TraceCheckUtils]: 16: Hoare triple {25329#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {25329#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:43,998 INFO L273 TraceCheckUtils]: 17: Hoare triple {25329#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {25329#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:43,998 INFO L273 TraceCheckUtils]: 18: Hoare triple {25329#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {25330#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:44,000 INFO L273 TraceCheckUtils]: 19: Hoare triple {25330#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {25330#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:44,000 INFO L273 TraceCheckUtils]: 20: Hoare triple {25330#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {25330#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:44,002 INFO L273 TraceCheckUtils]: 21: Hoare triple {25330#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {25331#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:44,002 INFO L273 TraceCheckUtils]: 22: Hoare triple {25331#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {25331#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:44,005 INFO L273 TraceCheckUtils]: 23: Hoare triple {25331#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {25331#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:44,005 INFO L273 TraceCheckUtils]: 24: Hoare triple {25331#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {25332#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:44,007 INFO L273 TraceCheckUtils]: 25: Hoare triple {25332#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {25332#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:44,007 INFO L273 TraceCheckUtils]: 26: Hoare triple {25332#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {25332#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:44,010 INFO L273 TraceCheckUtils]: 27: Hoare triple {25332#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {25333#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:44,010 INFO L273 TraceCheckUtils]: 28: Hoare triple {25333#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {25333#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:44,012 INFO L273 TraceCheckUtils]: 29: Hoare triple {25333#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {25333#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:44,012 INFO L273 TraceCheckUtils]: 30: Hoare triple {25333#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {25334#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:44,015 INFO L273 TraceCheckUtils]: 31: Hoare triple {25334#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {25334#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:44,015 INFO L273 TraceCheckUtils]: 32: Hoare triple {25334#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {25334#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:44,018 INFO L273 TraceCheckUtils]: 33: Hoare triple {25334#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {25335#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:44,018 INFO L273 TraceCheckUtils]: 34: Hoare triple {25335#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {25335#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:44,021 INFO L273 TraceCheckUtils]: 35: Hoare triple {25335#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {25335#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:44,021 INFO L273 TraceCheckUtils]: 36: Hoare triple {25335#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {25336#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:44,024 INFO L273 TraceCheckUtils]: 37: Hoare triple {25336#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {25336#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:44,024 INFO L273 TraceCheckUtils]: 38: Hoare triple {25336#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {25336#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:44,027 INFO L273 TraceCheckUtils]: 39: Hoare triple {25336#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {25337#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:44,027 INFO L273 TraceCheckUtils]: 40: Hoare triple {25337#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {25337#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:44,030 INFO L273 TraceCheckUtils]: 41: Hoare triple {25337#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {25337#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:44,030 INFO L273 TraceCheckUtils]: 42: Hoare triple {25337#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {25338#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:44,033 INFO L273 TraceCheckUtils]: 43: Hoare triple {25338#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {25338#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:44,033 INFO L273 TraceCheckUtils]: 44: Hoare triple {25338#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {25338#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:44,036 INFO L273 TraceCheckUtils]: 45: Hoare triple {25338#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {25339#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:44,036 INFO L273 TraceCheckUtils]: 46: Hoare triple {25339#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {25339#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:44,039 INFO L273 TraceCheckUtils]: 47: Hoare triple {25339#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {25339#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:44,039 INFO L273 TraceCheckUtils]: 48: Hoare triple {25339#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {25340#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:44,041 INFO L273 TraceCheckUtils]: 49: Hoare triple {25340#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {25340#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:44,041 INFO L273 TraceCheckUtils]: 50: Hoare triple {25340#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {25340#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:44,044 INFO L273 TraceCheckUtils]: 51: Hoare triple {25340#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {25341#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:44,044 INFO L273 TraceCheckUtils]: 52: Hoare triple {25341#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {25341#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:44,046 INFO L273 TraceCheckUtils]: 53: Hoare triple {25341#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {25341#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:44,046 INFO L273 TraceCheckUtils]: 54: Hoare triple {25341#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {25342#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:44,049 INFO L273 TraceCheckUtils]: 55: Hoare triple {25342#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {25342#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:44,049 INFO L273 TraceCheckUtils]: 56: Hoare triple {25342#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {25342#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:44,051 INFO L273 TraceCheckUtils]: 57: Hoare triple {25342#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {25343#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:44,051 INFO L273 TraceCheckUtils]: 58: Hoare triple {25343#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {25343#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:44,054 INFO L273 TraceCheckUtils]: 59: Hoare triple {25343#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {25343#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:44,054 INFO L273 TraceCheckUtils]: 60: Hoare triple {25343#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {25344#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:44,057 INFO L273 TraceCheckUtils]: 61: Hoare triple {25344#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {25344#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:44,057 INFO L273 TraceCheckUtils]: 62: Hoare triple {25344#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {25344#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:44,060 INFO L273 TraceCheckUtils]: 63: Hoare triple {25344#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {25345#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:44,060 INFO L273 TraceCheckUtils]: 64: Hoare triple {25345#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {25345#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:44,062 INFO L273 TraceCheckUtils]: 65: Hoare triple {25345#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {25345#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:44,062 INFO L273 TraceCheckUtils]: 66: Hoare triple {25345#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {25346#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:44,065 INFO L273 TraceCheckUtils]: 67: Hoare triple {25346#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {25346#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:44,065 INFO L273 TraceCheckUtils]: 68: Hoare triple {25346#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {25346#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:44,068 INFO L273 TraceCheckUtils]: 69: Hoare triple {25346#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {25347#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:44,068 INFO L273 TraceCheckUtils]: 70: Hoare triple {25347#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {25347#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:44,070 INFO L273 TraceCheckUtils]: 71: Hoare triple {25347#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {25347#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:44,070 INFO L273 TraceCheckUtils]: 72: Hoare triple {25347#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {25348#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:44,072 INFO L273 TraceCheckUtils]: 73: Hoare triple {25348#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {25348#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:44,072 INFO L273 TraceCheckUtils]: 74: Hoare triple {25348#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {25348#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:44,075 INFO L273 TraceCheckUtils]: 75: Hoare triple {25348#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {25349#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:44,075 INFO L273 TraceCheckUtils]: 76: Hoare triple {25349#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {25349#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:44,078 INFO L273 TraceCheckUtils]: 77: Hoare triple {25349#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {25349#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:44,078 INFO L273 TraceCheckUtils]: 78: Hoare triple {25349#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {25350#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:44,080 INFO L273 TraceCheckUtils]: 79: Hoare triple {25350#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {25350#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:44,080 INFO L273 TraceCheckUtils]: 80: Hoare triple {25350#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {25350#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:44,083 INFO L273 TraceCheckUtils]: 81: Hoare triple {25350#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {25351#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:44,083 INFO L273 TraceCheckUtils]: 82: Hoare triple {25351#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {25351#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:44,086 INFO L273 TraceCheckUtils]: 83: Hoare triple {25351#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {25351#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:44,086 INFO L273 TraceCheckUtils]: 84: Hoare triple {25351#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {25352#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:44,089 INFO L273 TraceCheckUtils]: 85: Hoare triple {25352#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {25352#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:44,089 INFO L273 TraceCheckUtils]: 86: Hoare triple {25352#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {25352#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:44,092 INFO L273 TraceCheckUtils]: 87: Hoare triple {25352#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {25353#(<= main_~i~0 28)} is VALID [2018-11-23 11:52:44,092 INFO L273 TraceCheckUtils]: 88: Hoare triple {25353#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {25353#(<= main_~i~0 28)} is VALID [2018-11-23 11:52:44,095 INFO L273 TraceCheckUtils]: 89: Hoare triple {25353#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {25353#(<= main_~i~0 28)} is VALID [2018-11-23 11:52:44,095 INFO L273 TraceCheckUtils]: 90: Hoare triple {25353#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {25354#(<= main_~i~0 29)} is VALID [2018-11-23 11:52:44,098 INFO L273 TraceCheckUtils]: 91: Hoare triple {25354#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {25354#(<= main_~i~0 29)} is VALID [2018-11-23 11:52:44,098 INFO L273 TraceCheckUtils]: 92: Hoare triple {25354#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {25354#(<= main_~i~0 29)} is VALID [2018-11-23 11:52:44,100 INFO L273 TraceCheckUtils]: 93: Hoare triple {25354#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {25355#(<= main_~i~0 30)} is VALID [2018-11-23 11:52:44,100 INFO L273 TraceCheckUtils]: 94: Hoare triple {25355#(<= main_~i~0 30)} assume !(~i~0 < 100000); {25325#false} is VALID [2018-11-23 11:52:44,100 INFO L273 TraceCheckUtils]: 95: Hoare triple {25325#false} assume !(0 != ~swapped~0); {25325#false} is VALID [2018-11-23 11:52:44,100 INFO L273 TraceCheckUtils]: 96: Hoare triple {25325#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {25325#false} is VALID [2018-11-23 11:52:44,100 INFO L273 TraceCheckUtils]: 97: Hoare triple {25325#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {25325#false} is VALID [2018-11-23 11:52:44,101 INFO L273 TraceCheckUtils]: 98: Hoare triple {25325#false} assume !!(~y~0 < 100000);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); {25325#false} is VALID [2018-11-23 11:52:44,101 INFO L256 TraceCheckUtils]: 99: Hoare triple {25325#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {25325#false} is VALID [2018-11-23 11:52:44,101 INFO L273 TraceCheckUtils]: 100: Hoare triple {25325#false} ~cond := #in~cond; {25325#false} is VALID [2018-11-23 11:52:44,101 INFO L273 TraceCheckUtils]: 101: Hoare triple {25325#false} assume 0 == ~cond; {25325#false} is VALID [2018-11-23 11:52:44,101 INFO L273 TraceCheckUtils]: 102: Hoare triple {25325#false} assume !false; {25325#false} is VALID [2018-11-23 11:52:44,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 1 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:44,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:44,110 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:52:44,125 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:52:44,227 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-11-23 11:52:44,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:44,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:44,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:44,500 INFO L256 TraceCheckUtils]: 0: Hoare triple {25324#true} call ULTIMATE.init(); {25324#true} is VALID [2018-11-23 11:52:44,501 INFO L273 TraceCheckUtils]: 1: Hoare triple {25324#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {25324#true} is VALID [2018-11-23 11:52:44,501 INFO L273 TraceCheckUtils]: 2: Hoare triple {25324#true} assume true; {25324#true} is VALID [2018-11-23 11:52:44,501 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25324#true} {25324#true} #79#return; {25324#true} is VALID [2018-11-23 11:52:44,501 INFO L256 TraceCheckUtils]: 4: Hoare triple {25324#true} call #t~ret8 := main(); {25324#true} is VALID [2018-11-23 11:52:44,501 INFO L273 TraceCheckUtils]: 5: Hoare triple {25324#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {25324#true} is VALID [2018-11-23 11:52:44,502 INFO L273 TraceCheckUtils]: 6: Hoare triple {25324#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {25377#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:44,502 INFO L273 TraceCheckUtils]: 7: Hoare triple {25377#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {25377#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:44,503 INFO L273 TraceCheckUtils]: 8: Hoare triple {25377#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {25377#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:44,504 INFO L273 TraceCheckUtils]: 9: Hoare triple {25377#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {25327#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:44,504 INFO L273 TraceCheckUtils]: 10: Hoare triple {25327#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {25327#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:44,504 INFO L273 TraceCheckUtils]: 11: Hoare triple {25327#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {25327#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:44,505 INFO L273 TraceCheckUtils]: 12: Hoare triple {25327#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {25328#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:44,505 INFO L273 TraceCheckUtils]: 13: Hoare triple {25328#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {25328#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:44,505 INFO L273 TraceCheckUtils]: 14: Hoare triple {25328#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {25328#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:44,506 INFO L273 TraceCheckUtils]: 15: Hoare triple {25328#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {25329#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:44,506 INFO L273 TraceCheckUtils]: 16: Hoare triple {25329#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {25329#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:44,506 INFO L273 TraceCheckUtils]: 17: Hoare triple {25329#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {25329#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:44,507 INFO L273 TraceCheckUtils]: 18: Hoare triple {25329#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {25330#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:44,507 INFO L273 TraceCheckUtils]: 19: Hoare triple {25330#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {25330#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:44,508 INFO L273 TraceCheckUtils]: 20: Hoare triple {25330#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {25330#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:44,508 INFO L273 TraceCheckUtils]: 21: Hoare triple {25330#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {25331#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:44,509 INFO L273 TraceCheckUtils]: 22: Hoare triple {25331#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {25331#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:44,510 INFO L273 TraceCheckUtils]: 23: Hoare triple {25331#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {25331#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:44,510 INFO L273 TraceCheckUtils]: 24: Hoare triple {25331#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {25332#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:44,511 INFO L273 TraceCheckUtils]: 25: Hoare triple {25332#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {25332#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:44,511 INFO L273 TraceCheckUtils]: 26: Hoare triple {25332#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {25332#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:44,512 INFO L273 TraceCheckUtils]: 27: Hoare triple {25332#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {25333#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:44,512 INFO L273 TraceCheckUtils]: 28: Hoare triple {25333#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {25333#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:44,513 INFO L273 TraceCheckUtils]: 29: Hoare triple {25333#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {25333#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:44,514 INFO L273 TraceCheckUtils]: 30: Hoare triple {25333#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {25334#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:44,514 INFO L273 TraceCheckUtils]: 31: Hoare triple {25334#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {25334#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:44,516 INFO L273 TraceCheckUtils]: 32: Hoare triple {25334#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {25334#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:44,516 INFO L273 TraceCheckUtils]: 33: Hoare triple {25334#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {25335#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:44,517 INFO L273 TraceCheckUtils]: 34: Hoare triple {25335#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {25335#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:44,517 INFO L273 TraceCheckUtils]: 35: Hoare triple {25335#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {25335#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:44,518 INFO L273 TraceCheckUtils]: 36: Hoare triple {25335#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {25336#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:44,518 INFO L273 TraceCheckUtils]: 37: Hoare triple {25336#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {25336#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:44,519 INFO L273 TraceCheckUtils]: 38: Hoare triple {25336#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {25336#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:44,520 INFO L273 TraceCheckUtils]: 39: Hoare triple {25336#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {25337#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:44,520 INFO L273 TraceCheckUtils]: 40: Hoare triple {25337#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {25337#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:44,521 INFO L273 TraceCheckUtils]: 41: Hoare triple {25337#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {25337#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:44,521 INFO L273 TraceCheckUtils]: 42: Hoare triple {25337#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {25338#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:44,522 INFO L273 TraceCheckUtils]: 43: Hoare triple {25338#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {25338#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:44,522 INFO L273 TraceCheckUtils]: 44: Hoare triple {25338#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {25338#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:44,523 INFO L273 TraceCheckUtils]: 45: Hoare triple {25338#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {25339#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:44,523 INFO L273 TraceCheckUtils]: 46: Hoare triple {25339#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {25339#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:44,524 INFO L273 TraceCheckUtils]: 47: Hoare triple {25339#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {25339#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:44,525 INFO L273 TraceCheckUtils]: 48: Hoare triple {25339#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {25340#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:44,525 INFO L273 TraceCheckUtils]: 49: Hoare triple {25340#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {25340#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:44,525 INFO L273 TraceCheckUtils]: 50: Hoare triple {25340#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {25340#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:44,526 INFO L273 TraceCheckUtils]: 51: Hoare triple {25340#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {25341#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:44,527 INFO L273 TraceCheckUtils]: 52: Hoare triple {25341#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {25341#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:44,527 INFO L273 TraceCheckUtils]: 53: Hoare triple {25341#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {25341#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:44,528 INFO L273 TraceCheckUtils]: 54: Hoare triple {25341#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {25342#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:44,528 INFO L273 TraceCheckUtils]: 55: Hoare triple {25342#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {25342#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:44,529 INFO L273 TraceCheckUtils]: 56: Hoare triple {25342#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {25342#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:44,529 INFO L273 TraceCheckUtils]: 57: Hoare triple {25342#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {25343#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:44,530 INFO L273 TraceCheckUtils]: 58: Hoare triple {25343#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {25343#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:44,530 INFO L273 TraceCheckUtils]: 59: Hoare triple {25343#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {25343#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:44,531 INFO L273 TraceCheckUtils]: 60: Hoare triple {25343#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {25344#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:44,532 INFO L273 TraceCheckUtils]: 61: Hoare triple {25344#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {25344#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:44,532 INFO L273 TraceCheckUtils]: 62: Hoare triple {25344#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {25344#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:44,533 INFO L273 TraceCheckUtils]: 63: Hoare triple {25344#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {25345#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:44,533 INFO L273 TraceCheckUtils]: 64: Hoare triple {25345#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {25345#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:44,534 INFO L273 TraceCheckUtils]: 65: Hoare triple {25345#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {25345#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:44,535 INFO L273 TraceCheckUtils]: 66: Hoare triple {25345#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {25346#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:44,535 INFO L273 TraceCheckUtils]: 67: Hoare triple {25346#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {25346#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:44,536 INFO L273 TraceCheckUtils]: 68: Hoare triple {25346#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {25346#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:44,536 INFO L273 TraceCheckUtils]: 69: Hoare triple {25346#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {25347#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:44,537 INFO L273 TraceCheckUtils]: 70: Hoare triple {25347#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {25347#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:44,537 INFO L273 TraceCheckUtils]: 71: Hoare triple {25347#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {25347#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:44,538 INFO L273 TraceCheckUtils]: 72: Hoare triple {25347#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {25348#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:44,538 INFO L273 TraceCheckUtils]: 73: Hoare triple {25348#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {25348#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:44,539 INFO L273 TraceCheckUtils]: 74: Hoare triple {25348#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {25348#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:44,540 INFO L273 TraceCheckUtils]: 75: Hoare triple {25348#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {25349#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:44,540 INFO L273 TraceCheckUtils]: 76: Hoare triple {25349#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {25349#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:44,541 INFO L273 TraceCheckUtils]: 77: Hoare triple {25349#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {25349#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:44,541 INFO L273 TraceCheckUtils]: 78: Hoare triple {25349#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {25350#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:44,542 INFO L273 TraceCheckUtils]: 79: Hoare triple {25350#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {25350#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:44,542 INFO L273 TraceCheckUtils]: 80: Hoare triple {25350#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {25350#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:44,543 INFO L273 TraceCheckUtils]: 81: Hoare triple {25350#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {25351#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:44,543 INFO L273 TraceCheckUtils]: 82: Hoare triple {25351#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {25351#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:44,544 INFO L273 TraceCheckUtils]: 83: Hoare triple {25351#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {25351#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:44,545 INFO L273 TraceCheckUtils]: 84: Hoare triple {25351#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {25352#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:44,545 INFO L273 TraceCheckUtils]: 85: Hoare triple {25352#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {25352#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:44,546 INFO L273 TraceCheckUtils]: 86: Hoare triple {25352#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {25352#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:44,546 INFO L273 TraceCheckUtils]: 87: Hoare triple {25352#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {25353#(<= main_~i~0 28)} is VALID [2018-11-23 11:52:44,547 INFO L273 TraceCheckUtils]: 88: Hoare triple {25353#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {25353#(<= main_~i~0 28)} is VALID [2018-11-23 11:52:44,547 INFO L273 TraceCheckUtils]: 89: Hoare triple {25353#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {25353#(<= main_~i~0 28)} is VALID [2018-11-23 11:52:44,548 INFO L273 TraceCheckUtils]: 90: Hoare triple {25353#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {25354#(<= main_~i~0 29)} is VALID [2018-11-23 11:52:44,548 INFO L273 TraceCheckUtils]: 91: Hoare triple {25354#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {25354#(<= main_~i~0 29)} is VALID [2018-11-23 11:52:44,549 INFO L273 TraceCheckUtils]: 92: Hoare triple {25354#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {25354#(<= main_~i~0 29)} is VALID [2018-11-23 11:52:44,550 INFO L273 TraceCheckUtils]: 93: Hoare triple {25354#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {25355#(<= main_~i~0 30)} is VALID [2018-11-23 11:52:44,550 INFO L273 TraceCheckUtils]: 94: Hoare triple {25355#(<= main_~i~0 30)} assume !(~i~0 < 100000); {25325#false} is VALID [2018-11-23 11:52:44,550 INFO L273 TraceCheckUtils]: 95: Hoare triple {25325#false} assume !(0 != ~swapped~0); {25325#false} is VALID [2018-11-23 11:52:44,551 INFO L273 TraceCheckUtils]: 96: Hoare triple {25325#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {25325#false} is VALID [2018-11-23 11:52:44,551 INFO L273 TraceCheckUtils]: 97: Hoare triple {25325#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {25325#false} is VALID [2018-11-23 11:52:44,551 INFO L273 TraceCheckUtils]: 98: Hoare triple {25325#false} assume !!(~y~0 < 100000);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); {25325#false} is VALID [2018-11-23 11:52:44,551 INFO L256 TraceCheckUtils]: 99: Hoare triple {25325#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {25325#false} is VALID [2018-11-23 11:52:44,551 INFO L273 TraceCheckUtils]: 100: Hoare triple {25325#false} ~cond := #in~cond; {25325#false} is VALID [2018-11-23 11:52:44,552 INFO L273 TraceCheckUtils]: 101: Hoare triple {25325#false} assume 0 == ~cond; {25325#false} is VALID [2018-11-23 11:52:44,552 INFO L273 TraceCheckUtils]: 102: Hoare triple {25325#false} assume !false; {25325#false} is VALID [2018-11-23 11:52:44,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 1 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:44,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:44,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2018-11-23 11:52:44,578 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 103 [2018-11-23 11:52:44,579 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:44,579 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-23 11:52:44,681 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:44,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-23 11:52:44,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-23 11:52:44,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 11:52:44,682 INFO L87 Difference]: Start difference. First operand 195 states and 256 transitions. Second operand 33 states. [2018-11-23 11:52:45,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:45,287 INFO L93 Difference]: Finished difference Result 394 states and 522 transitions. [2018-11-23 11:52:45,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-23 11:52:45,287 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 103 [2018-11-23 11:52:45,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:45,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 11:52:45,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 169 transitions. [2018-11-23 11:52:45,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 11:52:45,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 169 transitions. [2018-11-23 11:52:45,290 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 169 transitions. [2018-11-23 11:52:45,455 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:45,458 INFO L225 Difference]: With dead ends: 394 [2018-11-23 11:52:45,458 INFO L226 Difference]: Without dead ends: 205 [2018-11-23 11:52:45,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 11:52:45,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-11-23 11:52:45,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 201. [2018-11-23 11:52:45,533 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:45,533 INFO L82 GeneralOperation]: Start isEquivalent. First operand 205 states. Second operand 201 states. [2018-11-23 11:52:45,533 INFO L74 IsIncluded]: Start isIncluded. First operand 205 states. Second operand 201 states. [2018-11-23 11:52:45,534 INFO L87 Difference]: Start difference. First operand 205 states. Second operand 201 states. [2018-11-23 11:52:45,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:45,538 INFO L93 Difference]: Finished difference Result 205 states and 270 transitions. [2018-11-23 11:52:45,539 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 270 transitions. [2018-11-23 11:52:45,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:45,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:45,539 INFO L74 IsIncluded]: Start isIncluded. First operand 201 states. Second operand 205 states. [2018-11-23 11:52:45,539 INFO L87 Difference]: Start difference. First operand 201 states. Second operand 205 states. [2018-11-23 11:52:45,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:45,543 INFO L93 Difference]: Finished difference Result 205 states and 270 transitions. [2018-11-23 11:52:45,543 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 270 transitions. [2018-11-23 11:52:45,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:45,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:45,544 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:45,544 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:45,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-23 11:52:45,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 264 transitions. [2018-11-23 11:52:45,548 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 264 transitions. Word has length 103 [2018-11-23 11:52:45,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:45,548 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 264 transitions. [2018-11-23 11:52:45,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-23 11:52:45,548 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 264 transitions. [2018-11-23 11:52:45,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-23 11:52:45,549 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:45,549 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:45,550 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:45,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:45,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1906438705, now seen corresponding path program 30 times [2018-11-23 11:52:45,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:45,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:45,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:45,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:45,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:45,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:47,499 INFO L256 TraceCheckUtils]: 0: Hoare triple {26877#true} call ULTIMATE.init(); {26877#true} is VALID [2018-11-23 11:52:47,499 INFO L273 TraceCheckUtils]: 1: Hoare triple {26877#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26877#true} is VALID [2018-11-23 11:52:47,499 INFO L273 TraceCheckUtils]: 2: Hoare triple {26877#true} assume true; {26877#true} is VALID [2018-11-23 11:52:47,499 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26877#true} {26877#true} #79#return; {26877#true} is VALID [2018-11-23 11:52:47,500 INFO L256 TraceCheckUtils]: 4: Hoare triple {26877#true} call #t~ret8 := main(); {26877#true} is VALID [2018-11-23 11:52:47,500 INFO L273 TraceCheckUtils]: 5: Hoare triple {26877#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {26877#true} is VALID [2018-11-23 11:52:47,500 INFO L273 TraceCheckUtils]: 6: Hoare triple {26877#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {26879#(= main_~i~0 1)} is VALID [2018-11-23 11:52:47,501 INFO L273 TraceCheckUtils]: 7: Hoare triple {26879#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {26879#(= main_~i~0 1)} is VALID [2018-11-23 11:52:47,501 INFO L273 TraceCheckUtils]: 8: Hoare triple {26879#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26879#(= main_~i~0 1)} is VALID [2018-11-23 11:52:47,502 INFO L273 TraceCheckUtils]: 9: Hoare triple {26879#(= main_~i~0 1)} ~i~0 := 1 + ~i~0; {26880#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:47,502 INFO L273 TraceCheckUtils]: 10: Hoare triple {26880#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {26880#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:47,503 INFO L273 TraceCheckUtils]: 11: Hoare triple {26880#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26880#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:47,504 INFO L273 TraceCheckUtils]: 12: Hoare triple {26880#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {26881#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:47,504 INFO L273 TraceCheckUtils]: 13: Hoare triple {26881#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {26881#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:47,505 INFO L273 TraceCheckUtils]: 14: Hoare triple {26881#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26881#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:47,505 INFO L273 TraceCheckUtils]: 15: Hoare triple {26881#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {26882#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:47,506 INFO L273 TraceCheckUtils]: 16: Hoare triple {26882#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {26882#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:47,506 INFO L273 TraceCheckUtils]: 17: Hoare triple {26882#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26882#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:47,507 INFO L273 TraceCheckUtils]: 18: Hoare triple {26882#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {26883#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:47,507 INFO L273 TraceCheckUtils]: 19: Hoare triple {26883#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {26883#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:47,508 INFO L273 TraceCheckUtils]: 20: Hoare triple {26883#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26883#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:47,509 INFO L273 TraceCheckUtils]: 21: Hoare triple {26883#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {26884#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:47,509 INFO L273 TraceCheckUtils]: 22: Hoare triple {26884#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {26884#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:47,510 INFO L273 TraceCheckUtils]: 23: Hoare triple {26884#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26884#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:47,510 INFO L273 TraceCheckUtils]: 24: Hoare triple {26884#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {26885#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:47,511 INFO L273 TraceCheckUtils]: 25: Hoare triple {26885#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {26885#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:47,511 INFO L273 TraceCheckUtils]: 26: Hoare triple {26885#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26885#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:47,512 INFO L273 TraceCheckUtils]: 27: Hoare triple {26885#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {26886#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:47,512 INFO L273 TraceCheckUtils]: 28: Hoare triple {26886#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {26886#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:47,513 INFO L273 TraceCheckUtils]: 29: Hoare triple {26886#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26886#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:47,514 INFO L273 TraceCheckUtils]: 30: Hoare triple {26886#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {26887#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:47,514 INFO L273 TraceCheckUtils]: 31: Hoare triple {26887#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {26887#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:47,514 INFO L273 TraceCheckUtils]: 32: Hoare triple {26887#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26887#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:47,515 INFO L273 TraceCheckUtils]: 33: Hoare triple {26887#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {26888#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:47,516 INFO L273 TraceCheckUtils]: 34: Hoare triple {26888#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {26888#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:47,516 INFO L273 TraceCheckUtils]: 35: Hoare triple {26888#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26888#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:47,517 INFO L273 TraceCheckUtils]: 36: Hoare triple {26888#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {26889#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:47,517 INFO L273 TraceCheckUtils]: 37: Hoare triple {26889#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {26889#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:47,518 INFO L273 TraceCheckUtils]: 38: Hoare triple {26889#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26889#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:47,518 INFO L273 TraceCheckUtils]: 39: Hoare triple {26889#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {26890#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:47,519 INFO L273 TraceCheckUtils]: 40: Hoare triple {26890#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {26890#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:47,519 INFO L273 TraceCheckUtils]: 41: Hoare triple {26890#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26890#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:47,520 INFO L273 TraceCheckUtils]: 42: Hoare triple {26890#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {26891#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:47,521 INFO L273 TraceCheckUtils]: 43: Hoare triple {26891#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {26891#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:47,521 INFO L273 TraceCheckUtils]: 44: Hoare triple {26891#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26891#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:47,522 INFO L273 TraceCheckUtils]: 45: Hoare triple {26891#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {26892#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:47,522 INFO L273 TraceCheckUtils]: 46: Hoare triple {26892#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {26892#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:47,523 INFO L273 TraceCheckUtils]: 47: Hoare triple {26892#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26892#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:47,523 INFO L273 TraceCheckUtils]: 48: Hoare triple {26892#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {26893#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:47,524 INFO L273 TraceCheckUtils]: 49: Hoare triple {26893#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {26893#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:47,524 INFO L273 TraceCheckUtils]: 50: Hoare triple {26893#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26893#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:47,525 INFO L273 TraceCheckUtils]: 51: Hoare triple {26893#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {26894#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:47,525 INFO L273 TraceCheckUtils]: 52: Hoare triple {26894#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {26894#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:47,526 INFO L273 TraceCheckUtils]: 53: Hoare triple {26894#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26894#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:47,527 INFO L273 TraceCheckUtils]: 54: Hoare triple {26894#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {26895#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:47,527 INFO L273 TraceCheckUtils]: 55: Hoare triple {26895#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {26895#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:47,527 INFO L273 TraceCheckUtils]: 56: Hoare triple {26895#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26895#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:47,528 INFO L273 TraceCheckUtils]: 57: Hoare triple {26895#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {26896#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:47,529 INFO L273 TraceCheckUtils]: 58: Hoare triple {26896#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {26896#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:47,529 INFO L273 TraceCheckUtils]: 59: Hoare triple {26896#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26896#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:47,530 INFO L273 TraceCheckUtils]: 60: Hoare triple {26896#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {26897#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:47,530 INFO L273 TraceCheckUtils]: 61: Hoare triple {26897#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {26897#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:47,531 INFO L273 TraceCheckUtils]: 62: Hoare triple {26897#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26897#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:47,531 INFO L273 TraceCheckUtils]: 63: Hoare triple {26897#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {26898#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:47,532 INFO L273 TraceCheckUtils]: 64: Hoare triple {26898#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {26898#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:47,532 INFO L273 TraceCheckUtils]: 65: Hoare triple {26898#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26898#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:47,533 INFO L273 TraceCheckUtils]: 66: Hoare triple {26898#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {26899#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:47,534 INFO L273 TraceCheckUtils]: 67: Hoare triple {26899#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {26899#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:47,534 INFO L273 TraceCheckUtils]: 68: Hoare triple {26899#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26899#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:47,535 INFO L273 TraceCheckUtils]: 69: Hoare triple {26899#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {26900#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:47,535 INFO L273 TraceCheckUtils]: 70: Hoare triple {26900#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {26900#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:47,536 INFO L273 TraceCheckUtils]: 71: Hoare triple {26900#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26900#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:47,536 INFO L273 TraceCheckUtils]: 72: Hoare triple {26900#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {26901#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:47,537 INFO L273 TraceCheckUtils]: 73: Hoare triple {26901#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {26901#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:47,537 INFO L273 TraceCheckUtils]: 74: Hoare triple {26901#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26901#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:47,538 INFO L273 TraceCheckUtils]: 75: Hoare triple {26901#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {26902#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:47,538 INFO L273 TraceCheckUtils]: 76: Hoare triple {26902#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {26902#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:47,539 INFO L273 TraceCheckUtils]: 77: Hoare triple {26902#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26902#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:47,540 INFO L273 TraceCheckUtils]: 78: Hoare triple {26902#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {26903#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:47,540 INFO L273 TraceCheckUtils]: 79: Hoare triple {26903#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {26903#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:47,541 INFO L273 TraceCheckUtils]: 80: Hoare triple {26903#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26903#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:47,541 INFO L273 TraceCheckUtils]: 81: Hoare triple {26903#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {26904#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:47,542 INFO L273 TraceCheckUtils]: 82: Hoare triple {26904#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {26904#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:47,542 INFO L273 TraceCheckUtils]: 83: Hoare triple {26904#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26904#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:47,543 INFO L273 TraceCheckUtils]: 84: Hoare triple {26904#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {26905#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:47,543 INFO L273 TraceCheckUtils]: 85: Hoare triple {26905#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {26905#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:47,544 INFO L273 TraceCheckUtils]: 86: Hoare triple {26905#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26905#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:47,544 INFO L273 TraceCheckUtils]: 87: Hoare triple {26905#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {26906#(<= main_~i~0 28)} is VALID [2018-11-23 11:52:47,545 INFO L273 TraceCheckUtils]: 88: Hoare triple {26906#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {26906#(<= main_~i~0 28)} is VALID [2018-11-23 11:52:47,545 INFO L273 TraceCheckUtils]: 89: Hoare triple {26906#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26906#(<= main_~i~0 28)} is VALID [2018-11-23 11:52:47,546 INFO L273 TraceCheckUtils]: 90: Hoare triple {26906#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {26907#(<= main_~i~0 29)} is VALID [2018-11-23 11:52:47,547 INFO L273 TraceCheckUtils]: 91: Hoare triple {26907#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {26907#(<= main_~i~0 29)} is VALID [2018-11-23 11:52:47,547 INFO L273 TraceCheckUtils]: 92: Hoare triple {26907#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26907#(<= main_~i~0 29)} is VALID [2018-11-23 11:52:47,548 INFO L273 TraceCheckUtils]: 93: Hoare triple {26907#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {26908#(<= main_~i~0 30)} is VALID [2018-11-23 11:52:47,548 INFO L273 TraceCheckUtils]: 94: Hoare triple {26908#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {26908#(<= main_~i~0 30)} is VALID [2018-11-23 11:52:47,549 INFO L273 TraceCheckUtils]: 95: Hoare triple {26908#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26908#(<= main_~i~0 30)} is VALID [2018-11-23 11:52:47,549 INFO L273 TraceCheckUtils]: 96: Hoare triple {26908#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {26909#(<= main_~i~0 31)} is VALID [2018-11-23 11:52:47,550 INFO L273 TraceCheckUtils]: 97: Hoare triple {26909#(<= main_~i~0 31)} assume !(~i~0 < 100000); {26878#false} is VALID [2018-11-23 11:52:47,550 INFO L273 TraceCheckUtils]: 98: Hoare triple {26878#false} assume !(0 != ~swapped~0); {26878#false} is VALID [2018-11-23 11:52:47,550 INFO L273 TraceCheckUtils]: 99: Hoare triple {26878#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {26878#false} is VALID [2018-11-23 11:52:47,551 INFO L273 TraceCheckUtils]: 100: Hoare triple {26878#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {26878#false} is VALID [2018-11-23 11:52:47,551 INFO L273 TraceCheckUtils]: 101: Hoare triple {26878#false} assume !!(~y~0 < 100000);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); {26878#false} is VALID [2018-11-23 11:52:47,551 INFO L256 TraceCheckUtils]: 102: Hoare triple {26878#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {26878#false} is VALID [2018-11-23 11:52:47,551 INFO L273 TraceCheckUtils]: 103: Hoare triple {26878#false} ~cond := #in~cond; {26878#false} is VALID [2018-11-23 11:52:47,551 INFO L273 TraceCheckUtils]: 104: Hoare triple {26878#false} assume 0 == ~cond; {26878#false} is VALID [2018-11-23 11:52:47,552 INFO L273 TraceCheckUtils]: 105: Hoare triple {26878#false} assume !false; {26878#false} is VALID [2018-11-23 11:52:47,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1336 backedges. 1 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:47,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:47,560 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:52:47,569 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:52:47,665 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 32 check-sat command(s) [2018-11-23 11:52:47,666 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:47,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:47,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:47,937 INFO L256 TraceCheckUtils]: 0: Hoare triple {26877#true} call ULTIMATE.init(); {26877#true} is VALID [2018-11-23 11:52:47,937 INFO L273 TraceCheckUtils]: 1: Hoare triple {26877#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26877#true} is VALID [2018-11-23 11:52:47,937 INFO L273 TraceCheckUtils]: 2: Hoare triple {26877#true} assume true; {26877#true} is VALID [2018-11-23 11:52:47,938 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26877#true} {26877#true} #79#return; {26877#true} is VALID [2018-11-23 11:52:47,938 INFO L256 TraceCheckUtils]: 4: Hoare triple {26877#true} call #t~ret8 := main(); {26877#true} is VALID [2018-11-23 11:52:47,938 INFO L273 TraceCheckUtils]: 5: Hoare triple {26877#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {26877#true} is VALID [2018-11-23 11:52:47,938 INFO L273 TraceCheckUtils]: 6: Hoare triple {26877#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {26931#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:47,939 INFO L273 TraceCheckUtils]: 7: Hoare triple {26931#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {26931#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:47,939 INFO L273 TraceCheckUtils]: 8: Hoare triple {26931#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26931#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:47,940 INFO L273 TraceCheckUtils]: 9: Hoare triple {26931#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {26880#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:47,940 INFO L273 TraceCheckUtils]: 10: Hoare triple {26880#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {26880#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:47,940 INFO L273 TraceCheckUtils]: 11: Hoare triple {26880#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26880#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:47,941 INFO L273 TraceCheckUtils]: 12: Hoare triple {26880#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {26881#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:47,941 INFO L273 TraceCheckUtils]: 13: Hoare triple {26881#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {26881#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:47,942 INFO L273 TraceCheckUtils]: 14: Hoare triple {26881#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26881#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:47,942 INFO L273 TraceCheckUtils]: 15: Hoare triple {26881#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {26882#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:47,943 INFO L273 TraceCheckUtils]: 16: Hoare triple {26882#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {26882#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:47,943 INFO L273 TraceCheckUtils]: 17: Hoare triple {26882#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26882#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:47,944 INFO L273 TraceCheckUtils]: 18: Hoare triple {26882#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {26883#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:47,944 INFO L273 TraceCheckUtils]: 19: Hoare triple {26883#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {26883#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:47,945 INFO L273 TraceCheckUtils]: 20: Hoare triple {26883#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26883#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:47,946 INFO L273 TraceCheckUtils]: 21: Hoare triple {26883#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {26884#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:47,946 INFO L273 TraceCheckUtils]: 22: Hoare triple {26884#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {26884#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:47,947 INFO L273 TraceCheckUtils]: 23: Hoare triple {26884#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26884#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:47,947 INFO L273 TraceCheckUtils]: 24: Hoare triple {26884#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {26885#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:47,948 INFO L273 TraceCheckUtils]: 25: Hoare triple {26885#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {26885#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:47,948 INFO L273 TraceCheckUtils]: 26: Hoare triple {26885#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26885#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:47,949 INFO L273 TraceCheckUtils]: 27: Hoare triple {26885#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {26886#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:47,949 INFO L273 TraceCheckUtils]: 28: Hoare triple {26886#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {26886#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:47,950 INFO L273 TraceCheckUtils]: 29: Hoare triple {26886#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26886#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:47,950 INFO L273 TraceCheckUtils]: 30: Hoare triple {26886#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {26887#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:47,951 INFO L273 TraceCheckUtils]: 31: Hoare triple {26887#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {26887#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:47,951 INFO L273 TraceCheckUtils]: 32: Hoare triple {26887#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26887#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:47,952 INFO L273 TraceCheckUtils]: 33: Hoare triple {26887#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {26888#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:47,953 INFO L273 TraceCheckUtils]: 34: Hoare triple {26888#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {26888#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:47,953 INFO L273 TraceCheckUtils]: 35: Hoare triple {26888#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26888#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:47,954 INFO L273 TraceCheckUtils]: 36: Hoare triple {26888#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {26889#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:47,954 INFO L273 TraceCheckUtils]: 37: Hoare triple {26889#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {26889#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:47,955 INFO L273 TraceCheckUtils]: 38: Hoare triple {26889#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26889#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:47,955 INFO L273 TraceCheckUtils]: 39: Hoare triple {26889#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {26890#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:47,956 INFO L273 TraceCheckUtils]: 40: Hoare triple {26890#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {26890#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:47,956 INFO L273 TraceCheckUtils]: 41: Hoare triple {26890#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26890#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:47,957 INFO L273 TraceCheckUtils]: 42: Hoare triple {26890#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {26891#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:47,957 INFO L273 TraceCheckUtils]: 43: Hoare triple {26891#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {26891#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:47,958 INFO L273 TraceCheckUtils]: 44: Hoare triple {26891#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26891#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:47,959 INFO L273 TraceCheckUtils]: 45: Hoare triple {26891#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {26892#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:47,959 INFO L273 TraceCheckUtils]: 46: Hoare triple {26892#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {26892#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:47,960 INFO L273 TraceCheckUtils]: 47: Hoare triple {26892#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26892#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:47,960 INFO L273 TraceCheckUtils]: 48: Hoare triple {26892#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {26893#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:47,961 INFO L273 TraceCheckUtils]: 49: Hoare triple {26893#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {26893#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:47,961 INFO L273 TraceCheckUtils]: 50: Hoare triple {26893#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26893#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:47,962 INFO L273 TraceCheckUtils]: 51: Hoare triple {26893#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {26894#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:47,962 INFO L273 TraceCheckUtils]: 52: Hoare triple {26894#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {26894#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:47,963 INFO L273 TraceCheckUtils]: 53: Hoare triple {26894#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26894#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:47,964 INFO L273 TraceCheckUtils]: 54: Hoare triple {26894#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {26895#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:47,964 INFO L273 TraceCheckUtils]: 55: Hoare triple {26895#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {26895#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:47,965 INFO L273 TraceCheckUtils]: 56: Hoare triple {26895#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26895#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:47,965 INFO L273 TraceCheckUtils]: 57: Hoare triple {26895#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {26896#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:47,967 INFO L273 TraceCheckUtils]: 58: Hoare triple {26896#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {26896#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:47,967 INFO L273 TraceCheckUtils]: 59: Hoare triple {26896#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26896#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:47,968 INFO L273 TraceCheckUtils]: 60: Hoare triple {26896#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {26897#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:47,968 INFO L273 TraceCheckUtils]: 61: Hoare triple {26897#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {26897#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:47,969 INFO L273 TraceCheckUtils]: 62: Hoare triple {26897#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26897#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:47,969 INFO L273 TraceCheckUtils]: 63: Hoare triple {26897#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {26898#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:47,970 INFO L273 TraceCheckUtils]: 64: Hoare triple {26898#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {26898#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:47,970 INFO L273 TraceCheckUtils]: 65: Hoare triple {26898#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26898#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:47,971 INFO L273 TraceCheckUtils]: 66: Hoare triple {26898#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {26899#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:47,971 INFO L273 TraceCheckUtils]: 67: Hoare triple {26899#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {26899#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:47,972 INFO L273 TraceCheckUtils]: 68: Hoare triple {26899#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26899#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:47,973 INFO L273 TraceCheckUtils]: 69: Hoare triple {26899#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {26900#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:47,973 INFO L273 TraceCheckUtils]: 70: Hoare triple {26900#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {26900#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:47,974 INFO L273 TraceCheckUtils]: 71: Hoare triple {26900#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26900#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:47,974 INFO L273 TraceCheckUtils]: 72: Hoare triple {26900#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {26901#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:47,975 INFO L273 TraceCheckUtils]: 73: Hoare triple {26901#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {26901#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:47,975 INFO L273 TraceCheckUtils]: 74: Hoare triple {26901#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26901#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:47,976 INFO L273 TraceCheckUtils]: 75: Hoare triple {26901#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {26902#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:47,976 INFO L273 TraceCheckUtils]: 76: Hoare triple {26902#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {26902#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:47,977 INFO L273 TraceCheckUtils]: 77: Hoare triple {26902#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26902#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:47,978 INFO L273 TraceCheckUtils]: 78: Hoare triple {26902#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {26903#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:47,978 INFO L273 TraceCheckUtils]: 79: Hoare triple {26903#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {26903#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:47,978 INFO L273 TraceCheckUtils]: 80: Hoare triple {26903#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26903#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:47,979 INFO L273 TraceCheckUtils]: 81: Hoare triple {26903#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {26904#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:47,980 INFO L273 TraceCheckUtils]: 82: Hoare triple {26904#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {26904#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:47,980 INFO L273 TraceCheckUtils]: 83: Hoare triple {26904#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26904#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:47,981 INFO L273 TraceCheckUtils]: 84: Hoare triple {26904#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {26905#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:47,981 INFO L273 TraceCheckUtils]: 85: Hoare triple {26905#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {26905#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:47,982 INFO L273 TraceCheckUtils]: 86: Hoare triple {26905#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26905#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:47,982 INFO L273 TraceCheckUtils]: 87: Hoare triple {26905#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {26906#(<= main_~i~0 28)} is VALID [2018-11-23 11:52:47,985 INFO L273 TraceCheckUtils]: 88: Hoare triple {26906#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {26906#(<= main_~i~0 28)} is VALID [2018-11-23 11:52:47,986 INFO L273 TraceCheckUtils]: 89: Hoare triple {26906#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26906#(<= main_~i~0 28)} is VALID [2018-11-23 11:52:47,986 INFO L273 TraceCheckUtils]: 90: Hoare triple {26906#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {26907#(<= main_~i~0 29)} is VALID [2018-11-23 11:52:47,987 INFO L273 TraceCheckUtils]: 91: Hoare triple {26907#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {26907#(<= main_~i~0 29)} is VALID [2018-11-23 11:52:47,987 INFO L273 TraceCheckUtils]: 92: Hoare triple {26907#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26907#(<= main_~i~0 29)} is VALID [2018-11-23 11:52:47,987 INFO L273 TraceCheckUtils]: 93: Hoare triple {26907#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {26908#(<= main_~i~0 30)} is VALID [2018-11-23 11:52:47,988 INFO L273 TraceCheckUtils]: 94: Hoare triple {26908#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {26908#(<= main_~i~0 30)} is VALID [2018-11-23 11:52:47,988 INFO L273 TraceCheckUtils]: 95: Hoare triple {26908#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26908#(<= main_~i~0 30)} is VALID [2018-11-23 11:52:47,988 INFO L273 TraceCheckUtils]: 96: Hoare triple {26908#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {26909#(<= main_~i~0 31)} is VALID [2018-11-23 11:52:47,989 INFO L273 TraceCheckUtils]: 97: Hoare triple {26909#(<= main_~i~0 31)} assume !(~i~0 < 100000); {26878#false} is VALID [2018-11-23 11:52:47,989 INFO L273 TraceCheckUtils]: 98: Hoare triple {26878#false} assume !(0 != ~swapped~0); {26878#false} is VALID [2018-11-23 11:52:47,989 INFO L273 TraceCheckUtils]: 99: Hoare triple {26878#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {26878#false} is VALID [2018-11-23 11:52:47,989 INFO L273 TraceCheckUtils]: 100: Hoare triple {26878#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {26878#false} is VALID [2018-11-23 11:52:47,989 INFO L273 TraceCheckUtils]: 101: Hoare triple {26878#false} assume !!(~y~0 < 100000);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); {26878#false} is VALID [2018-11-23 11:52:47,989 INFO L256 TraceCheckUtils]: 102: Hoare triple {26878#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {26878#false} is VALID [2018-11-23 11:52:47,989 INFO L273 TraceCheckUtils]: 103: Hoare triple {26878#false} ~cond := #in~cond; {26878#false} is VALID [2018-11-23 11:52:47,990 INFO L273 TraceCheckUtils]: 104: Hoare triple {26878#false} assume 0 == ~cond; {26878#false} is VALID [2018-11-23 11:52:47,990 INFO L273 TraceCheckUtils]: 105: Hoare triple {26878#false} assume !false; {26878#false} is VALID [2018-11-23 11:52:47,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1336 backedges. 1 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:48,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:48,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2018-11-23 11:52:48,017 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 106 [2018-11-23 11:52:48,018 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:48,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-23 11:52:48,118 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:48,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-23 11:52:48,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-23 11:52:48,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 11:52:48,119 INFO L87 Difference]: Start difference. First operand 201 states and 264 transitions. Second operand 34 states. [2018-11-23 11:52:48,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:48,970 INFO L93 Difference]: Finished difference Result 406 states and 538 transitions. [2018-11-23 11:52:48,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-23 11:52:48,970 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 106 [2018-11-23 11:52:48,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:48,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 11:52:48,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 173 transitions. [2018-11-23 11:52:48,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 11:52:48,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 173 transitions. [2018-11-23 11:52:48,973 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 173 transitions. [2018-11-23 11:52:49,257 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:49,261 INFO L225 Difference]: With dead ends: 406 [2018-11-23 11:52:49,261 INFO L226 Difference]: Without dead ends: 211 [2018-11-23 11:52:49,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 11:52:49,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-11-23 11:52:49,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 207. [2018-11-23 11:52:49,373 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:49,373 INFO L82 GeneralOperation]: Start isEquivalent. First operand 211 states. Second operand 207 states. [2018-11-23 11:52:49,374 INFO L74 IsIncluded]: Start isIncluded. First operand 211 states. Second operand 207 states. [2018-11-23 11:52:49,374 INFO L87 Difference]: Start difference. First operand 211 states. Second operand 207 states. [2018-11-23 11:52:49,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:49,378 INFO L93 Difference]: Finished difference Result 211 states and 278 transitions. [2018-11-23 11:52:49,378 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 278 transitions. [2018-11-23 11:52:49,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:49,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:49,379 INFO L74 IsIncluded]: Start isIncluded. First operand 207 states. Second operand 211 states. [2018-11-23 11:52:49,379 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 211 states. [2018-11-23 11:52:49,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:49,383 INFO L93 Difference]: Finished difference Result 211 states and 278 transitions. [2018-11-23 11:52:49,383 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 278 transitions. [2018-11-23 11:52:49,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:49,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:49,383 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:49,384 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:49,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-11-23 11:52:49,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 272 transitions. [2018-11-23 11:52:49,388 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 272 transitions. Word has length 106 [2018-11-23 11:52:49,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:49,388 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 272 transitions. [2018-11-23 11:52:49,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-23 11:52:49,388 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 272 transitions. [2018-11-23 11:52:49,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-23 11:52:49,389 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:49,389 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:49,389 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:49,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:49,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1075565480, now seen corresponding path program 31 times [2018-11-23 11:52:49,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:49,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:49,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:49,391 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:49,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:49,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:50,011 INFO L256 TraceCheckUtils]: 0: Hoare triple {28476#true} call ULTIMATE.init(); {28476#true} is VALID [2018-11-23 11:52:50,012 INFO L273 TraceCheckUtils]: 1: Hoare triple {28476#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28476#true} is VALID [2018-11-23 11:52:50,012 INFO L273 TraceCheckUtils]: 2: Hoare triple {28476#true} assume true; {28476#true} is VALID [2018-11-23 11:52:50,012 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28476#true} {28476#true} #79#return; {28476#true} is VALID [2018-11-23 11:52:50,012 INFO L256 TraceCheckUtils]: 4: Hoare triple {28476#true} call #t~ret8 := main(); {28476#true} is VALID [2018-11-23 11:52:50,013 INFO L273 TraceCheckUtils]: 5: Hoare triple {28476#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {28476#true} is VALID [2018-11-23 11:52:50,013 INFO L273 TraceCheckUtils]: 6: Hoare triple {28476#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {28478#(= main_~i~0 1)} is VALID [2018-11-23 11:52:50,014 INFO L273 TraceCheckUtils]: 7: Hoare triple {28478#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28478#(= main_~i~0 1)} is VALID [2018-11-23 11:52:50,014 INFO L273 TraceCheckUtils]: 8: Hoare triple {28478#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28478#(= main_~i~0 1)} is VALID [2018-11-23 11:52:50,015 INFO L273 TraceCheckUtils]: 9: Hoare triple {28478#(= main_~i~0 1)} ~i~0 := 1 + ~i~0; {28479#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:50,015 INFO L273 TraceCheckUtils]: 10: Hoare triple {28479#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28479#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:50,015 INFO L273 TraceCheckUtils]: 11: Hoare triple {28479#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28479#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:50,016 INFO L273 TraceCheckUtils]: 12: Hoare triple {28479#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {28480#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:50,016 INFO L273 TraceCheckUtils]: 13: Hoare triple {28480#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28480#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:50,016 INFO L273 TraceCheckUtils]: 14: Hoare triple {28480#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28480#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:50,017 INFO L273 TraceCheckUtils]: 15: Hoare triple {28480#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {28481#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:50,017 INFO L273 TraceCheckUtils]: 16: Hoare triple {28481#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28481#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:50,017 INFO L273 TraceCheckUtils]: 17: Hoare triple {28481#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28481#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:50,018 INFO L273 TraceCheckUtils]: 18: Hoare triple {28481#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {28482#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:50,019 INFO L273 TraceCheckUtils]: 19: Hoare triple {28482#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28482#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:50,019 INFO L273 TraceCheckUtils]: 20: Hoare triple {28482#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28482#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:50,020 INFO L273 TraceCheckUtils]: 21: Hoare triple {28482#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {28483#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:50,020 INFO L273 TraceCheckUtils]: 22: Hoare triple {28483#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28483#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:50,021 INFO L273 TraceCheckUtils]: 23: Hoare triple {28483#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28483#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:50,022 INFO L273 TraceCheckUtils]: 24: Hoare triple {28483#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {28484#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:50,022 INFO L273 TraceCheckUtils]: 25: Hoare triple {28484#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28484#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:50,023 INFO L273 TraceCheckUtils]: 26: Hoare triple {28484#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28484#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:50,023 INFO L273 TraceCheckUtils]: 27: Hoare triple {28484#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {28485#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:50,024 INFO L273 TraceCheckUtils]: 28: Hoare triple {28485#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28485#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:50,024 INFO L273 TraceCheckUtils]: 29: Hoare triple {28485#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28485#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:50,025 INFO L273 TraceCheckUtils]: 30: Hoare triple {28485#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {28486#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:50,026 INFO L273 TraceCheckUtils]: 31: Hoare triple {28486#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28486#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:50,026 INFO L273 TraceCheckUtils]: 32: Hoare triple {28486#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28486#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:50,027 INFO L273 TraceCheckUtils]: 33: Hoare triple {28486#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {28487#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:50,027 INFO L273 TraceCheckUtils]: 34: Hoare triple {28487#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28487#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:50,028 INFO L273 TraceCheckUtils]: 35: Hoare triple {28487#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28487#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:50,029 INFO L273 TraceCheckUtils]: 36: Hoare triple {28487#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {28488#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:50,029 INFO L273 TraceCheckUtils]: 37: Hoare triple {28488#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28488#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:50,030 INFO L273 TraceCheckUtils]: 38: Hoare triple {28488#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28488#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:50,030 INFO L273 TraceCheckUtils]: 39: Hoare triple {28488#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {28489#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:50,031 INFO L273 TraceCheckUtils]: 40: Hoare triple {28489#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28489#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:50,031 INFO L273 TraceCheckUtils]: 41: Hoare triple {28489#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28489#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:50,032 INFO L273 TraceCheckUtils]: 42: Hoare triple {28489#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {28490#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:50,033 INFO L273 TraceCheckUtils]: 43: Hoare triple {28490#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28490#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:50,033 INFO L273 TraceCheckUtils]: 44: Hoare triple {28490#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28490#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:50,034 INFO L273 TraceCheckUtils]: 45: Hoare triple {28490#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {28491#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:50,034 INFO L273 TraceCheckUtils]: 46: Hoare triple {28491#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28491#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:50,035 INFO L273 TraceCheckUtils]: 47: Hoare triple {28491#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28491#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:50,036 INFO L273 TraceCheckUtils]: 48: Hoare triple {28491#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {28492#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:50,036 INFO L273 TraceCheckUtils]: 49: Hoare triple {28492#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28492#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:50,037 INFO L273 TraceCheckUtils]: 50: Hoare triple {28492#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28492#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:50,037 INFO L273 TraceCheckUtils]: 51: Hoare triple {28492#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {28493#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:50,038 INFO L273 TraceCheckUtils]: 52: Hoare triple {28493#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28493#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:50,038 INFO L273 TraceCheckUtils]: 53: Hoare triple {28493#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28493#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:50,039 INFO L273 TraceCheckUtils]: 54: Hoare triple {28493#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {28494#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:50,040 INFO L273 TraceCheckUtils]: 55: Hoare triple {28494#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28494#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:50,040 INFO L273 TraceCheckUtils]: 56: Hoare triple {28494#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28494#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:50,041 INFO L273 TraceCheckUtils]: 57: Hoare triple {28494#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {28495#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:50,041 INFO L273 TraceCheckUtils]: 58: Hoare triple {28495#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28495#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:50,042 INFO L273 TraceCheckUtils]: 59: Hoare triple {28495#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28495#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:50,043 INFO L273 TraceCheckUtils]: 60: Hoare triple {28495#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {28496#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:50,043 INFO L273 TraceCheckUtils]: 61: Hoare triple {28496#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28496#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:50,044 INFO L273 TraceCheckUtils]: 62: Hoare triple {28496#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28496#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:50,044 INFO L273 TraceCheckUtils]: 63: Hoare triple {28496#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {28497#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:50,045 INFO L273 TraceCheckUtils]: 64: Hoare triple {28497#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28497#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:50,045 INFO L273 TraceCheckUtils]: 65: Hoare triple {28497#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28497#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:50,046 INFO L273 TraceCheckUtils]: 66: Hoare triple {28497#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {28498#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:50,047 INFO L273 TraceCheckUtils]: 67: Hoare triple {28498#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28498#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:50,047 INFO L273 TraceCheckUtils]: 68: Hoare triple {28498#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28498#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:50,048 INFO L273 TraceCheckUtils]: 69: Hoare triple {28498#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {28499#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:50,048 INFO L273 TraceCheckUtils]: 70: Hoare triple {28499#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28499#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:50,049 INFO L273 TraceCheckUtils]: 71: Hoare triple {28499#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28499#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:50,050 INFO L273 TraceCheckUtils]: 72: Hoare triple {28499#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {28500#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:50,050 INFO L273 TraceCheckUtils]: 73: Hoare triple {28500#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28500#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:50,051 INFO L273 TraceCheckUtils]: 74: Hoare triple {28500#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28500#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:50,051 INFO L273 TraceCheckUtils]: 75: Hoare triple {28500#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {28501#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:50,052 INFO L273 TraceCheckUtils]: 76: Hoare triple {28501#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28501#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:50,052 INFO L273 TraceCheckUtils]: 77: Hoare triple {28501#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28501#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:50,053 INFO L273 TraceCheckUtils]: 78: Hoare triple {28501#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {28502#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:50,054 INFO L273 TraceCheckUtils]: 79: Hoare triple {28502#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28502#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:50,054 INFO L273 TraceCheckUtils]: 80: Hoare triple {28502#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28502#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:50,055 INFO L273 TraceCheckUtils]: 81: Hoare triple {28502#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {28503#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:50,055 INFO L273 TraceCheckUtils]: 82: Hoare triple {28503#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28503#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:50,056 INFO L273 TraceCheckUtils]: 83: Hoare triple {28503#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28503#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:50,057 INFO L273 TraceCheckUtils]: 84: Hoare triple {28503#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {28504#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:50,057 INFO L273 TraceCheckUtils]: 85: Hoare triple {28504#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28504#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:50,058 INFO L273 TraceCheckUtils]: 86: Hoare triple {28504#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28504#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:50,058 INFO L273 TraceCheckUtils]: 87: Hoare triple {28504#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {28505#(<= main_~i~0 28)} is VALID [2018-11-23 11:52:50,059 INFO L273 TraceCheckUtils]: 88: Hoare triple {28505#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28505#(<= main_~i~0 28)} is VALID [2018-11-23 11:52:50,059 INFO L273 TraceCheckUtils]: 89: Hoare triple {28505#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28505#(<= main_~i~0 28)} is VALID [2018-11-23 11:52:50,060 INFO L273 TraceCheckUtils]: 90: Hoare triple {28505#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {28506#(<= main_~i~0 29)} is VALID [2018-11-23 11:52:50,061 INFO L273 TraceCheckUtils]: 91: Hoare triple {28506#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28506#(<= main_~i~0 29)} is VALID [2018-11-23 11:52:50,061 INFO L273 TraceCheckUtils]: 92: Hoare triple {28506#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28506#(<= main_~i~0 29)} is VALID [2018-11-23 11:52:50,062 INFO L273 TraceCheckUtils]: 93: Hoare triple {28506#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {28507#(<= main_~i~0 30)} is VALID [2018-11-23 11:52:50,062 INFO L273 TraceCheckUtils]: 94: Hoare triple {28507#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28507#(<= main_~i~0 30)} is VALID [2018-11-23 11:52:50,084 INFO L273 TraceCheckUtils]: 95: Hoare triple {28507#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28507#(<= main_~i~0 30)} is VALID [2018-11-23 11:52:50,098 INFO L273 TraceCheckUtils]: 96: Hoare triple {28507#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {28508#(<= main_~i~0 31)} is VALID [2018-11-23 11:52:50,107 INFO L273 TraceCheckUtils]: 97: Hoare triple {28508#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28508#(<= main_~i~0 31)} is VALID [2018-11-23 11:52:50,109 INFO L273 TraceCheckUtils]: 98: Hoare triple {28508#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28508#(<= main_~i~0 31)} is VALID [2018-11-23 11:52:50,110 INFO L273 TraceCheckUtils]: 99: Hoare triple {28508#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {28509#(<= main_~i~0 32)} is VALID [2018-11-23 11:52:50,110 INFO L273 TraceCheckUtils]: 100: Hoare triple {28509#(<= main_~i~0 32)} assume !(~i~0 < 100000); {28477#false} is VALID [2018-11-23 11:52:50,110 INFO L273 TraceCheckUtils]: 101: Hoare triple {28477#false} assume !(0 != ~swapped~0); {28477#false} is VALID [2018-11-23 11:52:50,110 INFO L273 TraceCheckUtils]: 102: Hoare triple {28477#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {28477#false} is VALID [2018-11-23 11:52:50,111 INFO L273 TraceCheckUtils]: 103: Hoare triple {28477#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {28477#false} is VALID [2018-11-23 11:52:50,111 INFO L273 TraceCheckUtils]: 104: Hoare triple {28477#false} assume !!(~y~0 < 100000);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); {28477#false} is VALID [2018-11-23 11:52:50,111 INFO L256 TraceCheckUtils]: 105: Hoare triple {28477#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {28477#false} is VALID [2018-11-23 11:52:50,111 INFO L273 TraceCheckUtils]: 106: Hoare triple {28477#false} ~cond := #in~cond; {28477#false} is VALID [2018-11-23 11:52:50,111 INFO L273 TraceCheckUtils]: 107: Hoare triple {28477#false} assume 0 == ~cond; {28477#false} is VALID [2018-11-23 11:52:50,111 INFO L273 TraceCheckUtils]: 108: Hoare triple {28477#false} assume !false; {28477#false} is VALID [2018-11-23 11:52:50,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1427 backedges. 1 proven. 1426 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:50,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:50,119 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:52:50,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:52:50,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:50,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:50,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:50,480 INFO L256 TraceCheckUtils]: 0: Hoare triple {28476#true} call ULTIMATE.init(); {28476#true} is VALID [2018-11-23 11:52:50,480 INFO L273 TraceCheckUtils]: 1: Hoare triple {28476#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28476#true} is VALID [2018-11-23 11:52:50,481 INFO L273 TraceCheckUtils]: 2: Hoare triple {28476#true} assume true; {28476#true} is VALID [2018-11-23 11:52:50,481 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28476#true} {28476#true} #79#return; {28476#true} is VALID [2018-11-23 11:52:50,481 INFO L256 TraceCheckUtils]: 4: Hoare triple {28476#true} call #t~ret8 := main(); {28476#true} is VALID [2018-11-23 11:52:50,481 INFO L273 TraceCheckUtils]: 5: Hoare triple {28476#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {28476#true} is VALID [2018-11-23 11:52:50,482 INFO L273 TraceCheckUtils]: 6: Hoare triple {28476#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {28531#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:50,482 INFO L273 TraceCheckUtils]: 7: Hoare triple {28531#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28531#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:50,483 INFO L273 TraceCheckUtils]: 8: Hoare triple {28531#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28531#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:50,483 INFO L273 TraceCheckUtils]: 9: Hoare triple {28531#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {28479#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:50,484 INFO L273 TraceCheckUtils]: 10: Hoare triple {28479#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28479#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:50,484 INFO L273 TraceCheckUtils]: 11: Hoare triple {28479#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28479#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:50,485 INFO L273 TraceCheckUtils]: 12: Hoare triple {28479#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {28480#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:50,486 INFO L273 TraceCheckUtils]: 13: Hoare triple {28480#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28480#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:50,486 INFO L273 TraceCheckUtils]: 14: Hoare triple {28480#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28480#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:50,487 INFO L273 TraceCheckUtils]: 15: Hoare triple {28480#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {28481#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:50,487 INFO L273 TraceCheckUtils]: 16: Hoare triple {28481#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28481#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:50,488 INFO L273 TraceCheckUtils]: 17: Hoare triple {28481#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28481#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:50,488 INFO L273 TraceCheckUtils]: 18: Hoare triple {28481#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {28482#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:50,489 INFO L273 TraceCheckUtils]: 19: Hoare triple {28482#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28482#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:50,489 INFO L273 TraceCheckUtils]: 20: Hoare triple {28482#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28482#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:50,490 INFO L273 TraceCheckUtils]: 21: Hoare triple {28482#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {28483#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:50,491 INFO L273 TraceCheckUtils]: 22: Hoare triple {28483#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28483#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:50,491 INFO L273 TraceCheckUtils]: 23: Hoare triple {28483#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28483#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:50,492 INFO L273 TraceCheckUtils]: 24: Hoare triple {28483#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {28484#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:50,492 INFO L273 TraceCheckUtils]: 25: Hoare triple {28484#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28484#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:50,493 INFO L273 TraceCheckUtils]: 26: Hoare triple {28484#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28484#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:50,493 INFO L273 TraceCheckUtils]: 27: Hoare triple {28484#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {28485#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:50,494 INFO L273 TraceCheckUtils]: 28: Hoare triple {28485#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28485#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:50,494 INFO L273 TraceCheckUtils]: 29: Hoare triple {28485#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28485#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:50,495 INFO L273 TraceCheckUtils]: 30: Hoare triple {28485#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {28486#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:50,495 INFO L273 TraceCheckUtils]: 31: Hoare triple {28486#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28486#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:50,496 INFO L273 TraceCheckUtils]: 32: Hoare triple {28486#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28486#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:50,497 INFO L273 TraceCheckUtils]: 33: Hoare triple {28486#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {28487#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:50,497 INFO L273 TraceCheckUtils]: 34: Hoare triple {28487#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28487#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:50,498 INFO L273 TraceCheckUtils]: 35: Hoare triple {28487#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28487#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:50,498 INFO L273 TraceCheckUtils]: 36: Hoare triple {28487#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {28488#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:50,499 INFO L273 TraceCheckUtils]: 37: Hoare triple {28488#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28488#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:50,499 INFO L273 TraceCheckUtils]: 38: Hoare triple {28488#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28488#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:50,505 INFO L273 TraceCheckUtils]: 39: Hoare triple {28488#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {28489#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:50,505 INFO L273 TraceCheckUtils]: 40: Hoare triple {28489#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28489#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:50,506 INFO L273 TraceCheckUtils]: 41: Hoare triple {28489#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28489#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:50,506 INFO L273 TraceCheckUtils]: 42: Hoare triple {28489#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {28490#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:50,507 INFO L273 TraceCheckUtils]: 43: Hoare triple {28490#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28490#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:50,507 INFO L273 TraceCheckUtils]: 44: Hoare triple {28490#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28490#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:50,507 INFO L273 TraceCheckUtils]: 45: Hoare triple {28490#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {28491#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:50,508 INFO L273 TraceCheckUtils]: 46: Hoare triple {28491#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28491#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:50,508 INFO L273 TraceCheckUtils]: 47: Hoare triple {28491#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28491#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:50,508 INFO L273 TraceCheckUtils]: 48: Hoare triple {28491#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {28492#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:50,509 INFO L273 TraceCheckUtils]: 49: Hoare triple {28492#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28492#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:50,509 INFO L273 TraceCheckUtils]: 50: Hoare triple {28492#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28492#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:50,509 INFO L273 TraceCheckUtils]: 51: Hoare triple {28492#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {28493#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:50,510 INFO L273 TraceCheckUtils]: 52: Hoare triple {28493#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28493#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:50,510 INFO L273 TraceCheckUtils]: 53: Hoare triple {28493#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28493#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:50,511 INFO L273 TraceCheckUtils]: 54: Hoare triple {28493#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {28494#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:50,512 INFO L273 TraceCheckUtils]: 55: Hoare triple {28494#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28494#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:50,512 INFO L273 TraceCheckUtils]: 56: Hoare triple {28494#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28494#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:50,513 INFO L273 TraceCheckUtils]: 57: Hoare triple {28494#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {28495#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:50,513 INFO L273 TraceCheckUtils]: 58: Hoare triple {28495#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28495#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:50,514 INFO L273 TraceCheckUtils]: 59: Hoare triple {28495#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28495#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:50,514 INFO L273 TraceCheckUtils]: 60: Hoare triple {28495#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {28496#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:50,515 INFO L273 TraceCheckUtils]: 61: Hoare triple {28496#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28496#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:50,515 INFO L273 TraceCheckUtils]: 62: Hoare triple {28496#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28496#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:50,516 INFO L273 TraceCheckUtils]: 63: Hoare triple {28496#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {28497#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:50,517 INFO L273 TraceCheckUtils]: 64: Hoare triple {28497#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28497#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:50,517 INFO L273 TraceCheckUtils]: 65: Hoare triple {28497#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28497#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:50,518 INFO L273 TraceCheckUtils]: 66: Hoare triple {28497#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {28498#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:50,518 INFO L273 TraceCheckUtils]: 67: Hoare triple {28498#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28498#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:50,519 INFO L273 TraceCheckUtils]: 68: Hoare triple {28498#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28498#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:50,519 INFO L273 TraceCheckUtils]: 69: Hoare triple {28498#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {28499#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:50,520 INFO L273 TraceCheckUtils]: 70: Hoare triple {28499#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28499#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:50,520 INFO L273 TraceCheckUtils]: 71: Hoare triple {28499#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28499#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:50,521 INFO L273 TraceCheckUtils]: 72: Hoare triple {28499#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {28500#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:50,521 INFO L273 TraceCheckUtils]: 73: Hoare triple {28500#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28500#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:50,522 INFO L273 TraceCheckUtils]: 74: Hoare triple {28500#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28500#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:50,523 INFO L273 TraceCheckUtils]: 75: Hoare triple {28500#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {28501#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:50,523 INFO L273 TraceCheckUtils]: 76: Hoare triple {28501#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28501#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:50,524 INFO L273 TraceCheckUtils]: 77: Hoare triple {28501#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28501#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:50,524 INFO L273 TraceCheckUtils]: 78: Hoare triple {28501#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {28502#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:50,525 INFO L273 TraceCheckUtils]: 79: Hoare triple {28502#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28502#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:50,525 INFO L273 TraceCheckUtils]: 80: Hoare triple {28502#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28502#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:50,526 INFO L273 TraceCheckUtils]: 81: Hoare triple {28502#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {28503#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:50,526 INFO L273 TraceCheckUtils]: 82: Hoare triple {28503#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28503#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:50,527 INFO L273 TraceCheckUtils]: 83: Hoare triple {28503#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28503#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:50,528 INFO L273 TraceCheckUtils]: 84: Hoare triple {28503#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {28504#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:50,528 INFO L273 TraceCheckUtils]: 85: Hoare triple {28504#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28504#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:50,528 INFO L273 TraceCheckUtils]: 86: Hoare triple {28504#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28504#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:50,529 INFO L273 TraceCheckUtils]: 87: Hoare triple {28504#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {28505#(<= main_~i~0 28)} is VALID [2018-11-23 11:52:50,530 INFO L273 TraceCheckUtils]: 88: Hoare triple {28505#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28505#(<= main_~i~0 28)} is VALID [2018-11-23 11:52:50,530 INFO L273 TraceCheckUtils]: 89: Hoare triple {28505#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28505#(<= main_~i~0 28)} is VALID [2018-11-23 11:52:50,531 INFO L273 TraceCheckUtils]: 90: Hoare triple {28505#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {28506#(<= main_~i~0 29)} is VALID [2018-11-23 11:52:50,531 INFO L273 TraceCheckUtils]: 91: Hoare triple {28506#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28506#(<= main_~i~0 29)} is VALID [2018-11-23 11:52:50,532 INFO L273 TraceCheckUtils]: 92: Hoare triple {28506#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28506#(<= main_~i~0 29)} is VALID [2018-11-23 11:52:50,532 INFO L273 TraceCheckUtils]: 93: Hoare triple {28506#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {28507#(<= main_~i~0 30)} is VALID [2018-11-23 11:52:50,533 INFO L273 TraceCheckUtils]: 94: Hoare triple {28507#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28507#(<= main_~i~0 30)} is VALID [2018-11-23 11:52:50,533 INFO L273 TraceCheckUtils]: 95: Hoare triple {28507#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28507#(<= main_~i~0 30)} is VALID [2018-11-23 11:52:50,534 INFO L273 TraceCheckUtils]: 96: Hoare triple {28507#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {28508#(<= main_~i~0 31)} is VALID [2018-11-23 11:52:50,539 INFO L273 TraceCheckUtils]: 97: Hoare triple {28508#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {28508#(<= main_~i~0 31)} is VALID [2018-11-23 11:52:50,539 INFO L273 TraceCheckUtils]: 98: Hoare triple {28508#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28508#(<= main_~i~0 31)} is VALID [2018-11-23 11:52:50,540 INFO L273 TraceCheckUtils]: 99: Hoare triple {28508#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {28509#(<= main_~i~0 32)} is VALID [2018-11-23 11:52:50,540 INFO L273 TraceCheckUtils]: 100: Hoare triple {28509#(<= main_~i~0 32)} assume !(~i~0 < 100000); {28477#false} is VALID [2018-11-23 11:52:50,540 INFO L273 TraceCheckUtils]: 101: Hoare triple {28477#false} assume !(0 != ~swapped~0); {28477#false} is VALID [2018-11-23 11:52:50,541 INFO L273 TraceCheckUtils]: 102: Hoare triple {28477#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {28477#false} is VALID [2018-11-23 11:52:50,541 INFO L273 TraceCheckUtils]: 103: Hoare triple {28477#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {28477#false} is VALID [2018-11-23 11:52:50,541 INFO L273 TraceCheckUtils]: 104: Hoare triple {28477#false} assume !!(~y~0 < 100000);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); {28477#false} is VALID [2018-11-23 11:52:50,541 INFO L256 TraceCheckUtils]: 105: Hoare triple {28477#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {28477#false} is VALID [2018-11-23 11:52:50,541 INFO L273 TraceCheckUtils]: 106: Hoare triple {28477#false} ~cond := #in~cond; {28477#false} is VALID [2018-11-23 11:52:50,541 INFO L273 TraceCheckUtils]: 107: Hoare triple {28477#false} assume 0 == ~cond; {28477#false} is VALID [2018-11-23 11:52:50,541 INFO L273 TraceCheckUtils]: 108: Hoare triple {28477#false} assume !false; {28477#false} is VALID [2018-11-23 11:52:50,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1427 backedges. 1 proven. 1426 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:50,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:50,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2018-11-23 11:52:50,568 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 109 [2018-11-23 11:52:50,569 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:50,569 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-23 11:52:50,673 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:52:50,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-23 11:52:50,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-23 11:52:50,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 11:52:50,675 INFO L87 Difference]: Start difference. First operand 207 states and 272 transitions. Second operand 35 states. [2018-11-23 11:52:51,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:51,555 INFO L93 Difference]: Finished difference Result 418 states and 554 transitions. [2018-11-23 11:52:51,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 11:52:51,556 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 109 [2018-11-23 11:52:51,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:51,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 11:52:51,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 177 transitions. [2018-11-23 11:52:51,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 11:52:51,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 177 transitions. [2018-11-23 11:52:51,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 177 transitions. [2018-11-23 11:52:51,739 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:51,743 INFO L225 Difference]: With dead ends: 418 [2018-11-23 11:52:51,744 INFO L226 Difference]: Without dead ends: 217 [2018-11-23 11:52:51,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 11:52:51,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-11-23 11:52:51,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 213. [2018-11-23 11:52:51,820 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:51,820 INFO L82 GeneralOperation]: Start isEquivalent. First operand 217 states. Second operand 213 states. [2018-11-23 11:52:51,821 INFO L74 IsIncluded]: Start isIncluded. First operand 217 states. Second operand 213 states. [2018-11-23 11:52:51,821 INFO L87 Difference]: Start difference. First operand 217 states. Second operand 213 states. [2018-11-23 11:52:51,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:51,826 INFO L93 Difference]: Finished difference Result 217 states and 286 transitions. [2018-11-23 11:52:51,826 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 286 transitions. [2018-11-23 11:52:51,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:51,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:51,826 INFO L74 IsIncluded]: Start isIncluded. First operand 213 states. Second operand 217 states. [2018-11-23 11:52:51,826 INFO L87 Difference]: Start difference. First operand 213 states. Second operand 217 states. [2018-11-23 11:52:51,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:51,829 INFO L93 Difference]: Finished difference Result 217 states and 286 transitions. [2018-11-23 11:52:51,830 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 286 transitions. [2018-11-23 11:52:51,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:51,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:51,830 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:51,830 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:51,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-11-23 11:52:51,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 280 transitions. [2018-11-23 11:52:51,833 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 280 transitions. Word has length 109 [2018-11-23 11:52:51,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:51,833 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 280 transitions. [2018-11-23 11:52:51,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-23 11:52:51,834 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 280 transitions. [2018-11-23 11:52:51,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-23 11:52:51,834 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:51,835 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:51,835 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:51,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:51,835 INFO L82 PathProgramCache]: Analyzing trace with hash 427846353, now seen corresponding path program 32 times [2018-11-23 11:52:51,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:51,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:51,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:51,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:52:51,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:51,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:52,560 INFO L256 TraceCheckUtils]: 0: Hoare triple {30121#true} call ULTIMATE.init(); {30121#true} is VALID [2018-11-23 11:52:52,560 INFO L273 TraceCheckUtils]: 1: Hoare triple {30121#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {30121#true} is VALID [2018-11-23 11:52:52,560 INFO L273 TraceCheckUtils]: 2: Hoare triple {30121#true} assume true; {30121#true} is VALID [2018-11-23 11:52:52,560 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30121#true} {30121#true} #79#return; {30121#true} is VALID [2018-11-23 11:52:52,560 INFO L256 TraceCheckUtils]: 4: Hoare triple {30121#true} call #t~ret8 := main(); {30121#true} is VALID [2018-11-23 11:52:52,560 INFO L273 TraceCheckUtils]: 5: Hoare triple {30121#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {30121#true} is VALID [2018-11-23 11:52:52,561 INFO L273 TraceCheckUtils]: 6: Hoare triple {30121#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {30123#(= main_~i~0 1)} is VALID [2018-11-23 11:52:52,561 INFO L273 TraceCheckUtils]: 7: Hoare triple {30123#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30123#(= main_~i~0 1)} is VALID [2018-11-23 11:52:52,561 INFO L273 TraceCheckUtils]: 8: Hoare triple {30123#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30123#(= main_~i~0 1)} is VALID [2018-11-23 11:52:52,562 INFO L273 TraceCheckUtils]: 9: Hoare triple {30123#(= main_~i~0 1)} ~i~0 := 1 + ~i~0; {30124#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:52,562 INFO L273 TraceCheckUtils]: 10: Hoare triple {30124#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30124#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:52,563 INFO L273 TraceCheckUtils]: 11: Hoare triple {30124#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30124#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:52,563 INFO L273 TraceCheckUtils]: 12: Hoare triple {30124#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {30125#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:52,564 INFO L273 TraceCheckUtils]: 13: Hoare triple {30125#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30125#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:52,564 INFO L273 TraceCheckUtils]: 14: Hoare triple {30125#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30125#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:52,564 INFO L273 TraceCheckUtils]: 15: Hoare triple {30125#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {30126#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:52,565 INFO L273 TraceCheckUtils]: 16: Hoare triple {30126#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30126#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:52,565 INFO L273 TraceCheckUtils]: 17: Hoare triple {30126#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30126#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:52,566 INFO L273 TraceCheckUtils]: 18: Hoare triple {30126#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {30127#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:52,566 INFO L273 TraceCheckUtils]: 19: Hoare triple {30127#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30127#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:52,567 INFO L273 TraceCheckUtils]: 20: Hoare triple {30127#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30127#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:52,567 INFO L273 TraceCheckUtils]: 21: Hoare triple {30127#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {30128#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:52,568 INFO L273 TraceCheckUtils]: 22: Hoare triple {30128#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30128#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:52,569 INFO L273 TraceCheckUtils]: 23: Hoare triple {30128#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30128#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:52,569 INFO L273 TraceCheckUtils]: 24: Hoare triple {30128#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {30129#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:52,570 INFO L273 TraceCheckUtils]: 25: Hoare triple {30129#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30129#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:52,570 INFO L273 TraceCheckUtils]: 26: Hoare triple {30129#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30129#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:52,571 INFO L273 TraceCheckUtils]: 27: Hoare triple {30129#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {30130#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:52,571 INFO L273 TraceCheckUtils]: 28: Hoare triple {30130#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30130#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:52,572 INFO L273 TraceCheckUtils]: 29: Hoare triple {30130#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30130#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:52,573 INFO L273 TraceCheckUtils]: 30: Hoare triple {30130#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {30131#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:52,573 INFO L273 TraceCheckUtils]: 31: Hoare triple {30131#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30131#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:52,574 INFO L273 TraceCheckUtils]: 32: Hoare triple {30131#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30131#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:52,574 INFO L273 TraceCheckUtils]: 33: Hoare triple {30131#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {30132#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:52,575 INFO L273 TraceCheckUtils]: 34: Hoare triple {30132#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30132#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:52,575 INFO L273 TraceCheckUtils]: 35: Hoare triple {30132#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30132#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:52,576 INFO L273 TraceCheckUtils]: 36: Hoare triple {30132#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {30133#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:52,577 INFO L273 TraceCheckUtils]: 37: Hoare triple {30133#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30133#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:52,577 INFO L273 TraceCheckUtils]: 38: Hoare triple {30133#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30133#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:52,578 INFO L273 TraceCheckUtils]: 39: Hoare triple {30133#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {30134#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:52,578 INFO L273 TraceCheckUtils]: 40: Hoare triple {30134#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30134#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:52,579 INFO L273 TraceCheckUtils]: 41: Hoare triple {30134#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30134#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:52,580 INFO L273 TraceCheckUtils]: 42: Hoare triple {30134#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {30135#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:52,580 INFO L273 TraceCheckUtils]: 43: Hoare triple {30135#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30135#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:52,581 INFO L273 TraceCheckUtils]: 44: Hoare triple {30135#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30135#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:52,581 INFO L273 TraceCheckUtils]: 45: Hoare triple {30135#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {30136#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:52,582 INFO L273 TraceCheckUtils]: 46: Hoare triple {30136#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30136#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:52,582 INFO L273 TraceCheckUtils]: 47: Hoare triple {30136#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30136#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:52,583 INFO L273 TraceCheckUtils]: 48: Hoare triple {30136#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {30137#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:52,584 INFO L273 TraceCheckUtils]: 49: Hoare triple {30137#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30137#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:52,584 INFO L273 TraceCheckUtils]: 50: Hoare triple {30137#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30137#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:52,585 INFO L273 TraceCheckUtils]: 51: Hoare triple {30137#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {30138#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:52,585 INFO L273 TraceCheckUtils]: 52: Hoare triple {30138#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30138#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:52,586 INFO L273 TraceCheckUtils]: 53: Hoare triple {30138#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30138#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:52,587 INFO L273 TraceCheckUtils]: 54: Hoare triple {30138#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {30139#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:52,587 INFO L273 TraceCheckUtils]: 55: Hoare triple {30139#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30139#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:52,588 INFO L273 TraceCheckUtils]: 56: Hoare triple {30139#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30139#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:52,588 INFO L273 TraceCheckUtils]: 57: Hoare triple {30139#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {30140#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:52,589 INFO L273 TraceCheckUtils]: 58: Hoare triple {30140#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30140#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:52,589 INFO L273 TraceCheckUtils]: 59: Hoare triple {30140#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30140#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:52,590 INFO L273 TraceCheckUtils]: 60: Hoare triple {30140#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {30141#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:52,609 INFO L273 TraceCheckUtils]: 61: Hoare triple {30141#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30141#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:52,623 INFO L273 TraceCheckUtils]: 62: Hoare triple {30141#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30141#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:52,632 INFO L273 TraceCheckUtils]: 63: Hoare triple {30141#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {30142#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:52,633 INFO L273 TraceCheckUtils]: 64: Hoare triple {30142#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30142#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:52,633 INFO L273 TraceCheckUtils]: 65: Hoare triple {30142#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30142#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:52,634 INFO L273 TraceCheckUtils]: 66: Hoare triple {30142#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {30143#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:52,634 INFO L273 TraceCheckUtils]: 67: Hoare triple {30143#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30143#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:52,634 INFO L273 TraceCheckUtils]: 68: Hoare triple {30143#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30143#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:52,635 INFO L273 TraceCheckUtils]: 69: Hoare triple {30143#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {30144#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:52,635 INFO L273 TraceCheckUtils]: 70: Hoare triple {30144#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30144#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:52,635 INFO L273 TraceCheckUtils]: 71: Hoare triple {30144#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30144#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:52,636 INFO L273 TraceCheckUtils]: 72: Hoare triple {30144#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {30145#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:52,636 INFO L273 TraceCheckUtils]: 73: Hoare triple {30145#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30145#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:52,637 INFO L273 TraceCheckUtils]: 74: Hoare triple {30145#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30145#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:52,637 INFO L273 TraceCheckUtils]: 75: Hoare triple {30145#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {30146#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:52,638 INFO L273 TraceCheckUtils]: 76: Hoare triple {30146#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30146#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:52,638 INFO L273 TraceCheckUtils]: 77: Hoare triple {30146#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30146#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:52,639 INFO L273 TraceCheckUtils]: 78: Hoare triple {30146#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {30147#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:52,640 INFO L273 TraceCheckUtils]: 79: Hoare triple {30147#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30147#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:52,640 INFO L273 TraceCheckUtils]: 80: Hoare triple {30147#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30147#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:52,641 INFO L273 TraceCheckUtils]: 81: Hoare triple {30147#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {30148#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:52,641 INFO L273 TraceCheckUtils]: 82: Hoare triple {30148#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30148#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:52,642 INFO L273 TraceCheckUtils]: 83: Hoare triple {30148#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30148#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:52,643 INFO L273 TraceCheckUtils]: 84: Hoare triple {30148#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {30149#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:52,643 INFO L273 TraceCheckUtils]: 85: Hoare triple {30149#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30149#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:52,644 INFO L273 TraceCheckUtils]: 86: Hoare triple {30149#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30149#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:52,644 INFO L273 TraceCheckUtils]: 87: Hoare triple {30149#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {30150#(<= main_~i~0 28)} is VALID [2018-11-23 11:52:52,645 INFO L273 TraceCheckUtils]: 88: Hoare triple {30150#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30150#(<= main_~i~0 28)} is VALID [2018-11-23 11:52:52,645 INFO L273 TraceCheckUtils]: 89: Hoare triple {30150#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30150#(<= main_~i~0 28)} is VALID [2018-11-23 11:52:52,646 INFO L273 TraceCheckUtils]: 90: Hoare triple {30150#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {30151#(<= main_~i~0 29)} is VALID [2018-11-23 11:52:52,647 INFO L273 TraceCheckUtils]: 91: Hoare triple {30151#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30151#(<= main_~i~0 29)} is VALID [2018-11-23 11:52:52,647 INFO L273 TraceCheckUtils]: 92: Hoare triple {30151#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30151#(<= main_~i~0 29)} is VALID [2018-11-23 11:52:52,648 INFO L273 TraceCheckUtils]: 93: Hoare triple {30151#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {30152#(<= main_~i~0 30)} is VALID [2018-11-23 11:52:52,648 INFO L273 TraceCheckUtils]: 94: Hoare triple {30152#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30152#(<= main_~i~0 30)} is VALID [2018-11-23 11:52:52,649 INFO L273 TraceCheckUtils]: 95: Hoare triple {30152#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30152#(<= main_~i~0 30)} is VALID [2018-11-23 11:52:52,650 INFO L273 TraceCheckUtils]: 96: Hoare triple {30152#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {30153#(<= main_~i~0 31)} is VALID [2018-11-23 11:52:52,650 INFO L273 TraceCheckUtils]: 97: Hoare triple {30153#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30153#(<= main_~i~0 31)} is VALID [2018-11-23 11:52:52,651 INFO L273 TraceCheckUtils]: 98: Hoare triple {30153#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30153#(<= main_~i~0 31)} is VALID [2018-11-23 11:52:52,651 INFO L273 TraceCheckUtils]: 99: Hoare triple {30153#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {30154#(<= main_~i~0 32)} is VALID [2018-11-23 11:52:52,652 INFO L273 TraceCheckUtils]: 100: Hoare triple {30154#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30154#(<= main_~i~0 32)} is VALID [2018-11-23 11:52:52,652 INFO L273 TraceCheckUtils]: 101: Hoare triple {30154#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30154#(<= main_~i~0 32)} is VALID [2018-11-23 11:52:52,653 INFO L273 TraceCheckUtils]: 102: Hoare triple {30154#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {30155#(<= main_~i~0 33)} is VALID [2018-11-23 11:52:52,654 INFO L273 TraceCheckUtils]: 103: Hoare triple {30155#(<= main_~i~0 33)} assume !(~i~0 < 100000); {30122#false} is VALID [2018-11-23 11:52:52,654 INFO L273 TraceCheckUtils]: 104: Hoare triple {30122#false} assume !(0 != ~swapped~0); {30122#false} is VALID [2018-11-23 11:52:52,654 INFO L273 TraceCheckUtils]: 105: Hoare triple {30122#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {30122#false} is VALID [2018-11-23 11:52:52,654 INFO L273 TraceCheckUtils]: 106: Hoare triple {30122#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {30122#false} is VALID [2018-11-23 11:52:52,654 INFO L273 TraceCheckUtils]: 107: Hoare triple {30122#false} assume !!(~y~0 < 100000);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); {30122#false} is VALID [2018-11-23 11:52:52,655 INFO L256 TraceCheckUtils]: 108: Hoare triple {30122#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {30122#false} is VALID [2018-11-23 11:52:52,655 INFO L273 TraceCheckUtils]: 109: Hoare triple {30122#false} ~cond := #in~cond; {30122#false} is VALID [2018-11-23 11:52:52,655 INFO L273 TraceCheckUtils]: 110: Hoare triple {30122#false} assume 0 == ~cond; {30122#false} is VALID [2018-11-23 11:52:52,655 INFO L273 TraceCheckUtils]: 111: Hoare triple {30122#false} assume !false; {30122#false} is VALID [2018-11-23 11:52:52,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 1 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:52,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:52,665 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:52:52,675 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:52:52,723 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:52:52,723 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:52,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:52,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:52,992 INFO L256 TraceCheckUtils]: 0: Hoare triple {30121#true} call ULTIMATE.init(); {30121#true} is VALID [2018-11-23 11:52:52,993 INFO L273 TraceCheckUtils]: 1: Hoare triple {30121#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {30121#true} is VALID [2018-11-23 11:52:52,993 INFO L273 TraceCheckUtils]: 2: Hoare triple {30121#true} assume true; {30121#true} is VALID [2018-11-23 11:52:52,993 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30121#true} {30121#true} #79#return; {30121#true} is VALID [2018-11-23 11:52:52,993 INFO L256 TraceCheckUtils]: 4: Hoare triple {30121#true} call #t~ret8 := main(); {30121#true} is VALID [2018-11-23 11:52:52,993 INFO L273 TraceCheckUtils]: 5: Hoare triple {30121#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {30121#true} is VALID [2018-11-23 11:52:52,994 INFO L273 TraceCheckUtils]: 6: Hoare triple {30121#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {30177#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:52,995 INFO L273 TraceCheckUtils]: 7: Hoare triple {30177#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30177#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:52,995 INFO L273 TraceCheckUtils]: 8: Hoare triple {30177#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30177#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:52,995 INFO L273 TraceCheckUtils]: 9: Hoare triple {30177#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {30124#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:52,996 INFO L273 TraceCheckUtils]: 10: Hoare triple {30124#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30124#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:52,996 INFO L273 TraceCheckUtils]: 11: Hoare triple {30124#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30124#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:52,996 INFO L273 TraceCheckUtils]: 12: Hoare triple {30124#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {30125#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:52,997 INFO L273 TraceCheckUtils]: 13: Hoare triple {30125#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30125#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:52,997 INFO L273 TraceCheckUtils]: 14: Hoare triple {30125#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30125#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:52,998 INFO L273 TraceCheckUtils]: 15: Hoare triple {30125#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {30126#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:52,999 INFO L273 TraceCheckUtils]: 16: Hoare triple {30126#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30126#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:52,999 INFO L273 TraceCheckUtils]: 17: Hoare triple {30126#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30126#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:53,000 INFO L273 TraceCheckUtils]: 18: Hoare triple {30126#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {30127#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:53,000 INFO L273 TraceCheckUtils]: 19: Hoare triple {30127#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30127#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:53,001 INFO L273 TraceCheckUtils]: 20: Hoare triple {30127#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30127#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:53,002 INFO L273 TraceCheckUtils]: 21: Hoare triple {30127#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {30128#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:53,002 INFO L273 TraceCheckUtils]: 22: Hoare triple {30128#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30128#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:53,003 INFO L273 TraceCheckUtils]: 23: Hoare triple {30128#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30128#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:53,003 INFO L273 TraceCheckUtils]: 24: Hoare triple {30128#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {30129#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:53,004 INFO L273 TraceCheckUtils]: 25: Hoare triple {30129#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30129#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:53,004 INFO L273 TraceCheckUtils]: 26: Hoare triple {30129#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30129#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:53,005 INFO L273 TraceCheckUtils]: 27: Hoare triple {30129#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {30130#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:53,006 INFO L273 TraceCheckUtils]: 28: Hoare triple {30130#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30130#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:53,006 INFO L273 TraceCheckUtils]: 29: Hoare triple {30130#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30130#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:53,007 INFO L273 TraceCheckUtils]: 30: Hoare triple {30130#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {30131#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:53,007 INFO L273 TraceCheckUtils]: 31: Hoare triple {30131#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30131#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:53,008 INFO L273 TraceCheckUtils]: 32: Hoare triple {30131#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30131#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:53,009 INFO L273 TraceCheckUtils]: 33: Hoare triple {30131#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {30132#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:53,009 INFO L273 TraceCheckUtils]: 34: Hoare triple {30132#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30132#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:53,010 INFO L273 TraceCheckUtils]: 35: Hoare triple {30132#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30132#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:53,010 INFO L273 TraceCheckUtils]: 36: Hoare triple {30132#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {30133#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:53,011 INFO L273 TraceCheckUtils]: 37: Hoare triple {30133#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30133#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:53,011 INFO L273 TraceCheckUtils]: 38: Hoare triple {30133#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30133#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:53,012 INFO L273 TraceCheckUtils]: 39: Hoare triple {30133#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {30134#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:53,013 INFO L273 TraceCheckUtils]: 40: Hoare triple {30134#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30134#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:53,013 INFO L273 TraceCheckUtils]: 41: Hoare triple {30134#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30134#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:53,014 INFO L273 TraceCheckUtils]: 42: Hoare triple {30134#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {30135#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:53,014 INFO L273 TraceCheckUtils]: 43: Hoare triple {30135#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30135#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:53,015 INFO L273 TraceCheckUtils]: 44: Hoare triple {30135#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30135#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:53,015 INFO L273 TraceCheckUtils]: 45: Hoare triple {30135#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {30136#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:53,016 INFO L273 TraceCheckUtils]: 46: Hoare triple {30136#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30136#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:53,016 INFO L273 TraceCheckUtils]: 47: Hoare triple {30136#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30136#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:53,017 INFO L273 TraceCheckUtils]: 48: Hoare triple {30136#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {30137#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:53,018 INFO L273 TraceCheckUtils]: 49: Hoare triple {30137#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30137#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:53,018 INFO L273 TraceCheckUtils]: 50: Hoare triple {30137#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30137#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:53,019 INFO L273 TraceCheckUtils]: 51: Hoare triple {30137#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {30138#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:53,019 INFO L273 TraceCheckUtils]: 52: Hoare triple {30138#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30138#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:53,020 INFO L273 TraceCheckUtils]: 53: Hoare triple {30138#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30138#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:53,021 INFO L273 TraceCheckUtils]: 54: Hoare triple {30138#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {30139#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:53,021 INFO L273 TraceCheckUtils]: 55: Hoare triple {30139#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30139#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:53,022 INFO L273 TraceCheckUtils]: 56: Hoare triple {30139#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30139#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:53,022 INFO L273 TraceCheckUtils]: 57: Hoare triple {30139#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {30140#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:53,023 INFO L273 TraceCheckUtils]: 58: Hoare triple {30140#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30140#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:53,023 INFO L273 TraceCheckUtils]: 59: Hoare triple {30140#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30140#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:53,024 INFO L273 TraceCheckUtils]: 60: Hoare triple {30140#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {30141#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:53,025 INFO L273 TraceCheckUtils]: 61: Hoare triple {30141#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30141#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:53,025 INFO L273 TraceCheckUtils]: 62: Hoare triple {30141#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30141#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:53,026 INFO L273 TraceCheckUtils]: 63: Hoare triple {30141#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {30142#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:53,026 INFO L273 TraceCheckUtils]: 64: Hoare triple {30142#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30142#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:53,027 INFO L273 TraceCheckUtils]: 65: Hoare triple {30142#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30142#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:53,028 INFO L273 TraceCheckUtils]: 66: Hoare triple {30142#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {30143#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:53,028 INFO L273 TraceCheckUtils]: 67: Hoare triple {30143#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30143#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:53,029 INFO L273 TraceCheckUtils]: 68: Hoare triple {30143#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30143#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:53,029 INFO L273 TraceCheckUtils]: 69: Hoare triple {30143#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {30144#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:53,030 INFO L273 TraceCheckUtils]: 70: Hoare triple {30144#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30144#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:53,030 INFO L273 TraceCheckUtils]: 71: Hoare triple {30144#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30144#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:53,031 INFO L273 TraceCheckUtils]: 72: Hoare triple {30144#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {30145#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:53,032 INFO L273 TraceCheckUtils]: 73: Hoare triple {30145#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30145#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:53,032 INFO L273 TraceCheckUtils]: 74: Hoare triple {30145#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30145#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:53,033 INFO L273 TraceCheckUtils]: 75: Hoare triple {30145#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {30146#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:53,033 INFO L273 TraceCheckUtils]: 76: Hoare triple {30146#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30146#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:53,034 INFO L273 TraceCheckUtils]: 77: Hoare triple {30146#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30146#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:53,034 INFO L273 TraceCheckUtils]: 78: Hoare triple {30146#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {30147#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:53,035 INFO L273 TraceCheckUtils]: 79: Hoare triple {30147#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30147#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:53,036 INFO L273 TraceCheckUtils]: 80: Hoare triple {30147#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30147#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:53,036 INFO L273 TraceCheckUtils]: 81: Hoare triple {30147#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {30148#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:53,037 INFO L273 TraceCheckUtils]: 82: Hoare triple {30148#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30148#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:53,037 INFO L273 TraceCheckUtils]: 83: Hoare triple {30148#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30148#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:53,038 INFO L273 TraceCheckUtils]: 84: Hoare triple {30148#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {30149#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:53,038 INFO L273 TraceCheckUtils]: 85: Hoare triple {30149#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30149#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:53,039 INFO L273 TraceCheckUtils]: 86: Hoare triple {30149#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30149#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:53,040 INFO L273 TraceCheckUtils]: 87: Hoare triple {30149#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {30150#(<= main_~i~0 28)} is VALID [2018-11-23 11:52:53,040 INFO L273 TraceCheckUtils]: 88: Hoare triple {30150#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30150#(<= main_~i~0 28)} is VALID [2018-11-23 11:52:53,041 INFO L273 TraceCheckUtils]: 89: Hoare triple {30150#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30150#(<= main_~i~0 28)} is VALID [2018-11-23 11:52:53,041 INFO L273 TraceCheckUtils]: 90: Hoare triple {30150#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {30151#(<= main_~i~0 29)} is VALID [2018-11-23 11:52:53,042 INFO L273 TraceCheckUtils]: 91: Hoare triple {30151#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30151#(<= main_~i~0 29)} is VALID [2018-11-23 11:52:53,042 INFO L273 TraceCheckUtils]: 92: Hoare triple {30151#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30151#(<= main_~i~0 29)} is VALID [2018-11-23 11:52:53,043 INFO L273 TraceCheckUtils]: 93: Hoare triple {30151#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {30152#(<= main_~i~0 30)} is VALID [2018-11-23 11:52:53,044 INFO L273 TraceCheckUtils]: 94: Hoare triple {30152#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30152#(<= main_~i~0 30)} is VALID [2018-11-23 11:52:53,044 INFO L273 TraceCheckUtils]: 95: Hoare triple {30152#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30152#(<= main_~i~0 30)} is VALID [2018-11-23 11:52:53,045 INFO L273 TraceCheckUtils]: 96: Hoare triple {30152#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {30153#(<= main_~i~0 31)} is VALID [2018-11-23 11:52:53,045 INFO L273 TraceCheckUtils]: 97: Hoare triple {30153#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30153#(<= main_~i~0 31)} is VALID [2018-11-23 11:52:53,046 INFO L273 TraceCheckUtils]: 98: Hoare triple {30153#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30153#(<= main_~i~0 31)} is VALID [2018-11-23 11:52:53,047 INFO L273 TraceCheckUtils]: 99: Hoare triple {30153#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {30154#(<= main_~i~0 32)} is VALID [2018-11-23 11:52:53,047 INFO L273 TraceCheckUtils]: 100: Hoare triple {30154#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {30154#(<= main_~i~0 32)} is VALID [2018-11-23 11:52:53,048 INFO L273 TraceCheckUtils]: 101: Hoare triple {30154#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30154#(<= main_~i~0 32)} is VALID [2018-11-23 11:52:53,048 INFO L273 TraceCheckUtils]: 102: Hoare triple {30154#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {30155#(<= main_~i~0 33)} is VALID [2018-11-23 11:52:53,049 INFO L273 TraceCheckUtils]: 103: Hoare triple {30155#(<= main_~i~0 33)} assume !(~i~0 < 100000); {30122#false} is VALID [2018-11-23 11:52:53,049 INFO L273 TraceCheckUtils]: 104: Hoare triple {30122#false} assume !(0 != ~swapped~0); {30122#false} is VALID [2018-11-23 11:52:53,049 INFO L273 TraceCheckUtils]: 105: Hoare triple {30122#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {30122#false} is VALID [2018-11-23 11:52:53,050 INFO L273 TraceCheckUtils]: 106: Hoare triple {30122#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {30122#false} is VALID [2018-11-23 11:52:53,050 INFO L273 TraceCheckUtils]: 107: Hoare triple {30122#false} assume !!(~y~0 < 100000);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); {30122#false} is VALID [2018-11-23 11:52:53,050 INFO L256 TraceCheckUtils]: 108: Hoare triple {30122#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {30122#false} is VALID [2018-11-23 11:52:53,050 INFO L273 TraceCheckUtils]: 109: Hoare triple {30122#false} ~cond := #in~cond; {30122#false} is VALID [2018-11-23 11:52:53,050 INFO L273 TraceCheckUtils]: 110: Hoare triple {30122#false} assume 0 == ~cond; {30122#false} is VALID [2018-11-23 11:52:53,051 INFO L273 TraceCheckUtils]: 111: Hoare triple {30122#false} assume !false; {30122#false} is VALID [2018-11-23 11:52:53,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 1 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:53,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:53,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2018-11-23 11:52:53,078 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 112 [2018-11-23 11:52:53,079 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:53,079 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-23 11:52:53,188 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:53,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-23 11:52:53,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-23 11:52:53,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 11:52:53,190 INFO L87 Difference]: Start difference. First operand 213 states and 280 transitions. Second operand 36 states. [2018-11-23 11:52:53,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:53,831 INFO L93 Difference]: Finished difference Result 430 states and 570 transitions. [2018-11-23 11:52:53,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-23 11:52:53,832 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 112 [2018-11-23 11:52:53,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:53,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 11:52:53,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 181 transitions. [2018-11-23 11:52:53,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 11:52:53,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 181 transitions. [2018-11-23 11:52:53,835 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 181 transitions. [2018-11-23 11:52:54,012 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:54,017 INFO L225 Difference]: With dead ends: 430 [2018-11-23 11:52:54,017 INFO L226 Difference]: Without dead ends: 223 [2018-11-23 11:52:54,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 11:52:54,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-11-23 11:52:54,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 219. [2018-11-23 11:52:54,207 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:54,207 INFO L82 GeneralOperation]: Start isEquivalent. First operand 223 states. Second operand 219 states. [2018-11-23 11:52:54,207 INFO L74 IsIncluded]: Start isIncluded. First operand 223 states. Second operand 219 states. [2018-11-23 11:52:54,207 INFO L87 Difference]: Start difference. First operand 223 states. Second operand 219 states. [2018-11-23 11:52:54,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:54,212 INFO L93 Difference]: Finished difference Result 223 states and 294 transitions. [2018-11-23 11:52:54,212 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 294 transitions. [2018-11-23 11:52:54,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:54,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:54,213 INFO L74 IsIncluded]: Start isIncluded. First operand 219 states. Second operand 223 states. [2018-11-23 11:52:54,213 INFO L87 Difference]: Start difference. First operand 219 states. Second operand 223 states. [2018-11-23 11:52:54,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:54,217 INFO L93 Difference]: Finished difference Result 223 states and 294 transitions. [2018-11-23 11:52:54,217 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 294 transitions. [2018-11-23 11:52:54,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:54,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:54,218 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:54,218 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:54,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-11-23 11:52:54,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 288 transitions. [2018-11-23 11:52:54,223 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 288 transitions. Word has length 112 [2018-11-23 11:52:54,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:54,223 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 288 transitions. [2018-11-23 11:52:54,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-23 11:52:54,223 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 288 transitions. [2018-11-23 11:52:54,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-23 11:52:54,224 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:54,224 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:54,225 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:54,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:54,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1515394824, now seen corresponding path program 33 times [2018-11-23 11:52:54,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:54,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:54,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:54,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:54,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:54,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:56,340 INFO L256 TraceCheckUtils]: 0: Hoare triple {31812#true} call ULTIMATE.init(); {31812#true} is VALID [2018-11-23 11:52:56,341 INFO L273 TraceCheckUtils]: 1: Hoare triple {31812#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {31812#true} is VALID [2018-11-23 11:52:56,341 INFO L273 TraceCheckUtils]: 2: Hoare triple {31812#true} assume true; {31812#true} is VALID [2018-11-23 11:52:56,341 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31812#true} {31812#true} #79#return; {31812#true} is VALID [2018-11-23 11:52:56,341 INFO L256 TraceCheckUtils]: 4: Hoare triple {31812#true} call #t~ret8 := main(); {31812#true} is VALID [2018-11-23 11:52:56,341 INFO L273 TraceCheckUtils]: 5: Hoare triple {31812#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {31812#true} is VALID [2018-11-23 11:52:56,342 INFO L273 TraceCheckUtils]: 6: Hoare triple {31812#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {31814#(= main_~i~0 1)} is VALID [2018-11-23 11:52:56,342 INFO L273 TraceCheckUtils]: 7: Hoare triple {31814#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31814#(= main_~i~0 1)} is VALID [2018-11-23 11:52:56,343 INFO L273 TraceCheckUtils]: 8: Hoare triple {31814#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31814#(= main_~i~0 1)} is VALID [2018-11-23 11:52:56,343 INFO L273 TraceCheckUtils]: 9: Hoare triple {31814#(= main_~i~0 1)} ~i~0 := 1 + ~i~0; {31815#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:56,344 INFO L273 TraceCheckUtils]: 10: Hoare triple {31815#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31815#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:56,344 INFO L273 TraceCheckUtils]: 11: Hoare triple {31815#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31815#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:56,344 INFO L273 TraceCheckUtils]: 12: Hoare triple {31815#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {31816#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:56,345 INFO L273 TraceCheckUtils]: 13: Hoare triple {31816#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31816#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:56,345 INFO L273 TraceCheckUtils]: 14: Hoare triple {31816#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31816#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:56,345 INFO L273 TraceCheckUtils]: 15: Hoare triple {31816#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {31817#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:56,346 INFO L273 TraceCheckUtils]: 16: Hoare triple {31817#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31817#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:56,346 INFO L273 TraceCheckUtils]: 17: Hoare triple {31817#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31817#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:56,347 INFO L273 TraceCheckUtils]: 18: Hoare triple {31817#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {31818#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:56,348 INFO L273 TraceCheckUtils]: 19: Hoare triple {31818#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31818#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:56,348 INFO L273 TraceCheckUtils]: 20: Hoare triple {31818#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31818#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:56,349 INFO L273 TraceCheckUtils]: 21: Hoare triple {31818#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {31819#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:56,349 INFO L273 TraceCheckUtils]: 22: Hoare triple {31819#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31819#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:56,350 INFO L273 TraceCheckUtils]: 23: Hoare triple {31819#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31819#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:56,350 INFO L273 TraceCheckUtils]: 24: Hoare triple {31819#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {31820#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:56,351 INFO L273 TraceCheckUtils]: 25: Hoare triple {31820#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31820#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:56,351 INFO L273 TraceCheckUtils]: 26: Hoare triple {31820#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31820#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:56,352 INFO L273 TraceCheckUtils]: 27: Hoare triple {31820#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {31821#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:56,352 INFO L273 TraceCheckUtils]: 28: Hoare triple {31821#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31821#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:56,353 INFO L273 TraceCheckUtils]: 29: Hoare triple {31821#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31821#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:56,354 INFO L273 TraceCheckUtils]: 30: Hoare triple {31821#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {31822#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:56,354 INFO L273 TraceCheckUtils]: 31: Hoare triple {31822#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31822#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:56,354 INFO L273 TraceCheckUtils]: 32: Hoare triple {31822#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31822#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:56,355 INFO L273 TraceCheckUtils]: 33: Hoare triple {31822#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {31823#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:56,356 INFO L273 TraceCheckUtils]: 34: Hoare triple {31823#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31823#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:56,356 INFO L273 TraceCheckUtils]: 35: Hoare triple {31823#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31823#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:56,357 INFO L273 TraceCheckUtils]: 36: Hoare triple {31823#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {31824#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:56,357 INFO L273 TraceCheckUtils]: 37: Hoare triple {31824#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31824#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:56,358 INFO L273 TraceCheckUtils]: 38: Hoare triple {31824#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31824#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:56,358 INFO L273 TraceCheckUtils]: 39: Hoare triple {31824#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {31825#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:56,359 INFO L273 TraceCheckUtils]: 40: Hoare triple {31825#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31825#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:56,359 INFO L273 TraceCheckUtils]: 41: Hoare triple {31825#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31825#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:56,360 INFO L273 TraceCheckUtils]: 42: Hoare triple {31825#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {31826#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:56,361 INFO L273 TraceCheckUtils]: 43: Hoare triple {31826#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31826#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:56,361 INFO L273 TraceCheckUtils]: 44: Hoare triple {31826#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31826#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:56,362 INFO L273 TraceCheckUtils]: 45: Hoare triple {31826#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {31827#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:56,362 INFO L273 TraceCheckUtils]: 46: Hoare triple {31827#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31827#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:56,363 INFO L273 TraceCheckUtils]: 47: Hoare triple {31827#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31827#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:56,363 INFO L273 TraceCheckUtils]: 48: Hoare triple {31827#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {31828#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:56,364 INFO L273 TraceCheckUtils]: 49: Hoare triple {31828#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31828#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:56,364 INFO L273 TraceCheckUtils]: 50: Hoare triple {31828#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31828#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:56,365 INFO L273 TraceCheckUtils]: 51: Hoare triple {31828#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {31829#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:56,365 INFO L273 TraceCheckUtils]: 52: Hoare triple {31829#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31829#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:56,366 INFO L273 TraceCheckUtils]: 53: Hoare triple {31829#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31829#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:56,367 INFO L273 TraceCheckUtils]: 54: Hoare triple {31829#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {31830#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:56,367 INFO L273 TraceCheckUtils]: 55: Hoare triple {31830#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31830#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:56,367 INFO L273 TraceCheckUtils]: 56: Hoare triple {31830#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31830#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:56,368 INFO L273 TraceCheckUtils]: 57: Hoare triple {31830#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {31831#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:56,369 INFO L273 TraceCheckUtils]: 58: Hoare triple {31831#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31831#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:56,369 INFO L273 TraceCheckUtils]: 59: Hoare triple {31831#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31831#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:56,370 INFO L273 TraceCheckUtils]: 60: Hoare triple {31831#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {31832#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:56,370 INFO L273 TraceCheckUtils]: 61: Hoare triple {31832#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31832#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:56,371 INFO L273 TraceCheckUtils]: 62: Hoare triple {31832#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31832#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:56,371 INFO L273 TraceCheckUtils]: 63: Hoare triple {31832#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {31833#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:56,372 INFO L273 TraceCheckUtils]: 64: Hoare triple {31833#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31833#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:56,372 INFO L273 TraceCheckUtils]: 65: Hoare triple {31833#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31833#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:56,373 INFO L273 TraceCheckUtils]: 66: Hoare triple {31833#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {31834#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:56,374 INFO L273 TraceCheckUtils]: 67: Hoare triple {31834#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31834#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:56,374 INFO L273 TraceCheckUtils]: 68: Hoare triple {31834#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31834#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:56,375 INFO L273 TraceCheckUtils]: 69: Hoare triple {31834#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {31835#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:56,375 INFO L273 TraceCheckUtils]: 70: Hoare triple {31835#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31835#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:56,376 INFO L273 TraceCheckUtils]: 71: Hoare triple {31835#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31835#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:56,376 INFO L273 TraceCheckUtils]: 72: Hoare triple {31835#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {31836#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:56,377 INFO L273 TraceCheckUtils]: 73: Hoare triple {31836#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31836#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:56,377 INFO L273 TraceCheckUtils]: 74: Hoare triple {31836#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31836#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:56,378 INFO L273 TraceCheckUtils]: 75: Hoare triple {31836#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {31837#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:56,378 INFO L273 TraceCheckUtils]: 76: Hoare triple {31837#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31837#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:56,379 INFO L273 TraceCheckUtils]: 77: Hoare triple {31837#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31837#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:56,380 INFO L273 TraceCheckUtils]: 78: Hoare triple {31837#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {31838#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:56,380 INFO L273 TraceCheckUtils]: 79: Hoare triple {31838#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31838#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:56,380 INFO L273 TraceCheckUtils]: 80: Hoare triple {31838#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31838#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:56,381 INFO L273 TraceCheckUtils]: 81: Hoare triple {31838#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {31839#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:56,382 INFO L273 TraceCheckUtils]: 82: Hoare triple {31839#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31839#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:56,382 INFO L273 TraceCheckUtils]: 83: Hoare triple {31839#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31839#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:56,383 INFO L273 TraceCheckUtils]: 84: Hoare triple {31839#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {31840#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:56,383 INFO L273 TraceCheckUtils]: 85: Hoare triple {31840#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31840#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:56,384 INFO L273 TraceCheckUtils]: 86: Hoare triple {31840#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31840#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:56,384 INFO L273 TraceCheckUtils]: 87: Hoare triple {31840#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {31841#(<= main_~i~0 28)} is VALID [2018-11-23 11:52:56,385 INFO L273 TraceCheckUtils]: 88: Hoare triple {31841#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31841#(<= main_~i~0 28)} is VALID [2018-11-23 11:52:56,385 INFO L273 TraceCheckUtils]: 89: Hoare triple {31841#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31841#(<= main_~i~0 28)} is VALID [2018-11-23 11:52:56,386 INFO L273 TraceCheckUtils]: 90: Hoare triple {31841#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {31842#(<= main_~i~0 29)} is VALID [2018-11-23 11:52:56,386 INFO L273 TraceCheckUtils]: 91: Hoare triple {31842#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31842#(<= main_~i~0 29)} is VALID [2018-11-23 11:52:56,387 INFO L273 TraceCheckUtils]: 92: Hoare triple {31842#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31842#(<= main_~i~0 29)} is VALID [2018-11-23 11:52:56,388 INFO L273 TraceCheckUtils]: 93: Hoare triple {31842#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {31843#(<= main_~i~0 30)} is VALID [2018-11-23 11:52:56,388 INFO L273 TraceCheckUtils]: 94: Hoare triple {31843#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31843#(<= main_~i~0 30)} is VALID [2018-11-23 11:52:56,389 INFO L273 TraceCheckUtils]: 95: Hoare triple {31843#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31843#(<= main_~i~0 30)} is VALID [2018-11-23 11:52:56,389 INFO L273 TraceCheckUtils]: 96: Hoare triple {31843#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {31844#(<= main_~i~0 31)} is VALID [2018-11-23 11:52:56,390 INFO L273 TraceCheckUtils]: 97: Hoare triple {31844#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31844#(<= main_~i~0 31)} is VALID [2018-11-23 11:52:56,390 INFO L273 TraceCheckUtils]: 98: Hoare triple {31844#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31844#(<= main_~i~0 31)} is VALID [2018-11-23 11:52:56,391 INFO L273 TraceCheckUtils]: 99: Hoare triple {31844#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {31845#(<= main_~i~0 32)} is VALID [2018-11-23 11:52:56,391 INFO L273 TraceCheckUtils]: 100: Hoare triple {31845#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31845#(<= main_~i~0 32)} is VALID [2018-11-23 11:52:56,392 INFO L273 TraceCheckUtils]: 101: Hoare triple {31845#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31845#(<= main_~i~0 32)} is VALID [2018-11-23 11:52:56,393 INFO L273 TraceCheckUtils]: 102: Hoare triple {31845#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {31846#(<= main_~i~0 33)} is VALID [2018-11-23 11:52:56,393 INFO L273 TraceCheckUtils]: 103: Hoare triple {31846#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31846#(<= main_~i~0 33)} is VALID [2018-11-23 11:52:56,393 INFO L273 TraceCheckUtils]: 104: Hoare triple {31846#(<= main_~i~0 33)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31846#(<= main_~i~0 33)} is VALID [2018-11-23 11:52:56,394 INFO L273 TraceCheckUtils]: 105: Hoare triple {31846#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {31847#(<= main_~i~0 34)} is VALID [2018-11-23 11:52:56,395 INFO L273 TraceCheckUtils]: 106: Hoare triple {31847#(<= main_~i~0 34)} assume !(~i~0 < 100000); {31813#false} is VALID [2018-11-23 11:52:56,395 INFO L273 TraceCheckUtils]: 107: Hoare triple {31813#false} assume !(0 != ~swapped~0); {31813#false} is VALID [2018-11-23 11:52:56,395 INFO L273 TraceCheckUtils]: 108: Hoare triple {31813#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {31813#false} is VALID [2018-11-23 11:52:56,395 INFO L273 TraceCheckUtils]: 109: Hoare triple {31813#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {31813#false} is VALID [2018-11-23 11:52:56,396 INFO L273 TraceCheckUtils]: 110: Hoare triple {31813#false} assume !!(~y~0 < 100000);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); {31813#false} is VALID [2018-11-23 11:52:56,396 INFO L256 TraceCheckUtils]: 111: Hoare triple {31813#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {31813#false} is VALID [2018-11-23 11:52:56,396 INFO L273 TraceCheckUtils]: 112: Hoare triple {31813#false} ~cond := #in~cond; {31813#false} is VALID [2018-11-23 11:52:56,396 INFO L273 TraceCheckUtils]: 113: Hoare triple {31813#false} assume 0 == ~cond; {31813#false} is VALID [2018-11-23 11:52:56,396 INFO L273 TraceCheckUtils]: 114: Hoare triple {31813#false} assume !false; {31813#false} is VALID [2018-11-23 11:52:56,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 1 proven. 1617 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:56,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:56,406 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:52:56,414 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:52:56,522 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-11-23 11:52:56,523 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:56,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:57,788 INFO L256 TraceCheckUtils]: 0: Hoare triple {31812#true} call ULTIMATE.init(); {31812#true} is VALID [2018-11-23 11:52:57,788 INFO L273 TraceCheckUtils]: 1: Hoare triple {31812#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {31812#true} is VALID [2018-11-23 11:52:57,788 INFO L273 TraceCheckUtils]: 2: Hoare triple {31812#true} assume true; {31812#true} is VALID [2018-11-23 11:52:57,788 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31812#true} {31812#true} #79#return; {31812#true} is VALID [2018-11-23 11:52:57,789 INFO L256 TraceCheckUtils]: 4: Hoare triple {31812#true} call #t~ret8 := main(); {31812#true} is VALID [2018-11-23 11:52:57,789 INFO L273 TraceCheckUtils]: 5: Hoare triple {31812#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {31812#true} is VALID [2018-11-23 11:52:57,789 INFO L273 TraceCheckUtils]: 6: Hoare triple {31812#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {31869#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:57,790 INFO L273 TraceCheckUtils]: 7: Hoare triple {31869#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31869#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:57,790 INFO L273 TraceCheckUtils]: 8: Hoare triple {31869#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31869#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:57,791 INFO L273 TraceCheckUtils]: 9: Hoare triple {31869#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {31815#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:57,791 INFO L273 TraceCheckUtils]: 10: Hoare triple {31815#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31815#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:57,791 INFO L273 TraceCheckUtils]: 11: Hoare triple {31815#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31815#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:57,792 INFO L273 TraceCheckUtils]: 12: Hoare triple {31815#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {31816#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:57,792 INFO L273 TraceCheckUtils]: 13: Hoare triple {31816#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31816#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:57,792 INFO L273 TraceCheckUtils]: 14: Hoare triple {31816#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31816#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:57,793 INFO L273 TraceCheckUtils]: 15: Hoare triple {31816#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {31817#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:57,794 INFO L273 TraceCheckUtils]: 16: Hoare triple {31817#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31817#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:57,794 INFO L273 TraceCheckUtils]: 17: Hoare triple {31817#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31817#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:57,795 INFO L273 TraceCheckUtils]: 18: Hoare triple {31817#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {31818#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:57,795 INFO L273 TraceCheckUtils]: 19: Hoare triple {31818#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31818#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:57,796 INFO L273 TraceCheckUtils]: 20: Hoare triple {31818#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31818#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:57,796 INFO L273 TraceCheckUtils]: 21: Hoare triple {31818#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {31819#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:57,797 INFO L273 TraceCheckUtils]: 22: Hoare triple {31819#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31819#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:57,797 INFO L273 TraceCheckUtils]: 23: Hoare triple {31819#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31819#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:57,798 INFO L273 TraceCheckUtils]: 24: Hoare triple {31819#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {31820#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:57,799 INFO L273 TraceCheckUtils]: 25: Hoare triple {31820#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31820#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:57,799 INFO L273 TraceCheckUtils]: 26: Hoare triple {31820#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31820#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:57,800 INFO L273 TraceCheckUtils]: 27: Hoare triple {31820#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {31821#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:57,800 INFO L273 TraceCheckUtils]: 28: Hoare triple {31821#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31821#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:57,801 INFO L273 TraceCheckUtils]: 29: Hoare triple {31821#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31821#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:57,801 INFO L273 TraceCheckUtils]: 30: Hoare triple {31821#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {31822#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:57,802 INFO L273 TraceCheckUtils]: 31: Hoare triple {31822#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31822#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:57,802 INFO L273 TraceCheckUtils]: 32: Hoare triple {31822#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31822#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:57,803 INFO L273 TraceCheckUtils]: 33: Hoare triple {31822#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {31823#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:57,803 INFO L273 TraceCheckUtils]: 34: Hoare triple {31823#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31823#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:57,804 INFO L273 TraceCheckUtils]: 35: Hoare triple {31823#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31823#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:57,805 INFO L273 TraceCheckUtils]: 36: Hoare triple {31823#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {31824#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:57,805 INFO L273 TraceCheckUtils]: 37: Hoare triple {31824#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31824#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:57,806 INFO L273 TraceCheckUtils]: 38: Hoare triple {31824#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31824#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:57,806 INFO L273 TraceCheckUtils]: 39: Hoare triple {31824#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {31825#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:57,807 INFO L273 TraceCheckUtils]: 40: Hoare triple {31825#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31825#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:57,807 INFO L273 TraceCheckUtils]: 41: Hoare triple {31825#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31825#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:57,808 INFO L273 TraceCheckUtils]: 42: Hoare triple {31825#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {31826#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:57,808 INFO L273 TraceCheckUtils]: 43: Hoare triple {31826#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31826#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:57,809 INFO L273 TraceCheckUtils]: 44: Hoare triple {31826#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31826#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:57,810 INFO L273 TraceCheckUtils]: 45: Hoare triple {31826#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {31827#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:57,810 INFO L273 TraceCheckUtils]: 46: Hoare triple {31827#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31827#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:57,810 INFO L273 TraceCheckUtils]: 47: Hoare triple {31827#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31827#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:57,811 INFO L273 TraceCheckUtils]: 48: Hoare triple {31827#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {31828#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:57,812 INFO L273 TraceCheckUtils]: 49: Hoare triple {31828#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31828#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:57,812 INFO L273 TraceCheckUtils]: 50: Hoare triple {31828#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31828#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:57,813 INFO L273 TraceCheckUtils]: 51: Hoare triple {31828#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {31829#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:57,813 INFO L273 TraceCheckUtils]: 52: Hoare triple {31829#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31829#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:57,814 INFO L273 TraceCheckUtils]: 53: Hoare triple {31829#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31829#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:57,814 INFO L273 TraceCheckUtils]: 54: Hoare triple {31829#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {31830#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:57,815 INFO L273 TraceCheckUtils]: 55: Hoare triple {31830#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31830#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:57,815 INFO L273 TraceCheckUtils]: 56: Hoare triple {31830#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31830#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:57,816 INFO L273 TraceCheckUtils]: 57: Hoare triple {31830#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {31831#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:57,817 INFO L273 TraceCheckUtils]: 58: Hoare triple {31831#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31831#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:57,817 INFO L273 TraceCheckUtils]: 59: Hoare triple {31831#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31831#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:57,818 INFO L273 TraceCheckUtils]: 60: Hoare triple {31831#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {31832#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:57,818 INFO L273 TraceCheckUtils]: 61: Hoare triple {31832#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31832#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:57,819 INFO L273 TraceCheckUtils]: 62: Hoare triple {31832#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31832#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:57,819 INFO L273 TraceCheckUtils]: 63: Hoare triple {31832#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {31833#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:57,820 INFO L273 TraceCheckUtils]: 64: Hoare triple {31833#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31833#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:57,820 INFO L273 TraceCheckUtils]: 65: Hoare triple {31833#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31833#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:57,821 INFO L273 TraceCheckUtils]: 66: Hoare triple {31833#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {31834#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:57,821 INFO L273 TraceCheckUtils]: 67: Hoare triple {31834#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31834#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:57,822 INFO L273 TraceCheckUtils]: 68: Hoare triple {31834#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31834#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:57,823 INFO L273 TraceCheckUtils]: 69: Hoare triple {31834#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {31835#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:57,823 INFO L273 TraceCheckUtils]: 70: Hoare triple {31835#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31835#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:57,824 INFO L273 TraceCheckUtils]: 71: Hoare triple {31835#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31835#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:57,824 INFO L273 TraceCheckUtils]: 72: Hoare triple {31835#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {31836#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:57,825 INFO L273 TraceCheckUtils]: 73: Hoare triple {31836#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31836#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:57,825 INFO L273 TraceCheckUtils]: 74: Hoare triple {31836#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31836#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:57,826 INFO L273 TraceCheckUtils]: 75: Hoare triple {31836#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {31837#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:57,826 INFO L273 TraceCheckUtils]: 76: Hoare triple {31837#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31837#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:57,827 INFO L273 TraceCheckUtils]: 77: Hoare triple {31837#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31837#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:57,828 INFO L273 TraceCheckUtils]: 78: Hoare triple {31837#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {31838#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:57,828 INFO L273 TraceCheckUtils]: 79: Hoare triple {31838#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31838#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:57,829 INFO L273 TraceCheckUtils]: 80: Hoare triple {31838#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31838#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:57,829 INFO L273 TraceCheckUtils]: 81: Hoare triple {31838#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {31839#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:57,830 INFO L273 TraceCheckUtils]: 82: Hoare triple {31839#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31839#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:57,830 INFO L273 TraceCheckUtils]: 83: Hoare triple {31839#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31839#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:57,831 INFO L273 TraceCheckUtils]: 84: Hoare triple {31839#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {31840#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:57,832 INFO L273 TraceCheckUtils]: 85: Hoare triple {31840#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31840#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:57,832 INFO L273 TraceCheckUtils]: 86: Hoare triple {31840#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31840#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:57,833 INFO L273 TraceCheckUtils]: 87: Hoare triple {31840#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {31841#(<= main_~i~0 28)} is VALID [2018-11-23 11:52:57,833 INFO L273 TraceCheckUtils]: 88: Hoare triple {31841#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31841#(<= main_~i~0 28)} is VALID [2018-11-23 11:52:57,834 INFO L273 TraceCheckUtils]: 89: Hoare triple {31841#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31841#(<= main_~i~0 28)} is VALID [2018-11-23 11:52:57,835 INFO L273 TraceCheckUtils]: 90: Hoare triple {31841#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {31842#(<= main_~i~0 29)} is VALID [2018-11-23 11:52:57,835 INFO L273 TraceCheckUtils]: 91: Hoare triple {31842#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31842#(<= main_~i~0 29)} is VALID [2018-11-23 11:52:57,835 INFO L273 TraceCheckUtils]: 92: Hoare triple {31842#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31842#(<= main_~i~0 29)} is VALID [2018-11-23 11:52:57,836 INFO L273 TraceCheckUtils]: 93: Hoare triple {31842#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {31843#(<= main_~i~0 30)} is VALID [2018-11-23 11:52:57,837 INFO L273 TraceCheckUtils]: 94: Hoare triple {31843#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31843#(<= main_~i~0 30)} is VALID [2018-11-23 11:52:57,837 INFO L273 TraceCheckUtils]: 95: Hoare triple {31843#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31843#(<= main_~i~0 30)} is VALID [2018-11-23 11:52:57,838 INFO L273 TraceCheckUtils]: 96: Hoare triple {31843#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {31844#(<= main_~i~0 31)} is VALID [2018-11-23 11:52:57,838 INFO L273 TraceCheckUtils]: 97: Hoare triple {31844#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31844#(<= main_~i~0 31)} is VALID [2018-11-23 11:52:57,839 INFO L273 TraceCheckUtils]: 98: Hoare triple {31844#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31844#(<= main_~i~0 31)} is VALID [2018-11-23 11:52:57,839 INFO L273 TraceCheckUtils]: 99: Hoare triple {31844#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {31845#(<= main_~i~0 32)} is VALID [2018-11-23 11:52:57,840 INFO L273 TraceCheckUtils]: 100: Hoare triple {31845#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31845#(<= main_~i~0 32)} is VALID [2018-11-23 11:52:57,840 INFO L273 TraceCheckUtils]: 101: Hoare triple {31845#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31845#(<= main_~i~0 32)} is VALID [2018-11-23 11:52:57,841 INFO L273 TraceCheckUtils]: 102: Hoare triple {31845#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {31846#(<= main_~i~0 33)} is VALID [2018-11-23 11:52:57,842 INFO L273 TraceCheckUtils]: 103: Hoare triple {31846#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {31846#(<= main_~i~0 33)} is VALID [2018-11-23 11:52:57,842 INFO L273 TraceCheckUtils]: 104: Hoare triple {31846#(<= main_~i~0 33)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31846#(<= main_~i~0 33)} is VALID [2018-11-23 11:52:57,843 INFO L273 TraceCheckUtils]: 105: Hoare triple {31846#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {31847#(<= main_~i~0 34)} is VALID [2018-11-23 11:52:57,843 INFO L273 TraceCheckUtils]: 106: Hoare triple {31847#(<= main_~i~0 34)} assume !(~i~0 < 100000); {31813#false} is VALID [2018-11-23 11:52:57,844 INFO L273 TraceCheckUtils]: 107: Hoare triple {31813#false} assume !(0 != ~swapped~0); {31813#false} is VALID [2018-11-23 11:52:57,844 INFO L273 TraceCheckUtils]: 108: Hoare triple {31813#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {31813#false} is VALID [2018-11-23 11:52:57,844 INFO L273 TraceCheckUtils]: 109: Hoare triple {31813#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {31813#false} is VALID [2018-11-23 11:52:57,844 INFO L273 TraceCheckUtils]: 110: Hoare triple {31813#false} assume !!(~y~0 < 100000);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); {31813#false} is VALID [2018-11-23 11:52:57,844 INFO L256 TraceCheckUtils]: 111: Hoare triple {31813#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {31813#false} is VALID [2018-11-23 11:52:57,844 INFO L273 TraceCheckUtils]: 112: Hoare triple {31813#false} ~cond := #in~cond; {31813#false} is VALID [2018-11-23 11:52:57,845 INFO L273 TraceCheckUtils]: 113: Hoare triple {31813#false} assume 0 == ~cond; {31813#false} is VALID [2018-11-23 11:52:57,845 INFO L273 TraceCheckUtils]: 114: Hoare triple {31813#false} assume !false; {31813#false} is VALID [2018-11-23 11:52:57,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 1 proven. 1617 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:57,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:57,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2018-11-23 11:52:57,874 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 115 [2018-11-23 11:52:57,874 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:57,874 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states. [2018-11-23 11:52:57,982 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:52:57,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-23 11:52:57,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-23 11:52:57,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 11:52:57,983 INFO L87 Difference]: Start difference. First operand 219 states and 288 transitions. Second operand 37 states. [2018-11-23 11:52:58,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:58,933 INFO L93 Difference]: Finished difference Result 442 states and 586 transitions. [2018-11-23 11:52:58,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-23 11:52:58,933 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 115 [2018-11-23 11:52:58,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:58,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 11:52:58,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 185 transitions. [2018-11-23 11:52:58,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 11:52:58,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 185 transitions. [2018-11-23 11:52:58,936 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 185 transitions. [2018-11-23 11:52:59,116 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 185 edges. 185 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:59,121 INFO L225 Difference]: With dead ends: 442 [2018-11-23 11:52:59,121 INFO L226 Difference]: Without dead ends: 229 [2018-11-23 11:52:59,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 11:52:59,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-11-23 11:52:59,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 225. [2018-11-23 11:52:59,202 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:59,202 INFO L82 GeneralOperation]: Start isEquivalent. First operand 229 states. Second operand 225 states. [2018-11-23 11:52:59,202 INFO L74 IsIncluded]: Start isIncluded. First operand 229 states. Second operand 225 states. [2018-11-23 11:52:59,202 INFO L87 Difference]: Start difference. First operand 229 states. Second operand 225 states. [2018-11-23 11:52:59,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:59,207 INFO L93 Difference]: Finished difference Result 229 states and 302 transitions. [2018-11-23 11:52:59,207 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 302 transitions. [2018-11-23 11:52:59,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:59,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:59,207 INFO L74 IsIncluded]: Start isIncluded. First operand 225 states. Second operand 229 states. [2018-11-23 11:52:59,207 INFO L87 Difference]: Start difference. First operand 225 states. Second operand 229 states. [2018-11-23 11:52:59,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:59,212 INFO L93 Difference]: Finished difference Result 229 states and 302 transitions. [2018-11-23 11:52:59,212 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 302 transitions. [2018-11-23 11:52:59,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:59,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:59,212 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:59,213 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:59,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-11-23 11:52:59,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 296 transitions. [2018-11-23 11:52:59,217 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 296 transitions. Word has length 115 [2018-11-23 11:52:59,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:59,218 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 296 transitions. [2018-11-23 11:52:59,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-23 11:52:59,218 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 296 transitions. [2018-11-23 11:52:59,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-23 11:52:59,218 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:59,219 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:59,219 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:59,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:59,219 INFO L82 PathProgramCache]: Analyzing trace with hash -561386639, now seen corresponding path program 34 times [2018-11-23 11:52:59,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:59,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:59,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:59,220 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:59,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:59,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:00,146 INFO L256 TraceCheckUtils]: 0: Hoare triple {33549#true} call ULTIMATE.init(); {33549#true} is VALID [2018-11-23 11:53:00,147 INFO L273 TraceCheckUtils]: 1: Hoare triple {33549#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {33549#true} is VALID [2018-11-23 11:53:00,147 INFO L273 TraceCheckUtils]: 2: Hoare triple {33549#true} assume true; {33549#true} is VALID [2018-11-23 11:53:00,147 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33549#true} {33549#true} #79#return; {33549#true} is VALID [2018-11-23 11:53:00,147 INFO L256 TraceCheckUtils]: 4: Hoare triple {33549#true} call #t~ret8 := main(); {33549#true} is VALID [2018-11-23 11:53:00,147 INFO L273 TraceCheckUtils]: 5: Hoare triple {33549#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {33549#true} is VALID [2018-11-23 11:53:00,148 INFO L273 TraceCheckUtils]: 6: Hoare triple {33549#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {33551#(= main_~i~0 1)} is VALID [2018-11-23 11:53:00,148 INFO L273 TraceCheckUtils]: 7: Hoare triple {33551#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33551#(= main_~i~0 1)} is VALID [2018-11-23 11:53:00,149 INFO L273 TraceCheckUtils]: 8: Hoare triple {33551#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33551#(= main_~i~0 1)} is VALID [2018-11-23 11:53:00,149 INFO L273 TraceCheckUtils]: 9: Hoare triple {33551#(= main_~i~0 1)} ~i~0 := 1 + ~i~0; {33552#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:00,150 INFO L273 TraceCheckUtils]: 10: Hoare triple {33552#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33552#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:00,150 INFO L273 TraceCheckUtils]: 11: Hoare triple {33552#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33552#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:00,150 INFO L273 TraceCheckUtils]: 12: Hoare triple {33552#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {33553#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:00,151 INFO L273 TraceCheckUtils]: 13: Hoare triple {33553#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33553#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:00,151 INFO L273 TraceCheckUtils]: 14: Hoare triple {33553#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33553#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:00,151 INFO L273 TraceCheckUtils]: 15: Hoare triple {33553#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {33554#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:00,152 INFO L273 TraceCheckUtils]: 16: Hoare triple {33554#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33554#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:00,152 INFO L273 TraceCheckUtils]: 17: Hoare triple {33554#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33554#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:00,153 INFO L273 TraceCheckUtils]: 18: Hoare triple {33554#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {33555#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:00,153 INFO L273 TraceCheckUtils]: 19: Hoare triple {33555#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33555#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:00,154 INFO L273 TraceCheckUtils]: 20: Hoare triple {33555#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33555#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:00,155 INFO L273 TraceCheckUtils]: 21: Hoare triple {33555#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {33556#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:00,155 INFO L273 TraceCheckUtils]: 22: Hoare triple {33556#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33556#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:00,156 INFO L273 TraceCheckUtils]: 23: Hoare triple {33556#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33556#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:00,156 INFO L273 TraceCheckUtils]: 24: Hoare triple {33556#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {33557#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:00,157 INFO L273 TraceCheckUtils]: 25: Hoare triple {33557#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33557#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:00,157 INFO L273 TraceCheckUtils]: 26: Hoare triple {33557#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33557#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:00,158 INFO L273 TraceCheckUtils]: 27: Hoare triple {33557#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {33558#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:00,159 INFO L273 TraceCheckUtils]: 28: Hoare triple {33558#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33558#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:00,159 INFO L273 TraceCheckUtils]: 29: Hoare triple {33558#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33558#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:00,160 INFO L273 TraceCheckUtils]: 30: Hoare triple {33558#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {33559#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:00,161 INFO L273 TraceCheckUtils]: 31: Hoare triple {33559#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33559#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:00,161 INFO L273 TraceCheckUtils]: 32: Hoare triple {33559#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33559#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:00,162 INFO L273 TraceCheckUtils]: 33: Hoare triple {33559#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {33560#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:00,162 INFO L273 TraceCheckUtils]: 34: Hoare triple {33560#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33560#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:00,163 INFO L273 TraceCheckUtils]: 35: Hoare triple {33560#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33560#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:00,163 INFO L273 TraceCheckUtils]: 36: Hoare triple {33560#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {33561#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:00,164 INFO L273 TraceCheckUtils]: 37: Hoare triple {33561#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33561#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:00,164 INFO L273 TraceCheckUtils]: 38: Hoare triple {33561#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33561#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:00,165 INFO L273 TraceCheckUtils]: 39: Hoare triple {33561#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {33562#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:00,166 INFO L273 TraceCheckUtils]: 40: Hoare triple {33562#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33562#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:00,166 INFO L273 TraceCheckUtils]: 41: Hoare triple {33562#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33562#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:00,167 INFO L273 TraceCheckUtils]: 42: Hoare triple {33562#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {33563#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:00,167 INFO L273 TraceCheckUtils]: 43: Hoare triple {33563#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33563#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:00,168 INFO L273 TraceCheckUtils]: 44: Hoare triple {33563#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33563#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:00,169 INFO L273 TraceCheckUtils]: 45: Hoare triple {33563#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {33564#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:00,169 INFO L273 TraceCheckUtils]: 46: Hoare triple {33564#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33564#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:00,170 INFO L273 TraceCheckUtils]: 47: Hoare triple {33564#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33564#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:00,170 INFO L273 TraceCheckUtils]: 48: Hoare triple {33564#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {33565#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:00,171 INFO L273 TraceCheckUtils]: 49: Hoare triple {33565#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33565#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:00,171 INFO L273 TraceCheckUtils]: 50: Hoare triple {33565#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33565#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:00,172 INFO L273 TraceCheckUtils]: 51: Hoare triple {33565#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {33566#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:00,173 INFO L273 TraceCheckUtils]: 52: Hoare triple {33566#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33566#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:00,173 INFO L273 TraceCheckUtils]: 53: Hoare triple {33566#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33566#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:00,174 INFO L273 TraceCheckUtils]: 54: Hoare triple {33566#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {33567#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:00,174 INFO L273 TraceCheckUtils]: 55: Hoare triple {33567#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33567#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:00,175 INFO L273 TraceCheckUtils]: 56: Hoare triple {33567#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33567#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:00,176 INFO L273 TraceCheckUtils]: 57: Hoare triple {33567#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {33568#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:00,176 INFO L273 TraceCheckUtils]: 58: Hoare triple {33568#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33568#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:00,177 INFO L273 TraceCheckUtils]: 59: Hoare triple {33568#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33568#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:00,177 INFO L273 TraceCheckUtils]: 60: Hoare triple {33568#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {33569#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:00,178 INFO L273 TraceCheckUtils]: 61: Hoare triple {33569#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33569#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:00,178 INFO L273 TraceCheckUtils]: 62: Hoare triple {33569#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33569#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:00,179 INFO L273 TraceCheckUtils]: 63: Hoare triple {33569#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {33570#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:00,179 INFO L273 TraceCheckUtils]: 64: Hoare triple {33570#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33570#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:00,180 INFO L273 TraceCheckUtils]: 65: Hoare triple {33570#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33570#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:00,181 INFO L273 TraceCheckUtils]: 66: Hoare triple {33570#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {33571#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:00,181 INFO L273 TraceCheckUtils]: 67: Hoare triple {33571#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33571#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:00,182 INFO L273 TraceCheckUtils]: 68: Hoare triple {33571#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33571#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:00,182 INFO L273 TraceCheckUtils]: 69: Hoare triple {33571#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {33572#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:00,183 INFO L273 TraceCheckUtils]: 70: Hoare triple {33572#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33572#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:00,183 INFO L273 TraceCheckUtils]: 71: Hoare triple {33572#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33572#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:00,184 INFO L273 TraceCheckUtils]: 72: Hoare triple {33572#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {33573#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:00,185 INFO L273 TraceCheckUtils]: 73: Hoare triple {33573#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33573#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:00,185 INFO L273 TraceCheckUtils]: 74: Hoare triple {33573#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33573#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:00,186 INFO L273 TraceCheckUtils]: 75: Hoare triple {33573#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {33574#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:00,186 INFO L273 TraceCheckUtils]: 76: Hoare triple {33574#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33574#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:00,187 INFO L273 TraceCheckUtils]: 77: Hoare triple {33574#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33574#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:00,188 INFO L273 TraceCheckUtils]: 78: Hoare triple {33574#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {33575#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:00,188 INFO L273 TraceCheckUtils]: 79: Hoare triple {33575#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33575#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:00,189 INFO L273 TraceCheckUtils]: 80: Hoare triple {33575#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33575#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:00,189 INFO L273 TraceCheckUtils]: 81: Hoare triple {33575#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {33576#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:00,190 INFO L273 TraceCheckUtils]: 82: Hoare triple {33576#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33576#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:00,190 INFO L273 TraceCheckUtils]: 83: Hoare triple {33576#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33576#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:00,191 INFO L273 TraceCheckUtils]: 84: Hoare triple {33576#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {33577#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:00,192 INFO L273 TraceCheckUtils]: 85: Hoare triple {33577#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33577#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:00,192 INFO L273 TraceCheckUtils]: 86: Hoare triple {33577#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33577#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:00,193 INFO L273 TraceCheckUtils]: 87: Hoare triple {33577#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {33578#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:00,193 INFO L273 TraceCheckUtils]: 88: Hoare triple {33578#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33578#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:00,194 INFO L273 TraceCheckUtils]: 89: Hoare triple {33578#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33578#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:00,194 INFO L273 TraceCheckUtils]: 90: Hoare triple {33578#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {33579#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:00,195 INFO L273 TraceCheckUtils]: 91: Hoare triple {33579#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33579#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:00,195 INFO L273 TraceCheckUtils]: 92: Hoare triple {33579#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33579#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:00,196 INFO L273 TraceCheckUtils]: 93: Hoare triple {33579#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {33580#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:00,197 INFO L273 TraceCheckUtils]: 94: Hoare triple {33580#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33580#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:00,197 INFO L273 TraceCheckUtils]: 95: Hoare triple {33580#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33580#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:00,198 INFO L273 TraceCheckUtils]: 96: Hoare triple {33580#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {33581#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:00,198 INFO L273 TraceCheckUtils]: 97: Hoare triple {33581#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33581#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:00,199 INFO L273 TraceCheckUtils]: 98: Hoare triple {33581#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33581#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:00,200 INFO L273 TraceCheckUtils]: 99: Hoare triple {33581#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {33582#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:00,200 INFO L273 TraceCheckUtils]: 100: Hoare triple {33582#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33582#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:00,201 INFO L273 TraceCheckUtils]: 101: Hoare triple {33582#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33582#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:00,201 INFO L273 TraceCheckUtils]: 102: Hoare triple {33582#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {33583#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:00,202 INFO L273 TraceCheckUtils]: 103: Hoare triple {33583#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33583#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:00,202 INFO L273 TraceCheckUtils]: 104: Hoare triple {33583#(<= main_~i~0 33)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33583#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:00,203 INFO L273 TraceCheckUtils]: 105: Hoare triple {33583#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {33584#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:00,204 INFO L273 TraceCheckUtils]: 106: Hoare triple {33584#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33584#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:00,204 INFO L273 TraceCheckUtils]: 107: Hoare triple {33584#(<= main_~i~0 34)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33584#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:00,205 INFO L273 TraceCheckUtils]: 108: Hoare triple {33584#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {33585#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:00,206 INFO L273 TraceCheckUtils]: 109: Hoare triple {33585#(<= main_~i~0 35)} assume !(~i~0 < 100000); {33550#false} is VALID [2018-11-23 11:53:00,206 INFO L273 TraceCheckUtils]: 110: Hoare triple {33550#false} assume !(0 != ~swapped~0); {33550#false} is VALID [2018-11-23 11:53:00,206 INFO L273 TraceCheckUtils]: 111: Hoare triple {33550#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {33550#false} is VALID [2018-11-23 11:53:00,206 INFO L273 TraceCheckUtils]: 112: Hoare triple {33550#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {33550#false} is VALID [2018-11-23 11:53:00,206 INFO L273 TraceCheckUtils]: 113: Hoare triple {33550#false} assume !!(~y~0 < 100000);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); {33550#false} is VALID [2018-11-23 11:53:00,206 INFO L256 TraceCheckUtils]: 114: Hoare triple {33550#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {33550#false} is VALID [2018-11-23 11:53:00,207 INFO L273 TraceCheckUtils]: 115: Hoare triple {33550#false} ~cond := #in~cond; {33550#false} is VALID [2018-11-23 11:53:00,207 INFO L273 TraceCheckUtils]: 116: Hoare triple {33550#false} assume 0 == ~cond; {33550#false} is VALID [2018-11-23 11:53:00,207 INFO L273 TraceCheckUtils]: 117: Hoare triple {33550#false} assume !false; {33550#false} is VALID [2018-11-23 11:53:00,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1718 backedges. 1 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:53:00,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:00,217 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:53:00,226 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:53:00,277 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:53:00,277 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:00,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:00,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:00,583 INFO L256 TraceCheckUtils]: 0: Hoare triple {33549#true} call ULTIMATE.init(); {33549#true} is VALID [2018-11-23 11:53:00,584 INFO L273 TraceCheckUtils]: 1: Hoare triple {33549#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {33549#true} is VALID [2018-11-23 11:53:00,584 INFO L273 TraceCheckUtils]: 2: Hoare triple {33549#true} assume true; {33549#true} is VALID [2018-11-23 11:53:00,584 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33549#true} {33549#true} #79#return; {33549#true} is VALID [2018-11-23 11:53:00,584 INFO L256 TraceCheckUtils]: 4: Hoare triple {33549#true} call #t~ret8 := main(); {33549#true} is VALID [2018-11-23 11:53:00,584 INFO L273 TraceCheckUtils]: 5: Hoare triple {33549#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {33549#true} is VALID [2018-11-23 11:53:00,585 INFO L273 TraceCheckUtils]: 6: Hoare triple {33549#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {33607#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:00,586 INFO L273 TraceCheckUtils]: 7: Hoare triple {33607#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33607#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:00,586 INFO L273 TraceCheckUtils]: 8: Hoare triple {33607#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33607#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:00,587 INFO L273 TraceCheckUtils]: 9: Hoare triple {33607#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {33552#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:00,587 INFO L273 TraceCheckUtils]: 10: Hoare triple {33552#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33552#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:00,588 INFO L273 TraceCheckUtils]: 11: Hoare triple {33552#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33552#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:00,588 INFO L273 TraceCheckUtils]: 12: Hoare triple {33552#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {33553#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:00,588 INFO L273 TraceCheckUtils]: 13: Hoare triple {33553#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33553#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:00,589 INFO L273 TraceCheckUtils]: 14: Hoare triple {33553#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33553#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:00,589 INFO L273 TraceCheckUtils]: 15: Hoare triple {33553#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {33554#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:00,589 INFO L273 TraceCheckUtils]: 16: Hoare triple {33554#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33554#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:00,590 INFO L273 TraceCheckUtils]: 17: Hoare triple {33554#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33554#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:00,590 INFO L273 TraceCheckUtils]: 18: Hoare triple {33554#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {33555#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:00,590 INFO L273 TraceCheckUtils]: 19: Hoare triple {33555#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33555#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:00,591 INFO L273 TraceCheckUtils]: 20: Hoare triple {33555#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33555#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:00,592 INFO L273 TraceCheckUtils]: 21: Hoare triple {33555#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {33556#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:00,592 INFO L273 TraceCheckUtils]: 22: Hoare triple {33556#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33556#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:00,593 INFO L273 TraceCheckUtils]: 23: Hoare triple {33556#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33556#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:00,593 INFO L273 TraceCheckUtils]: 24: Hoare triple {33556#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {33557#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:00,594 INFO L273 TraceCheckUtils]: 25: Hoare triple {33557#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33557#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:00,594 INFO L273 TraceCheckUtils]: 26: Hoare triple {33557#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33557#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:00,595 INFO L273 TraceCheckUtils]: 27: Hoare triple {33557#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {33558#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:00,596 INFO L273 TraceCheckUtils]: 28: Hoare triple {33558#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33558#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:00,596 INFO L273 TraceCheckUtils]: 29: Hoare triple {33558#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33558#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:00,597 INFO L273 TraceCheckUtils]: 30: Hoare triple {33558#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {33559#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:00,598 INFO L273 TraceCheckUtils]: 31: Hoare triple {33559#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33559#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:00,598 INFO L273 TraceCheckUtils]: 32: Hoare triple {33559#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33559#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:00,599 INFO L273 TraceCheckUtils]: 33: Hoare triple {33559#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {33560#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:00,599 INFO L273 TraceCheckUtils]: 34: Hoare triple {33560#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33560#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:00,600 INFO L273 TraceCheckUtils]: 35: Hoare triple {33560#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33560#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:00,600 INFO L273 TraceCheckUtils]: 36: Hoare triple {33560#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {33561#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:00,601 INFO L273 TraceCheckUtils]: 37: Hoare triple {33561#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33561#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:00,601 INFO L273 TraceCheckUtils]: 38: Hoare triple {33561#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33561#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:00,602 INFO L273 TraceCheckUtils]: 39: Hoare triple {33561#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {33562#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:00,603 INFO L273 TraceCheckUtils]: 40: Hoare triple {33562#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33562#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:00,603 INFO L273 TraceCheckUtils]: 41: Hoare triple {33562#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33562#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:00,604 INFO L273 TraceCheckUtils]: 42: Hoare triple {33562#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {33563#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:00,604 INFO L273 TraceCheckUtils]: 43: Hoare triple {33563#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33563#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:00,605 INFO L273 TraceCheckUtils]: 44: Hoare triple {33563#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33563#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:00,606 INFO L273 TraceCheckUtils]: 45: Hoare triple {33563#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {33564#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:00,606 INFO L273 TraceCheckUtils]: 46: Hoare triple {33564#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33564#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:00,607 INFO L273 TraceCheckUtils]: 47: Hoare triple {33564#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33564#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:00,607 INFO L273 TraceCheckUtils]: 48: Hoare triple {33564#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {33565#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:00,608 INFO L273 TraceCheckUtils]: 49: Hoare triple {33565#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33565#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:00,608 INFO L273 TraceCheckUtils]: 50: Hoare triple {33565#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33565#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:00,609 INFO L273 TraceCheckUtils]: 51: Hoare triple {33565#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {33566#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:00,610 INFO L273 TraceCheckUtils]: 52: Hoare triple {33566#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33566#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:00,610 INFO L273 TraceCheckUtils]: 53: Hoare triple {33566#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33566#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:00,611 INFO L273 TraceCheckUtils]: 54: Hoare triple {33566#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {33567#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:00,611 INFO L273 TraceCheckUtils]: 55: Hoare triple {33567#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33567#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:00,612 INFO L273 TraceCheckUtils]: 56: Hoare triple {33567#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33567#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:00,613 INFO L273 TraceCheckUtils]: 57: Hoare triple {33567#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {33568#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:00,613 INFO L273 TraceCheckUtils]: 58: Hoare triple {33568#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33568#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:00,614 INFO L273 TraceCheckUtils]: 59: Hoare triple {33568#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33568#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:00,614 INFO L273 TraceCheckUtils]: 60: Hoare triple {33568#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {33569#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:00,615 INFO L273 TraceCheckUtils]: 61: Hoare triple {33569#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33569#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:00,615 INFO L273 TraceCheckUtils]: 62: Hoare triple {33569#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33569#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:00,616 INFO L273 TraceCheckUtils]: 63: Hoare triple {33569#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {33570#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:00,617 INFO L273 TraceCheckUtils]: 64: Hoare triple {33570#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33570#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:00,617 INFO L273 TraceCheckUtils]: 65: Hoare triple {33570#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33570#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:00,618 INFO L273 TraceCheckUtils]: 66: Hoare triple {33570#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {33571#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:00,618 INFO L273 TraceCheckUtils]: 67: Hoare triple {33571#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33571#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:00,619 INFO L273 TraceCheckUtils]: 68: Hoare triple {33571#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33571#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:00,619 INFO L273 TraceCheckUtils]: 69: Hoare triple {33571#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {33572#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:00,620 INFO L273 TraceCheckUtils]: 70: Hoare triple {33572#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33572#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:00,620 INFO L273 TraceCheckUtils]: 71: Hoare triple {33572#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33572#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:00,621 INFO L273 TraceCheckUtils]: 72: Hoare triple {33572#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {33573#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:00,622 INFO L273 TraceCheckUtils]: 73: Hoare triple {33573#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33573#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:00,622 INFO L273 TraceCheckUtils]: 74: Hoare triple {33573#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33573#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:00,623 INFO L273 TraceCheckUtils]: 75: Hoare triple {33573#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {33574#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:00,623 INFO L273 TraceCheckUtils]: 76: Hoare triple {33574#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33574#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:00,624 INFO L273 TraceCheckUtils]: 77: Hoare triple {33574#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33574#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:00,625 INFO L273 TraceCheckUtils]: 78: Hoare triple {33574#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {33575#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:00,625 INFO L273 TraceCheckUtils]: 79: Hoare triple {33575#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33575#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:00,626 INFO L273 TraceCheckUtils]: 80: Hoare triple {33575#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33575#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:00,626 INFO L273 TraceCheckUtils]: 81: Hoare triple {33575#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {33576#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:00,627 INFO L273 TraceCheckUtils]: 82: Hoare triple {33576#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33576#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:00,627 INFO L273 TraceCheckUtils]: 83: Hoare triple {33576#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33576#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:00,628 INFO L273 TraceCheckUtils]: 84: Hoare triple {33576#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {33577#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:00,628 INFO L273 TraceCheckUtils]: 85: Hoare triple {33577#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33577#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:00,629 INFO L273 TraceCheckUtils]: 86: Hoare triple {33577#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33577#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:00,630 INFO L273 TraceCheckUtils]: 87: Hoare triple {33577#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {33578#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:00,630 INFO L273 TraceCheckUtils]: 88: Hoare triple {33578#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33578#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:00,631 INFO L273 TraceCheckUtils]: 89: Hoare triple {33578#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33578#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:00,631 INFO L273 TraceCheckUtils]: 90: Hoare triple {33578#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {33579#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:00,632 INFO L273 TraceCheckUtils]: 91: Hoare triple {33579#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33579#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:00,632 INFO L273 TraceCheckUtils]: 92: Hoare triple {33579#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33579#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:00,633 INFO L273 TraceCheckUtils]: 93: Hoare triple {33579#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {33580#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:00,634 INFO L273 TraceCheckUtils]: 94: Hoare triple {33580#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33580#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:00,634 INFO L273 TraceCheckUtils]: 95: Hoare triple {33580#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33580#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:00,635 INFO L273 TraceCheckUtils]: 96: Hoare triple {33580#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {33581#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:00,635 INFO L273 TraceCheckUtils]: 97: Hoare triple {33581#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33581#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:00,636 INFO L273 TraceCheckUtils]: 98: Hoare triple {33581#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33581#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:00,636 INFO L273 TraceCheckUtils]: 99: Hoare triple {33581#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {33582#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:00,637 INFO L273 TraceCheckUtils]: 100: Hoare triple {33582#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33582#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:00,637 INFO L273 TraceCheckUtils]: 101: Hoare triple {33582#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33582#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:00,638 INFO L273 TraceCheckUtils]: 102: Hoare triple {33582#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {33583#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:00,639 INFO L273 TraceCheckUtils]: 103: Hoare triple {33583#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33583#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:00,639 INFO L273 TraceCheckUtils]: 104: Hoare triple {33583#(<= main_~i~0 33)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33583#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:00,640 INFO L273 TraceCheckUtils]: 105: Hoare triple {33583#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {33584#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:00,640 INFO L273 TraceCheckUtils]: 106: Hoare triple {33584#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {33584#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:00,641 INFO L273 TraceCheckUtils]: 107: Hoare triple {33584#(<= main_~i~0 34)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33584#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:00,641 INFO L273 TraceCheckUtils]: 108: Hoare triple {33584#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {33585#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:00,642 INFO L273 TraceCheckUtils]: 109: Hoare triple {33585#(<= main_~i~0 35)} assume !(~i~0 < 100000); {33550#false} is VALID [2018-11-23 11:53:00,642 INFO L273 TraceCheckUtils]: 110: Hoare triple {33550#false} assume !(0 != ~swapped~0); {33550#false} is VALID [2018-11-23 11:53:00,643 INFO L273 TraceCheckUtils]: 111: Hoare triple {33550#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {33550#false} is VALID [2018-11-23 11:53:00,643 INFO L273 TraceCheckUtils]: 112: Hoare triple {33550#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {33550#false} is VALID [2018-11-23 11:53:00,643 INFO L273 TraceCheckUtils]: 113: Hoare triple {33550#false} assume !!(~y~0 < 100000);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); {33550#false} is VALID [2018-11-23 11:53:00,643 INFO L256 TraceCheckUtils]: 114: Hoare triple {33550#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {33550#false} is VALID [2018-11-23 11:53:00,643 INFO L273 TraceCheckUtils]: 115: Hoare triple {33550#false} ~cond := #in~cond; {33550#false} is VALID [2018-11-23 11:53:00,643 INFO L273 TraceCheckUtils]: 116: Hoare triple {33550#false} assume 0 == ~cond; {33550#false} is VALID [2018-11-23 11:53:00,644 INFO L273 TraceCheckUtils]: 117: Hoare triple {33550#false} assume !false; {33550#false} is VALID [2018-11-23 11:53:00,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1718 backedges. 1 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:53:00,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:00,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2018-11-23 11:53:00,673 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 118 [2018-11-23 11:53:00,673 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:00,673 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2018-11-23 11:53:00,790 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:00,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-23 11:53:00,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-23 11:53:00,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 11:53:00,792 INFO L87 Difference]: Start difference. First operand 225 states and 296 transitions. Second operand 38 states. [2018-11-23 11:53:01,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:01,770 INFO L93 Difference]: Finished difference Result 454 states and 602 transitions. [2018-11-23 11:53:01,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-23 11:53:01,770 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 118 [2018-11-23 11:53:01,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:01,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 11:53:01,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 189 transitions. [2018-11-23 11:53:01,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 11:53:01,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 189 transitions. [2018-11-23 11:53:01,773 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 189 transitions. [2018-11-23 11:53:01,962 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:01,967 INFO L225 Difference]: With dead ends: 454 [2018-11-23 11:53:01,967 INFO L226 Difference]: Without dead ends: 235 [2018-11-23 11:53:01,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 11:53:01,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-11-23 11:53:02,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 231. [2018-11-23 11:53:02,046 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:02,046 INFO L82 GeneralOperation]: Start isEquivalent. First operand 235 states. Second operand 231 states. [2018-11-23 11:53:02,047 INFO L74 IsIncluded]: Start isIncluded. First operand 235 states. Second operand 231 states. [2018-11-23 11:53:02,047 INFO L87 Difference]: Start difference. First operand 235 states. Second operand 231 states. [2018-11-23 11:53:02,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:02,052 INFO L93 Difference]: Finished difference Result 235 states and 310 transitions. [2018-11-23 11:53:02,052 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 310 transitions. [2018-11-23 11:53:02,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:02,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:02,053 INFO L74 IsIncluded]: Start isIncluded. First operand 231 states. Second operand 235 states. [2018-11-23 11:53:02,053 INFO L87 Difference]: Start difference. First operand 231 states. Second operand 235 states. [2018-11-23 11:53:02,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:02,056 INFO L93 Difference]: Finished difference Result 235 states and 310 transitions. [2018-11-23 11:53:02,056 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 310 transitions. [2018-11-23 11:53:02,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:02,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:02,057 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:02,057 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:02,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-11-23 11:53:02,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 304 transitions. [2018-11-23 11:53:02,060 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 304 transitions. Word has length 118 [2018-11-23 11:53:02,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:02,061 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 304 transitions. [2018-11-23 11:53:02,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-23 11:53:02,061 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 304 transitions. [2018-11-23 11:53:02,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-23 11:53:02,061 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:02,061 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:53:02,061 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:02,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:02,062 INFO L82 PathProgramCache]: Analyzing trace with hash -954051992, now seen corresponding path program 35 times [2018-11-23 11:53:02,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:02,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:02,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:02,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:02,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:02,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:03,633 INFO L256 TraceCheckUtils]: 0: Hoare triple {35332#true} call ULTIMATE.init(); {35332#true} is VALID [2018-11-23 11:53:03,633 INFO L273 TraceCheckUtils]: 1: Hoare triple {35332#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {35332#true} is VALID [2018-11-23 11:53:03,634 INFO L273 TraceCheckUtils]: 2: Hoare triple {35332#true} assume true; {35332#true} is VALID [2018-11-23 11:53:03,634 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {35332#true} {35332#true} #79#return; {35332#true} is VALID [2018-11-23 11:53:03,634 INFO L256 TraceCheckUtils]: 4: Hoare triple {35332#true} call #t~ret8 := main(); {35332#true} is VALID [2018-11-23 11:53:03,634 INFO L273 TraceCheckUtils]: 5: Hoare triple {35332#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {35332#true} is VALID [2018-11-23 11:53:03,634 INFO L273 TraceCheckUtils]: 6: Hoare triple {35332#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {35334#(= main_~i~0 1)} is VALID [2018-11-23 11:53:03,635 INFO L273 TraceCheckUtils]: 7: Hoare triple {35334#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35334#(= main_~i~0 1)} is VALID [2018-11-23 11:53:03,635 INFO L273 TraceCheckUtils]: 8: Hoare triple {35334#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35334#(= main_~i~0 1)} is VALID [2018-11-23 11:53:03,635 INFO L273 TraceCheckUtils]: 9: Hoare triple {35334#(= main_~i~0 1)} ~i~0 := 1 + ~i~0; {35335#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:03,636 INFO L273 TraceCheckUtils]: 10: Hoare triple {35335#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35335#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:03,636 INFO L273 TraceCheckUtils]: 11: Hoare triple {35335#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35335#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:03,637 INFO L273 TraceCheckUtils]: 12: Hoare triple {35335#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {35336#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:03,637 INFO L273 TraceCheckUtils]: 13: Hoare triple {35336#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35336#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:03,638 INFO L273 TraceCheckUtils]: 14: Hoare triple {35336#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35336#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:03,639 INFO L273 TraceCheckUtils]: 15: Hoare triple {35336#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {35337#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:03,639 INFO L273 TraceCheckUtils]: 16: Hoare triple {35337#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35337#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:03,640 INFO L273 TraceCheckUtils]: 17: Hoare triple {35337#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35337#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:03,640 INFO L273 TraceCheckUtils]: 18: Hoare triple {35337#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {35338#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:03,641 INFO L273 TraceCheckUtils]: 19: Hoare triple {35338#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35338#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:03,642 INFO L273 TraceCheckUtils]: 20: Hoare triple {35338#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35338#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:03,642 INFO L273 TraceCheckUtils]: 21: Hoare triple {35338#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {35339#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:03,643 INFO L273 TraceCheckUtils]: 22: Hoare triple {35339#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35339#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:03,643 INFO L273 TraceCheckUtils]: 23: Hoare triple {35339#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35339#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:03,644 INFO L273 TraceCheckUtils]: 24: Hoare triple {35339#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {35340#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:03,644 INFO L273 TraceCheckUtils]: 25: Hoare triple {35340#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35340#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:03,645 INFO L273 TraceCheckUtils]: 26: Hoare triple {35340#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35340#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:03,646 INFO L273 TraceCheckUtils]: 27: Hoare triple {35340#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {35341#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:03,646 INFO L273 TraceCheckUtils]: 28: Hoare triple {35341#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35341#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:03,647 INFO L273 TraceCheckUtils]: 29: Hoare triple {35341#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35341#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:03,647 INFO L273 TraceCheckUtils]: 30: Hoare triple {35341#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {35342#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:03,648 INFO L273 TraceCheckUtils]: 31: Hoare triple {35342#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35342#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:03,648 INFO L273 TraceCheckUtils]: 32: Hoare triple {35342#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35342#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:03,649 INFO L273 TraceCheckUtils]: 33: Hoare triple {35342#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {35343#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:03,650 INFO L273 TraceCheckUtils]: 34: Hoare triple {35343#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35343#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:03,650 INFO L273 TraceCheckUtils]: 35: Hoare triple {35343#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35343#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:03,651 INFO L273 TraceCheckUtils]: 36: Hoare triple {35343#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {35344#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:03,651 INFO L273 TraceCheckUtils]: 37: Hoare triple {35344#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35344#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:03,652 INFO L273 TraceCheckUtils]: 38: Hoare triple {35344#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35344#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:03,653 INFO L273 TraceCheckUtils]: 39: Hoare triple {35344#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {35345#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:03,653 INFO L273 TraceCheckUtils]: 40: Hoare triple {35345#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35345#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:03,654 INFO L273 TraceCheckUtils]: 41: Hoare triple {35345#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35345#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:03,654 INFO L273 TraceCheckUtils]: 42: Hoare triple {35345#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {35346#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:03,655 INFO L273 TraceCheckUtils]: 43: Hoare triple {35346#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35346#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:03,655 INFO L273 TraceCheckUtils]: 44: Hoare triple {35346#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35346#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:03,656 INFO L273 TraceCheckUtils]: 45: Hoare triple {35346#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {35347#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:03,657 INFO L273 TraceCheckUtils]: 46: Hoare triple {35347#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35347#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:03,657 INFO L273 TraceCheckUtils]: 47: Hoare triple {35347#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35347#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:03,658 INFO L273 TraceCheckUtils]: 48: Hoare triple {35347#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {35348#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:03,658 INFO L273 TraceCheckUtils]: 49: Hoare triple {35348#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35348#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:03,659 INFO L273 TraceCheckUtils]: 50: Hoare triple {35348#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35348#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:03,659 INFO L273 TraceCheckUtils]: 51: Hoare triple {35348#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {35349#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:03,660 INFO L273 TraceCheckUtils]: 52: Hoare triple {35349#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35349#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:03,660 INFO L273 TraceCheckUtils]: 53: Hoare triple {35349#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35349#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:03,661 INFO L273 TraceCheckUtils]: 54: Hoare triple {35349#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {35350#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:03,662 INFO L273 TraceCheckUtils]: 55: Hoare triple {35350#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35350#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:03,662 INFO L273 TraceCheckUtils]: 56: Hoare triple {35350#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35350#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:03,663 INFO L273 TraceCheckUtils]: 57: Hoare triple {35350#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {35351#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:03,663 INFO L273 TraceCheckUtils]: 58: Hoare triple {35351#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35351#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:03,664 INFO L273 TraceCheckUtils]: 59: Hoare triple {35351#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35351#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:03,665 INFO L273 TraceCheckUtils]: 60: Hoare triple {35351#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {35352#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:03,665 INFO L273 TraceCheckUtils]: 61: Hoare triple {35352#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35352#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:03,666 INFO L273 TraceCheckUtils]: 62: Hoare triple {35352#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35352#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:03,666 INFO L273 TraceCheckUtils]: 63: Hoare triple {35352#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {35353#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:03,667 INFO L273 TraceCheckUtils]: 64: Hoare triple {35353#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35353#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:03,667 INFO L273 TraceCheckUtils]: 65: Hoare triple {35353#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35353#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:03,668 INFO L273 TraceCheckUtils]: 66: Hoare triple {35353#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {35354#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:03,669 INFO L273 TraceCheckUtils]: 67: Hoare triple {35354#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35354#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:03,669 INFO L273 TraceCheckUtils]: 68: Hoare triple {35354#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35354#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:03,670 INFO L273 TraceCheckUtils]: 69: Hoare triple {35354#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {35355#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:03,670 INFO L273 TraceCheckUtils]: 70: Hoare triple {35355#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35355#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:03,671 INFO L273 TraceCheckUtils]: 71: Hoare triple {35355#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35355#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:03,672 INFO L273 TraceCheckUtils]: 72: Hoare triple {35355#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {35356#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:03,672 INFO L273 TraceCheckUtils]: 73: Hoare triple {35356#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35356#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:03,673 INFO L273 TraceCheckUtils]: 74: Hoare triple {35356#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35356#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:03,673 INFO L273 TraceCheckUtils]: 75: Hoare triple {35356#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {35357#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:03,674 INFO L273 TraceCheckUtils]: 76: Hoare triple {35357#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35357#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:03,674 INFO L273 TraceCheckUtils]: 77: Hoare triple {35357#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35357#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:03,675 INFO L273 TraceCheckUtils]: 78: Hoare triple {35357#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {35358#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:03,676 INFO L273 TraceCheckUtils]: 79: Hoare triple {35358#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35358#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:03,676 INFO L273 TraceCheckUtils]: 80: Hoare triple {35358#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35358#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:03,677 INFO L273 TraceCheckUtils]: 81: Hoare triple {35358#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {35359#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:03,677 INFO L273 TraceCheckUtils]: 82: Hoare triple {35359#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35359#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:03,678 INFO L273 TraceCheckUtils]: 83: Hoare triple {35359#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35359#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:03,679 INFO L273 TraceCheckUtils]: 84: Hoare triple {35359#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {35360#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:03,679 INFO L273 TraceCheckUtils]: 85: Hoare triple {35360#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35360#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:03,680 INFO L273 TraceCheckUtils]: 86: Hoare triple {35360#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35360#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:03,680 INFO L273 TraceCheckUtils]: 87: Hoare triple {35360#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {35361#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:03,681 INFO L273 TraceCheckUtils]: 88: Hoare triple {35361#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35361#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:03,681 INFO L273 TraceCheckUtils]: 89: Hoare triple {35361#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35361#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:03,682 INFO L273 TraceCheckUtils]: 90: Hoare triple {35361#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {35362#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:03,683 INFO L273 TraceCheckUtils]: 91: Hoare triple {35362#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35362#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:03,683 INFO L273 TraceCheckUtils]: 92: Hoare triple {35362#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35362#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:03,684 INFO L273 TraceCheckUtils]: 93: Hoare triple {35362#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {35363#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:03,684 INFO L273 TraceCheckUtils]: 94: Hoare triple {35363#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35363#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:03,685 INFO L273 TraceCheckUtils]: 95: Hoare triple {35363#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35363#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:03,686 INFO L273 TraceCheckUtils]: 96: Hoare triple {35363#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {35364#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:03,686 INFO L273 TraceCheckUtils]: 97: Hoare triple {35364#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35364#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:03,687 INFO L273 TraceCheckUtils]: 98: Hoare triple {35364#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35364#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:03,687 INFO L273 TraceCheckUtils]: 99: Hoare triple {35364#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {35365#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:03,688 INFO L273 TraceCheckUtils]: 100: Hoare triple {35365#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35365#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:03,688 INFO L273 TraceCheckUtils]: 101: Hoare triple {35365#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35365#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:03,689 INFO L273 TraceCheckUtils]: 102: Hoare triple {35365#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {35366#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:03,690 INFO L273 TraceCheckUtils]: 103: Hoare triple {35366#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35366#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:03,690 INFO L273 TraceCheckUtils]: 104: Hoare triple {35366#(<= main_~i~0 33)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35366#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:03,691 INFO L273 TraceCheckUtils]: 105: Hoare triple {35366#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {35367#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:03,691 INFO L273 TraceCheckUtils]: 106: Hoare triple {35367#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35367#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:03,692 INFO L273 TraceCheckUtils]: 107: Hoare triple {35367#(<= main_~i~0 34)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35367#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:03,693 INFO L273 TraceCheckUtils]: 108: Hoare triple {35367#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {35368#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:03,693 INFO L273 TraceCheckUtils]: 109: Hoare triple {35368#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35368#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:03,694 INFO L273 TraceCheckUtils]: 110: Hoare triple {35368#(<= main_~i~0 35)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35368#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:03,694 INFO L273 TraceCheckUtils]: 111: Hoare triple {35368#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {35369#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:03,695 INFO L273 TraceCheckUtils]: 112: Hoare triple {35369#(<= main_~i~0 36)} assume !(~i~0 < 100000); {35333#false} is VALID [2018-11-23 11:53:03,695 INFO L273 TraceCheckUtils]: 113: Hoare triple {35333#false} assume !(0 != ~swapped~0); {35333#false} is VALID [2018-11-23 11:53:03,695 INFO L273 TraceCheckUtils]: 114: Hoare triple {35333#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {35333#false} is VALID [2018-11-23 11:53:03,696 INFO L273 TraceCheckUtils]: 115: Hoare triple {35333#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {35333#false} is VALID [2018-11-23 11:53:03,696 INFO L273 TraceCheckUtils]: 116: Hoare triple {35333#false} assume !!(~y~0 < 100000);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); {35333#false} is VALID [2018-11-23 11:53:03,696 INFO L256 TraceCheckUtils]: 117: Hoare triple {35333#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {35333#false} is VALID [2018-11-23 11:53:03,696 INFO L273 TraceCheckUtils]: 118: Hoare triple {35333#false} ~cond := #in~cond; {35333#false} is VALID [2018-11-23 11:53:03,696 INFO L273 TraceCheckUtils]: 119: Hoare triple {35333#false} assume 0 == ~cond; {35333#false} is VALID [2018-11-23 11:53:03,696 INFO L273 TraceCheckUtils]: 120: Hoare triple {35333#false} assume !false; {35333#false} is VALID [2018-11-23 11:53:03,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1821 backedges. 1 proven. 1820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:53:03,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:03,707 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:53:03,736 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:53:03,868 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-11-23 11:53:03,868 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:03,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:03,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:04,132 INFO L256 TraceCheckUtils]: 0: Hoare triple {35332#true} call ULTIMATE.init(); {35332#true} is VALID [2018-11-23 11:53:04,133 INFO L273 TraceCheckUtils]: 1: Hoare triple {35332#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {35332#true} is VALID [2018-11-23 11:53:04,133 INFO L273 TraceCheckUtils]: 2: Hoare triple {35332#true} assume true; {35332#true} is VALID [2018-11-23 11:53:04,133 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {35332#true} {35332#true} #79#return; {35332#true} is VALID [2018-11-23 11:53:04,133 INFO L256 TraceCheckUtils]: 4: Hoare triple {35332#true} call #t~ret8 := main(); {35332#true} is VALID [2018-11-23 11:53:04,133 INFO L273 TraceCheckUtils]: 5: Hoare triple {35332#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {35332#true} is VALID [2018-11-23 11:53:04,133 INFO L273 TraceCheckUtils]: 6: Hoare triple {35332#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {35391#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:04,134 INFO L273 TraceCheckUtils]: 7: Hoare triple {35391#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35391#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:04,134 INFO L273 TraceCheckUtils]: 8: Hoare triple {35391#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35391#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:04,134 INFO L273 TraceCheckUtils]: 9: Hoare triple {35391#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {35335#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:04,135 INFO L273 TraceCheckUtils]: 10: Hoare triple {35335#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35335#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:04,135 INFO L273 TraceCheckUtils]: 11: Hoare triple {35335#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35335#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:04,135 INFO L273 TraceCheckUtils]: 12: Hoare triple {35335#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {35336#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:04,136 INFO L273 TraceCheckUtils]: 13: Hoare triple {35336#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35336#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:04,136 INFO L273 TraceCheckUtils]: 14: Hoare triple {35336#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35336#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:04,137 INFO L273 TraceCheckUtils]: 15: Hoare triple {35336#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {35337#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:04,137 INFO L273 TraceCheckUtils]: 16: Hoare triple {35337#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35337#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:04,137 INFO L273 TraceCheckUtils]: 17: Hoare triple {35337#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35337#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:04,138 INFO L273 TraceCheckUtils]: 18: Hoare triple {35337#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {35338#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:04,138 INFO L273 TraceCheckUtils]: 19: Hoare triple {35338#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35338#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:04,139 INFO L273 TraceCheckUtils]: 20: Hoare triple {35338#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35338#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:04,140 INFO L273 TraceCheckUtils]: 21: Hoare triple {35338#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {35339#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:04,140 INFO L273 TraceCheckUtils]: 22: Hoare triple {35339#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35339#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:04,141 INFO L273 TraceCheckUtils]: 23: Hoare triple {35339#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35339#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:04,141 INFO L273 TraceCheckUtils]: 24: Hoare triple {35339#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {35340#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:04,142 INFO L273 TraceCheckUtils]: 25: Hoare triple {35340#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35340#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:04,142 INFO L273 TraceCheckUtils]: 26: Hoare triple {35340#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35340#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:04,143 INFO L273 TraceCheckUtils]: 27: Hoare triple {35340#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {35341#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:04,143 INFO L273 TraceCheckUtils]: 28: Hoare triple {35341#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35341#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:04,144 INFO L273 TraceCheckUtils]: 29: Hoare triple {35341#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35341#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:04,144 INFO L273 TraceCheckUtils]: 30: Hoare triple {35341#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {35342#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:04,145 INFO L273 TraceCheckUtils]: 31: Hoare triple {35342#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35342#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:04,145 INFO L273 TraceCheckUtils]: 32: Hoare triple {35342#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35342#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:04,146 INFO L273 TraceCheckUtils]: 33: Hoare triple {35342#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {35343#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:04,147 INFO L273 TraceCheckUtils]: 34: Hoare triple {35343#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35343#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:04,147 INFO L273 TraceCheckUtils]: 35: Hoare triple {35343#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35343#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:04,148 INFO L273 TraceCheckUtils]: 36: Hoare triple {35343#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {35344#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:04,148 INFO L273 TraceCheckUtils]: 37: Hoare triple {35344#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35344#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:04,149 INFO L273 TraceCheckUtils]: 38: Hoare triple {35344#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35344#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:04,149 INFO L273 TraceCheckUtils]: 39: Hoare triple {35344#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {35345#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:04,150 INFO L273 TraceCheckUtils]: 40: Hoare triple {35345#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35345#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:04,150 INFO L273 TraceCheckUtils]: 41: Hoare triple {35345#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35345#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:04,151 INFO L273 TraceCheckUtils]: 42: Hoare triple {35345#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {35346#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:04,151 INFO L273 TraceCheckUtils]: 43: Hoare triple {35346#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35346#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:04,152 INFO L273 TraceCheckUtils]: 44: Hoare triple {35346#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35346#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:04,153 INFO L273 TraceCheckUtils]: 45: Hoare triple {35346#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {35347#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:04,153 INFO L273 TraceCheckUtils]: 46: Hoare triple {35347#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35347#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:04,153 INFO L273 TraceCheckUtils]: 47: Hoare triple {35347#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35347#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:04,154 INFO L273 TraceCheckUtils]: 48: Hoare triple {35347#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {35348#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:04,155 INFO L273 TraceCheckUtils]: 49: Hoare triple {35348#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35348#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:04,175 INFO L273 TraceCheckUtils]: 50: Hoare triple {35348#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35348#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:04,176 INFO L273 TraceCheckUtils]: 51: Hoare triple {35348#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {35349#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:04,181 INFO L273 TraceCheckUtils]: 52: Hoare triple {35349#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35349#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:04,181 INFO L273 TraceCheckUtils]: 53: Hoare triple {35349#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35349#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:04,181 INFO L273 TraceCheckUtils]: 54: Hoare triple {35349#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {35350#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:04,182 INFO L273 TraceCheckUtils]: 55: Hoare triple {35350#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35350#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:04,182 INFO L273 TraceCheckUtils]: 56: Hoare triple {35350#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35350#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:04,182 INFO L273 TraceCheckUtils]: 57: Hoare triple {35350#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {35351#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:04,183 INFO L273 TraceCheckUtils]: 58: Hoare triple {35351#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35351#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:04,183 INFO L273 TraceCheckUtils]: 59: Hoare triple {35351#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35351#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:04,183 INFO L273 TraceCheckUtils]: 60: Hoare triple {35351#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {35352#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:04,184 INFO L273 TraceCheckUtils]: 61: Hoare triple {35352#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35352#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:04,184 INFO L273 TraceCheckUtils]: 62: Hoare triple {35352#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35352#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:04,185 INFO L273 TraceCheckUtils]: 63: Hoare triple {35352#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {35353#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:04,185 INFO L273 TraceCheckUtils]: 64: Hoare triple {35353#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35353#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:04,186 INFO L273 TraceCheckUtils]: 65: Hoare triple {35353#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35353#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:04,186 INFO L273 TraceCheckUtils]: 66: Hoare triple {35353#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {35354#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:04,187 INFO L273 TraceCheckUtils]: 67: Hoare triple {35354#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35354#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:04,187 INFO L273 TraceCheckUtils]: 68: Hoare triple {35354#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35354#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:04,188 INFO L273 TraceCheckUtils]: 69: Hoare triple {35354#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {35355#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:04,189 INFO L273 TraceCheckUtils]: 70: Hoare triple {35355#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35355#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:04,189 INFO L273 TraceCheckUtils]: 71: Hoare triple {35355#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35355#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:04,190 INFO L273 TraceCheckUtils]: 72: Hoare triple {35355#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {35356#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:04,190 INFO L273 TraceCheckUtils]: 73: Hoare triple {35356#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35356#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:04,191 INFO L273 TraceCheckUtils]: 74: Hoare triple {35356#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35356#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:04,191 INFO L273 TraceCheckUtils]: 75: Hoare triple {35356#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {35357#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:04,192 INFO L273 TraceCheckUtils]: 76: Hoare triple {35357#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35357#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:04,192 INFO L273 TraceCheckUtils]: 77: Hoare triple {35357#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35357#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:04,193 INFO L273 TraceCheckUtils]: 78: Hoare triple {35357#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {35358#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:04,193 INFO L273 TraceCheckUtils]: 79: Hoare triple {35358#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35358#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:04,194 INFO L273 TraceCheckUtils]: 80: Hoare triple {35358#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35358#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:04,195 INFO L273 TraceCheckUtils]: 81: Hoare triple {35358#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {35359#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:04,195 INFO L273 TraceCheckUtils]: 82: Hoare triple {35359#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35359#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:04,196 INFO L273 TraceCheckUtils]: 83: Hoare triple {35359#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35359#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:04,196 INFO L273 TraceCheckUtils]: 84: Hoare triple {35359#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {35360#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:04,197 INFO L273 TraceCheckUtils]: 85: Hoare triple {35360#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35360#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:04,197 INFO L273 TraceCheckUtils]: 86: Hoare triple {35360#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35360#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:04,198 INFO L273 TraceCheckUtils]: 87: Hoare triple {35360#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {35361#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:04,198 INFO L273 TraceCheckUtils]: 88: Hoare triple {35361#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35361#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:04,199 INFO L273 TraceCheckUtils]: 89: Hoare triple {35361#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35361#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:04,200 INFO L273 TraceCheckUtils]: 90: Hoare triple {35361#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {35362#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:04,200 INFO L273 TraceCheckUtils]: 91: Hoare triple {35362#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35362#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:04,201 INFO L273 TraceCheckUtils]: 92: Hoare triple {35362#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35362#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:04,201 INFO L273 TraceCheckUtils]: 93: Hoare triple {35362#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {35363#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:04,202 INFO L273 TraceCheckUtils]: 94: Hoare triple {35363#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35363#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:04,202 INFO L273 TraceCheckUtils]: 95: Hoare triple {35363#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35363#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:04,203 INFO L273 TraceCheckUtils]: 96: Hoare triple {35363#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {35364#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:04,203 INFO L273 TraceCheckUtils]: 97: Hoare triple {35364#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35364#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:04,204 INFO L273 TraceCheckUtils]: 98: Hoare triple {35364#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35364#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:04,204 INFO L273 TraceCheckUtils]: 99: Hoare triple {35364#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {35365#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:04,205 INFO L273 TraceCheckUtils]: 100: Hoare triple {35365#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35365#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:04,205 INFO L273 TraceCheckUtils]: 101: Hoare triple {35365#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35365#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:04,206 INFO L273 TraceCheckUtils]: 102: Hoare triple {35365#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {35366#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:04,207 INFO L273 TraceCheckUtils]: 103: Hoare triple {35366#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35366#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:04,207 INFO L273 TraceCheckUtils]: 104: Hoare triple {35366#(<= main_~i~0 33)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35366#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:04,208 INFO L273 TraceCheckUtils]: 105: Hoare triple {35366#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {35367#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:04,208 INFO L273 TraceCheckUtils]: 106: Hoare triple {35367#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35367#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:04,209 INFO L273 TraceCheckUtils]: 107: Hoare triple {35367#(<= main_~i~0 34)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35367#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:04,209 INFO L273 TraceCheckUtils]: 108: Hoare triple {35367#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {35368#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:04,210 INFO L273 TraceCheckUtils]: 109: Hoare triple {35368#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {35368#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:04,210 INFO L273 TraceCheckUtils]: 110: Hoare triple {35368#(<= main_~i~0 35)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35368#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:04,211 INFO L273 TraceCheckUtils]: 111: Hoare triple {35368#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {35369#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:04,212 INFO L273 TraceCheckUtils]: 112: Hoare triple {35369#(<= main_~i~0 36)} assume !(~i~0 < 100000); {35333#false} is VALID [2018-11-23 11:53:04,212 INFO L273 TraceCheckUtils]: 113: Hoare triple {35333#false} assume !(0 != ~swapped~0); {35333#false} is VALID [2018-11-23 11:53:04,212 INFO L273 TraceCheckUtils]: 114: Hoare triple {35333#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {35333#false} is VALID [2018-11-23 11:53:04,212 INFO L273 TraceCheckUtils]: 115: Hoare triple {35333#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {35333#false} is VALID [2018-11-23 11:53:04,212 INFO L273 TraceCheckUtils]: 116: Hoare triple {35333#false} assume !!(~y~0 < 100000);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); {35333#false} is VALID [2018-11-23 11:53:04,212 INFO L256 TraceCheckUtils]: 117: Hoare triple {35333#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {35333#false} is VALID [2018-11-23 11:53:04,213 INFO L273 TraceCheckUtils]: 118: Hoare triple {35333#false} ~cond := #in~cond; {35333#false} is VALID [2018-11-23 11:53:04,213 INFO L273 TraceCheckUtils]: 119: Hoare triple {35333#false} assume 0 == ~cond; {35333#false} is VALID [2018-11-23 11:53:04,213 INFO L273 TraceCheckUtils]: 120: Hoare triple {35333#false} assume !false; {35333#false} is VALID [2018-11-23 11:53:04,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1821 backedges. 1 proven. 1820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:53:04,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:04,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2018-11-23 11:53:04,243 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 121 [2018-11-23 11:53:04,243 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:04,243 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states. [2018-11-23 11:53:04,361 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:04,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-23 11:53:04,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-23 11:53:04,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 11:53:04,362 INFO L87 Difference]: Start difference. First operand 231 states and 304 transitions. Second operand 39 states. [2018-11-23 11:53:05,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:05,560 INFO L93 Difference]: Finished difference Result 466 states and 618 transitions. [2018-11-23 11:53:05,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-23 11:53:05,561 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 121 [2018-11-23 11:53:05,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:05,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 11:53:05,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 193 transitions. [2018-11-23 11:53:05,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 11:53:05,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 193 transitions. [2018-11-23 11:53:05,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 193 transitions. [2018-11-23 11:53:05,744 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 193 edges. 193 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:05,749 INFO L225 Difference]: With dead ends: 466 [2018-11-23 11:53:05,749 INFO L226 Difference]: Without dead ends: 241 [2018-11-23 11:53:05,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 11:53:05,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-11-23 11:53:05,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 237. [2018-11-23 11:53:05,862 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:05,863 INFO L82 GeneralOperation]: Start isEquivalent. First operand 241 states. Second operand 237 states. [2018-11-23 11:53:05,863 INFO L74 IsIncluded]: Start isIncluded. First operand 241 states. Second operand 237 states. [2018-11-23 11:53:05,863 INFO L87 Difference]: Start difference. First operand 241 states. Second operand 237 states. [2018-11-23 11:53:05,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:05,869 INFO L93 Difference]: Finished difference Result 241 states and 318 transitions. [2018-11-23 11:53:05,869 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 318 transitions. [2018-11-23 11:53:05,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:05,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:05,869 INFO L74 IsIncluded]: Start isIncluded. First operand 237 states. Second operand 241 states. [2018-11-23 11:53:05,869 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 241 states. [2018-11-23 11:53:05,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:05,873 INFO L93 Difference]: Finished difference Result 241 states and 318 transitions. [2018-11-23 11:53:05,873 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 318 transitions. [2018-11-23 11:53:05,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:05,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:05,874 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:05,874 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:05,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-11-23 11:53:05,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 312 transitions. [2018-11-23 11:53:05,877 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 312 transitions. Word has length 121 [2018-11-23 11:53:05,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:05,877 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 312 transitions. [2018-11-23 11:53:05,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-23 11:53:05,878 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 312 transitions. [2018-11-23 11:53:05,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-23 11:53:05,878 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:05,878 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:53:05,878 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:05,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:05,879 INFO L82 PathProgramCache]: Analyzing trace with hash 643331089, now seen corresponding path program 36 times [2018-11-23 11:53:05,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:05,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:05,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:05,879 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:05,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:05,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:06,681 INFO L256 TraceCheckUtils]: 0: Hoare triple {37161#true} call ULTIMATE.init(); {37161#true} is VALID [2018-11-23 11:53:06,681 INFO L273 TraceCheckUtils]: 1: Hoare triple {37161#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {37161#true} is VALID [2018-11-23 11:53:06,681 INFO L273 TraceCheckUtils]: 2: Hoare triple {37161#true} assume true; {37161#true} is VALID [2018-11-23 11:53:06,682 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37161#true} {37161#true} #79#return; {37161#true} is VALID [2018-11-23 11:53:06,682 INFO L256 TraceCheckUtils]: 4: Hoare triple {37161#true} call #t~ret8 := main(); {37161#true} is VALID [2018-11-23 11:53:06,682 INFO L273 TraceCheckUtils]: 5: Hoare triple {37161#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {37161#true} is VALID [2018-11-23 11:53:06,683 INFO L273 TraceCheckUtils]: 6: Hoare triple {37161#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {37163#(= main_~i~0 1)} is VALID [2018-11-23 11:53:06,683 INFO L273 TraceCheckUtils]: 7: Hoare triple {37163#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37163#(= main_~i~0 1)} is VALID [2018-11-23 11:53:06,684 INFO L273 TraceCheckUtils]: 8: Hoare triple {37163#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37163#(= main_~i~0 1)} is VALID [2018-11-23 11:53:06,684 INFO L273 TraceCheckUtils]: 9: Hoare triple {37163#(= main_~i~0 1)} ~i~0 := 1 + ~i~0; {37164#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:06,685 INFO L273 TraceCheckUtils]: 10: Hoare triple {37164#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37164#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:06,685 INFO L273 TraceCheckUtils]: 11: Hoare triple {37164#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37164#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:06,686 INFO L273 TraceCheckUtils]: 12: Hoare triple {37164#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {37165#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:06,687 INFO L273 TraceCheckUtils]: 13: Hoare triple {37165#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37165#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:06,687 INFO L273 TraceCheckUtils]: 14: Hoare triple {37165#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37165#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:06,688 INFO L273 TraceCheckUtils]: 15: Hoare triple {37165#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {37166#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:06,688 INFO L273 TraceCheckUtils]: 16: Hoare triple {37166#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37166#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:06,689 INFO L273 TraceCheckUtils]: 17: Hoare triple {37166#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37166#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:06,689 INFO L273 TraceCheckUtils]: 18: Hoare triple {37166#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {37167#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:06,690 INFO L273 TraceCheckUtils]: 19: Hoare triple {37167#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37167#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:06,690 INFO L273 TraceCheckUtils]: 20: Hoare triple {37167#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37167#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:06,691 INFO L273 TraceCheckUtils]: 21: Hoare triple {37167#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {37168#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:06,692 INFO L273 TraceCheckUtils]: 22: Hoare triple {37168#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37168#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:06,692 INFO L273 TraceCheckUtils]: 23: Hoare triple {37168#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37168#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:06,693 INFO L273 TraceCheckUtils]: 24: Hoare triple {37168#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {37169#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:06,693 INFO L273 TraceCheckUtils]: 25: Hoare triple {37169#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37169#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:06,694 INFO L273 TraceCheckUtils]: 26: Hoare triple {37169#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37169#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:06,694 INFO L273 TraceCheckUtils]: 27: Hoare triple {37169#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {37170#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:06,695 INFO L273 TraceCheckUtils]: 28: Hoare triple {37170#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37170#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:06,695 INFO L273 TraceCheckUtils]: 29: Hoare triple {37170#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37170#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:06,696 INFO L273 TraceCheckUtils]: 30: Hoare triple {37170#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {37171#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:06,697 INFO L273 TraceCheckUtils]: 31: Hoare triple {37171#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37171#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:06,697 INFO L273 TraceCheckUtils]: 32: Hoare triple {37171#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37171#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:06,698 INFO L273 TraceCheckUtils]: 33: Hoare triple {37171#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {37172#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:06,698 INFO L273 TraceCheckUtils]: 34: Hoare triple {37172#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37172#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:06,699 INFO L273 TraceCheckUtils]: 35: Hoare triple {37172#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37172#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:06,699 INFO L273 TraceCheckUtils]: 36: Hoare triple {37172#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {37173#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:06,700 INFO L273 TraceCheckUtils]: 37: Hoare triple {37173#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37173#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:06,700 INFO L273 TraceCheckUtils]: 38: Hoare triple {37173#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37173#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:06,701 INFO L273 TraceCheckUtils]: 39: Hoare triple {37173#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {37174#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:06,702 INFO L273 TraceCheckUtils]: 40: Hoare triple {37174#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37174#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:06,702 INFO L273 TraceCheckUtils]: 41: Hoare triple {37174#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37174#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:06,703 INFO L273 TraceCheckUtils]: 42: Hoare triple {37174#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {37175#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:06,703 INFO L273 TraceCheckUtils]: 43: Hoare triple {37175#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37175#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:06,704 INFO L273 TraceCheckUtils]: 44: Hoare triple {37175#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37175#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:06,704 INFO L273 TraceCheckUtils]: 45: Hoare triple {37175#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {37176#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:06,705 INFO L273 TraceCheckUtils]: 46: Hoare triple {37176#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37176#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:06,705 INFO L273 TraceCheckUtils]: 47: Hoare triple {37176#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37176#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:06,706 INFO L273 TraceCheckUtils]: 48: Hoare triple {37176#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {37177#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:06,707 INFO L273 TraceCheckUtils]: 49: Hoare triple {37177#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37177#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:06,707 INFO L273 TraceCheckUtils]: 50: Hoare triple {37177#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37177#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:06,708 INFO L273 TraceCheckUtils]: 51: Hoare triple {37177#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {37178#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:06,708 INFO L273 TraceCheckUtils]: 52: Hoare triple {37178#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37178#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:06,709 INFO L273 TraceCheckUtils]: 53: Hoare triple {37178#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37178#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:06,710 INFO L273 TraceCheckUtils]: 54: Hoare triple {37178#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {37179#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:06,710 INFO L273 TraceCheckUtils]: 55: Hoare triple {37179#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37179#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:06,711 INFO L273 TraceCheckUtils]: 56: Hoare triple {37179#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37179#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:06,711 INFO L273 TraceCheckUtils]: 57: Hoare triple {37179#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {37180#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:06,712 INFO L273 TraceCheckUtils]: 58: Hoare triple {37180#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37180#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:06,712 INFO L273 TraceCheckUtils]: 59: Hoare triple {37180#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37180#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:06,713 INFO L273 TraceCheckUtils]: 60: Hoare triple {37180#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {37181#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:06,713 INFO L273 TraceCheckUtils]: 61: Hoare triple {37181#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37181#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:06,714 INFO L273 TraceCheckUtils]: 62: Hoare triple {37181#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37181#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:06,715 INFO L273 TraceCheckUtils]: 63: Hoare triple {37181#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {37182#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:06,715 INFO L273 TraceCheckUtils]: 64: Hoare triple {37182#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37182#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:06,715 INFO L273 TraceCheckUtils]: 65: Hoare triple {37182#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37182#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:06,716 INFO L273 TraceCheckUtils]: 66: Hoare triple {37182#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {37183#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:06,717 INFO L273 TraceCheckUtils]: 67: Hoare triple {37183#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37183#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:06,717 INFO L273 TraceCheckUtils]: 68: Hoare triple {37183#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37183#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:06,718 INFO L273 TraceCheckUtils]: 69: Hoare triple {37183#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {37184#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:06,718 INFO L273 TraceCheckUtils]: 70: Hoare triple {37184#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37184#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:06,719 INFO L273 TraceCheckUtils]: 71: Hoare triple {37184#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37184#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:06,719 INFO L273 TraceCheckUtils]: 72: Hoare triple {37184#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {37185#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:06,720 INFO L273 TraceCheckUtils]: 73: Hoare triple {37185#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37185#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:06,720 INFO L273 TraceCheckUtils]: 74: Hoare triple {37185#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37185#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:06,721 INFO L273 TraceCheckUtils]: 75: Hoare triple {37185#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {37186#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:06,722 INFO L273 TraceCheckUtils]: 76: Hoare triple {37186#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37186#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:06,722 INFO L273 TraceCheckUtils]: 77: Hoare triple {37186#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37186#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:06,723 INFO L273 TraceCheckUtils]: 78: Hoare triple {37186#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {37187#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:06,723 INFO L273 TraceCheckUtils]: 79: Hoare triple {37187#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37187#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:06,724 INFO L273 TraceCheckUtils]: 80: Hoare triple {37187#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37187#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:06,725 INFO L273 TraceCheckUtils]: 81: Hoare triple {37187#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {37188#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:06,725 INFO L273 TraceCheckUtils]: 82: Hoare triple {37188#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37188#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:06,726 INFO L273 TraceCheckUtils]: 83: Hoare triple {37188#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37188#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:06,726 INFO L273 TraceCheckUtils]: 84: Hoare triple {37188#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {37189#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:06,727 INFO L273 TraceCheckUtils]: 85: Hoare triple {37189#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37189#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:06,727 INFO L273 TraceCheckUtils]: 86: Hoare triple {37189#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37189#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:06,728 INFO L273 TraceCheckUtils]: 87: Hoare triple {37189#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {37190#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:06,728 INFO L273 TraceCheckUtils]: 88: Hoare triple {37190#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37190#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:06,729 INFO L273 TraceCheckUtils]: 89: Hoare triple {37190#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37190#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:06,729 INFO L273 TraceCheckUtils]: 90: Hoare triple {37190#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {37191#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:06,730 INFO L273 TraceCheckUtils]: 91: Hoare triple {37191#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37191#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:06,730 INFO L273 TraceCheckUtils]: 92: Hoare triple {37191#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37191#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:06,731 INFO L273 TraceCheckUtils]: 93: Hoare triple {37191#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {37192#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:06,732 INFO L273 TraceCheckUtils]: 94: Hoare triple {37192#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37192#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:06,732 INFO L273 TraceCheckUtils]: 95: Hoare triple {37192#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37192#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:06,733 INFO L273 TraceCheckUtils]: 96: Hoare triple {37192#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {37193#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:06,733 INFO L273 TraceCheckUtils]: 97: Hoare triple {37193#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37193#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:06,734 INFO L273 TraceCheckUtils]: 98: Hoare triple {37193#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37193#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:06,735 INFO L273 TraceCheckUtils]: 99: Hoare triple {37193#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {37194#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:06,735 INFO L273 TraceCheckUtils]: 100: Hoare triple {37194#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37194#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:06,736 INFO L273 TraceCheckUtils]: 101: Hoare triple {37194#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37194#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:06,736 INFO L273 TraceCheckUtils]: 102: Hoare triple {37194#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {37195#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:06,737 INFO L273 TraceCheckUtils]: 103: Hoare triple {37195#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37195#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:06,737 INFO L273 TraceCheckUtils]: 104: Hoare triple {37195#(<= main_~i~0 33)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37195#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:06,738 INFO L273 TraceCheckUtils]: 105: Hoare triple {37195#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {37196#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:06,739 INFO L273 TraceCheckUtils]: 106: Hoare triple {37196#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37196#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:06,739 INFO L273 TraceCheckUtils]: 107: Hoare triple {37196#(<= main_~i~0 34)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37196#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:06,740 INFO L273 TraceCheckUtils]: 108: Hoare triple {37196#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {37197#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:06,740 INFO L273 TraceCheckUtils]: 109: Hoare triple {37197#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37197#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:06,741 INFO L273 TraceCheckUtils]: 110: Hoare triple {37197#(<= main_~i~0 35)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37197#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:06,741 INFO L273 TraceCheckUtils]: 111: Hoare triple {37197#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {37198#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:06,742 INFO L273 TraceCheckUtils]: 112: Hoare triple {37198#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37198#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:06,742 INFO L273 TraceCheckUtils]: 113: Hoare triple {37198#(<= main_~i~0 36)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37198#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:06,743 INFO L273 TraceCheckUtils]: 114: Hoare triple {37198#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {37199#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:06,744 INFO L273 TraceCheckUtils]: 115: Hoare triple {37199#(<= main_~i~0 37)} assume !(~i~0 < 100000); {37162#false} is VALID [2018-11-23 11:53:06,744 INFO L273 TraceCheckUtils]: 116: Hoare triple {37162#false} assume !(0 != ~swapped~0); {37162#false} is VALID [2018-11-23 11:53:06,744 INFO L273 TraceCheckUtils]: 117: Hoare triple {37162#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {37162#false} is VALID [2018-11-23 11:53:06,744 INFO L273 TraceCheckUtils]: 118: Hoare triple {37162#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {37162#false} is VALID [2018-11-23 11:53:06,745 INFO L273 TraceCheckUtils]: 119: Hoare triple {37162#false} assume !!(~y~0 < 100000);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); {37162#false} is VALID [2018-11-23 11:53:06,745 INFO L256 TraceCheckUtils]: 120: Hoare triple {37162#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {37162#false} is VALID [2018-11-23 11:53:06,745 INFO L273 TraceCheckUtils]: 121: Hoare triple {37162#false} ~cond := #in~cond; {37162#false} is VALID [2018-11-23 11:53:06,745 INFO L273 TraceCheckUtils]: 122: Hoare triple {37162#false} assume 0 == ~cond; {37162#false} is VALID [2018-11-23 11:53:06,745 INFO L273 TraceCheckUtils]: 123: Hoare triple {37162#false} assume !false; {37162#false} is VALID [2018-11-23 11:53:06,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1927 backedges. 1 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:53:06,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:06,757 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:53:06,766 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:53:06,896 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 38 check-sat command(s) [2018-11-23 11:53:06,896 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:06,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:06,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:07,717 INFO L256 TraceCheckUtils]: 0: Hoare triple {37161#true} call ULTIMATE.init(); {37161#true} is VALID [2018-11-23 11:53:07,718 INFO L273 TraceCheckUtils]: 1: Hoare triple {37161#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {37161#true} is VALID [2018-11-23 11:53:07,718 INFO L273 TraceCheckUtils]: 2: Hoare triple {37161#true} assume true; {37161#true} is VALID [2018-11-23 11:53:07,718 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37161#true} {37161#true} #79#return; {37161#true} is VALID [2018-11-23 11:53:07,718 INFO L256 TraceCheckUtils]: 4: Hoare triple {37161#true} call #t~ret8 := main(); {37161#true} is VALID [2018-11-23 11:53:07,719 INFO L273 TraceCheckUtils]: 5: Hoare triple {37161#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {37161#true} is VALID [2018-11-23 11:53:07,719 INFO L273 TraceCheckUtils]: 6: Hoare triple {37161#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {37221#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:07,720 INFO L273 TraceCheckUtils]: 7: Hoare triple {37221#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37221#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:07,720 INFO L273 TraceCheckUtils]: 8: Hoare triple {37221#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37221#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:07,720 INFO L273 TraceCheckUtils]: 9: Hoare triple {37221#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {37164#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:07,721 INFO L273 TraceCheckUtils]: 10: Hoare triple {37164#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37164#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:07,721 INFO L273 TraceCheckUtils]: 11: Hoare triple {37164#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37164#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:07,721 INFO L273 TraceCheckUtils]: 12: Hoare triple {37164#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {37165#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:07,722 INFO L273 TraceCheckUtils]: 13: Hoare triple {37165#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37165#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:07,722 INFO L273 TraceCheckUtils]: 14: Hoare triple {37165#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37165#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:07,723 INFO L273 TraceCheckUtils]: 15: Hoare triple {37165#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {37166#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:07,724 INFO L273 TraceCheckUtils]: 16: Hoare triple {37166#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37166#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:07,724 INFO L273 TraceCheckUtils]: 17: Hoare triple {37166#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37166#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:07,725 INFO L273 TraceCheckUtils]: 18: Hoare triple {37166#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {37167#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:07,725 INFO L273 TraceCheckUtils]: 19: Hoare triple {37167#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37167#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:07,726 INFO L273 TraceCheckUtils]: 20: Hoare triple {37167#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37167#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:07,726 INFO L273 TraceCheckUtils]: 21: Hoare triple {37167#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {37168#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:07,727 INFO L273 TraceCheckUtils]: 22: Hoare triple {37168#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37168#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:07,727 INFO L273 TraceCheckUtils]: 23: Hoare triple {37168#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37168#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:07,728 INFO L273 TraceCheckUtils]: 24: Hoare triple {37168#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {37169#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:07,729 INFO L273 TraceCheckUtils]: 25: Hoare triple {37169#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37169#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:07,729 INFO L273 TraceCheckUtils]: 26: Hoare triple {37169#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37169#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:07,730 INFO L273 TraceCheckUtils]: 27: Hoare triple {37169#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {37170#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:07,730 INFO L273 TraceCheckUtils]: 28: Hoare triple {37170#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37170#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:07,731 INFO L273 TraceCheckUtils]: 29: Hoare triple {37170#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37170#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:07,732 INFO L273 TraceCheckUtils]: 30: Hoare triple {37170#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {37171#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:07,732 INFO L273 TraceCheckUtils]: 31: Hoare triple {37171#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37171#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:07,733 INFO L273 TraceCheckUtils]: 32: Hoare triple {37171#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37171#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:07,733 INFO L273 TraceCheckUtils]: 33: Hoare triple {37171#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {37172#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:07,734 INFO L273 TraceCheckUtils]: 34: Hoare triple {37172#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37172#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:07,734 INFO L273 TraceCheckUtils]: 35: Hoare triple {37172#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37172#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:07,735 INFO L273 TraceCheckUtils]: 36: Hoare triple {37172#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {37173#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:07,736 INFO L273 TraceCheckUtils]: 37: Hoare triple {37173#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37173#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:07,736 INFO L273 TraceCheckUtils]: 38: Hoare triple {37173#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37173#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:07,737 INFO L273 TraceCheckUtils]: 39: Hoare triple {37173#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {37174#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:07,737 INFO L273 TraceCheckUtils]: 40: Hoare triple {37174#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37174#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:07,738 INFO L273 TraceCheckUtils]: 41: Hoare triple {37174#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37174#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:07,739 INFO L273 TraceCheckUtils]: 42: Hoare triple {37174#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {37175#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:07,739 INFO L273 TraceCheckUtils]: 43: Hoare triple {37175#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37175#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:07,740 INFO L273 TraceCheckUtils]: 44: Hoare triple {37175#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37175#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:07,740 INFO L273 TraceCheckUtils]: 45: Hoare triple {37175#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {37176#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:07,741 INFO L273 TraceCheckUtils]: 46: Hoare triple {37176#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37176#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:07,741 INFO L273 TraceCheckUtils]: 47: Hoare triple {37176#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37176#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:07,742 INFO L273 TraceCheckUtils]: 48: Hoare triple {37176#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {37177#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:07,743 INFO L273 TraceCheckUtils]: 49: Hoare triple {37177#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37177#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:07,743 INFO L273 TraceCheckUtils]: 50: Hoare triple {37177#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37177#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:07,744 INFO L273 TraceCheckUtils]: 51: Hoare triple {37177#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {37178#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:07,744 INFO L273 TraceCheckUtils]: 52: Hoare triple {37178#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37178#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:07,745 INFO L273 TraceCheckUtils]: 53: Hoare triple {37178#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37178#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:07,746 INFO L273 TraceCheckUtils]: 54: Hoare triple {37178#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {37179#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:07,746 INFO L273 TraceCheckUtils]: 55: Hoare triple {37179#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37179#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:07,747 INFO L273 TraceCheckUtils]: 56: Hoare triple {37179#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37179#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:07,747 INFO L273 TraceCheckUtils]: 57: Hoare triple {37179#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {37180#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:07,748 INFO L273 TraceCheckUtils]: 58: Hoare triple {37180#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37180#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:07,748 INFO L273 TraceCheckUtils]: 59: Hoare triple {37180#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37180#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:07,749 INFO L273 TraceCheckUtils]: 60: Hoare triple {37180#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {37181#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:07,750 INFO L273 TraceCheckUtils]: 61: Hoare triple {37181#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37181#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:07,750 INFO L273 TraceCheckUtils]: 62: Hoare triple {37181#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37181#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:07,751 INFO L273 TraceCheckUtils]: 63: Hoare triple {37181#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {37182#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:07,751 INFO L273 TraceCheckUtils]: 64: Hoare triple {37182#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37182#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:07,752 INFO L273 TraceCheckUtils]: 65: Hoare triple {37182#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37182#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:07,753 INFO L273 TraceCheckUtils]: 66: Hoare triple {37182#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {37183#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:07,753 INFO L273 TraceCheckUtils]: 67: Hoare triple {37183#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37183#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:07,754 INFO L273 TraceCheckUtils]: 68: Hoare triple {37183#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37183#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:07,754 INFO L273 TraceCheckUtils]: 69: Hoare triple {37183#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {37184#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:07,755 INFO L273 TraceCheckUtils]: 70: Hoare triple {37184#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37184#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:07,755 INFO L273 TraceCheckUtils]: 71: Hoare triple {37184#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37184#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:07,756 INFO L273 TraceCheckUtils]: 72: Hoare triple {37184#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {37185#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:07,757 INFO L273 TraceCheckUtils]: 73: Hoare triple {37185#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37185#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:07,757 INFO L273 TraceCheckUtils]: 74: Hoare triple {37185#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37185#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:07,758 INFO L273 TraceCheckUtils]: 75: Hoare triple {37185#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {37186#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:07,758 INFO L273 TraceCheckUtils]: 76: Hoare triple {37186#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37186#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:07,759 INFO L273 TraceCheckUtils]: 77: Hoare triple {37186#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37186#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:07,760 INFO L273 TraceCheckUtils]: 78: Hoare triple {37186#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {37187#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:07,760 INFO L273 TraceCheckUtils]: 79: Hoare triple {37187#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37187#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:07,761 INFO L273 TraceCheckUtils]: 80: Hoare triple {37187#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37187#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:07,761 INFO L273 TraceCheckUtils]: 81: Hoare triple {37187#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {37188#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:07,762 INFO L273 TraceCheckUtils]: 82: Hoare triple {37188#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37188#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:07,762 INFO L273 TraceCheckUtils]: 83: Hoare triple {37188#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37188#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:07,763 INFO L273 TraceCheckUtils]: 84: Hoare triple {37188#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {37189#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:07,764 INFO L273 TraceCheckUtils]: 85: Hoare triple {37189#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37189#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:07,764 INFO L273 TraceCheckUtils]: 86: Hoare triple {37189#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37189#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:07,765 INFO L273 TraceCheckUtils]: 87: Hoare triple {37189#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {37190#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:07,765 INFO L273 TraceCheckUtils]: 88: Hoare triple {37190#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37190#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:07,766 INFO L273 TraceCheckUtils]: 89: Hoare triple {37190#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37190#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:07,767 INFO L273 TraceCheckUtils]: 90: Hoare triple {37190#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {37191#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:07,767 INFO L273 TraceCheckUtils]: 91: Hoare triple {37191#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37191#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:07,768 INFO L273 TraceCheckUtils]: 92: Hoare triple {37191#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37191#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:07,768 INFO L273 TraceCheckUtils]: 93: Hoare triple {37191#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {37192#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:07,769 INFO L273 TraceCheckUtils]: 94: Hoare triple {37192#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37192#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:07,769 INFO L273 TraceCheckUtils]: 95: Hoare triple {37192#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37192#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:07,770 INFO L273 TraceCheckUtils]: 96: Hoare triple {37192#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {37193#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:07,771 INFO L273 TraceCheckUtils]: 97: Hoare triple {37193#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37193#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:07,771 INFO L273 TraceCheckUtils]: 98: Hoare triple {37193#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37193#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:07,772 INFO L273 TraceCheckUtils]: 99: Hoare triple {37193#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {37194#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:07,772 INFO L273 TraceCheckUtils]: 100: Hoare triple {37194#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37194#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:07,773 INFO L273 TraceCheckUtils]: 101: Hoare triple {37194#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37194#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:07,774 INFO L273 TraceCheckUtils]: 102: Hoare triple {37194#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {37195#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:07,774 INFO L273 TraceCheckUtils]: 103: Hoare triple {37195#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37195#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:07,775 INFO L273 TraceCheckUtils]: 104: Hoare triple {37195#(<= main_~i~0 33)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37195#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:07,775 INFO L273 TraceCheckUtils]: 105: Hoare triple {37195#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {37196#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:07,776 INFO L273 TraceCheckUtils]: 106: Hoare triple {37196#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37196#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:07,776 INFO L273 TraceCheckUtils]: 107: Hoare triple {37196#(<= main_~i~0 34)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37196#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:07,777 INFO L273 TraceCheckUtils]: 108: Hoare triple {37196#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {37197#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:07,778 INFO L273 TraceCheckUtils]: 109: Hoare triple {37197#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37197#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:07,778 INFO L273 TraceCheckUtils]: 110: Hoare triple {37197#(<= main_~i~0 35)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37197#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:07,779 INFO L273 TraceCheckUtils]: 111: Hoare triple {37197#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {37198#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:07,779 INFO L273 TraceCheckUtils]: 112: Hoare triple {37198#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {37198#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:07,780 INFO L273 TraceCheckUtils]: 113: Hoare triple {37198#(<= main_~i~0 36)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37198#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:07,781 INFO L273 TraceCheckUtils]: 114: Hoare triple {37198#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {37199#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:07,781 INFO L273 TraceCheckUtils]: 115: Hoare triple {37199#(<= main_~i~0 37)} assume !(~i~0 < 100000); {37162#false} is VALID [2018-11-23 11:53:07,781 INFO L273 TraceCheckUtils]: 116: Hoare triple {37162#false} assume !(0 != ~swapped~0); {37162#false} is VALID [2018-11-23 11:53:07,782 INFO L273 TraceCheckUtils]: 117: Hoare triple {37162#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {37162#false} is VALID [2018-11-23 11:53:07,782 INFO L273 TraceCheckUtils]: 118: Hoare triple {37162#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {37162#false} is VALID [2018-11-23 11:53:07,782 INFO L273 TraceCheckUtils]: 119: Hoare triple {37162#false} assume !!(~y~0 < 100000);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); {37162#false} is VALID [2018-11-23 11:53:07,782 INFO L256 TraceCheckUtils]: 120: Hoare triple {37162#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {37162#false} is VALID [2018-11-23 11:53:07,782 INFO L273 TraceCheckUtils]: 121: Hoare triple {37162#false} ~cond := #in~cond; {37162#false} is VALID [2018-11-23 11:53:07,783 INFO L273 TraceCheckUtils]: 122: Hoare triple {37162#false} assume 0 == ~cond; {37162#false} is VALID [2018-11-23 11:53:07,783 INFO L273 TraceCheckUtils]: 123: Hoare triple {37162#false} assume !false; {37162#false} is VALID [2018-11-23 11:53:07,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1927 backedges. 1 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:53:07,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:07,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2018-11-23 11:53:07,814 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 124 [2018-11-23 11:53:07,814 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:07,814 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states. [2018-11-23 11:53:07,932 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:07,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-23 11:53:07,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-23 11:53:07,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 11:53:07,934 INFO L87 Difference]: Start difference. First operand 237 states and 312 transitions. Second operand 40 states. [2018-11-23 11:53:08,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:08,998 INFO L93 Difference]: Finished difference Result 478 states and 634 transitions. [2018-11-23 11:53:08,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-23 11:53:08,998 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 124 [2018-11-23 11:53:08,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:08,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 11:53:09,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 197 transitions. [2018-11-23 11:53:09,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 11:53:09,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 197 transitions. [2018-11-23 11:53:09,001 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 197 transitions. [2018-11-23 11:53:09,197 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:09,203 INFO L225 Difference]: With dead ends: 478 [2018-11-23 11:53:09,203 INFO L226 Difference]: Without dead ends: 247 [2018-11-23 11:53:09,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 11:53:09,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-11-23 11:53:09,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 243. [2018-11-23 11:53:09,294 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:09,294 INFO L82 GeneralOperation]: Start isEquivalent. First operand 247 states. Second operand 243 states. [2018-11-23 11:53:09,294 INFO L74 IsIncluded]: Start isIncluded. First operand 247 states. Second operand 243 states. [2018-11-23 11:53:09,294 INFO L87 Difference]: Start difference. First operand 247 states. Second operand 243 states. [2018-11-23 11:53:09,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:09,300 INFO L93 Difference]: Finished difference Result 247 states and 326 transitions. [2018-11-23 11:53:09,300 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 326 transitions. [2018-11-23 11:53:09,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:09,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:09,300 INFO L74 IsIncluded]: Start isIncluded. First operand 243 states. Second operand 247 states. [2018-11-23 11:53:09,300 INFO L87 Difference]: Start difference. First operand 243 states. Second operand 247 states. [2018-11-23 11:53:09,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:09,304 INFO L93 Difference]: Finished difference Result 247 states and 326 transitions. [2018-11-23 11:53:09,304 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 326 transitions. [2018-11-23 11:53:09,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:09,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:09,305 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:09,305 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:09,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-11-23 11:53:09,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 320 transitions. [2018-11-23 11:53:09,309 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 320 transitions. Word has length 124 [2018-11-23 11:53:09,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:09,309 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 320 transitions. [2018-11-23 11:53:09,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-23 11:53:09,310 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 320 transitions. [2018-11-23 11:53:09,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-23 11:53:09,310 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:09,311 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:53:09,311 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:09,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:09,311 INFO L82 PathProgramCache]: Analyzing trace with hash 45057480, now seen corresponding path program 37 times [2018-11-23 11:53:09,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:09,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:09,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:09,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:09,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:09,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:10,270 INFO L256 TraceCheckUtils]: 0: Hoare triple {39036#true} call ULTIMATE.init(); {39036#true} is VALID [2018-11-23 11:53:10,270 INFO L273 TraceCheckUtils]: 1: Hoare triple {39036#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {39036#true} is VALID [2018-11-23 11:53:10,270 INFO L273 TraceCheckUtils]: 2: Hoare triple {39036#true} assume true; {39036#true} is VALID [2018-11-23 11:53:10,270 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {39036#true} {39036#true} #79#return; {39036#true} is VALID [2018-11-23 11:53:10,270 INFO L256 TraceCheckUtils]: 4: Hoare triple {39036#true} call #t~ret8 := main(); {39036#true} is VALID [2018-11-23 11:53:10,271 INFO L273 TraceCheckUtils]: 5: Hoare triple {39036#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {39036#true} is VALID [2018-11-23 11:53:10,271 INFO L273 TraceCheckUtils]: 6: Hoare triple {39036#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {39038#(= main_~i~0 1)} is VALID [2018-11-23 11:53:10,271 INFO L273 TraceCheckUtils]: 7: Hoare triple {39038#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39038#(= main_~i~0 1)} is VALID [2018-11-23 11:53:10,271 INFO L273 TraceCheckUtils]: 8: Hoare triple {39038#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39038#(= main_~i~0 1)} is VALID [2018-11-23 11:53:10,272 INFO L273 TraceCheckUtils]: 9: Hoare triple {39038#(= main_~i~0 1)} ~i~0 := 1 + ~i~0; {39039#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:10,272 INFO L273 TraceCheckUtils]: 10: Hoare triple {39039#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39039#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:10,273 INFO L273 TraceCheckUtils]: 11: Hoare triple {39039#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39039#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:10,273 INFO L273 TraceCheckUtils]: 12: Hoare triple {39039#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {39040#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:10,273 INFO L273 TraceCheckUtils]: 13: Hoare triple {39040#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39040#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:10,274 INFO L273 TraceCheckUtils]: 14: Hoare triple {39040#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39040#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:10,274 INFO L273 TraceCheckUtils]: 15: Hoare triple {39040#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {39041#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:10,275 INFO L273 TraceCheckUtils]: 16: Hoare triple {39041#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39041#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:10,276 INFO L273 TraceCheckUtils]: 17: Hoare triple {39041#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39041#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:10,276 INFO L273 TraceCheckUtils]: 18: Hoare triple {39041#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {39042#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:10,277 INFO L273 TraceCheckUtils]: 19: Hoare triple {39042#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39042#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:10,277 INFO L273 TraceCheckUtils]: 20: Hoare triple {39042#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39042#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:10,278 INFO L273 TraceCheckUtils]: 21: Hoare triple {39042#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {39043#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:10,278 INFO L273 TraceCheckUtils]: 22: Hoare triple {39043#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39043#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:10,279 INFO L273 TraceCheckUtils]: 23: Hoare triple {39043#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39043#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:10,280 INFO L273 TraceCheckUtils]: 24: Hoare triple {39043#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {39044#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:10,280 INFO L273 TraceCheckUtils]: 25: Hoare triple {39044#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39044#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:10,281 INFO L273 TraceCheckUtils]: 26: Hoare triple {39044#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39044#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:10,281 INFO L273 TraceCheckUtils]: 27: Hoare triple {39044#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {39045#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:10,282 INFO L273 TraceCheckUtils]: 28: Hoare triple {39045#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39045#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:10,282 INFO L273 TraceCheckUtils]: 29: Hoare triple {39045#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39045#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:10,283 INFO L273 TraceCheckUtils]: 30: Hoare triple {39045#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {39046#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:10,284 INFO L273 TraceCheckUtils]: 31: Hoare triple {39046#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39046#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:10,284 INFO L273 TraceCheckUtils]: 32: Hoare triple {39046#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39046#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:10,285 INFO L273 TraceCheckUtils]: 33: Hoare triple {39046#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {39047#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:10,285 INFO L273 TraceCheckUtils]: 34: Hoare triple {39047#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39047#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:10,286 INFO L273 TraceCheckUtils]: 35: Hoare triple {39047#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39047#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:10,287 INFO L273 TraceCheckUtils]: 36: Hoare triple {39047#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {39048#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:10,287 INFO L273 TraceCheckUtils]: 37: Hoare triple {39048#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39048#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:10,288 INFO L273 TraceCheckUtils]: 38: Hoare triple {39048#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39048#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:10,288 INFO L273 TraceCheckUtils]: 39: Hoare triple {39048#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {39049#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:10,289 INFO L273 TraceCheckUtils]: 40: Hoare triple {39049#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39049#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:10,289 INFO L273 TraceCheckUtils]: 41: Hoare triple {39049#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39049#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:10,290 INFO L273 TraceCheckUtils]: 42: Hoare triple {39049#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {39050#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:10,291 INFO L273 TraceCheckUtils]: 43: Hoare triple {39050#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39050#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:10,291 INFO L273 TraceCheckUtils]: 44: Hoare triple {39050#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39050#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:10,292 INFO L273 TraceCheckUtils]: 45: Hoare triple {39050#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {39051#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:10,292 INFO L273 TraceCheckUtils]: 46: Hoare triple {39051#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39051#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:10,293 INFO L273 TraceCheckUtils]: 47: Hoare triple {39051#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39051#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:10,294 INFO L273 TraceCheckUtils]: 48: Hoare triple {39051#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {39052#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:10,294 INFO L273 TraceCheckUtils]: 49: Hoare triple {39052#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39052#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:10,295 INFO L273 TraceCheckUtils]: 50: Hoare triple {39052#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39052#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:10,295 INFO L273 TraceCheckUtils]: 51: Hoare triple {39052#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {39053#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:10,296 INFO L273 TraceCheckUtils]: 52: Hoare triple {39053#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39053#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:10,296 INFO L273 TraceCheckUtils]: 53: Hoare triple {39053#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39053#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:10,297 INFO L273 TraceCheckUtils]: 54: Hoare triple {39053#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {39054#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:10,298 INFO L273 TraceCheckUtils]: 55: Hoare triple {39054#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39054#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:10,298 INFO L273 TraceCheckUtils]: 56: Hoare triple {39054#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39054#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:10,299 INFO L273 TraceCheckUtils]: 57: Hoare triple {39054#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {39055#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:10,299 INFO L273 TraceCheckUtils]: 58: Hoare triple {39055#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39055#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:10,300 INFO L273 TraceCheckUtils]: 59: Hoare triple {39055#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39055#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:10,301 INFO L273 TraceCheckUtils]: 60: Hoare triple {39055#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {39056#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:10,301 INFO L273 TraceCheckUtils]: 61: Hoare triple {39056#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39056#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:10,302 INFO L273 TraceCheckUtils]: 62: Hoare triple {39056#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39056#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:10,302 INFO L273 TraceCheckUtils]: 63: Hoare triple {39056#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {39057#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:10,303 INFO L273 TraceCheckUtils]: 64: Hoare triple {39057#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39057#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:10,303 INFO L273 TraceCheckUtils]: 65: Hoare triple {39057#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39057#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:10,304 INFO L273 TraceCheckUtils]: 66: Hoare triple {39057#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {39058#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:10,305 INFO L273 TraceCheckUtils]: 67: Hoare triple {39058#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39058#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:10,305 INFO L273 TraceCheckUtils]: 68: Hoare triple {39058#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39058#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:10,306 INFO L273 TraceCheckUtils]: 69: Hoare triple {39058#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {39059#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:10,306 INFO L273 TraceCheckUtils]: 70: Hoare triple {39059#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39059#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:10,307 INFO L273 TraceCheckUtils]: 71: Hoare triple {39059#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39059#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:10,308 INFO L273 TraceCheckUtils]: 72: Hoare triple {39059#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {39060#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:10,308 INFO L273 TraceCheckUtils]: 73: Hoare triple {39060#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39060#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:10,309 INFO L273 TraceCheckUtils]: 74: Hoare triple {39060#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39060#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:10,309 INFO L273 TraceCheckUtils]: 75: Hoare triple {39060#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {39061#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:10,310 INFO L273 TraceCheckUtils]: 76: Hoare triple {39061#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39061#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:10,310 INFO L273 TraceCheckUtils]: 77: Hoare triple {39061#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39061#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:10,311 INFO L273 TraceCheckUtils]: 78: Hoare triple {39061#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {39062#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:10,312 INFO L273 TraceCheckUtils]: 79: Hoare triple {39062#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39062#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:10,312 INFO L273 TraceCheckUtils]: 80: Hoare triple {39062#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39062#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:10,313 INFO L273 TraceCheckUtils]: 81: Hoare triple {39062#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {39063#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:10,313 INFO L273 TraceCheckUtils]: 82: Hoare triple {39063#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39063#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:10,314 INFO L273 TraceCheckUtils]: 83: Hoare triple {39063#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39063#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:10,315 INFO L273 TraceCheckUtils]: 84: Hoare triple {39063#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {39064#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:10,315 INFO L273 TraceCheckUtils]: 85: Hoare triple {39064#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39064#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:10,316 INFO L273 TraceCheckUtils]: 86: Hoare triple {39064#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39064#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:10,316 INFO L273 TraceCheckUtils]: 87: Hoare triple {39064#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {39065#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:10,317 INFO L273 TraceCheckUtils]: 88: Hoare triple {39065#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39065#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:10,317 INFO L273 TraceCheckUtils]: 89: Hoare triple {39065#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39065#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:10,318 INFO L273 TraceCheckUtils]: 90: Hoare triple {39065#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {39066#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:10,319 INFO L273 TraceCheckUtils]: 91: Hoare triple {39066#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39066#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:10,319 INFO L273 TraceCheckUtils]: 92: Hoare triple {39066#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39066#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:10,320 INFO L273 TraceCheckUtils]: 93: Hoare triple {39066#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {39067#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:10,320 INFO L273 TraceCheckUtils]: 94: Hoare triple {39067#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39067#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:10,321 INFO L273 TraceCheckUtils]: 95: Hoare triple {39067#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39067#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:10,322 INFO L273 TraceCheckUtils]: 96: Hoare triple {39067#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {39068#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:10,322 INFO L273 TraceCheckUtils]: 97: Hoare triple {39068#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39068#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:10,323 INFO L273 TraceCheckUtils]: 98: Hoare triple {39068#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39068#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:10,323 INFO L273 TraceCheckUtils]: 99: Hoare triple {39068#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {39069#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:10,324 INFO L273 TraceCheckUtils]: 100: Hoare triple {39069#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39069#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:10,324 INFO L273 TraceCheckUtils]: 101: Hoare triple {39069#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39069#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:10,325 INFO L273 TraceCheckUtils]: 102: Hoare triple {39069#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {39070#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:10,326 INFO L273 TraceCheckUtils]: 103: Hoare triple {39070#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39070#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:10,326 INFO L273 TraceCheckUtils]: 104: Hoare triple {39070#(<= main_~i~0 33)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39070#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:10,327 INFO L273 TraceCheckUtils]: 105: Hoare triple {39070#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {39071#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:10,327 INFO L273 TraceCheckUtils]: 106: Hoare triple {39071#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39071#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:10,328 INFO L273 TraceCheckUtils]: 107: Hoare triple {39071#(<= main_~i~0 34)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39071#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:10,329 INFO L273 TraceCheckUtils]: 108: Hoare triple {39071#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {39072#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:10,329 INFO L273 TraceCheckUtils]: 109: Hoare triple {39072#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39072#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:10,330 INFO L273 TraceCheckUtils]: 110: Hoare triple {39072#(<= main_~i~0 35)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39072#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:10,330 INFO L273 TraceCheckUtils]: 111: Hoare triple {39072#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {39073#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:10,331 INFO L273 TraceCheckUtils]: 112: Hoare triple {39073#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39073#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:10,331 INFO L273 TraceCheckUtils]: 113: Hoare triple {39073#(<= main_~i~0 36)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39073#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:10,332 INFO L273 TraceCheckUtils]: 114: Hoare triple {39073#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {39074#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:10,333 INFO L273 TraceCheckUtils]: 115: Hoare triple {39074#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39074#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:10,333 INFO L273 TraceCheckUtils]: 116: Hoare triple {39074#(<= main_~i~0 37)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39074#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:10,334 INFO L273 TraceCheckUtils]: 117: Hoare triple {39074#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {39075#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:10,335 INFO L273 TraceCheckUtils]: 118: Hoare triple {39075#(<= main_~i~0 38)} assume !(~i~0 < 100000); {39037#false} is VALID [2018-11-23 11:53:10,335 INFO L273 TraceCheckUtils]: 119: Hoare triple {39037#false} assume !(0 != ~swapped~0); {39037#false} is VALID [2018-11-23 11:53:10,335 INFO L273 TraceCheckUtils]: 120: Hoare triple {39037#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {39037#false} is VALID [2018-11-23 11:53:10,335 INFO L273 TraceCheckUtils]: 121: Hoare triple {39037#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {39037#false} is VALID [2018-11-23 11:53:10,335 INFO L273 TraceCheckUtils]: 122: Hoare triple {39037#false} assume !!(~y~0 < 100000);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); {39037#false} is VALID [2018-11-23 11:53:10,335 INFO L256 TraceCheckUtils]: 123: Hoare triple {39037#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {39037#false} is VALID [2018-11-23 11:53:10,336 INFO L273 TraceCheckUtils]: 124: Hoare triple {39037#false} ~cond := #in~cond; {39037#false} is VALID [2018-11-23 11:53:10,336 INFO L273 TraceCheckUtils]: 125: Hoare triple {39037#false} assume 0 == ~cond; {39037#false} is VALID [2018-11-23 11:53:10,336 INFO L273 TraceCheckUtils]: 126: Hoare triple {39037#false} assume !false; {39037#false} is VALID [2018-11-23 11:53:10,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2036 backedges. 1 proven. 2035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:53:10,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:10,348 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 11:53:10,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:53:10,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:10,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:10,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:10,816 INFO L256 TraceCheckUtils]: 0: Hoare triple {39036#true} call ULTIMATE.init(); {39036#true} is VALID [2018-11-23 11:53:10,816 INFO L273 TraceCheckUtils]: 1: Hoare triple {39036#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {39036#true} is VALID [2018-11-23 11:53:10,816 INFO L273 TraceCheckUtils]: 2: Hoare triple {39036#true} assume true; {39036#true} is VALID [2018-11-23 11:53:10,817 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {39036#true} {39036#true} #79#return; {39036#true} is VALID [2018-11-23 11:53:10,817 INFO L256 TraceCheckUtils]: 4: Hoare triple {39036#true} call #t~ret8 := main(); {39036#true} is VALID [2018-11-23 11:53:10,817 INFO L273 TraceCheckUtils]: 5: Hoare triple {39036#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {39036#true} is VALID [2018-11-23 11:53:10,817 INFO L273 TraceCheckUtils]: 6: Hoare triple {39036#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {39097#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:10,818 INFO L273 TraceCheckUtils]: 7: Hoare triple {39097#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39097#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:10,818 INFO L273 TraceCheckUtils]: 8: Hoare triple {39097#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39097#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:10,820 INFO L273 TraceCheckUtils]: 9: Hoare triple {39097#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {39039#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:10,820 INFO L273 TraceCheckUtils]: 10: Hoare triple {39039#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39039#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:10,820 INFO L273 TraceCheckUtils]: 11: Hoare triple {39039#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39039#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:10,821 INFO L273 TraceCheckUtils]: 12: Hoare triple {39039#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {39040#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:10,821 INFO L273 TraceCheckUtils]: 13: Hoare triple {39040#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39040#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:10,821 INFO L273 TraceCheckUtils]: 14: Hoare triple {39040#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39040#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:10,822 INFO L273 TraceCheckUtils]: 15: Hoare triple {39040#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {39041#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:10,822 INFO L273 TraceCheckUtils]: 16: Hoare triple {39041#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39041#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:10,822 INFO L273 TraceCheckUtils]: 17: Hoare triple {39041#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39041#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:10,823 INFO L273 TraceCheckUtils]: 18: Hoare triple {39041#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {39042#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:10,823 INFO L273 TraceCheckUtils]: 19: Hoare triple {39042#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39042#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:10,824 INFO L273 TraceCheckUtils]: 20: Hoare triple {39042#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39042#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:10,825 INFO L273 TraceCheckUtils]: 21: Hoare triple {39042#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {39043#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:10,825 INFO L273 TraceCheckUtils]: 22: Hoare triple {39043#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39043#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:10,826 INFO L273 TraceCheckUtils]: 23: Hoare triple {39043#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39043#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:10,828 INFO L273 TraceCheckUtils]: 24: Hoare triple {39043#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {39044#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:10,829 INFO L273 TraceCheckUtils]: 25: Hoare triple {39044#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39044#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:10,829 INFO L273 TraceCheckUtils]: 26: Hoare triple {39044#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39044#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:10,830 INFO L273 TraceCheckUtils]: 27: Hoare triple {39044#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {39045#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:10,830 INFO L273 TraceCheckUtils]: 28: Hoare triple {39045#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39045#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:10,831 INFO L273 TraceCheckUtils]: 29: Hoare triple {39045#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39045#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:10,831 INFO L273 TraceCheckUtils]: 30: Hoare triple {39045#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {39046#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:10,831 INFO L273 TraceCheckUtils]: 31: Hoare triple {39046#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39046#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:10,832 INFO L273 TraceCheckUtils]: 32: Hoare triple {39046#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39046#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:10,832 INFO L273 TraceCheckUtils]: 33: Hoare triple {39046#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {39047#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:10,833 INFO L273 TraceCheckUtils]: 34: Hoare triple {39047#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39047#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:10,833 INFO L273 TraceCheckUtils]: 35: Hoare triple {39047#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39047#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:10,834 INFO L273 TraceCheckUtils]: 36: Hoare triple {39047#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {39048#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:10,834 INFO L273 TraceCheckUtils]: 37: Hoare triple {39048#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39048#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:10,835 INFO L273 TraceCheckUtils]: 38: Hoare triple {39048#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39048#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:10,836 INFO L273 TraceCheckUtils]: 39: Hoare triple {39048#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {39049#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:10,836 INFO L273 TraceCheckUtils]: 40: Hoare triple {39049#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39049#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:10,837 INFO L273 TraceCheckUtils]: 41: Hoare triple {39049#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39049#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:10,837 INFO L273 TraceCheckUtils]: 42: Hoare triple {39049#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {39050#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:10,838 INFO L273 TraceCheckUtils]: 43: Hoare triple {39050#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39050#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:10,838 INFO L273 TraceCheckUtils]: 44: Hoare triple {39050#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39050#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:10,839 INFO L273 TraceCheckUtils]: 45: Hoare triple {39050#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {39051#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:10,840 INFO L273 TraceCheckUtils]: 46: Hoare triple {39051#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39051#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:10,840 INFO L273 TraceCheckUtils]: 47: Hoare triple {39051#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39051#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:10,841 INFO L273 TraceCheckUtils]: 48: Hoare triple {39051#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {39052#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:10,841 INFO L273 TraceCheckUtils]: 49: Hoare triple {39052#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39052#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:10,842 INFO L273 TraceCheckUtils]: 50: Hoare triple {39052#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39052#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:10,842 INFO L273 TraceCheckUtils]: 51: Hoare triple {39052#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {39053#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:10,843 INFO L273 TraceCheckUtils]: 52: Hoare triple {39053#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39053#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:10,843 INFO L273 TraceCheckUtils]: 53: Hoare triple {39053#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39053#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:10,844 INFO L273 TraceCheckUtils]: 54: Hoare triple {39053#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {39054#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:10,844 INFO L273 TraceCheckUtils]: 55: Hoare triple {39054#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39054#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:10,866 INFO L273 TraceCheckUtils]: 56: Hoare triple {39054#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39054#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:10,880 INFO L273 TraceCheckUtils]: 57: Hoare triple {39054#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {39055#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:10,888 INFO L273 TraceCheckUtils]: 58: Hoare triple {39055#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39055#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:10,892 INFO L273 TraceCheckUtils]: 59: Hoare triple {39055#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39055#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:10,892 INFO L273 TraceCheckUtils]: 60: Hoare triple {39055#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {39056#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:10,893 INFO L273 TraceCheckUtils]: 61: Hoare triple {39056#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39056#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:10,893 INFO L273 TraceCheckUtils]: 62: Hoare triple {39056#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39056#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:10,893 INFO L273 TraceCheckUtils]: 63: Hoare triple {39056#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {39057#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:10,894 INFO L273 TraceCheckUtils]: 64: Hoare triple {39057#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39057#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:10,894 INFO L273 TraceCheckUtils]: 65: Hoare triple {39057#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39057#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:10,894 INFO L273 TraceCheckUtils]: 66: Hoare triple {39057#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {39058#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:10,895 INFO L273 TraceCheckUtils]: 67: Hoare triple {39058#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39058#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:10,895 INFO L273 TraceCheckUtils]: 68: Hoare triple {39058#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39058#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:10,895 INFO L273 TraceCheckUtils]: 69: Hoare triple {39058#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {39059#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:10,896 INFO L273 TraceCheckUtils]: 70: Hoare triple {39059#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39059#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:10,896 INFO L273 TraceCheckUtils]: 71: Hoare triple {39059#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39059#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:10,897 INFO L273 TraceCheckUtils]: 72: Hoare triple {39059#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {39060#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:10,897 INFO L273 TraceCheckUtils]: 73: Hoare triple {39060#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39060#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:10,898 INFO L273 TraceCheckUtils]: 74: Hoare triple {39060#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39060#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:10,899 INFO L273 TraceCheckUtils]: 75: Hoare triple {39060#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {39061#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:10,899 INFO L273 TraceCheckUtils]: 76: Hoare triple {39061#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39061#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:10,899 INFO L273 TraceCheckUtils]: 77: Hoare triple {39061#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39061#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:10,900 INFO L273 TraceCheckUtils]: 78: Hoare triple {39061#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {39062#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:10,901 INFO L273 TraceCheckUtils]: 79: Hoare triple {39062#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39062#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:10,901 INFO L273 TraceCheckUtils]: 80: Hoare triple {39062#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39062#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:10,902 INFO L273 TraceCheckUtils]: 81: Hoare triple {39062#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {39063#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:10,902 INFO L273 TraceCheckUtils]: 82: Hoare triple {39063#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39063#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:10,903 INFO L273 TraceCheckUtils]: 83: Hoare triple {39063#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39063#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:10,903 INFO L273 TraceCheckUtils]: 84: Hoare triple {39063#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {39064#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:10,904 INFO L273 TraceCheckUtils]: 85: Hoare triple {39064#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39064#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:10,904 INFO L273 TraceCheckUtils]: 86: Hoare triple {39064#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39064#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:10,905 INFO L273 TraceCheckUtils]: 87: Hoare triple {39064#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {39065#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:10,905 INFO L273 TraceCheckUtils]: 88: Hoare triple {39065#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39065#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:10,906 INFO L273 TraceCheckUtils]: 89: Hoare triple {39065#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39065#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:10,907 INFO L273 TraceCheckUtils]: 90: Hoare triple {39065#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {39066#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:10,907 INFO L273 TraceCheckUtils]: 91: Hoare triple {39066#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39066#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:10,908 INFO L273 TraceCheckUtils]: 92: Hoare triple {39066#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39066#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:10,908 INFO L273 TraceCheckUtils]: 93: Hoare triple {39066#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {39067#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:10,909 INFO L273 TraceCheckUtils]: 94: Hoare triple {39067#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39067#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:10,909 INFO L273 TraceCheckUtils]: 95: Hoare triple {39067#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39067#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:10,910 INFO L273 TraceCheckUtils]: 96: Hoare triple {39067#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {39068#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:10,910 INFO L273 TraceCheckUtils]: 97: Hoare triple {39068#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39068#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:10,911 INFO L273 TraceCheckUtils]: 98: Hoare triple {39068#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39068#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:10,911 INFO L273 TraceCheckUtils]: 99: Hoare triple {39068#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {39069#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:10,912 INFO L273 TraceCheckUtils]: 100: Hoare triple {39069#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39069#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:10,912 INFO L273 TraceCheckUtils]: 101: Hoare triple {39069#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39069#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:10,913 INFO L273 TraceCheckUtils]: 102: Hoare triple {39069#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {39070#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:10,914 INFO L273 TraceCheckUtils]: 103: Hoare triple {39070#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39070#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:10,914 INFO L273 TraceCheckUtils]: 104: Hoare triple {39070#(<= main_~i~0 33)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39070#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:10,915 INFO L273 TraceCheckUtils]: 105: Hoare triple {39070#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {39071#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:10,915 INFO L273 TraceCheckUtils]: 106: Hoare triple {39071#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39071#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:10,916 INFO L273 TraceCheckUtils]: 107: Hoare triple {39071#(<= main_~i~0 34)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39071#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:10,916 INFO L273 TraceCheckUtils]: 108: Hoare triple {39071#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {39072#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:10,917 INFO L273 TraceCheckUtils]: 109: Hoare triple {39072#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39072#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:10,917 INFO L273 TraceCheckUtils]: 110: Hoare triple {39072#(<= main_~i~0 35)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39072#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:10,918 INFO L273 TraceCheckUtils]: 111: Hoare triple {39072#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {39073#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:10,919 INFO L273 TraceCheckUtils]: 112: Hoare triple {39073#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39073#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:10,919 INFO L273 TraceCheckUtils]: 113: Hoare triple {39073#(<= main_~i~0 36)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39073#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:10,920 INFO L273 TraceCheckUtils]: 114: Hoare triple {39073#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {39074#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:10,920 INFO L273 TraceCheckUtils]: 115: Hoare triple {39074#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {39074#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:10,921 INFO L273 TraceCheckUtils]: 116: Hoare triple {39074#(<= main_~i~0 37)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39074#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:10,921 INFO L273 TraceCheckUtils]: 117: Hoare triple {39074#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {39075#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:10,922 INFO L273 TraceCheckUtils]: 118: Hoare triple {39075#(<= main_~i~0 38)} assume !(~i~0 < 100000); {39037#false} is VALID [2018-11-23 11:53:10,922 INFO L273 TraceCheckUtils]: 119: Hoare triple {39037#false} assume !(0 != ~swapped~0); {39037#false} is VALID [2018-11-23 11:53:10,922 INFO L273 TraceCheckUtils]: 120: Hoare triple {39037#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {39037#false} is VALID [2018-11-23 11:53:10,923 INFO L273 TraceCheckUtils]: 121: Hoare triple {39037#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {39037#false} is VALID [2018-11-23 11:53:10,923 INFO L273 TraceCheckUtils]: 122: Hoare triple {39037#false} assume !!(~y~0 < 100000);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); {39037#false} is VALID [2018-11-23 11:53:10,923 INFO L256 TraceCheckUtils]: 123: Hoare triple {39037#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {39037#false} is VALID [2018-11-23 11:53:10,923 INFO L273 TraceCheckUtils]: 124: Hoare triple {39037#false} ~cond := #in~cond; {39037#false} is VALID [2018-11-23 11:53:10,923 INFO L273 TraceCheckUtils]: 125: Hoare triple {39037#false} assume 0 == ~cond; {39037#false} is VALID [2018-11-23 11:53:10,924 INFO L273 TraceCheckUtils]: 126: Hoare triple {39037#false} assume !false; {39037#false} is VALID [2018-11-23 11:53:10,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2036 backedges. 1 proven. 2035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:53:10,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:10,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2018-11-23 11:53:10,954 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 127 [2018-11-23 11:53:10,954 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:10,955 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states. [2018-11-23 11:53:11,110 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:53:11,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-23 11:53:11,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-23 11:53:11,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 11:53:11,112 INFO L87 Difference]: Start difference. First operand 243 states and 320 transitions. Second operand 41 states. [2018-11-23 11:53:12,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:12,084 INFO L93 Difference]: Finished difference Result 490 states and 650 transitions. [2018-11-23 11:53:12,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-23 11:53:12,084 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 127 [2018-11-23 11:53:12,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:12,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 11:53:12,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 201 transitions. [2018-11-23 11:53:12,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 11:53:12,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 201 transitions. [2018-11-23 11:53:12,087 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 201 transitions. [2018-11-23 11:53:12,274 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 201 edges. 201 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:12,280 INFO L225 Difference]: With dead ends: 490 [2018-11-23 11:53:12,280 INFO L226 Difference]: Without dead ends: 253 [2018-11-23 11:53:12,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 11:53:12,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-11-23 11:53:12,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 249. [2018-11-23 11:53:12,423 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:12,423 INFO L82 GeneralOperation]: Start isEquivalent. First operand 253 states. Second operand 249 states. [2018-11-23 11:53:12,423 INFO L74 IsIncluded]: Start isIncluded. First operand 253 states. Second operand 249 states. [2018-11-23 11:53:12,424 INFO L87 Difference]: Start difference. First operand 253 states. Second operand 249 states. [2018-11-23 11:53:12,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:12,428 INFO L93 Difference]: Finished difference Result 253 states and 334 transitions. [2018-11-23 11:53:12,428 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 334 transitions. [2018-11-23 11:53:12,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:12,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:12,429 INFO L74 IsIncluded]: Start isIncluded. First operand 249 states. Second operand 253 states. [2018-11-23 11:53:12,429 INFO L87 Difference]: Start difference. First operand 249 states. Second operand 253 states. [2018-11-23 11:53:12,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:12,433 INFO L93 Difference]: Finished difference Result 253 states and 334 transitions. [2018-11-23 11:53:12,433 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 334 transitions. [2018-11-23 11:53:12,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:12,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:12,433 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:12,433 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:12,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-11-23 11:53:12,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 328 transitions. [2018-11-23 11:53:12,437 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 328 transitions. Word has length 127 [2018-11-23 11:53:12,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:12,437 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 328 transitions. [2018-11-23 11:53:12,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-23 11:53:12,437 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 328 transitions. [2018-11-23 11:53:12,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-23 11:53:12,438 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:12,438 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:53:12,438 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:12,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:12,439 INFO L82 PathProgramCache]: Analyzing trace with hash 990250161, now seen corresponding path program 38 times [2018-11-23 11:53:12,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:12,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:12,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:12,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:53:12,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:12,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:13,462 INFO L256 TraceCheckUtils]: 0: Hoare triple {40957#true} call ULTIMATE.init(); {40957#true} is VALID [2018-11-23 11:53:13,462 INFO L273 TraceCheckUtils]: 1: Hoare triple {40957#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {40957#true} is VALID [2018-11-23 11:53:13,462 INFO L273 TraceCheckUtils]: 2: Hoare triple {40957#true} assume true; {40957#true} is VALID [2018-11-23 11:53:13,462 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {40957#true} {40957#true} #79#return; {40957#true} is VALID [2018-11-23 11:53:13,463 INFO L256 TraceCheckUtils]: 4: Hoare triple {40957#true} call #t~ret8 := main(); {40957#true} is VALID [2018-11-23 11:53:13,463 INFO L273 TraceCheckUtils]: 5: Hoare triple {40957#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {40957#true} is VALID [2018-11-23 11:53:13,463 INFO L273 TraceCheckUtils]: 6: Hoare triple {40957#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {40959#(= main_~i~0 1)} is VALID [2018-11-23 11:53:13,463 INFO L273 TraceCheckUtils]: 7: Hoare triple {40959#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40959#(= main_~i~0 1)} is VALID [2018-11-23 11:53:13,464 INFO L273 TraceCheckUtils]: 8: Hoare triple {40959#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40959#(= main_~i~0 1)} is VALID [2018-11-23 11:53:13,464 INFO L273 TraceCheckUtils]: 9: Hoare triple {40959#(= main_~i~0 1)} ~i~0 := 1 + ~i~0; {40960#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:13,464 INFO L273 TraceCheckUtils]: 10: Hoare triple {40960#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40960#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:13,465 INFO L273 TraceCheckUtils]: 11: Hoare triple {40960#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40960#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:13,465 INFO L273 TraceCheckUtils]: 12: Hoare triple {40960#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {40961#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:13,465 INFO L273 TraceCheckUtils]: 13: Hoare triple {40961#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40961#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:13,466 INFO L273 TraceCheckUtils]: 14: Hoare triple {40961#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40961#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:13,466 INFO L273 TraceCheckUtils]: 15: Hoare triple {40961#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {40962#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:13,466 INFO L273 TraceCheckUtils]: 16: Hoare triple {40962#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40962#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:13,467 INFO L273 TraceCheckUtils]: 17: Hoare triple {40962#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40962#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:13,467 INFO L273 TraceCheckUtils]: 18: Hoare triple {40962#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {40963#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:13,468 INFO L273 TraceCheckUtils]: 19: Hoare triple {40963#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40963#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:13,468 INFO L273 TraceCheckUtils]: 20: Hoare triple {40963#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40963#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:13,469 INFO L273 TraceCheckUtils]: 21: Hoare triple {40963#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {40964#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:13,470 INFO L273 TraceCheckUtils]: 22: Hoare triple {40964#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40964#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:13,470 INFO L273 TraceCheckUtils]: 23: Hoare triple {40964#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40964#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:13,471 INFO L273 TraceCheckUtils]: 24: Hoare triple {40964#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {40965#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:13,471 INFO L273 TraceCheckUtils]: 25: Hoare triple {40965#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40965#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:13,472 INFO L273 TraceCheckUtils]: 26: Hoare triple {40965#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40965#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:13,472 INFO L273 TraceCheckUtils]: 27: Hoare triple {40965#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {40966#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:13,473 INFO L273 TraceCheckUtils]: 28: Hoare triple {40966#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40966#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:13,473 INFO L273 TraceCheckUtils]: 29: Hoare triple {40966#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40966#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:13,474 INFO L273 TraceCheckUtils]: 30: Hoare triple {40966#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {40967#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:13,474 INFO L273 TraceCheckUtils]: 31: Hoare triple {40967#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40967#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:13,475 INFO L273 TraceCheckUtils]: 32: Hoare triple {40967#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40967#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:13,476 INFO L273 TraceCheckUtils]: 33: Hoare triple {40967#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {40968#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:13,476 INFO L273 TraceCheckUtils]: 34: Hoare triple {40968#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40968#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:13,477 INFO L273 TraceCheckUtils]: 35: Hoare triple {40968#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40968#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:13,477 INFO L273 TraceCheckUtils]: 36: Hoare triple {40968#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {40969#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:13,478 INFO L273 TraceCheckUtils]: 37: Hoare triple {40969#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40969#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:13,478 INFO L273 TraceCheckUtils]: 38: Hoare triple {40969#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40969#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:13,479 INFO L273 TraceCheckUtils]: 39: Hoare triple {40969#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {40970#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:13,479 INFO L273 TraceCheckUtils]: 40: Hoare triple {40970#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40970#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:13,480 INFO L273 TraceCheckUtils]: 41: Hoare triple {40970#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40970#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:13,480 INFO L273 TraceCheckUtils]: 42: Hoare triple {40970#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {40971#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:13,481 INFO L273 TraceCheckUtils]: 43: Hoare triple {40971#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40971#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:13,481 INFO L273 TraceCheckUtils]: 44: Hoare triple {40971#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40971#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:13,482 INFO L273 TraceCheckUtils]: 45: Hoare triple {40971#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {40972#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:13,483 INFO L273 TraceCheckUtils]: 46: Hoare triple {40972#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40972#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:13,483 INFO L273 TraceCheckUtils]: 47: Hoare triple {40972#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40972#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:13,484 INFO L273 TraceCheckUtils]: 48: Hoare triple {40972#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {40973#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:13,484 INFO L273 TraceCheckUtils]: 49: Hoare triple {40973#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40973#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:13,485 INFO L273 TraceCheckUtils]: 50: Hoare triple {40973#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40973#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:13,485 INFO L273 TraceCheckUtils]: 51: Hoare triple {40973#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {40974#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:13,486 INFO L273 TraceCheckUtils]: 52: Hoare triple {40974#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40974#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:13,486 INFO L273 TraceCheckUtils]: 53: Hoare triple {40974#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40974#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:13,487 INFO L273 TraceCheckUtils]: 54: Hoare triple {40974#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {40975#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:13,487 INFO L273 TraceCheckUtils]: 55: Hoare triple {40975#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40975#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:13,488 INFO L273 TraceCheckUtils]: 56: Hoare triple {40975#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40975#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:13,489 INFO L273 TraceCheckUtils]: 57: Hoare triple {40975#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {40976#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:13,490 INFO L273 TraceCheckUtils]: 58: Hoare triple {40976#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40976#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:13,491 INFO L273 TraceCheckUtils]: 59: Hoare triple {40976#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40976#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:13,492 INFO L273 TraceCheckUtils]: 60: Hoare triple {40976#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {40977#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:13,492 INFO L273 TraceCheckUtils]: 61: Hoare triple {40977#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40977#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:13,493 INFO L273 TraceCheckUtils]: 62: Hoare triple {40977#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40977#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:13,493 INFO L273 TraceCheckUtils]: 63: Hoare triple {40977#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {40978#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:13,494 INFO L273 TraceCheckUtils]: 64: Hoare triple {40978#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40978#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:13,494 INFO L273 TraceCheckUtils]: 65: Hoare triple {40978#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40978#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:13,495 INFO L273 TraceCheckUtils]: 66: Hoare triple {40978#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {40979#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:13,496 INFO L273 TraceCheckUtils]: 67: Hoare triple {40979#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40979#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:13,496 INFO L273 TraceCheckUtils]: 68: Hoare triple {40979#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40979#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:13,497 INFO L273 TraceCheckUtils]: 69: Hoare triple {40979#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {40980#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:13,497 INFO L273 TraceCheckUtils]: 70: Hoare triple {40980#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40980#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:13,498 INFO L273 TraceCheckUtils]: 71: Hoare triple {40980#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40980#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:13,498 INFO L273 TraceCheckUtils]: 72: Hoare triple {40980#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {40981#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:13,499 INFO L273 TraceCheckUtils]: 73: Hoare triple {40981#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40981#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:13,499 INFO L273 TraceCheckUtils]: 74: Hoare triple {40981#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40981#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:13,500 INFO L273 TraceCheckUtils]: 75: Hoare triple {40981#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {40982#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:13,500 INFO L273 TraceCheckUtils]: 76: Hoare triple {40982#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40982#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:13,501 INFO L273 TraceCheckUtils]: 77: Hoare triple {40982#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40982#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:13,502 INFO L273 TraceCheckUtils]: 78: Hoare triple {40982#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {40983#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:13,502 INFO L273 TraceCheckUtils]: 79: Hoare triple {40983#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40983#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:13,503 INFO L273 TraceCheckUtils]: 80: Hoare triple {40983#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40983#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:13,503 INFO L273 TraceCheckUtils]: 81: Hoare triple {40983#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {40984#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:13,504 INFO L273 TraceCheckUtils]: 82: Hoare triple {40984#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40984#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:13,504 INFO L273 TraceCheckUtils]: 83: Hoare triple {40984#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40984#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:13,505 INFO L273 TraceCheckUtils]: 84: Hoare triple {40984#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {40985#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:13,505 INFO L273 TraceCheckUtils]: 85: Hoare triple {40985#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40985#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:13,506 INFO L273 TraceCheckUtils]: 86: Hoare triple {40985#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40985#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:13,506 INFO L273 TraceCheckUtils]: 87: Hoare triple {40985#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {40986#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:13,507 INFO L273 TraceCheckUtils]: 88: Hoare triple {40986#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40986#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:13,507 INFO L273 TraceCheckUtils]: 89: Hoare triple {40986#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40986#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:13,508 INFO L273 TraceCheckUtils]: 90: Hoare triple {40986#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {40987#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:13,509 INFO L273 TraceCheckUtils]: 91: Hoare triple {40987#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40987#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:13,509 INFO L273 TraceCheckUtils]: 92: Hoare triple {40987#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40987#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:13,510 INFO L273 TraceCheckUtils]: 93: Hoare triple {40987#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {40988#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:13,510 INFO L273 TraceCheckUtils]: 94: Hoare triple {40988#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40988#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:13,511 INFO L273 TraceCheckUtils]: 95: Hoare triple {40988#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40988#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:13,511 INFO L273 TraceCheckUtils]: 96: Hoare triple {40988#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {40989#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:13,512 INFO L273 TraceCheckUtils]: 97: Hoare triple {40989#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40989#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:13,512 INFO L273 TraceCheckUtils]: 98: Hoare triple {40989#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40989#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:13,513 INFO L273 TraceCheckUtils]: 99: Hoare triple {40989#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {40990#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:13,513 INFO L273 TraceCheckUtils]: 100: Hoare triple {40990#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40990#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:13,514 INFO L273 TraceCheckUtils]: 101: Hoare triple {40990#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40990#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:13,515 INFO L273 TraceCheckUtils]: 102: Hoare triple {40990#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {40991#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:13,515 INFO L273 TraceCheckUtils]: 103: Hoare triple {40991#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40991#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:13,516 INFO L273 TraceCheckUtils]: 104: Hoare triple {40991#(<= main_~i~0 33)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40991#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:13,516 INFO L273 TraceCheckUtils]: 105: Hoare triple {40991#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {40992#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:13,517 INFO L273 TraceCheckUtils]: 106: Hoare triple {40992#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40992#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:13,517 INFO L273 TraceCheckUtils]: 107: Hoare triple {40992#(<= main_~i~0 34)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40992#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:13,518 INFO L273 TraceCheckUtils]: 108: Hoare triple {40992#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {40993#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:13,518 INFO L273 TraceCheckUtils]: 109: Hoare triple {40993#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40993#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:13,519 INFO L273 TraceCheckUtils]: 110: Hoare triple {40993#(<= main_~i~0 35)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40993#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:13,520 INFO L273 TraceCheckUtils]: 111: Hoare triple {40993#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {40994#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:13,520 INFO L273 TraceCheckUtils]: 112: Hoare triple {40994#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40994#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:13,520 INFO L273 TraceCheckUtils]: 113: Hoare triple {40994#(<= main_~i~0 36)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40994#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:13,521 INFO L273 TraceCheckUtils]: 114: Hoare triple {40994#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {40995#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:13,522 INFO L273 TraceCheckUtils]: 115: Hoare triple {40995#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40995#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:13,522 INFO L273 TraceCheckUtils]: 116: Hoare triple {40995#(<= main_~i~0 37)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40995#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:13,523 INFO L273 TraceCheckUtils]: 117: Hoare triple {40995#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {40996#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:13,523 INFO L273 TraceCheckUtils]: 118: Hoare triple {40996#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40996#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:13,524 INFO L273 TraceCheckUtils]: 119: Hoare triple {40996#(<= main_~i~0 38)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40996#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:13,524 INFO L273 TraceCheckUtils]: 120: Hoare triple {40996#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {40997#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:13,525 INFO L273 TraceCheckUtils]: 121: Hoare triple {40997#(<= main_~i~0 39)} assume !(~i~0 < 100000); {40958#false} is VALID [2018-11-23 11:53:13,525 INFO L273 TraceCheckUtils]: 122: Hoare triple {40958#false} assume !(0 != ~swapped~0); {40958#false} is VALID [2018-11-23 11:53:13,525 INFO L273 TraceCheckUtils]: 123: Hoare triple {40958#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {40958#false} is VALID [2018-11-23 11:53:13,526 INFO L273 TraceCheckUtils]: 124: Hoare triple {40958#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {40958#false} is VALID [2018-11-23 11:53:13,526 INFO L273 TraceCheckUtils]: 125: Hoare triple {40958#false} assume !!(~y~0 < 100000);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); {40958#false} is VALID [2018-11-23 11:53:13,526 INFO L256 TraceCheckUtils]: 126: Hoare triple {40958#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {40958#false} is VALID [2018-11-23 11:53:13,526 INFO L273 TraceCheckUtils]: 127: Hoare triple {40958#false} ~cond := #in~cond; {40958#false} is VALID [2018-11-23 11:53:13,526 INFO L273 TraceCheckUtils]: 128: Hoare triple {40958#false} assume 0 == ~cond; {40958#false} is VALID [2018-11-23 11:53:13,526 INFO L273 TraceCheckUtils]: 129: Hoare triple {40958#false} assume !false; {40958#false} is VALID [2018-11-23 11:53:13,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2148 backedges. 1 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:53:13,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:13,540 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 11:53:13,550 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:53:13,606 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:53:13,606 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:13,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:13,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:13,898 INFO L256 TraceCheckUtils]: 0: Hoare triple {40957#true} call ULTIMATE.init(); {40957#true} is VALID [2018-11-23 11:53:13,899 INFO L273 TraceCheckUtils]: 1: Hoare triple {40957#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {40957#true} is VALID [2018-11-23 11:53:13,899 INFO L273 TraceCheckUtils]: 2: Hoare triple {40957#true} assume true; {40957#true} is VALID [2018-11-23 11:53:13,899 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {40957#true} {40957#true} #79#return; {40957#true} is VALID [2018-11-23 11:53:13,899 INFO L256 TraceCheckUtils]: 4: Hoare triple {40957#true} call #t~ret8 := main(); {40957#true} is VALID [2018-11-23 11:53:13,900 INFO L273 TraceCheckUtils]: 5: Hoare triple {40957#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {40957#true} is VALID [2018-11-23 11:53:13,900 INFO L273 TraceCheckUtils]: 6: Hoare triple {40957#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {41019#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:13,900 INFO L273 TraceCheckUtils]: 7: Hoare triple {41019#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {41019#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:13,901 INFO L273 TraceCheckUtils]: 8: Hoare triple {41019#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {41019#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:13,901 INFO L273 TraceCheckUtils]: 9: Hoare triple {41019#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {40960#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:13,902 INFO L273 TraceCheckUtils]: 10: Hoare triple {40960#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40960#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:13,902 INFO L273 TraceCheckUtils]: 11: Hoare triple {40960#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40960#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:13,902 INFO L273 TraceCheckUtils]: 12: Hoare triple {40960#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {40961#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:13,903 INFO L273 TraceCheckUtils]: 13: Hoare triple {40961#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40961#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:13,903 INFO L273 TraceCheckUtils]: 14: Hoare triple {40961#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40961#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:13,903 INFO L273 TraceCheckUtils]: 15: Hoare triple {40961#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {40962#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:13,904 INFO L273 TraceCheckUtils]: 16: Hoare triple {40962#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40962#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:13,904 INFO L273 TraceCheckUtils]: 17: Hoare triple {40962#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40962#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:13,905 INFO L273 TraceCheckUtils]: 18: Hoare triple {40962#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {40963#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:13,905 INFO L273 TraceCheckUtils]: 19: Hoare triple {40963#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40963#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:13,906 INFO L273 TraceCheckUtils]: 20: Hoare triple {40963#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40963#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:13,907 INFO L273 TraceCheckUtils]: 21: Hoare triple {40963#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {40964#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:13,907 INFO L273 TraceCheckUtils]: 22: Hoare triple {40964#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40964#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:13,907 INFO L273 TraceCheckUtils]: 23: Hoare triple {40964#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40964#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:13,908 INFO L273 TraceCheckUtils]: 24: Hoare triple {40964#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {40965#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:13,909 INFO L273 TraceCheckUtils]: 25: Hoare triple {40965#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40965#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:13,909 INFO L273 TraceCheckUtils]: 26: Hoare triple {40965#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40965#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:13,910 INFO L273 TraceCheckUtils]: 27: Hoare triple {40965#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {40966#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:13,910 INFO L273 TraceCheckUtils]: 28: Hoare triple {40966#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40966#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:13,911 INFO L273 TraceCheckUtils]: 29: Hoare triple {40966#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40966#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:13,911 INFO L273 TraceCheckUtils]: 30: Hoare triple {40966#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {40967#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:13,912 INFO L273 TraceCheckUtils]: 31: Hoare triple {40967#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40967#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:13,912 INFO L273 TraceCheckUtils]: 32: Hoare triple {40967#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40967#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:13,913 INFO L273 TraceCheckUtils]: 33: Hoare triple {40967#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {40968#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:13,914 INFO L273 TraceCheckUtils]: 34: Hoare triple {40968#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40968#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:13,914 INFO L273 TraceCheckUtils]: 35: Hoare triple {40968#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40968#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:13,915 INFO L273 TraceCheckUtils]: 36: Hoare triple {40968#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {40969#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:13,915 INFO L273 TraceCheckUtils]: 37: Hoare triple {40969#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40969#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:13,916 INFO L273 TraceCheckUtils]: 38: Hoare triple {40969#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40969#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:13,916 INFO L273 TraceCheckUtils]: 39: Hoare triple {40969#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {40970#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:13,917 INFO L273 TraceCheckUtils]: 40: Hoare triple {40970#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40970#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:13,917 INFO L273 TraceCheckUtils]: 41: Hoare triple {40970#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40970#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:13,918 INFO L273 TraceCheckUtils]: 42: Hoare triple {40970#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {40971#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:13,918 INFO L273 TraceCheckUtils]: 43: Hoare triple {40971#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40971#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:13,919 INFO L273 TraceCheckUtils]: 44: Hoare triple {40971#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40971#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:13,920 INFO L273 TraceCheckUtils]: 45: Hoare triple {40971#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {40972#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:13,920 INFO L273 TraceCheckUtils]: 46: Hoare triple {40972#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40972#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:13,920 INFO L273 TraceCheckUtils]: 47: Hoare triple {40972#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40972#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:13,921 INFO L273 TraceCheckUtils]: 48: Hoare triple {40972#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {40973#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:13,922 INFO L273 TraceCheckUtils]: 49: Hoare triple {40973#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40973#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:13,922 INFO L273 TraceCheckUtils]: 50: Hoare triple {40973#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40973#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:13,923 INFO L273 TraceCheckUtils]: 51: Hoare triple {40973#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {40974#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:13,923 INFO L273 TraceCheckUtils]: 52: Hoare triple {40974#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40974#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:13,924 INFO L273 TraceCheckUtils]: 53: Hoare triple {40974#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40974#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:13,924 INFO L273 TraceCheckUtils]: 54: Hoare triple {40974#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {40975#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:13,925 INFO L273 TraceCheckUtils]: 55: Hoare triple {40975#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40975#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:13,944 INFO L273 TraceCheckUtils]: 56: Hoare triple {40975#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40975#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:13,959 INFO L273 TraceCheckUtils]: 57: Hoare triple {40975#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {40976#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:13,973 INFO L273 TraceCheckUtils]: 58: Hoare triple {40976#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40976#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:13,977 INFO L273 TraceCheckUtils]: 59: Hoare triple {40976#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40976#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:13,977 INFO L273 TraceCheckUtils]: 60: Hoare triple {40976#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {40977#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:13,980 INFO L273 TraceCheckUtils]: 61: Hoare triple {40977#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40977#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:13,980 INFO L273 TraceCheckUtils]: 62: Hoare triple {40977#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40977#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:13,980 INFO L273 TraceCheckUtils]: 63: Hoare triple {40977#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {40978#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:13,981 INFO L273 TraceCheckUtils]: 64: Hoare triple {40978#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40978#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:13,981 INFO L273 TraceCheckUtils]: 65: Hoare triple {40978#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40978#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:13,981 INFO L273 TraceCheckUtils]: 66: Hoare triple {40978#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {40979#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:13,982 INFO L273 TraceCheckUtils]: 67: Hoare triple {40979#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40979#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:13,982 INFO L273 TraceCheckUtils]: 68: Hoare triple {40979#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40979#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:13,982 INFO L273 TraceCheckUtils]: 69: Hoare triple {40979#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {40980#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:13,983 INFO L273 TraceCheckUtils]: 70: Hoare triple {40980#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40980#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:13,983 INFO L273 TraceCheckUtils]: 71: Hoare triple {40980#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40980#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:13,983 INFO L273 TraceCheckUtils]: 72: Hoare triple {40980#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {40981#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:13,984 INFO L273 TraceCheckUtils]: 73: Hoare triple {40981#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40981#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:13,984 INFO L273 TraceCheckUtils]: 74: Hoare triple {40981#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40981#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:13,985 INFO L273 TraceCheckUtils]: 75: Hoare triple {40981#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {40982#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:13,986 INFO L273 TraceCheckUtils]: 76: Hoare triple {40982#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40982#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:13,986 INFO L273 TraceCheckUtils]: 77: Hoare triple {40982#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40982#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:13,987 INFO L273 TraceCheckUtils]: 78: Hoare triple {40982#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {40983#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:13,987 INFO L273 TraceCheckUtils]: 79: Hoare triple {40983#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40983#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:13,988 INFO L273 TraceCheckUtils]: 80: Hoare triple {40983#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40983#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:13,988 INFO L273 TraceCheckUtils]: 81: Hoare triple {40983#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {40984#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:13,989 INFO L273 TraceCheckUtils]: 82: Hoare triple {40984#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40984#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:13,989 INFO L273 TraceCheckUtils]: 83: Hoare triple {40984#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40984#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:13,990 INFO L273 TraceCheckUtils]: 84: Hoare triple {40984#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {40985#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:13,990 INFO L273 TraceCheckUtils]: 85: Hoare triple {40985#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40985#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:13,991 INFO L273 TraceCheckUtils]: 86: Hoare triple {40985#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40985#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:13,991 INFO L273 TraceCheckUtils]: 87: Hoare triple {40985#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {40986#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:13,992 INFO L273 TraceCheckUtils]: 88: Hoare triple {40986#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40986#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:13,992 INFO L273 TraceCheckUtils]: 89: Hoare triple {40986#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40986#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:13,993 INFO L273 TraceCheckUtils]: 90: Hoare triple {40986#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {40987#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:13,994 INFO L273 TraceCheckUtils]: 91: Hoare triple {40987#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40987#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:13,994 INFO L273 TraceCheckUtils]: 92: Hoare triple {40987#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40987#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:13,995 INFO L273 TraceCheckUtils]: 93: Hoare triple {40987#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {40988#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:13,995 INFO L273 TraceCheckUtils]: 94: Hoare triple {40988#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40988#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:13,996 INFO L273 TraceCheckUtils]: 95: Hoare triple {40988#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40988#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:13,996 INFO L273 TraceCheckUtils]: 96: Hoare triple {40988#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {40989#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:13,997 INFO L273 TraceCheckUtils]: 97: Hoare triple {40989#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40989#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:13,997 INFO L273 TraceCheckUtils]: 98: Hoare triple {40989#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40989#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:13,998 INFO L273 TraceCheckUtils]: 99: Hoare triple {40989#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {40990#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:13,999 INFO L273 TraceCheckUtils]: 100: Hoare triple {40990#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40990#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:13,999 INFO L273 TraceCheckUtils]: 101: Hoare triple {40990#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40990#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:14,000 INFO L273 TraceCheckUtils]: 102: Hoare triple {40990#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {40991#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:14,000 INFO L273 TraceCheckUtils]: 103: Hoare triple {40991#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40991#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:14,001 INFO L273 TraceCheckUtils]: 104: Hoare triple {40991#(<= main_~i~0 33)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40991#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:14,018 INFO L273 TraceCheckUtils]: 105: Hoare triple {40991#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {40992#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:14,027 INFO L273 TraceCheckUtils]: 106: Hoare triple {40992#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40992#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:14,040 INFO L273 TraceCheckUtils]: 107: Hoare triple {40992#(<= main_~i~0 34)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40992#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:14,054 INFO L273 TraceCheckUtils]: 108: Hoare triple {40992#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {40993#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:14,058 INFO L273 TraceCheckUtils]: 109: Hoare triple {40993#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40993#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:14,058 INFO L273 TraceCheckUtils]: 110: Hoare triple {40993#(<= main_~i~0 35)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40993#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:14,060 INFO L273 TraceCheckUtils]: 111: Hoare triple {40993#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {40994#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:14,060 INFO L273 TraceCheckUtils]: 112: Hoare triple {40994#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40994#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:14,062 INFO L273 TraceCheckUtils]: 113: Hoare triple {40994#(<= main_~i~0 36)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40994#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:14,062 INFO L273 TraceCheckUtils]: 114: Hoare triple {40994#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {40995#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:14,064 INFO L273 TraceCheckUtils]: 115: Hoare triple {40995#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40995#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:14,064 INFO L273 TraceCheckUtils]: 116: Hoare triple {40995#(<= main_~i~0 37)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40995#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:14,065 INFO L273 TraceCheckUtils]: 117: Hoare triple {40995#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {40996#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:14,068 INFO L273 TraceCheckUtils]: 118: Hoare triple {40996#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {40996#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:14,068 INFO L273 TraceCheckUtils]: 119: Hoare triple {40996#(<= main_~i~0 38)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40996#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:14,068 INFO L273 TraceCheckUtils]: 120: Hoare triple {40996#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {40997#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:14,069 INFO L273 TraceCheckUtils]: 121: Hoare triple {40997#(<= main_~i~0 39)} assume !(~i~0 < 100000); {40958#false} is VALID [2018-11-23 11:53:14,069 INFO L273 TraceCheckUtils]: 122: Hoare triple {40958#false} assume !(0 != ~swapped~0); {40958#false} is VALID [2018-11-23 11:53:14,069 INFO L273 TraceCheckUtils]: 123: Hoare triple {40958#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {40958#false} is VALID [2018-11-23 11:53:14,069 INFO L273 TraceCheckUtils]: 124: Hoare triple {40958#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {40958#false} is VALID [2018-11-23 11:53:14,069 INFO L273 TraceCheckUtils]: 125: Hoare triple {40958#false} assume !!(~y~0 < 100000);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); {40958#false} is VALID [2018-11-23 11:53:14,069 INFO L256 TraceCheckUtils]: 126: Hoare triple {40958#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {40958#false} is VALID [2018-11-23 11:53:14,069 INFO L273 TraceCheckUtils]: 127: Hoare triple {40958#false} ~cond := #in~cond; {40958#false} is VALID [2018-11-23 11:53:14,070 INFO L273 TraceCheckUtils]: 128: Hoare triple {40958#false} assume 0 == ~cond; {40958#false} is VALID [2018-11-23 11:53:14,070 INFO L273 TraceCheckUtils]: 129: Hoare triple {40958#false} assume !false; {40958#false} is VALID [2018-11-23 11:53:14,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2148 backedges. 1 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:53:14,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:14,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2018-11-23 11:53:14,101 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 130 [2018-11-23 11:53:14,101 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:14,101 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-23 11:53:14,229 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:14,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 11:53:14,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 11:53:14,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 11:53:14,231 INFO L87 Difference]: Start difference. First operand 249 states and 328 transitions. Second operand 42 states. [2018-11-23 11:53:15,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:15,406 INFO L93 Difference]: Finished difference Result 502 states and 666 transitions. [2018-11-23 11:53:15,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-23 11:53:15,406 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 130 [2018-11-23 11:53:15,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:15,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 11:53:15,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 205 transitions. [2018-11-23 11:53:15,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 11:53:15,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 205 transitions. [2018-11-23 11:53:15,409 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 205 transitions. [2018-11-23 11:53:15,613 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 205 edges. 205 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:15,619 INFO L225 Difference]: With dead ends: 502 [2018-11-23 11:53:15,619 INFO L226 Difference]: Without dead ends: 259 [2018-11-23 11:53:15,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 11:53:15,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-11-23 11:53:16,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 255. [2018-11-23 11:53:16,152 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:16,152 INFO L82 GeneralOperation]: Start isEquivalent. First operand 259 states. Second operand 255 states. [2018-11-23 11:53:16,152 INFO L74 IsIncluded]: Start isIncluded. First operand 259 states. Second operand 255 states. [2018-11-23 11:53:16,152 INFO L87 Difference]: Start difference. First operand 259 states. Second operand 255 states. [2018-11-23 11:53:16,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:16,158 INFO L93 Difference]: Finished difference Result 259 states and 342 transitions. [2018-11-23 11:53:16,158 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 342 transitions. [2018-11-23 11:53:16,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:16,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:16,159 INFO L74 IsIncluded]: Start isIncluded. First operand 255 states. Second operand 259 states. [2018-11-23 11:53:16,159 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 259 states. [2018-11-23 11:53:16,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:16,164 INFO L93 Difference]: Finished difference Result 259 states and 342 transitions. [2018-11-23 11:53:16,164 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 342 transitions. [2018-11-23 11:53:16,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:16,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:16,165 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:16,165 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:16,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-11-23 11:53:16,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 336 transitions. [2018-11-23 11:53:16,170 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 336 transitions. Word has length 130 [2018-11-23 11:53:16,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:16,170 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 336 transitions. [2018-11-23 11:53:16,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 11:53:16,170 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 336 transitions. [2018-11-23 11:53:16,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-23 11:53:16,170 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:16,171 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:53:16,171 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:16,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:16,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1419817256, now seen corresponding path program 39 times [2018-11-23 11:53:16,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:16,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:16,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:16,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:16,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:16,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:17,126 INFO L256 TraceCheckUtils]: 0: Hoare triple {42924#true} call ULTIMATE.init(); {42924#true} is VALID [2018-11-23 11:53:17,126 INFO L273 TraceCheckUtils]: 1: Hoare triple {42924#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {42924#true} is VALID [2018-11-23 11:53:17,126 INFO L273 TraceCheckUtils]: 2: Hoare triple {42924#true} assume true; {42924#true} is VALID [2018-11-23 11:53:17,126 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {42924#true} {42924#true} #79#return; {42924#true} is VALID [2018-11-23 11:53:17,127 INFO L256 TraceCheckUtils]: 4: Hoare triple {42924#true} call #t~ret8 := main(); {42924#true} is VALID [2018-11-23 11:53:17,127 INFO L273 TraceCheckUtils]: 5: Hoare triple {42924#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {42924#true} is VALID [2018-11-23 11:53:17,127 INFO L273 TraceCheckUtils]: 6: Hoare triple {42924#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {42926#(= main_~i~0 1)} is VALID [2018-11-23 11:53:17,127 INFO L273 TraceCheckUtils]: 7: Hoare triple {42926#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42926#(= main_~i~0 1)} is VALID [2018-11-23 11:53:17,128 INFO L273 TraceCheckUtils]: 8: Hoare triple {42926#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42926#(= main_~i~0 1)} is VALID [2018-11-23 11:53:17,128 INFO L273 TraceCheckUtils]: 9: Hoare triple {42926#(= main_~i~0 1)} ~i~0 := 1 + ~i~0; {42927#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:17,128 INFO L273 TraceCheckUtils]: 10: Hoare triple {42927#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42927#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:17,129 INFO L273 TraceCheckUtils]: 11: Hoare triple {42927#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42927#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:17,129 INFO L273 TraceCheckUtils]: 12: Hoare triple {42927#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {42928#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:17,130 INFO L273 TraceCheckUtils]: 13: Hoare triple {42928#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42928#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:17,130 INFO L273 TraceCheckUtils]: 14: Hoare triple {42928#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42928#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:17,131 INFO L273 TraceCheckUtils]: 15: Hoare triple {42928#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {42929#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:17,132 INFO L273 TraceCheckUtils]: 16: Hoare triple {42929#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42929#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:17,132 INFO L273 TraceCheckUtils]: 17: Hoare triple {42929#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42929#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:17,133 INFO L273 TraceCheckUtils]: 18: Hoare triple {42929#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {42930#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:17,133 INFO L273 TraceCheckUtils]: 19: Hoare triple {42930#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42930#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:17,134 INFO L273 TraceCheckUtils]: 20: Hoare triple {42930#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42930#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:17,135 INFO L273 TraceCheckUtils]: 21: Hoare triple {42930#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {42931#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:17,135 INFO L273 TraceCheckUtils]: 22: Hoare triple {42931#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42931#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:17,136 INFO L273 TraceCheckUtils]: 23: Hoare triple {42931#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42931#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:17,136 INFO L273 TraceCheckUtils]: 24: Hoare triple {42931#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {42932#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:17,137 INFO L273 TraceCheckUtils]: 25: Hoare triple {42932#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42932#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:17,137 INFO L273 TraceCheckUtils]: 26: Hoare triple {42932#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42932#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:17,138 INFO L273 TraceCheckUtils]: 27: Hoare triple {42932#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {42933#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:17,139 INFO L273 TraceCheckUtils]: 28: Hoare triple {42933#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42933#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:17,139 INFO L273 TraceCheckUtils]: 29: Hoare triple {42933#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42933#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:17,140 INFO L273 TraceCheckUtils]: 30: Hoare triple {42933#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {42934#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:17,140 INFO L273 TraceCheckUtils]: 31: Hoare triple {42934#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42934#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:17,141 INFO L273 TraceCheckUtils]: 32: Hoare triple {42934#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42934#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:17,141 INFO L273 TraceCheckUtils]: 33: Hoare triple {42934#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {42935#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:17,142 INFO L273 TraceCheckUtils]: 34: Hoare triple {42935#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42935#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:17,142 INFO L273 TraceCheckUtils]: 35: Hoare triple {42935#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42935#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:17,143 INFO L273 TraceCheckUtils]: 36: Hoare triple {42935#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {42936#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:17,144 INFO L273 TraceCheckUtils]: 37: Hoare triple {42936#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42936#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:17,144 INFO L273 TraceCheckUtils]: 38: Hoare triple {42936#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42936#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:17,145 INFO L273 TraceCheckUtils]: 39: Hoare triple {42936#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {42937#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:17,145 INFO L273 TraceCheckUtils]: 40: Hoare triple {42937#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42937#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:17,146 INFO L273 TraceCheckUtils]: 41: Hoare triple {42937#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42937#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:17,146 INFO L273 TraceCheckUtils]: 42: Hoare triple {42937#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {42938#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:17,147 INFO L273 TraceCheckUtils]: 43: Hoare triple {42938#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42938#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:17,147 INFO L273 TraceCheckUtils]: 44: Hoare triple {42938#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42938#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:17,148 INFO L273 TraceCheckUtils]: 45: Hoare triple {42938#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {42939#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:17,148 INFO L273 TraceCheckUtils]: 46: Hoare triple {42939#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42939#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:17,149 INFO L273 TraceCheckUtils]: 47: Hoare triple {42939#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42939#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:17,150 INFO L273 TraceCheckUtils]: 48: Hoare triple {42939#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {42940#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:17,150 INFO L273 TraceCheckUtils]: 49: Hoare triple {42940#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42940#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:17,151 INFO L273 TraceCheckUtils]: 50: Hoare triple {42940#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42940#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:17,151 INFO L273 TraceCheckUtils]: 51: Hoare triple {42940#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {42941#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:17,152 INFO L273 TraceCheckUtils]: 52: Hoare triple {42941#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42941#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:17,152 INFO L273 TraceCheckUtils]: 53: Hoare triple {42941#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42941#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:17,153 INFO L273 TraceCheckUtils]: 54: Hoare triple {42941#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {42942#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:17,153 INFO L273 TraceCheckUtils]: 55: Hoare triple {42942#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42942#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:17,154 INFO L273 TraceCheckUtils]: 56: Hoare triple {42942#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42942#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:17,154 INFO L273 TraceCheckUtils]: 57: Hoare triple {42942#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {42943#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:17,155 INFO L273 TraceCheckUtils]: 58: Hoare triple {42943#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42943#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:17,155 INFO L273 TraceCheckUtils]: 59: Hoare triple {42943#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42943#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:17,156 INFO L273 TraceCheckUtils]: 60: Hoare triple {42943#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {42944#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:17,156 INFO L273 TraceCheckUtils]: 61: Hoare triple {42944#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42944#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:17,157 INFO L273 TraceCheckUtils]: 62: Hoare triple {42944#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42944#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:17,158 INFO L273 TraceCheckUtils]: 63: Hoare triple {42944#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {42945#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:17,158 INFO L273 TraceCheckUtils]: 64: Hoare triple {42945#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42945#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:17,159 INFO L273 TraceCheckUtils]: 65: Hoare triple {42945#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42945#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:17,159 INFO L273 TraceCheckUtils]: 66: Hoare triple {42945#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {42946#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:17,160 INFO L273 TraceCheckUtils]: 67: Hoare triple {42946#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42946#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:17,160 INFO L273 TraceCheckUtils]: 68: Hoare triple {42946#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42946#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:17,161 INFO L273 TraceCheckUtils]: 69: Hoare triple {42946#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {42947#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:17,161 INFO L273 TraceCheckUtils]: 70: Hoare triple {42947#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42947#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:17,162 INFO L273 TraceCheckUtils]: 71: Hoare triple {42947#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42947#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:17,163 INFO L273 TraceCheckUtils]: 72: Hoare triple {42947#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {42948#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:17,163 INFO L273 TraceCheckUtils]: 73: Hoare triple {42948#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42948#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:17,164 INFO L273 TraceCheckUtils]: 74: Hoare triple {42948#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42948#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:17,164 INFO L273 TraceCheckUtils]: 75: Hoare triple {42948#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {42949#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:17,165 INFO L273 TraceCheckUtils]: 76: Hoare triple {42949#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42949#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:17,165 INFO L273 TraceCheckUtils]: 77: Hoare triple {42949#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42949#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:17,166 INFO L273 TraceCheckUtils]: 78: Hoare triple {42949#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {42950#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:17,167 INFO L273 TraceCheckUtils]: 79: Hoare triple {42950#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42950#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:17,167 INFO L273 TraceCheckUtils]: 80: Hoare triple {42950#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42950#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:17,168 INFO L273 TraceCheckUtils]: 81: Hoare triple {42950#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {42951#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:17,168 INFO L273 TraceCheckUtils]: 82: Hoare triple {42951#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42951#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:17,169 INFO L273 TraceCheckUtils]: 83: Hoare triple {42951#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42951#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:17,169 INFO L273 TraceCheckUtils]: 84: Hoare triple {42951#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {42952#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:17,170 INFO L273 TraceCheckUtils]: 85: Hoare triple {42952#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42952#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:17,170 INFO L273 TraceCheckUtils]: 86: Hoare triple {42952#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42952#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:17,171 INFO L273 TraceCheckUtils]: 87: Hoare triple {42952#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {42953#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:17,172 INFO L273 TraceCheckUtils]: 88: Hoare triple {42953#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42953#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:17,172 INFO L273 TraceCheckUtils]: 89: Hoare triple {42953#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42953#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:17,173 INFO L273 TraceCheckUtils]: 90: Hoare triple {42953#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {42954#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:17,173 INFO L273 TraceCheckUtils]: 91: Hoare triple {42954#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42954#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:17,174 INFO L273 TraceCheckUtils]: 92: Hoare triple {42954#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42954#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:17,174 INFO L273 TraceCheckUtils]: 93: Hoare triple {42954#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {42955#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:17,175 INFO L273 TraceCheckUtils]: 94: Hoare triple {42955#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42955#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:17,175 INFO L273 TraceCheckUtils]: 95: Hoare triple {42955#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42955#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:17,176 INFO L273 TraceCheckUtils]: 96: Hoare triple {42955#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {42956#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:17,176 INFO L273 TraceCheckUtils]: 97: Hoare triple {42956#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42956#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:17,177 INFO L273 TraceCheckUtils]: 98: Hoare triple {42956#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42956#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:17,177 INFO L273 TraceCheckUtils]: 99: Hoare triple {42956#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {42957#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:17,178 INFO L273 TraceCheckUtils]: 100: Hoare triple {42957#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42957#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:17,178 INFO L273 TraceCheckUtils]: 101: Hoare triple {42957#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42957#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:17,179 INFO L273 TraceCheckUtils]: 102: Hoare triple {42957#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {42958#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:17,180 INFO L273 TraceCheckUtils]: 103: Hoare triple {42958#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42958#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:17,180 INFO L273 TraceCheckUtils]: 104: Hoare triple {42958#(<= main_~i~0 33)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42958#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:17,181 INFO L273 TraceCheckUtils]: 105: Hoare triple {42958#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {42959#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:17,181 INFO L273 TraceCheckUtils]: 106: Hoare triple {42959#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42959#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:17,182 INFO L273 TraceCheckUtils]: 107: Hoare triple {42959#(<= main_~i~0 34)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42959#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:17,182 INFO L273 TraceCheckUtils]: 108: Hoare triple {42959#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {42960#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:17,183 INFO L273 TraceCheckUtils]: 109: Hoare triple {42960#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42960#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:17,183 INFO L273 TraceCheckUtils]: 110: Hoare triple {42960#(<= main_~i~0 35)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42960#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:17,184 INFO L273 TraceCheckUtils]: 111: Hoare triple {42960#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {42961#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:17,184 INFO L273 TraceCheckUtils]: 112: Hoare triple {42961#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42961#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:17,185 INFO L273 TraceCheckUtils]: 113: Hoare triple {42961#(<= main_~i~0 36)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42961#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:17,186 INFO L273 TraceCheckUtils]: 114: Hoare triple {42961#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {42962#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:17,186 INFO L273 TraceCheckUtils]: 115: Hoare triple {42962#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42962#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:17,186 INFO L273 TraceCheckUtils]: 116: Hoare triple {42962#(<= main_~i~0 37)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42962#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:17,187 INFO L273 TraceCheckUtils]: 117: Hoare triple {42962#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {42963#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:17,188 INFO L273 TraceCheckUtils]: 118: Hoare triple {42963#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42963#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:17,188 INFO L273 TraceCheckUtils]: 119: Hoare triple {42963#(<= main_~i~0 38)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42963#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:17,189 INFO L273 TraceCheckUtils]: 120: Hoare triple {42963#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {42964#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:17,189 INFO L273 TraceCheckUtils]: 121: Hoare triple {42964#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42964#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:17,190 INFO L273 TraceCheckUtils]: 122: Hoare triple {42964#(<= main_~i~0 39)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42964#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:17,190 INFO L273 TraceCheckUtils]: 123: Hoare triple {42964#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {42965#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:17,191 INFO L273 TraceCheckUtils]: 124: Hoare triple {42965#(<= main_~i~0 40)} assume !(~i~0 < 100000); {42925#false} is VALID [2018-11-23 11:53:17,191 INFO L273 TraceCheckUtils]: 125: Hoare triple {42925#false} assume !(0 != ~swapped~0); {42925#false} is VALID [2018-11-23 11:53:17,191 INFO L273 TraceCheckUtils]: 126: Hoare triple {42925#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {42925#false} is VALID [2018-11-23 11:53:17,191 INFO L273 TraceCheckUtils]: 127: Hoare triple {42925#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {42925#false} is VALID [2018-11-23 11:53:17,192 INFO L273 TraceCheckUtils]: 128: Hoare triple {42925#false} assume !!(~y~0 < 100000);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); {42925#false} is VALID [2018-11-23 11:53:17,192 INFO L256 TraceCheckUtils]: 129: Hoare triple {42925#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {42925#false} is VALID [2018-11-23 11:53:17,192 INFO L273 TraceCheckUtils]: 130: Hoare triple {42925#false} ~cond := #in~cond; {42925#false} is VALID [2018-11-23 11:53:17,192 INFO L273 TraceCheckUtils]: 131: Hoare triple {42925#false} assume 0 == ~cond; {42925#false} is VALID [2018-11-23 11:53:17,192 INFO L273 TraceCheckUtils]: 132: Hoare triple {42925#false} assume !false; {42925#false} is VALID [2018-11-23 11:53:17,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2263 backedges. 1 proven. 2262 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:53:17,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:17,206 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 11:53:17,215 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:53:17,355 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2018-11-23 11:53:17,355 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:17,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:17,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:17,734 INFO L256 TraceCheckUtils]: 0: Hoare triple {42924#true} call ULTIMATE.init(); {42924#true} is VALID [2018-11-23 11:53:17,734 INFO L273 TraceCheckUtils]: 1: Hoare triple {42924#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {42924#true} is VALID [2018-11-23 11:53:17,734 INFO L273 TraceCheckUtils]: 2: Hoare triple {42924#true} assume true; {42924#true} is VALID [2018-11-23 11:53:17,735 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {42924#true} {42924#true} #79#return; {42924#true} is VALID [2018-11-23 11:53:17,735 INFO L256 TraceCheckUtils]: 4: Hoare triple {42924#true} call #t~ret8 := main(); {42924#true} is VALID [2018-11-23 11:53:17,735 INFO L273 TraceCheckUtils]: 5: Hoare triple {42924#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {42924#true} is VALID [2018-11-23 11:53:17,735 INFO L273 TraceCheckUtils]: 6: Hoare triple {42924#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {42987#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:17,736 INFO L273 TraceCheckUtils]: 7: Hoare triple {42987#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42987#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:17,736 INFO L273 TraceCheckUtils]: 8: Hoare triple {42987#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42987#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:17,737 INFO L273 TraceCheckUtils]: 9: Hoare triple {42987#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {42927#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:17,737 INFO L273 TraceCheckUtils]: 10: Hoare triple {42927#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42927#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:17,737 INFO L273 TraceCheckUtils]: 11: Hoare triple {42927#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42927#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:17,738 INFO L273 TraceCheckUtils]: 12: Hoare triple {42927#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {42928#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:17,738 INFO L273 TraceCheckUtils]: 13: Hoare triple {42928#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42928#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:17,738 INFO L273 TraceCheckUtils]: 14: Hoare triple {42928#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42928#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:17,739 INFO L273 TraceCheckUtils]: 15: Hoare triple {42928#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {42929#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:17,740 INFO L273 TraceCheckUtils]: 16: Hoare triple {42929#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42929#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:17,740 INFO L273 TraceCheckUtils]: 17: Hoare triple {42929#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42929#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:17,741 INFO L273 TraceCheckUtils]: 18: Hoare triple {42929#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {42930#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:17,741 INFO L273 TraceCheckUtils]: 19: Hoare triple {42930#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42930#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:17,742 INFO L273 TraceCheckUtils]: 20: Hoare triple {42930#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42930#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:17,742 INFO L273 TraceCheckUtils]: 21: Hoare triple {42930#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {42931#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:17,743 INFO L273 TraceCheckUtils]: 22: Hoare triple {42931#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42931#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:17,743 INFO L273 TraceCheckUtils]: 23: Hoare triple {42931#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42931#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:17,744 INFO L273 TraceCheckUtils]: 24: Hoare triple {42931#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {42932#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:17,745 INFO L273 TraceCheckUtils]: 25: Hoare triple {42932#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42932#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:17,745 INFO L273 TraceCheckUtils]: 26: Hoare triple {42932#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42932#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:17,746 INFO L273 TraceCheckUtils]: 27: Hoare triple {42932#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {42933#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:17,746 INFO L273 TraceCheckUtils]: 28: Hoare triple {42933#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42933#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:17,747 INFO L273 TraceCheckUtils]: 29: Hoare triple {42933#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42933#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:17,747 INFO L273 TraceCheckUtils]: 30: Hoare triple {42933#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {42934#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:17,748 INFO L273 TraceCheckUtils]: 31: Hoare triple {42934#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42934#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:17,748 INFO L273 TraceCheckUtils]: 32: Hoare triple {42934#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42934#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:17,749 INFO L273 TraceCheckUtils]: 33: Hoare triple {42934#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {42935#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:17,749 INFO L273 TraceCheckUtils]: 34: Hoare triple {42935#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42935#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:17,750 INFO L273 TraceCheckUtils]: 35: Hoare triple {42935#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42935#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:17,750 INFO L273 TraceCheckUtils]: 36: Hoare triple {42935#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {42936#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:17,751 INFO L273 TraceCheckUtils]: 37: Hoare triple {42936#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42936#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:17,751 INFO L273 TraceCheckUtils]: 38: Hoare triple {42936#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42936#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:17,752 INFO L273 TraceCheckUtils]: 39: Hoare triple {42936#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {42937#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:17,753 INFO L273 TraceCheckUtils]: 40: Hoare triple {42937#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42937#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:17,753 INFO L273 TraceCheckUtils]: 41: Hoare triple {42937#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42937#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:17,754 INFO L273 TraceCheckUtils]: 42: Hoare triple {42937#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {42938#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:17,754 INFO L273 TraceCheckUtils]: 43: Hoare triple {42938#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42938#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:17,755 INFO L273 TraceCheckUtils]: 44: Hoare triple {42938#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42938#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:17,755 INFO L273 TraceCheckUtils]: 45: Hoare triple {42938#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {42939#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:17,756 INFO L273 TraceCheckUtils]: 46: Hoare triple {42939#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42939#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:17,756 INFO L273 TraceCheckUtils]: 47: Hoare triple {42939#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42939#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:17,757 INFO L273 TraceCheckUtils]: 48: Hoare triple {42939#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {42940#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:17,757 INFO L273 TraceCheckUtils]: 49: Hoare triple {42940#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42940#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:17,758 INFO L273 TraceCheckUtils]: 50: Hoare triple {42940#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42940#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:17,758 INFO L273 TraceCheckUtils]: 51: Hoare triple {42940#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {42941#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:17,759 INFO L273 TraceCheckUtils]: 52: Hoare triple {42941#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42941#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:17,759 INFO L273 TraceCheckUtils]: 53: Hoare triple {42941#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42941#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:17,760 INFO L273 TraceCheckUtils]: 54: Hoare triple {42941#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {42942#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:17,761 INFO L273 TraceCheckUtils]: 55: Hoare triple {42942#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42942#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:17,761 INFO L273 TraceCheckUtils]: 56: Hoare triple {42942#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42942#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:17,762 INFO L273 TraceCheckUtils]: 57: Hoare triple {42942#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {42943#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:17,762 INFO L273 TraceCheckUtils]: 58: Hoare triple {42943#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42943#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:17,763 INFO L273 TraceCheckUtils]: 59: Hoare triple {42943#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42943#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:17,763 INFO L273 TraceCheckUtils]: 60: Hoare triple {42943#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {42944#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:17,764 INFO L273 TraceCheckUtils]: 61: Hoare triple {42944#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42944#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:17,764 INFO L273 TraceCheckUtils]: 62: Hoare triple {42944#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42944#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:17,765 INFO L273 TraceCheckUtils]: 63: Hoare triple {42944#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {42945#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:17,765 INFO L273 TraceCheckUtils]: 64: Hoare triple {42945#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42945#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:17,766 INFO L273 TraceCheckUtils]: 65: Hoare triple {42945#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42945#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:17,767 INFO L273 TraceCheckUtils]: 66: Hoare triple {42945#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {42946#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:17,767 INFO L273 TraceCheckUtils]: 67: Hoare triple {42946#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42946#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:17,767 INFO L273 TraceCheckUtils]: 68: Hoare triple {42946#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42946#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:17,768 INFO L273 TraceCheckUtils]: 69: Hoare triple {42946#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {42947#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:17,769 INFO L273 TraceCheckUtils]: 70: Hoare triple {42947#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42947#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:17,769 INFO L273 TraceCheckUtils]: 71: Hoare triple {42947#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42947#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:17,770 INFO L273 TraceCheckUtils]: 72: Hoare triple {42947#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {42948#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:17,770 INFO L273 TraceCheckUtils]: 73: Hoare triple {42948#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42948#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:17,771 INFO L273 TraceCheckUtils]: 74: Hoare triple {42948#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42948#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:17,771 INFO L273 TraceCheckUtils]: 75: Hoare triple {42948#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {42949#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:17,772 INFO L273 TraceCheckUtils]: 76: Hoare triple {42949#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42949#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:17,772 INFO L273 TraceCheckUtils]: 77: Hoare triple {42949#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42949#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:17,773 INFO L273 TraceCheckUtils]: 78: Hoare triple {42949#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {42950#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:17,773 INFO L273 TraceCheckUtils]: 79: Hoare triple {42950#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42950#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:17,774 INFO L273 TraceCheckUtils]: 80: Hoare triple {42950#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42950#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:17,775 INFO L273 TraceCheckUtils]: 81: Hoare triple {42950#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {42951#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:17,775 INFO L273 TraceCheckUtils]: 82: Hoare triple {42951#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42951#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:17,776 INFO L273 TraceCheckUtils]: 83: Hoare triple {42951#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42951#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:17,776 INFO L273 TraceCheckUtils]: 84: Hoare triple {42951#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {42952#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:17,777 INFO L273 TraceCheckUtils]: 85: Hoare triple {42952#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42952#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:17,777 INFO L273 TraceCheckUtils]: 86: Hoare triple {42952#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42952#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:17,778 INFO L273 TraceCheckUtils]: 87: Hoare triple {42952#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {42953#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:17,778 INFO L273 TraceCheckUtils]: 88: Hoare triple {42953#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42953#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:17,779 INFO L273 TraceCheckUtils]: 89: Hoare triple {42953#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42953#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:17,779 INFO L273 TraceCheckUtils]: 90: Hoare triple {42953#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {42954#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:17,780 INFO L273 TraceCheckUtils]: 91: Hoare triple {42954#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42954#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:17,780 INFO L273 TraceCheckUtils]: 92: Hoare triple {42954#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42954#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:17,781 INFO L273 TraceCheckUtils]: 93: Hoare triple {42954#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {42955#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:17,782 INFO L273 TraceCheckUtils]: 94: Hoare triple {42955#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42955#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:17,782 INFO L273 TraceCheckUtils]: 95: Hoare triple {42955#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42955#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:17,783 INFO L273 TraceCheckUtils]: 96: Hoare triple {42955#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {42956#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:17,783 INFO L273 TraceCheckUtils]: 97: Hoare triple {42956#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42956#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:17,784 INFO L273 TraceCheckUtils]: 98: Hoare triple {42956#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42956#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:17,784 INFO L273 TraceCheckUtils]: 99: Hoare triple {42956#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {42957#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:17,785 INFO L273 TraceCheckUtils]: 100: Hoare triple {42957#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42957#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:17,785 INFO L273 TraceCheckUtils]: 101: Hoare triple {42957#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42957#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:17,786 INFO L273 TraceCheckUtils]: 102: Hoare triple {42957#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {42958#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:17,786 INFO L273 TraceCheckUtils]: 103: Hoare triple {42958#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42958#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:17,787 INFO L273 TraceCheckUtils]: 104: Hoare triple {42958#(<= main_~i~0 33)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42958#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:17,787 INFO L273 TraceCheckUtils]: 105: Hoare triple {42958#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {42959#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:17,788 INFO L273 TraceCheckUtils]: 106: Hoare triple {42959#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42959#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:17,788 INFO L273 TraceCheckUtils]: 107: Hoare triple {42959#(<= main_~i~0 34)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42959#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:17,789 INFO L273 TraceCheckUtils]: 108: Hoare triple {42959#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {42960#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:17,790 INFO L273 TraceCheckUtils]: 109: Hoare triple {42960#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42960#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:17,790 INFO L273 TraceCheckUtils]: 110: Hoare triple {42960#(<= main_~i~0 35)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42960#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:17,791 INFO L273 TraceCheckUtils]: 111: Hoare triple {42960#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {42961#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:17,791 INFO L273 TraceCheckUtils]: 112: Hoare triple {42961#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42961#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:17,792 INFO L273 TraceCheckUtils]: 113: Hoare triple {42961#(<= main_~i~0 36)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42961#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:17,792 INFO L273 TraceCheckUtils]: 114: Hoare triple {42961#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {42962#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:17,793 INFO L273 TraceCheckUtils]: 115: Hoare triple {42962#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42962#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:17,793 INFO L273 TraceCheckUtils]: 116: Hoare triple {42962#(<= main_~i~0 37)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42962#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:17,794 INFO L273 TraceCheckUtils]: 117: Hoare triple {42962#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {42963#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:17,794 INFO L273 TraceCheckUtils]: 118: Hoare triple {42963#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42963#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:17,795 INFO L273 TraceCheckUtils]: 119: Hoare triple {42963#(<= main_~i~0 38)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42963#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:17,795 INFO L273 TraceCheckUtils]: 120: Hoare triple {42963#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {42964#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:17,796 INFO L273 TraceCheckUtils]: 121: Hoare triple {42964#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {42964#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:17,796 INFO L273 TraceCheckUtils]: 122: Hoare triple {42964#(<= main_~i~0 39)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42964#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:17,797 INFO L273 TraceCheckUtils]: 123: Hoare triple {42964#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {42965#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:17,798 INFO L273 TraceCheckUtils]: 124: Hoare triple {42965#(<= main_~i~0 40)} assume !(~i~0 < 100000); {42925#false} is VALID [2018-11-23 11:53:17,798 INFO L273 TraceCheckUtils]: 125: Hoare triple {42925#false} assume !(0 != ~swapped~0); {42925#false} is VALID [2018-11-23 11:53:17,798 INFO L273 TraceCheckUtils]: 126: Hoare triple {42925#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {42925#false} is VALID [2018-11-23 11:53:17,798 INFO L273 TraceCheckUtils]: 127: Hoare triple {42925#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {42925#false} is VALID [2018-11-23 11:53:17,798 INFO L273 TraceCheckUtils]: 128: Hoare triple {42925#false} assume !!(~y~0 < 100000);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); {42925#false} is VALID [2018-11-23 11:53:17,799 INFO L256 TraceCheckUtils]: 129: Hoare triple {42925#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {42925#false} is VALID [2018-11-23 11:53:17,799 INFO L273 TraceCheckUtils]: 130: Hoare triple {42925#false} ~cond := #in~cond; {42925#false} is VALID [2018-11-23 11:53:17,799 INFO L273 TraceCheckUtils]: 131: Hoare triple {42925#false} assume 0 == ~cond; {42925#false} is VALID [2018-11-23 11:53:17,799 INFO L273 TraceCheckUtils]: 132: Hoare triple {42925#false} assume !false; {42925#false} is VALID [2018-11-23 11:53:17,811 INFO L134 CoverageAnalysis]: Checked inductivity of 2263 backedges. 1 proven. 2262 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:53:17,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:17,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 43 [2018-11-23 11:53:17,832 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 133 [2018-11-23 11:53:17,833 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:17,833 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states. [2018-11-23 11:53:17,961 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:17,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-23 11:53:17,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-23 11:53:17,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 11:53:17,962 INFO L87 Difference]: Start difference. First operand 255 states and 336 transitions. Second operand 43 states. [2018-11-23 11:53:18,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:18,784 INFO L93 Difference]: Finished difference Result 514 states and 682 transitions. [2018-11-23 11:53:18,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-23 11:53:18,785 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 133 [2018-11-23 11:53:18,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:18,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 11:53:18,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 209 transitions. [2018-11-23 11:53:18,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 11:53:18,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 209 transitions. [2018-11-23 11:53:18,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 209 transitions. [2018-11-23 11:53:18,999 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 209 edges. 209 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:19,005 INFO L225 Difference]: With dead ends: 514 [2018-11-23 11:53:19,005 INFO L226 Difference]: Without dead ends: 265 [2018-11-23 11:53:19,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 11:53:19,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-11-23 11:53:19,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 261. [2018-11-23 11:53:19,124 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:19,124 INFO L82 GeneralOperation]: Start isEquivalent. First operand 265 states. Second operand 261 states. [2018-11-23 11:53:19,124 INFO L74 IsIncluded]: Start isIncluded. First operand 265 states. Second operand 261 states. [2018-11-23 11:53:19,124 INFO L87 Difference]: Start difference. First operand 265 states. Second operand 261 states. [2018-11-23 11:53:19,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:19,130 INFO L93 Difference]: Finished difference Result 265 states and 350 transitions. [2018-11-23 11:53:19,130 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 350 transitions. [2018-11-23 11:53:19,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:19,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:19,130 INFO L74 IsIncluded]: Start isIncluded. First operand 261 states. Second operand 265 states. [2018-11-23 11:53:19,130 INFO L87 Difference]: Start difference. First operand 261 states. Second operand 265 states. [2018-11-23 11:53:19,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:19,134 INFO L93 Difference]: Finished difference Result 265 states and 350 transitions. [2018-11-23 11:53:19,134 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 350 transitions. [2018-11-23 11:53:19,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:19,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:19,135 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:19,135 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:19,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-11-23 11:53:19,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 344 transitions. [2018-11-23 11:53:19,140 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 344 transitions. Word has length 133 [2018-11-23 11:53:19,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:19,141 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 344 transitions. [2018-11-23 11:53:19,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-23 11:53:19,141 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 344 transitions. [2018-11-23 11:53:19,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-23 11:53:19,142 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:19,142 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:53:19,142 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:19,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:19,142 INFO L82 PathProgramCache]: Analyzing trace with hash -349397679, now seen corresponding path program 40 times [2018-11-23 11:53:19,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:19,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:19,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:19,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:19,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:19,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:20,382 INFO L256 TraceCheckUtils]: 0: Hoare triple {44937#true} call ULTIMATE.init(); {44937#true} is VALID [2018-11-23 11:53:20,382 INFO L273 TraceCheckUtils]: 1: Hoare triple {44937#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {44937#true} is VALID [2018-11-23 11:53:20,383 INFO L273 TraceCheckUtils]: 2: Hoare triple {44937#true} assume true; {44937#true} is VALID [2018-11-23 11:53:20,383 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {44937#true} {44937#true} #79#return; {44937#true} is VALID [2018-11-23 11:53:20,383 INFO L256 TraceCheckUtils]: 4: Hoare triple {44937#true} call #t~ret8 := main(); {44937#true} is VALID [2018-11-23 11:53:20,383 INFO L273 TraceCheckUtils]: 5: Hoare triple {44937#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {44937#true} is VALID [2018-11-23 11:53:20,384 INFO L273 TraceCheckUtils]: 6: Hoare triple {44937#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {44939#(= main_~i~0 1)} is VALID [2018-11-23 11:53:20,384 INFO L273 TraceCheckUtils]: 7: Hoare triple {44939#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44939#(= main_~i~0 1)} is VALID [2018-11-23 11:53:20,385 INFO L273 TraceCheckUtils]: 8: Hoare triple {44939#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44939#(= main_~i~0 1)} is VALID [2018-11-23 11:53:20,386 INFO L273 TraceCheckUtils]: 9: Hoare triple {44939#(= main_~i~0 1)} ~i~0 := 1 + ~i~0; {44940#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:20,386 INFO L273 TraceCheckUtils]: 10: Hoare triple {44940#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44940#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:20,386 INFO L273 TraceCheckUtils]: 11: Hoare triple {44940#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44940#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:20,387 INFO L273 TraceCheckUtils]: 12: Hoare triple {44940#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {44941#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:20,387 INFO L273 TraceCheckUtils]: 13: Hoare triple {44941#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44941#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:20,387 INFO L273 TraceCheckUtils]: 14: Hoare triple {44941#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44941#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:20,388 INFO L273 TraceCheckUtils]: 15: Hoare triple {44941#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {44942#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:20,389 INFO L273 TraceCheckUtils]: 16: Hoare triple {44942#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44942#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:20,389 INFO L273 TraceCheckUtils]: 17: Hoare triple {44942#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44942#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:20,390 INFO L273 TraceCheckUtils]: 18: Hoare triple {44942#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {44943#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:20,390 INFO L273 TraceCheckUtils]: 19: Hoare triple {44943#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44943#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:20,391 INFO L273 TraceCheckUtils]: 20: Hoare triple {44943#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44943#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:20,392 INFO L273 TraceCheckUtils]: 21: Hoare triple {44943#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {44944#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:20,392 INFO L273 TraceCheckUtils]: 22: Hoare triple {44944#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44944#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:20,393 INFO L273 TraceCheckUtils]: 23: Hoare triple {44944#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44944#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:20,393 INFO L273 TraceCheckUtils]: 24: Hoare triple {44944#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {44945#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:20,394 INFO L273 TraceCheckUtils]: 25: Hoare triple {44945#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44945#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:20,394 INFO L273 TraceCheckUtils]: 26: Hoare triple {44945#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44945#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:20,395 INFO L273 TraceCheckUtils]: 27: Hoare triple {44945#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {44946#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:20,396 INFO L273 TraceCheckUtils]: 28: Hoare triple {44946#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44946#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:20,396 INFO L273 TraceCheckUtils]: 29: Hoare triple {44946#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44946#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:20,397 INFO L273 TraceCheckUtils]: 30: Hoare triple {44946#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {44947#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:20,398 INFO L273 TraceCheckUtils]: 31: Hoare triple {44947#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44947#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:20,398 INFO L273 TraceCheckUtils]: 32: Hoare triple {44947#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44947#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:20,399 INFO L273 TraceCheckUtils]: 33: Hoare triple {44947#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {44948#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:20,399 INFO L273 TraceCheckUtils]: 34: Hoare triple {44948#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44948#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:20,400 INFO L273 TraceCheckUtils]: 35: Hoare triple {44948#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44948#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:20,400 INFO L273 TraceCheckUtils]: 36: Hoare triple {44948#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {44949#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:20,401 INFO L273 TraceCheckUtils]: 37: Hoare triple {44949#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44949#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:20,401 INFO L273 TraceCheckUtils]: 38: Hoare triple {44949#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44949#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:20,402 INFO L273 TraceCheckUtils]: 39: Hoare triple {44949#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {44950#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:20,403 INFO L273 TraceCheckUtils]: 40: Hoare triple {44950#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44950#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:20,403 INFO L273 TraceCheckUtils]: 41: Hoare triple {44950#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44950#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:20,404 INFO L273 TraceCheckUtils]: 42: Hoare triple {44950#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {44951#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:20,404 INFO L273 TraceCheckUtils]: 43: Hoare triple {44951#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44951#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:20,405 INFO L273 TraceCheckUtils]: 44: Hoare triple {44951#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44951#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:20,406 INFO L273 TraceCheckUtils]: 45: Hoare triple {44951#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {44952#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:20,406 INFO L273 TraceCheckUtils]: 46: Hoare triple {44952#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44952#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:20,407 INFO L273 TraceCheckUtils]: 47: Hoare triple {44952#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44952#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:20,407 INFO L273 TraceCheckUtils]: 48: Hoare triple {44952#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {44953#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:20,408 INFO L273 TraceCheckUtils]: 49: Hoare triple {44953#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44953#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:20,408 INFO L273 TraceCheckUtils]: 50: Hoare triple {44953#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44953#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:20,409 INFO L273 TraceCheckUtils]: 51: Hoare triple {44953#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {44954#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:20,410 INFO L273 TraceCheckUtils]: 52: Hoare triple {44954#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44954#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:20,410 INFO L273 TraceCheckUtils]: 53: Hoare triple {44954#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44954#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:20,411 INFO L273 TraceCheckUtils]: 54: Hoare triple {44954#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {44955#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:20,411 INFO L273 TraceCheckUtils]: 55: Hoare triple {44955#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44955#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:20,412 INFO L273 TraceCheckUtils]: 56: Hoare triple {44955#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44955#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:20,413 INFO L273 TraceCheckUtils]: 57: Hoare triple {44955#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {44956#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:20,413 INFO L273 TraceCheckUtils]: 58: Hoare triple {44956#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44956#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:20,414 INFO L273 TraceCheckUtils]: 59: Hoare triple {44956#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44956#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:20,414 INFO L273 TraceCheckUtils]: 60: Hoare triple {44956#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {44957#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:20,415 INFO L273 TraceCheckUtils]: 61: Hoare triple {44957#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44957#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:20,415 INFO L273 TraceCheckUtils]: 62: Hoare triple {44957#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44957#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:20,416 INFO L273 TraceCheckUtils]: 63: Hoare triple {44957#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {44958#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:20,417 INFO L273 TraceCheckUtils]: 64: Hoare triple {44958#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44958#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:20,417 INFO L273 TraceCheckUtils]: 65: Hoare triple {44958#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44958#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:20,418 INFO L273 TraceCheckUtils]: 66: Hoare triple {44958#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {44959#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:20,418 INFO L273 TraceCheckUtils]: 67: Hoare triple {44959#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44959#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:20,419 INFO L273 TraceCheckUtils]: 68: Hoare triple {44959#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44959#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:20,420 INFO L273 TraceCheckUtils]: 69: Hoare triple {44959#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {44960#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:20,420 INFO L273 TraceCheckUtils]: 70: Hoare triple {44960#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44960#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:20,421 INFO L273 TraceCheckUtils]: 71: Hoare triple {44960#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44960#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:20,421 INFO L273 TraceCheckUtils]: 72: Hoare triple {44960#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {44961#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:20,422 INFO L273 TraceCheckUtils]: 73: Hoare triple {44961#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44961#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:20,422 INFO L273 TraceCheckUtils]: 74: Hoare triple {44961#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44961#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:20,423 INFO L273 TraceCheckUtils]: 75: Hoare triple {44961#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {44962#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:20,424 INFO L273 TraceCheckUtils]: 76: Hoare triple {44962#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44962#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:20,424 INFO L273 TraceCheckUtils]: 77: Hoare triple {44962#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44962#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:20,425 INFO L273 TraceCheckUtils]: 78: Hoare triple {44962#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {44963#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:20,425 INFO L273 TraceCheckUtils]: 79: Hoare triple {44963#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44963#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:20,426 INFO L273 TraceCheckUtils]: 80: Hoare triple {44963#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44963#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:20,426 INFO L273 TraceCheckUtils]: 81: Hoare triple {44963#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {44964#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:20,427 INFO L273 TraceCheckUtils]: 82: Hoare triple {44964#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44964#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:20,428 INFO L273 TraceCheckUtils]: 83: Hoare triple {44964#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44964#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:20,428 INFO L273 TraceCheckUtils]: 84: Hoare triple {44964#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {44965#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:20,429 INFO L273 TraceCheckUtils]: 85: Hoare triple {44965#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44965#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:20,429 INFO L273 TraceCheckUtils]: 86: Hoare triple {44965#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44965#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:20,430 INFO L273 TraceCheckUtils]: 87: Hoare triple {44965#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {44966#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:20,430 INFO L273 TraceCheckUtils]: 88: Hoare triple {44966#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44966#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:20,431 INFO L273 TraceCheckUtils]: 89: Hoare triple {44966#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44966#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:20,432 INFO L273 TraceCheckUtils]: 90: Hoare triple {44966#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {44967#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:20,432 INFO L273 TraceCheckUtils]: 91: Hoare triple {44967#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44967#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:20,433 INFO L273 TraceCheckUtils]: 92: Hoare triple {44967#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44967#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:20,433 INFO L273 TraceCheckUtils]: 93: Hoare triple {44967#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {44968#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:20,434 INFO L273 TraceCheckUtils]: 94: Hoare triple {44968#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44968#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:20,434 INFO L273 TraceCheckUtils]: 95: Hoare triple {44968#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44968#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:20,435 INFO L273 TraceCheckUtils]: 96: Hoare triple {44968#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {44969#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:20,436 INFO L273 TraceCheckUtils]: 97: Hoare triple {44969#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44969#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:20,436 INFO L273 TraceCheckUtils]: 98: Hoare triple {44969#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44969#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:20,437 INFO L273 TraceCheckUtils]: 99: Hoare triple {44969#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {44970#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:20,437 INFO L273 TraceCheckUtils]: 100: Hoare triple {44970#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44970#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:20,438 INFO L273 TraceCheckUtils]: 101: Hoare triple {44970#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44970#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:20,439 INFO L273 TraceCheckUtils]: 102: Hoare triple {44970#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {44971#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:20,439 INFO L273 TraceCheckUtils]: 103: Hoare triple {44971#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44971#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:20,440 INFO L273 TraceCheckUtils]: 104: Hoare triple {44971#(<= main_~i~0 33)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44971#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:20,440 INFO L273 TraceCheckUtils]: 105: Hoare triple {44971#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {44972#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:20,441 INFO L273 TraceCheckUtils]: 106: Hoare triple {44972#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44972#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:20,441 INFO L273 TraceCheckUtils]: 107: Hoare triple {44972#(<= main_~i~0 34)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44972#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:20,442 INFO L273 TraceCheckUtils]: 108: Hoare triple {44972#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {44973#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:20,443 INFO L273 TraceCheckUtils]: 109: Hoare triple {44973#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44973#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:20,443 INFO L273 TraceCheckUtils]: 110: Hoare triple {44973#(<= main_~i~0 35)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44973#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:20,444 INFO L273 TraceCheckUtils]: 111: Hoare triple {44973#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {44974#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:20,444 INFO L273 TraceCheckUtils]: 112: Hoare triple {44974#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44974#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:20,445 INFO L273 TraceCheckUtils]: 113: Hoare triple {44974#(<= main_~i~0 36)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44974#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:20,446 INFO L273 TraceCheckUtils]: 114: Hoare triple {44974#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {44975#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:20,446 INFO L273 TraceCheckUtils]: 115: Hoare triple {44975#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44975#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:20,447 INFO L273 TraceCheckUtils]: 116: Hoare triple {44975#(<= main_~i~0 37)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44975#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:20,447 INFO L273 TraceCheckUtils]: 117: Hoare triple {44975#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {44976#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:20,448 INFO L273 TraceCheckUtils]: 118: Hoare triple {44976#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44976#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:20,448 INFO L273 TraceCheckUtils]: 119: Hoare triple {44976#(<= main_~i~0 38)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44976#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:20,449 INFO L273 TraceCheckUtils]: 120: Hoare triple {44976#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {44977#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:20,449 INFO L273 TraceCheckUtils]: 121: Hoare triple {44977#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44977#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:20,450 INFO L273 TraceCheckUtils]: 122: Hoare triple {44977#(<= main_~i~0 39)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44977#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:20,451 INFO L273 TraceCheckUtils]: 123: Hoare triple {44977#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {44978#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:20,451 INFO L273 TraceCheckUtils]: 124: Hoare triple {44978#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44978#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:20,452 INFO L273 TraceCheckUtils]: 125: Hoare triple {44978#(<= main_~i~0 40)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44978#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:20,452 INFO L273 TraceCheckUtils]: 126: Hoare triple {44978#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {44979#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:20,453 INFO L273 TraceCheckUtils]: 127: Hoare triple {44979#(<= main_~i~0 41)} assume !(~i~0 < 100000); {44938#false} is VALID [2018-11-23 11:53:20,453 INFO L273 TraceCheckUtils]: 128: Hoare triple {44938#false} assume !(0 != ~swapped~0); {44938#false} is VALID [2018-11-23 11:53:20,454 INFO L273 TraceCheckUtils]: 129: Hoare triple {44938#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {44938#false} is VALID [2018-11-23 11:53:20,454 INFO L273 TraceCheckUtils]: 130: Hoare triple {44938#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {44938#false} is VALID [2018-11-23 11:53:20,454 INFO L273 TraceCheckUtils]: 131: Hoare triple {44938#false} assume !!(~y~0 < 100000);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); {44938#false} is VALID [2018-11-23 11:53:20,454 INFO L256 TraceCheckUtils]: 132: Hoare triple {44938#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {44938#false} is VALID [2018-11-23 11:53:20,454 INFO L273 TraceCheckUtils]: 133: Hoare triple {44938#false} ~cond := #in~cond; {44938#false} is VALID [2018-11-23 11:53:20,454 INFO L273 TraceCheckUtils]: 134: Hoare triple {44938#false} assume 0 == ~cond; {44938#false} is VALID [2018-11-23 11:53:20,455 INFO L273 TraceCheckUtils]: 135: Hoare triple {44938#false} assume !false; {44938#false} is VALID [2018-11-23 11:53:20,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2381 backedges. 1 proven. 2380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:53:20,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:20,466 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 11:53:20,476 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:53:20,534 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:53:20,534 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:20,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:20,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:20,853 INFO L256 TraceCheckUtils]: 0: Hoare triple {44937#true} call ULTIMATE.init(); {44937#true} is VALID [2018-11-23 11:53:20,853 INFO L273 TraceCheckUtils]: 1: Hoare triple {44937#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {44937#true} is VALID [2018-11-23 11:53:20,854 INFO L273 TraceCheckUtils]: 2: Hoare triple {44937#true} assume true; {44937#true} is VALID [2018-11-23 11:53:20,854 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {44937#true} {44937#true} #79#return; {44937#true} is VALID [2018-11-23 11:53:20,854 INFO L256 TraceCheckUtils]: 4: Hoare triple {44937#true} call #t~ret8 := main(); {44937#true} is VALID [2018-11-23 11:53:20,854 INFO L273 TraceCheckUtils]: 5: Hoare triple {44937#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {44937#true} is VALID [2018-11-23 11:53:20,855 INFO L273 TraceCheckUtils]: 6: Hoare triple {44937#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {45001#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:20,855 INFO L273 TraceCheckUtils]: 7: Hoare triple {45001#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {45001#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:20,855 INFO L273 TraceCheckUtils]: 8: Hoare triple {45001#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {45001#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:20,856 INFO L273 TraceCheckUtils]: 9: Hoare triple {45001#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {44940#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:20,856 INFO L273 TraceCheckUtils]: 10: Hoare triple {44940#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44940#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:20,856 INFO L273 TraceCheckUtils]: 11: Hoare triple {44940#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44940#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:20,857 INFO L273 TraceCheckUtils]: 12: Hoare triple {44940#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {44941#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:20,857 INFO L273 TraceCheckUtils]: 13: Hoare triple {44941#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44941#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:20,857 INFO L273 TraceCheckUtils]: 14: Hoare triple {44941#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44941#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:20,858 INFO L273 TraceCheckUtils]: 15: Hoare triple {44941#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {44942#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:20,858 INFO L273 TraceCheckUtils]: 16: Hoare triple {44942#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44942#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:20,859 INFO L273 TraceCheckUtils]: 17: Hoare triple {44942#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44942#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:20,860 INFO L273 TraceCheckUtils]: 18: Hoare triple {44942#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {44943#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:20,860 INFO L273 TraceCheckUtils]: 19: Hoare triple {44943#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44943#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:20,861 INFO L273 TraceCheckUtils]: 20: Hoare triple {44943#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44943#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:20,861 INFO L273 TraceCheckUtils]: 21: Hoare triple {44943#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {44944#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:20,862 INFO L273 TraceCheckUtils]: 22: Hoare triple {44944#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44944#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:20,862 INFO L273 TraceCheckUtils]: 23: Hoare triple {44944#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44944#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:20,863 INFO L273 TraceCheckUtils]: 24: Hoare triple {44944#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {44945#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:20,864 INFO L273 TraceCheckUtils]: 25: Hoare triple {44945#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44945#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:20,864 INFO L273 TraceCheckUtils]: 26: Hoare triple {44945#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44945#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:20,865 INFO L273 TraceCheckUtils]: 27: Hoare triple {44945#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {44946#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:20,865 INFO L273 TraceCheckUtils]: 28: Hoare triple {44946#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44946#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:20,866 INFO L273 TraceCheckUtils]: 29: Hoare triple {44946#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44946#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:20,866 INFO L273 TraceCheckUtils]: 30: Hoare triple {44946#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {44947#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:20,867 INFO L273 TraceCheckUtils]: 31: Hoare triple {44947#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44947#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:20,867 INFO L273 TraceCheckUtils]: 32: Hoare triple {44947#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44947#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:20,868 INFO L273 TraceCheckUtils]: 33: Hoare triple {44947#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {44948#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:20,869 INFO L273 TraceCheckUtils]: 34: Hoare triple {44948#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44948#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:20,869 INFO L273 TraceCheckUtils]: 35: Hoare triple {44948#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44948#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:20,870 INFO L273 TraceCheckUtils]: 36: Hoare triple {44948#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {44949#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:20,870 INFO L273 TraceCheckUtils]: 37: Hoare triple {44949#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44949#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:20,871 INFO L273 TraceCheckUtils]: 38: Hoare triple {44949#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44949#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:20,872 INFO L273 TraceCheckUtils]: 39: Hoare triple {44949#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {44950#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:20,872 INFO L273 TraceCheckUtils]: 40: Hoare triple {44950#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44950#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:20,873 INFO L273 TraceCheckUtils]: 41: Hoare triple {44950#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44950#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:20,873 INFO L273 TraceCheckUtils]: 42: Hoare triple {44950#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {44951#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:20,874 INFO L273 TraceCheckUtils]: 43: Hoare triple {44951#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44951#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:20,874 INFO L273 TraceCheckUtils]: 44: Hoare triple {44951#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44951#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:20,875 INFO L273 TraceCheckUtils]: 45: Hoare triple {44951#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {44952#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:20,875 INFO L273 TraceCheckUtils]: 46: Hoare triple {44952#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44952#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:20,876 INFO L273 TraceCheckUtils]: 47: Hoare triple {44952#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44952#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:20,877 INFO L273 TraceCheckUtils]: 48: Hoare triple {44952#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {44953#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:20,877 INFO L273 TraceCheckUtils]: 49: Hoare triple {44953#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44953#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:20,878 INFO L273 TraceCheckUtils]: 50: Hoare triple {44953#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44953#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:20,878 INFO L273 TraceCheckUtils]: 51: Hoare triple {44953#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {44954#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:20,879 INFO L273 TraceCheckUtils]: 52: Hoare triple {44954#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44954#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:20,879 INFO L273 TraceCheckUtils]: 53: Hoare triple {44954#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44954#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:20,880 INFO L273 TraceCheckUtils]: 54: Hoare triple {44954#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {44955#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:20,881 INFO L273 TraceCheckUtils]: 55: Hoare triple {44955#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44955#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:20,881 INFO L273 TraceCheckUtils]: 56: Hoare triple {44955#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44955#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:20,882 INFO L273 TraceCheckUtils]: 57: Hoare triple {44955#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {44956#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:20,882 INFO L273 TraceCheckUtils]: 58: Hoare triple {44956#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44956#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:20,883 INFO L273 TraceCheckUtils]: 59: Hoare triple {44956#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44956#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:20,884 INFO L273 TraceCheckUtils]: 60: Hoare triple {44956#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {44957#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:20,884 INFO L273 TraceCheckUtils]: 61: Hoare triple {44957#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44957#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:20,885 INFO L273 TraceCheckUtils]: 62: Hoare triple {44957#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44957#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:20,885 INFO L273 TraceCheckUtils]: 63: Hoare triple {44957#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {44958#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:20,886 INFO L273 TraceCheckUtils]: 64: Hoare triple {44958#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44958#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:20,886 INFO L273 TraceCheckUtils]: 65: Hoare triple {44958#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44958#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:20,887 INFO L273 TraceCheckUtils]: 66: Hoare triple {44958#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {44959#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:20,887 INFO L273 TraceCheckUtils]: 67: Hoare triple {44959#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44959#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:20,888 INFO L273 TraceCheckUtils]: 68: Hoare triple {44959#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44959#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:20,889 INFO L273 TraceCheckUtils]: 69: Hoare triple {44959#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {44960#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:20,889 INFO L273 TraceCheckUtils]: 70: Hoare triple {44960#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44960#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:20,890 INFO L273 TraceCheckUtils]: 71: Hoare triple {44960#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44960#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:20,890 INFO L273 TraceCheckUtils]: 72: Hoare triple {44960#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {44961#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:20,891 INFO L273 TraceCheckUtils]: 73: Hoare triple {44961#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44961#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:20,891 INFO L273 TraceCheckUtils]: 74: Hoare triple {44961#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44961#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:20,892 INFO L273 TraceCheckUtils]: 75: Hoare triple {44961#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {44962#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:20,893 INFO L273 TraceCheckUtils]: 76: Hoare triple {44962#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44962#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:20,893 INFO L273 TraceCheckUtils]: 77: Hoare triple {44962#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44962#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:20,894 INFO L273 TraceCheckUtils]: 78: Hoare triple {44962#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {44963#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:20,894 INFO L273 TraceCheckUtils]: 79: Hoare triple {44963#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44963#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:20,895 INFO L273 TraceCheckUtils]: 80: Hoare triple {44963#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44963#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:20,895 INFO L273 TraceCheckUtils]: 81: Hoare triple {44963#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {44964#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:20,896 INFO L273 TraceCheckUtils]: 82: Hoare triple {44964#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44964#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:20,897 INFO L273 TraceCheckUtils]: 83: Hoare triple {44964#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44964#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:20,897 INFO L273 TraceCheckUtils]: 84: Hoare triple {44964#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {44965#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:20,898 INFO L273 TraceCheckUtils]: 85: Hoare triple {44965#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44965#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:20,898 INFO L273 TraceCheckUtils]: 86: Hoare triple {44965#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44965#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:20,899 INFO L273 TraceCheckUtils]: 87: Hoare triple {44965#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {44966#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:20,899 INFO L273 TraceCheckUtils]: 88: Hoare triple {44966#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44966#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:20,900 INFO L273 TraceCheckUtils]: 89: Hoare triple {44966#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44966#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:20,901 INFO L273 TraceCheckUtils]: 90: Hoare triple {44966#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {44967#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:20,901 INFO L273 TraceCheckUtils]: 91: Hoare triple {44967#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44967#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:20,902 INFO L273 TraceCheckUtils]: 92: Hoare triple {44967#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44967#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:20,902 INFO L273 TraceCheckUtils]: 93: Hoare triple {44967#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {44968#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:20,903 INFO L273 TraceCheckUtils]: 94: Hoare triple {44968#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44968#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:20,903 INFO L273 TraceCheckUtils]: 95: Hoare triple {44968#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44968#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:20,904 INFO L273 TraceCheckUtils]: 96: Hoare triple {44968#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {44969#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:20,905 INFO L273 TraceCheckUtils]: 97: Hoare triple {44969#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44969#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:20,905 INFO L273 TraceCheckUtils]: 98: Hoare triple {44969#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44969#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:20,906 INFO L273 TraceCheckUtils]: 99: Hoare triple {44969#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {44970#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:20,906 INFO L273 TraceCheckUtils]: 100: Hoare triple {44970#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44970#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:20,907 INFO L273 TraceCheckUtils]: 101: Hoare triple {44970#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44970#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:20,907 INFO L273 TraceCheckUtils]: 102: Hoare triple {44970#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {44971#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:20,908 INFO L273 TraceCheckUtils]: 103: Hoare triple {44971#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44971#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:20,908 INFO L273 TraceCheckUtils]: 104: Hoare triple {44971#(<= main_~i~0 33)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44971#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:20,909 INFO L273 TraceCheckUtils]: 105: Hoare triple {44971#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {44972#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:20,910 INFO L273 TraceCheckUtils]: 106: Hoare triple {44972#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44972#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:20,910 INFO L273 TraceCheckUtils]: 107: Hoare triple {44972#(<= main_~i~0 34)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44972#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:20,911 INFO L273 TraceCheckUtils]: 108: Hoare triple {44972#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {44973#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:20,911 INFO L273 TraceCheckUtils]: 109: Hoare triple {44973#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44973#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:20,912 INFO L273 TraceCheckUtils]: 110: Hoare triple {44973#(<= main_~i~0 35)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44973#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:20,913 INFO L273 TraceCheckUtils]: 111: Hoare triple {44973#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {44974#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:20,913 INFO L273 TraceCheckUtils]: 112: Hoare triple {44974#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44974#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:20,914 INFO L273 TraceCheckUtils]: 113: Hoare triple {44974#(<= main_~i~0 36)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44974#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:20,914 INFO L273 TraceCheckUtils]: 114: Hoare triple {44974#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {44975#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:20,915 INFO L273 TraceCheckUtils]: 115: Hoare triple {44975#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44975#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:20,915 INFO L273 TraceCheckUtils]: 116: Hoare triple {44975#(<= main_~i~0 37)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44975#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:20,916 INFO L273 TraceCheckUtils]: 117: Hoare triple {44975#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {44976#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:20,916 INFO L273 TraceCheckUtils]: 118: Hoare triple {44976#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44976#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:20,917 INFO L273 TraceCheckUtils]: 119: Hoare triple {44976#(<= main_~i~0 38)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44976#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:20,918 INFO L273 TraceCheckUtils]: 120: Hoare triple {44976#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {44977#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:20,918 INFO L273 TraceCheckUtils]: 121: Hoare triple {44977#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44977#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:20,919 INFO L273 TraceCheckUtils]: 122: Hoare triple {44977#(<= main_~i~0 39)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44977#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:20,919 INFO L273 TraceCheckUtils]: 123: Hoare triple {44977#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {44978#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:20,920 INFO L273 TraceCheckUtils]: 124: Hoare triple {44978#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {44978#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:20,920 INFO L273 TraceCheckUtils]: 125: Hoare triple {44978#(<= main_~i~0 40)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {44978#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:20,921 INFO L273 TraceCheckUtils]: 126: Hoare triple {44978#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {44979#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:20,922 INFO L273 TraceCheckUtils]: 127: Hoare triple {44979#(<= main_~i~0 41)} assume !(~i~0 < 100000); {44938#false} is VALID [2018-11-23 11:53:20,922 INFO L273 TraceCheckUtils]: 128: Hoare triple {44938#false} assume !(0 != ~swapped~0); {44938#false} is VALID [2018-11-23 11:53:20,922 INFO L273 TraceCheckUtils]: 129: Hoare triple {44938#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {44938#false} is VALID [2018-11-23 11:53:20,922 INFO L273 TraceCheckUtils]: 130: Hoare triple {44938#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {44938#false} is VALID [2018-11-23 11:53:20,922 INFO L273 TraceCheckUtils]: 131: Hoare triple {44938#false} assume !!(~y~0 < 100000);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); {44938#false} is VALID [2018-11-23 11:53:20,923 INFO L256 TraceCheckUtils]: 132: Hoare triple {44938#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {44938#false} is VALID [2018-11-23 11:53:20,923 INFO L273 TraceCheckUtils]: 133: Hoare triple {44938#false} ~cond := #in~cond; {44938#false} is VALID [2018-11-23 11:53:20,923 INFO L273 TraceCheckUtils]: 134: Hoare triple {44938#false} assume 0 == ~cond; {44938#false} is VALID [2018-11-23 11:53:20,923 INFO L273 TraceCheckUtils]: 135: Hoare triple {44938#false} assume !false; {44938#false} is VALID [2018-11-23 11:53:20,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2381 backedges. 1 proven. 2380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:53:20,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:20,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2018-11-23 11:53:20,954 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 136 [2018-11-23 11:53:20,954 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:20,954 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states. [2018-11-23 11:53:21,089 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:21,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-23 11:53:21,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-23 11:53:21,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 11:53:21,091 INFO L87 Difference]: Start difference. First operand 261 states and 344 transitions. Second operand 44 states. [2018-11-23 11:53:22,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:22,226 INFO L93 Difference]: Finished difference Result 526 states and 698 transitions. [2018-11-23 11:53:22,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-23 11:53:22,226 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 136 [2018-11-23 11:53:22,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:22,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 11:53:22,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 213 transitions. [2018-11-23 11:53:22,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 11:53:22,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 213 transitions. [2018-11-23 11:53:22,229 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 213 transitions. [2018-11-23 11:53:22,483 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 213 edges. 213 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:22,490 INFO L225 Difference]: With dead ends: 526 [2018-11-23 11:53:22,490 INFO L226 Difference]: Without dead ends: 271 [2018-11-23 11:53:22,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 11:53:22,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-11-23 11:53:22,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 267. [2018-11-23 11:53:22,650 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:22,650 INFO L82 GeneralOperation]: Start isEquivalent. First operand 271 states. Second operand 267 states. [2018-11-23 11:53:22,651 INFO L74 IsIncluded]: Start isIncluded. First operand 271 states. Second operand 267 states. [2018-11-23 11:53:22,651 INFO L87 Difference]: Start difference. First operand 271 states. Second operand 267 states. [2018-11-23 11:53:22,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:22,657 INFO L93 Difference]: Finished difference Result 271 states and 358 transitions. [2018-11-23 11:53:22,657 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 358 transitions. [2018-11-23 11:53:22,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:22,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:22,658 INFO L74 IsIncluded]: Start isIncluded. First operand 267 states. Second operand 271 states. [2018-11-23 11:53:22,658 INFO L87 Difference]: Start difference. First operand 267 states. Second operand 271 states. [2018-11-23 11:53:22,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:22,664 INFO L93 Difference]: Finished difference Result 271 states and 358 transitions. [2018-11-23 11:53:22,664 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 358 transitions. [2018-11-23 11:53:22,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:22,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:22,664 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:22,664 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:22,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-11-23 11:53:22,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 352 transitions. [2018-11-23 11:53:22,670 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 352 transitions. Word has length 136 [2018-11-23 11:53:22,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:22,670 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 352 transitions. [2018-11-23 11:53:22,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-23 11:53:22,671 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 352 transitions. [2018-11-23 11:53:22,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-23 11:53:22,671 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:22,672 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:53:22,672 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:22,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:22,672 INFO L82 PathProgramCache]: Analyzing trace with hash 807130248, now seen corresponding path program 41 times [2018-11-23 11:53:22,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:22,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:22,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:22,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:22,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:22,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:24,242 INFO L256 TraceCheckUtils]: 0: Hoare triple {46996#true} call ULTIMATE.init(); {46996#true} is VALID [2018-11-23 11:53:24,243 INFO L273 TraceCheckUtils]: 1: Hoare triple {46996#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {46996#true} is VALID [2018-11-23 11:53:24,243 INFO L273 TraceCheckUtils]: 2: Hoare triple {46996#true} assume true; {46996#true} is VALID [2018-11-23 11:53:24,243 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {46996#true} {46996#true} #79#return; {46996#true} is VALID [2018-11-23 11:53:24,243 INFO L256 TraceCheckUtils]: 4: Hoare triple {46996#true} call #t~ret8 := main(); {46996#true} is VALID [2018-11-23 11:53:24,243 INFO L273 TraceCheckUtils]: 5: Hoare triple {46996#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {46996#true} is VALID [2018-11-23 11:53:24,244 INFO L273 TraceCheckUtils]: 6: Hoare triple {46996#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {46998#(= main_~i~0 1)} is VALID [2018-11-23 11:53:24,244 INFO L273 TraceCheckUtils]: 7: Hoare triple {46998#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {46998#(= main_~i~0 1)} is VALID [2018-11-23 11:53:24,245 INFO L273 TraceCheckUtils]: 8: Hoare triple {46998#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {46998#(= main_~i~0 1)} is VALID [2018-11-23 11:53:24,245 INFO L273 TraceCheckUtils]: 9: Hoare triple {46998#(= main_~i~0 1)} ~i~0 := 1 + ~i~0; {46999#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:24,245 INFO L273 TraceCheckUtils]: 10: Hoare triple {46999#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {46999#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:24,246 INFO L273 TraceCheckUtils]: 11: Hoare triple {46999#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {46999#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:24,246 INFO L273 TraceCheckUtils]: 12: Hoare triple {46999#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {47000#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:24,247 INFO L273 TraceCheckUtils]: 13: Hoare triple {47000#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47000#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:24,247 INFO L273 TraceCheckUtils]: 14: Hoare triple {47000#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47000#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:24,247 INFO L273 TraceCheckUtils]: 15: Hoare triple {47000#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {47001#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:24,248 INFO L273 TraceCheckUtils]: 16: Hoare triple {47001#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47001#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:24,248 INFO L273 TraceCheckUtils]: 17: Hoare triple {47001#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47001#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:24,248 INFO L273 TraceCheckUtils]: 18: Hoare triple {47001#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {47002#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:24,249 INFO L273 TraceCheckUtils]: 19: Hoare triple {47002#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47002#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:24,249 INFO L273 TraceCheckUtils]: 20: Hoare triple {47002#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47002#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:24,250 INFO L273 TraceCheckUtils]: 21: Hoare triple {47002#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {47003#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:24,251 INFO L273 TraceCheckUtils]: 22: Hoare triple {47003#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47003#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:24,251 INFO L273 TraceCheckUtils]: 23: Hoare triple {47003#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47003#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:24,252 INFO L273 TraceCheckUtils]: 24: Hoare triple {47003#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {47004#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:24,252 INFO L273 TraceCheckUtils]: 25: Hoare triple {47004#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47004#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:24,253 INFO L273 TraceCheckUtils]: 26: Hoare triple {47004#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47004#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:24,253 INFO L273 TraceCheckUtils]: 27: Hoare triple {47004#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {47005#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:24,254 INFO L273 TraceCheckUtils]: 28: Hoare triple {47005#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47005#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:24,254 INFO L273 TraceCheckUtils]: 29: Hoare triple {47005#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47005#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:24,255 INFO L273 TraceCheckUtils]: 30: Hoare triple {47005#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {47006#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:24,255 INFO L273 TraceCheckUtils]: 31: Hoare triple {47006#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47006#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:24,256 INFO L273 TraceCheckUtils]: 32: Hoare triple {47006#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47006#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:24,256 INFO L273 TraceCheckUtils]: 33: Hoare triple {47006#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {47007#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:24,257 INFO L273 TraceCheckUtils]: 34: Hoare triple {47007#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47007#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:24,257 INFO L273 TraceCheckUtils]: 35: Hoare triple {47007#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47007#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:24,258 INFO L273 TraceCheckUtils]: 36: Hoare triple {47007#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {47008#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:24,259 INFO L273 TraceCheckUtils]: 37: Hoare triple {47008#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47008#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:24,259 INFO L273 TraceCheckUtils]: 38: Hoare triple {47008#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47008#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:24,260 INFO L273 TraceCheckUtils]: 39: Hoare triple {47008#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {47009#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:24,260 INFO L273 TraceCheckUtils]: 40: Hoare triple {47009#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47009#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:24,261 INFO L273 TraceCheckUtils]: 41: Hoare triple {47009#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47009#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:24,261 INFO L273 TraceCheckUtils]: 42: Hoare triple {47009#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {47010#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:24,262 INFO L273 TraceCheckUtils]: 43: Hoare triple {47010#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47010#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:24,262 INFO L273 TraceCheckUtils]: 44: Hoare triple {47010#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47010#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:24,263 INFO L273 TraceCheckUtils]: 45: Hoare triple {47010#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {47011#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:24,264 INFO L273 TraceCheckUtils]: 46: Hoare triple {47011#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47011#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:24,264 INFO L273 TraceCheckUtils]: 47: Hoare triple {47011#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47011#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:24,265 INFO L273 TraceCheckUtils]: 48: Hoare triple {47011#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {47012#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:24,265 INFO L273 TraceCheckUtils]: 49: Hoare triple {47012#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47012#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:24,266 INFO L273 TraceCheckUtils]: 50: Hoare triple {47012#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47012#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:24,266 INFO L273 TraceCheckUtils]: 51: Hoare triple {47012#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {47013#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:24,267 INFO L273 TraceCheckUtils]: 52: Hoare triple {47013#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47013#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:24,267 INFO L273 TraceCheckUtils]: 53: Hoare triple {47013#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47013#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:24,268 INFO L273 TraceCheckUtils]: 54: Hoare triple {47013#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {47014#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:24,268 INFO L273 TraceCheckUtils]: 55: Hoare triple {47014#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47014#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:24,269 INFO L273 TraceCheckUtils]: 56: Hoare triple {47014#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47014#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:24,269 INFO L273 TraceCheckUtils]: 57: Hoare triple {47014#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {47015#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:24,270 INFO L273 TraceCheckUtils]: 58: Hoare triple {47015#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47015#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:24,270 INFO L273 TraceCheckUtils]: 59: Hoare triple {47015#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47015#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:24,271 INFO L273 TraceCheckUtils]: 60: Hoare triple {47015#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {47016#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:24,272 INFO L273 TraceCheckUtils]: 61: Hoare triple {47016#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47016#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:24,272 INFO L273 TraceCheckUtils]: 62: Hoare triple {47016#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47016#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:24,273 INFO L273 TraceCheckUtils]: 63: Hoare triple {47016#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {47017#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:24,273 INFO L273 TraceCheckUtils]: 64: Hoare triple {47017#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47017#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:24,274 INFO L273 TraceCheckUtils]: 65: Hoare triple {47017#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47017#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:24,274 INFO L273 TraceCheckUtils]: 66: Hoare triple {47017#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {47018#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:24,275 INFO L273 TraceCheckUtils]: 67: Hoare triple {47018#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47018#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:24,275 INFO L273 TraceCheckUtils]: 68: Hoare triple {47018#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47018#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:24,276 INFO L273 TraceCheckUtils]: 69: Hoare triple {47018#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {47019#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:24,276 INFO L273 TraceCheckUtils]: 70: Hoare triple {47019#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47019#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:24,277 INFO L273 TraceCheckUtils]: 71: Hoare triple {47019#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47019#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:24,277 INFO L273 TraceCheckUtils]: 72: Hoare triple {47019#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {47020#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:24,278 INFO L273 TraceCheckUtils]: 73: Hoare triple {47020#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47020#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:24,278 INFO L273 TraceCheckUtils]: 74: Hoare triple {47020#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47020#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:24,279 INFO L273 TraceCheckUtils]: 75: Hoare triple {47020#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {47021#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:24,280 INFO L273 TraceCheckUtils]: 76: Hoare triple {47021#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47021#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:24,280 INFO L273 TraceCheckUtils]: 77: Hoare triple {47021#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47021#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:24,281 INFO L273 TraceCheckUtils]: 78: Hoare triple {47021#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {47022#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:24,281 INFO L273 TraceCheckUtils]: 79: Hoare triple {47022#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47022#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:24,282 INFO L273 TraceCheckUtils]: 80: Hoare triple {47022#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47022#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:24,282 INFO L273 TraceCheckUtils]: 81: Hoare triple {47022#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {47023#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:24,283 INFO L273 TraceCheckUtils]: 82: Hoare triple {47023#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47023#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:24,283 INFO L273 TraceCheckUtils]: 83: Hoare triple {47023#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47023#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:24,284 INFO L273 TraceCheckUtils]: 84: Hoare triple {47023#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {47024#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:24,284 INFO L273 TraceCheckUtils]: 85: Hoare triple {47024#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47024#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:24,285 INFO L273 TraceCheckUtils]: 86: Hoare triple {47024#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47024#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:24,286 INFO L273 TraceCheckUtils]: 87: Hoare triple {47024#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {47025#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:24,286 INFO L273 TraceCheckUtils]: 88: Hoare triple {47025#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47025#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:24,287 INFO L273 TraceCheckUtils]: 89: Hoare triple {47025#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47025#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:24,287 INFO L273 TraceCheckUtils]: 90: Hoare triple {47025#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {47026#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:24,288 INFO L273 TraceCheckUtils]: 91: Hoare triple {47026#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47026#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:24,288 INFO L273 TraceCheckUtils]: 92: Hoare triple {47026#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47026#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:24,289 INFO L273 TraceCheckUtils]: 93: Hoare triple {47026#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {47027#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:24,289 INFO L273 TraceCheckUtils]: 94: Hoare triple {47027#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47027#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:24,290 INFO L273 TraceCheckUtils]: 95: Hoare triple {47027#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47027#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:24,290 INFO L273 TraceCheckUtils]: 96: Hoare triple {47027#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {47028#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:24,291 INFO L273 TraceCheckUtils]: 97: Hoare triple {47028#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47028#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:24,291 INFO L273 TraceCheckUtils]: 98: Hoare triple {47028#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47028#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:24,292 INFO L273 TraceCheckUtils]: 99: Hoare triple {47028#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {47029#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:24,293 INFO L273 TraceCheckUtils]: 100: Hoare triple {47029#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47029#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:24,293 INFO L273 TraceCheckUtils]: 101: Hoare triple {47029#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47029#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:24,294 INFO L273 TraceCheckUtils]: 102: Hoare triple {47029#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {47030#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:24,294 INFO L273 TraceCheckUtils]: 103: Hoare triple {47030#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47030#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:24,295 INFO L273 TraceCheckUtils]: 104: Hoare triple {47030#(<= main_~i~0 33)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47030#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:24,295 INFO L273 TraceCheckUtils]: 105: Hoare triple {47030#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {47031#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:24,296 INFO L273 TraceCheckUtils]: 106: Hoare triple {47031#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47031#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:24,296 INFO L273 TraceCheckUtils]: 107: Hoare triple {47031#(<= main_~i~0 34)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47031#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:24,297 INFO L273 TraceCheckUtils]: 108: Hoare triple {47031#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {47032#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:24,307 INFO L273 TraceCheckUtils]: 109: Hoare triple {47032#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47032#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:24,307 INFO L273 TraceCheckUtils]: 110: Hoare triple {47032#(<= main_~i~0 35)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47032#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:24,308 INFO L273 TraceCheckUtils]: 111: Hoare triple {47032#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {47033#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:24,308 INFO L273 TraceCheckUtils]: 112: Hoare triple {47033#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47033#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:24,308 INFO L273 TraceCheckUtils]: 113: Hoare triple {47033#(<= main_~i~0 36)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47033#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:24,309 INFO L273 TraceCheckUtils]: 114: Hoare triple {47033#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {47034#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:24,309 INFO L273 TraceCheckUtils]: 115: Hoare triple {47034#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47034#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:24,309 INFO L273 TraceCheckUtils]: 116: Hoare triple {47034#(<= main_~i~0 37)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47034#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:24,310 INFO L273 TraceCheckUtils]: 117: Hoare triple {47034#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {47035#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:24,310 INFO L273 TraceCheckUtils]: 118: Hoare triple {47035#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47035#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:24,310 INFO L273 TraceCheckUtils]: 119: Hoare triple {47035#(<= main_~i~0 38)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47035#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:24,311 INFO L273 TraceCheckUtils]: 120: Hoare triple {47035#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {47036#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:24,311 INFO L273 TraceCheckUtils]: 121: Hoare triple {47036#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47036#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:24,312 INFO L273 TraceCheckUtils]: 122: Hoare triple {47036#(<= main_~i~0 39)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47036#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:24,312 INFO L273 TraceCheckUtils]: 123: Hoare triple {47036#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {47037#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:24,313 INFO L273 TraceCheckUtils]: 124: Hoare triple {47037#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47037#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:24,313 INFO L273 TraceCheckUtils]: 125: Hoare triple {47037#(<= main_~i~0 40)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47037#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:24,314 INFO L273 TraceCheckUtils]: 126: Hoare triple {47037#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {47038#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:24,315 INFO L273 TraceCheckUtils]: 127: Hoare triple {47038#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47038#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:24,315 INFO L273 TraceCheckUtils]: 128: Hoare triple {47038#(<= main_~i~0 41)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47038#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:24,316 INFO L273 TraceCheckUtils]: 129: Hoare triple {47038#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {47039#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:24,316 INFO L273 TraceCheckUtils]: 130: Hoare triple {47039#(<= main_~i~0 42)} assume !(~i~0 < 100000); {46997#false} is VALID [2018-11-23 11:53:24,316 INFO L273 TraceCheckUtils]: 131: Hoare triple {46997#false} assume !(0 != ~swapped~0); {46997#false} is VALID [2018-11-23 11:53:24,317 INFO L273 TraceCheckUtils]: 132: Hoare triple {46997#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {46997#false} is VALID [2018-11-23 11:53:24,317 INFO L273 TraceCheckUtils]: 133: Hoare triple {46997#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {46997#false} is VALID [2018-11-23 11:53:24,317 INFO L273 TraceCheckUtils]: 134: Hoare triple {46997#false} assume !!(~y~0 < 100000);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); {46997#false} is VALID [2018-11-23 11:53:24,317 INFO L256 TraceCheckUtils]: 135: Hoare triple {46997#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {46997#false} is VALID [2018-11-23 11:53:24,317 INFO L273 TraceCheckUtils]: 136: Hoare triple {46997#false} ~cond := #in~cond; {46997#false} is VALID [2018-11-23 11:53:24,318 INFO L273 TraceCheckUtils]: 137: Hoare triple {46997#false} assume 0 == ~cond; {46997#false} is VALID [2018-11-23 11:53:24,318 INFO L273 TraceCheckUtils]: 138: Hoare triple {46997#false} assume !false; {46997#false} is VALID [2018-11-23 11:53:24,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2502 backedges. 1 proven. 2501 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:53:24,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:24,330 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 11:53:24,339 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:53:24,517 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-11-23 11:53:24,517 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:24,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:24,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:25,175 INFO L256 TraceCheckUtils]: 0: Hoare triple {46996#true} call ULTIMATE.init(); {46996#true} is VALID [2018-11-23 11:53:25,175 INFO L273 TraceCheckUtils]: 1: Hoare triple {46996#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {46996#true} is VALID [2018-11-23 11:53:25,175 INFO L273 TraceCheckUtils]: 2: Hoare triple {46996#true} assume true; {46996#true} is VALID [2018-11-23 11:53:25,176 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {46996#true} {46996#true} #79#return; {46996#true} is VALID [2018-11-23 11:53:25,176 INFO L256 TraceCheckUtils]: 4: Hoare triple {46996#true} call #t~ret8 := main(); {46996#true} is VALID [2018-11-23 11:53:25,176 INFO L273 TraceCheckUtils]: 5: Hoare triple {46996#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {46996#true} is VALID [2018-11-23 11:53:25,176 INFO L273 TraceCheckUtils]: 6: Hoare triple {46996#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {47061#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:25,176 INFO L273 TraceCheckUtils]: 7: Hoare triple {47061#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47061#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:25,177 INFO L273 TraceCheckUtils]: 8: Hoare triple {47061#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47061#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:25,178 INFO L273 TraceCheckUtils]: 9: Hoare triple {47061#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {46999#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:25,178 INFO L273 TraceCheckUtils]: 10: Hoare triple {46999#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {46999#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:25,179 INFO L273 TraceCheckUtils]: 11: Hoare triple {46999#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {46999#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:25,179 INFO L273 TraceCheckUtils]: 12: Hoare triple {46999#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {47000#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:25,180 INFO L273 TraceCheckUtils]: 13: Hoare triple {47000#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47000#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:25,180 INFO L273 TraceCheckUtils]: 14: Hoare triple {47000#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47000#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:25,181 INFO L273 TraceCheckUtils]: 15: Hoare triple {47000#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {47001#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:25,182 INFO L273 TraceCheckUtils]: 16: Hoare triple {47001#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47001#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:25,182 INFO L273 TraceCheckUtils]: 17: Hoare triple {47001#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47001#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:25,183 INFO L273 TraceCheckUtils]: 18: Hoare triple {47001#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {47002#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:25,183 INFO L273 TraceCheckUtils]: 19: Hoare triple {47002#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47002#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:25,184 INFO L273 TraceCheckUtils]: 20: Hoare triple {47002#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47002#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:25,184 INFO L273 TraceCheckUtils]: 21: Hoare triple {47002#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {47003#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:25,185 INFO L273 TraceCheckUtils]: 22: Hoare triple {47003#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47003#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:25,185 INFO L273 TraceCheckUtils]: 23: Hoare triple {47003#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47003#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:25,186 INFO L273 TraceCheckUtils]: 24: Hoare triple {47003#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {47004#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:25,187 INFO L273 TraceCheckUtils]: 25: Hoare triple {47004#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47004#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:25,187 INFO L273 TraceCheckUtils]: 26: Hoare triple {47004#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47004#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:25,188 INFO L273 TraceCheckUtils]: 27: Hoare triple {47004#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {47005#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:25,188 INFO L273 TraceCheckUtils]: 28: Hoare triple {47005#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47005#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:25,189 INFO L273 TraceCheckUtils]: 29: Hoare triple {47005#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47005#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:25,189 INFO L273 TraceCheckUtils]: 30: Hoare triple {47005#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {47006#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:25,190 INFO L273 TraceCheckUtils]: 31: Hoare triple {47006#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47006#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:25,190 INFO L273 TraceCheckUtils]: 32: Hoare triple {47006#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47006#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:25,191 INFO L273 TraceCheckUtils]: 33: Hoare triple {47006#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {47007#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:25,191 INFO L273 TraceCheckUtils]: 34: Hoare triple {47007#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47007#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:25,192 INFO L273 TraceCheckUtils]: 35: Hoare triple {47007#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47007#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:25,193 INFO L273 TraceCheckUtils]: 36: Hoare triple {47007#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {47008#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:25,193 INFO L273 TraceCheckUtils]: 37: Hoare triple {47008#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47008#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:25,194 INFO L273 TraceCheckUtils]: 38: Hoare triple {47008#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47008#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:25,194 INFO L273 TraceCheckUtils]: 39: Hoare triple {47008#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {47009#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:25,195 INFO L273 TraceCheckUtils]: 40: Hoare triple {47009#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47009#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:25,195 INFO L273 TraceCheckUtils]: 41: Hoare triple {47009#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47009#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:25,196 INFO L273 TraceCheckUtils]: 42: Hoare triple {47009#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {47010#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:25,197 INFO L273 TraceCheckUtils]: 43: Hoare triple {47010#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47010#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:25,197 INFO L273 TraceCheckUtils]: 44: Hoare triple {47010#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47010#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:25,198 INFO L273 TraceCheckUtils]: 45: Hoare triple {47010#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {47011#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:25,198 INFO L273 TraceCheckUtils]: 46: Hoare triple {47011#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47011#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:25,199 INFO L273 TraceCheckUtils]: 47: Hoare triple {47011#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47011#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:25,199 INFO L273 TraceCheckUtils]: 48: Hoare triple {47011#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {47012#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:25,200 INFO L273 TraceCheckUtils]: 49: Hoare triple {47012#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47012#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:25,200 INFO L273 TraceCheckUtils]: 50: Hoare triple {47012#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47012#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:25,201 INFO L273 TraceCheckUtils]: 51: Hoare triple {47012#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {47013#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:25,201 INFO L273 TraceCheckUtils]: 52: Hoare triple {47013#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47013#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:25,202 INFO L273 TraceCheckUtils]: 53: Hoare triple {47013#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47013#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:25,203 INFO L273 TraceCheckUtils]: 54: Hoare triple {47013#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {47014#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:25,203 INFO L273 TraceCheckUtils]: 55: Hoare triple {47014#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47014#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:25,204 INFO L273 TraceCheckUtils]: 56: Hoare triple {47014#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47014#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:25,204 INFO L273 TraceCheckUtils]: 57: Hoare triple {47014#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {47015#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:25,205 INFO L273 TraceCheckUtils]: 58: Hoare triple {47015#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47015#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:25,205 INFO L273 TraceCheckUtils]: 59: Hoare triple {47015#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47015#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:25,206 INFO L273 TraceCheckUtils]: 60: Hoare triple {47015#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {47016#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:25,206 INFO L273 TraceCheckUtils]: 61: Hoare triple {47016#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47016#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:25,207 INFO L273 TraceCheckUtils]: 62: Hoare triple {47016#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47016#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:25,207 INFO L273 TraceCheckUtils]: 63: Hoare triple {47016#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {47017#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:25,208 INFO L273 TraceCheckUtils]: 64: Hoare triple {47017#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47017#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:25,208 INFO L273 TraceCheckUtils]: 65: Hoare triple {47017#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47017#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:25,209 INFO L273 TraceCheckUtils]: 66: Hoare triple {47017#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {47018#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:25,209 INFO L273 TraceCheckUtils]: 67: Hoare triple {47018#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47018#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:25,210 INFO L273 TraceCheckUtils]: 68: Hoare triple {47018#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47018#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:25,211 INFO L273 TraceCheckUtils]: 69: Hoare triple {47018#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {47019#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:25,211 INFO L273 TraceCheckUtils]: 70: Hoare triple {47019#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47019#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:25,212 INFO L273 TraceCheckUtils]: 71: Hoare triple {47019#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47019#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:25,212 INFO L273 TraceCheckUtils]: 72: Hoare triple {47019#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {47020#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:25,213 INFO L273 TraceCheckUtils]: 73: Hoare triple {47020#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47020#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:25,213 INFO L273 TraceCheckUtils]: 74: Hoare triple {47020#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47020#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:25,214 INFO L273 TraceCheckUtils]: 75: Hoare triple {47020#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {47021#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:25,215 INFO L273 TraceCheckUtils]: 76: Hoare triple {47021#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47021#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:25,215 INFO L273 TraceCheckUtils]: 77: Hoare triple {47021#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47021#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:25,216 INFO L273 TraceCheckUtils]: 78: Hoare triple {47021#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {47022#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:25,216 INFO L273 TraceCheckUtils]: 79: Hoare triple {47022#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47022#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:25,217 INFO L273 TraceCheckUtils]: 80: Hoare triple {47022#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47022#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:25,217 INFO L273 TraceCheckUtils]: 81: Hoare triple {47022#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {47023#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:25,218 INFO L273 TraceCheckUtils]: 82: Hoare triple {47023#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47023#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:25,218 INFO L273 TraceCheckUtils]: 83: Hoare triple {47023#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47023#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:25,219 INFO L273 TraceCheckUtils]: 84: Hoare triple {47023#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {47024#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:25,219 INFO L273 TraceCheckUtils]: 85: Hoare triple {47024#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47024#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:25,220 INFO L273 TraceCheckUtils]: 86: Hoare triple {47024#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47024#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:25,221 INFO L273 TraceCheckUtils]: 87: Hoare triple {47024#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {47025#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:25,221 INFO L273 TraceCheckUtils]: 88: Hoare triple {47025#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47025#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:25,222 INFO L273 TraceCheckUtils]: 89: Hoare triple {47025#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47025#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:25,222 INFO L273 TraceCheckUtils]: 90: Hoare triple {47025#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {47026#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:25,223 INFO L273 TraceCheckUtils]: 91: Hoare triple {47026#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47026#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:25,223 INFO L273 TraceCheckUtils]: 92: Hoare triple {47026#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47026#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:25,224 INFO L273 TraceCheckUtils]: 93: Hoare triple {47026#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {47027#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:25,224 INFO L273 TraceCheckUtils]: 94: Hoare triple {47027#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47027#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:25,225 INFO L273 TraceCheckUtils]: 95: Hoare triple {47027#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47027#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:25,225 INFO L273 TraceCheckUtils]: 96: Hoare triple {47027#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {47028#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:25,226 INFO L273 TraceCheckUtils]: 97: Hoare triple {47028#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47028#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:25,226 INFO L273 TraceCheckUtils]: 98: Hoare triple {47028#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47028#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:25,227 INFO L273 TraceCheckUtils]: 99: Hoare triple {47028#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {47029#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:25,227 INFO L273 TraceCheckUtils]: 100: Hoare triple {47029#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47029#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:25,228 INFO L273 TraceCheckUtils]: 101: Hoare triple {47029#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47029#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:25,229 INFO L273 TraceCheckUtils]: 102: Hoare triple {47029#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {47030#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:25,229 INFO L273 TraceCheckUtils]: 103: Hoare triple {47030#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47030#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:25,230 INFO L273 TraceCheckUtils]: 104: Hoare triple {47030#(<= main_~i~0 33)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47030#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:25,230 INFO L273 TraceCheckUtils]: 105: Hoare triple {47030#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {47031#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:25,231 INFO L273 TraceCheckUtils]: 106: Hoare triple {47031#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47031#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:25,231 INFO L273 TraceCheckUtils]: 107: Hoare triple {47031#(<= main_~i~0 34)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47031#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:25,232 INFO L273 TraceCheckUtils]: 108: Hoare triple {47031#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {47032#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:25,232 INFO L273 TraceCheckUtils]: 109: Hoare triple {47032#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47032#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:25,233 INFO L273 TraceCheckUtils]: 110: Hoare triple {47032#(<= main_~i~0 35)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47032#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:25,233 INFO L273 TraceCheckUtils]: 111: Hoare triple {47032#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {47033#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:25,234 INFO L273 TraceCheckUtils]: 112: Hoare triple {47033#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47033#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:25,234 INFO L273 TraceCheckUtils]: 113: Hoare triple {47033#(<= main_~i~0 36)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47033#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:25,235 INFO L273 TraceCheckUtils]: 114: Hoare triple {47033#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {47034#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:25,235 INFO L273 TraceCheckUtils]: 115: Hoare triple {47034#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47034#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:25,236 INFO L273 TraceCheckUtils]: 116: Hoare triple {47034#(<= main_~i~0 37)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47034#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:25,237 INFO L273 TraceCheckUtils]: 117: Hoare triple {47034#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {47035#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:25,237 INFO L273 TraceCheckUtils]: 118: Hoare triple {47035#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47035#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:25,238 INFO L273 TraceCheckUtils]: 119: Hoare triple {47035#(<= main_~i~0 38)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47035#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:25,238 INFO L273 TraceCheckUtils]: 120: Hoare triple {47035#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {47036#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:25,239 INFO L273 TraceCheckUtils]: 121: Hoare triple {47036#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47036#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:25,239 INFO L273 TraceCheckUtils]: 122: Hoare triple {47036#(<= main_~i~0 39)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47036#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:25,240 INFO L273 TraceCheckUtils]: 123: Hoare triple {47036#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {47037#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:25,240 INFO L273 TraceCheckUtils]: 124: Hoare triple {47037#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47037#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:25,241 INFO L273 TraceCheckUtils]: 125: Hoare triple {47037#(<= main_~i~0 40)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47037#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:25,241 INFO L273 TraceCheckUtils]: 126: Hoare triple {47037#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {47038#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:25,242 INFO L273 TraceCheckUtils]: 127: Hoare triple {47038#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {47038#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:25,242 INFO L273 TraceCheckUtils]: 128: Hoare triple {47038#(<= main_~i~0 41)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47038#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:25,243 INFO L273 TraceCheckUtils]: 129: Hoare triple {47038#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {47039#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:25,244 INFO L273 TraceCheckUtils]: 130: Hoare triple {47039#(<= main_~i~0 42)} assume !(~i~0 < 100000); {46997#false} is VALID [2018-11-23 11:53:25,244 INFO L273 TraceCheckUtils]: 131: Hoare triple {46997#false} assume !(0 != ~swapped~0); {46997#false} is VALID [2018-11-23 11:53:25,244 INFO L273 TraceCheckUtils]: 132: Hoare triple {46997#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {46997#false} is VALID [2018-11-23 11:53:25,244 INFO L273 TraceCheckUtils]: 133: Hoare triple {46997#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {46997#false} is VALID [2018-11-23 11:53:25,244 INFO L273 TraceCheckUtils]: 134: Hoare triple {46997#false} assume !!(~y~0 < 100000);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); {46997#false} is VALID [2018-11-23 11:53:25,245 INFO L256 TraceCheckUtils]: 135: Hoare triple {46997#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {46997#false} is VALID [2018-11-23 11:53:25,245 INFO L273 TraceCheckUtils]: 136: Hoare triple {46997#false} ~cond := #in~cond; {46997#false} is VALID [2018-11-23 11:53:25,245 INFO L273 TraceCheckUtils]: 137: Hoare triple {46997#false} assume 0 == ~cond; {46997#false} is VALID [2018-11-23 11:53:25,245 INFO L273 TraceCheckUtils]: 138: Hoare triple {46997#false} assume !false; {46997#false} is VALID [2018-11-23 11:53:25,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2502 backedges. 1 proven. 2501 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:53:25,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:25,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 45 [2018-11-23 11:53:25,277 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 139 [2018-11-23 11:53:25,278 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:25,278 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states. [2018-11-23 11:53:25,406 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:53:25,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-23 11:53:25,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-23 11:53:25,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-23 11:53:25,408 INFO L87 Difference]: Start difference. First operand 267 states and 352 transitions. Second operand 45 states. [2018-11-23 11:53:26,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:26,542 INFO L93 Difference]: Finished difference Result 538 states and 714 transitions. [2018-11-23 11:53:26,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-23 11:53:26,543 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 139 [2018-11-23 11:53:26,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:26,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 11:53:26,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 217 transitions. [2018-11-23 11:53:26,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 11:53:26,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 217 transitions. [2018-11-23 11:53:26,546 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states and 217 transitions. [2018-11-23 11:53:26,753 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 217 edges. 217 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:26,759 INFO L225 Difference]: With dead ends: 538 [2018-11-23 11:53:26,759 INFO L226 Difference]: Without dead ends: 277 [2018-11-23 11:53:26,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-23 11:53:26,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-11-23 11:53:26,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 273. [2018-11-23 11:53:26,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:26,885 INFO L82 GeneralOperation]: Start isEquivalent. First operand 277 states. Second operand 273 states. [2018-11-23 11:53:26,885 INFO L74 IsIncluded]: Start isIncluded. First operand 277 states. Second operand 273 states. [2018-11-23 11:53:26,885 INFO L87 Difference]: Start difference. First operand 277 states. Second operand 273 states. [2018-11-23 11:53:26,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:26,890 INFO L93 Difference]: Finished difference Result 277 states and 366 transitions. [2018-11-23 11:53:26,891 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 366 transitions. [2018-11-23 11:53:26,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:26,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:26,891 INFO L74 IsIncluded]: Start isIncluded. First operand 273 states. Second operand 277 states. [2018-11-23 11:53:26,891 INFO L87 Difference]: Start difference. First operand 273 states. Second operand 277 states. [2018-11-23 11:53:26,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:26,895 INFO L93 Difference]: Finished difference Result 277 states and 366 transitions. [2018-11-23 11:53:26,895 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 366 transitions. [2018-11-23 11:53:26,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:26,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:26,896 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:26,896 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:26,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-11-23 11:53:26,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 360 transitions. [2018-11-23 11:53:26,900 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 360 transitions. Word has length 139 [2018-11-23 11:53:26,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:26,901 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 360 transitions. [2018-11-23 11:53:26,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-23 11:53:26,901 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 360 transitions. [2018-11-23 11:53:26,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-23 11:53:26,901 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:26,901 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:53:26,902 INFO L423 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:26,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:26,902 INFO L82 PathProgramCache]: Analyzing trace with hash 702954993, now seen corresponding path program 42 times [2018-11-23 11:53:26,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:26,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:26,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:26,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:26,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:26,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:27,837 INFO L256 TraceCheckUtils]: 0: Hoare triple {49101#true} call ULTIMATE.init(); {49101#true} is VALID [2018-11-23 11:53:27,837 INFO L273 TraceCheckUtils]: 1: Hoare triple {49101#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {49101#true} is VALID [2018-11-23 11:53:27,837 INFO L273 TraceCheckUtils]: 2: Hoare triple {49101#true} assume true; {49101#true} is VALID [2018-11-23 11:53:27,837 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {49101#true} {49101#true} #79#return; {49101#true} is VALID [2018-11-23 11:53:27,837 INFO L256 TraceCheckUtils]: 4: Hoare triple {49101#true} call #t~ret8 := main(); {49101#true} is VALID [2018-11-23 11:53:27,838 INFO L273 TraceCheckUtils]: 5: Hoare triple {49101#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {49101#true} is VALID [2018-11-23 11:53:27,838 INFO L273 TraceCheckUtils]: 6: Hoare triple {49101#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {49103#(= main_~i~0 1)} is VALID [2018-11-23 11:53:27,839 INFO L273 TraceCheckUtils]: 7: Hoare triple {49103#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49103#(= main_~i~0 1)} is VALID [2018-11-23 11:53:27,839 INFO L273 TraceCheckUtils]: 8: Hoare triple {49103#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49103#(= main_~i~0 1)} is VALID [2018-11-23 11:53:27,840 INFO L273 TraceCheckUtils]: 9: Hoare triple {49103#(= main_~i~0 1)} ~i~0 := 1 + ~i~0; {49104#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:27,840 INFO L273 TraceCheckUtils]: 10: Hoare triple {49104#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49104#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:27,841 INFO L273 TraceCheckUtils]: 11: Hoare triple {49104#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49104#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:27,841 INFO L273 TraceCheckUtils]: 12: Hoare triple {49104#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {49105#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:27,841 INFO L273 TraceCheckUtils]: 13: Hoare triple {49105#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49105#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:27,842 INFO L273 TraceCheckUtils]: 14: Hoare triple {49105#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49105#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:27,842 INFO L273 TraceCheckUtils]: 15: Hoare triple {49105#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {49106#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:27,842 INFO L273 TraceCheckUtils]: 16: Hoare triple {49106#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49106#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:27,843 INFO L273 TraceCheckUtils]: 17: Hoare triple {49106#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49106#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:27,843 INFO L273 TraceCheckUtils]: 18: Hoare triple {49106#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {49107#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:27,844 INFO L273 TraceCheckUtils]: 19: Hoare triple {49107#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49107#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:27,844 INFO L273 TraceCheckUtils]: 20: Hoare triple {49107#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49107#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:27,845 INFO L273 TraceCheckUtils]: 21: Hoare triple {49107#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {49108#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:27,846 INFO L273 TraceCheckUtils]: 22: Hoare triple {49108#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49108#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:27,846 INFO L273 TraceCheckUtils]: 23: Hoare triple {49108#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49108#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:27,847 INFO L273 TraceCheckUtils]: 24: Hoare triple {49108#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {49109#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:27,847 INFO L273 TraceCheckUtils]: 25: Hoare triple {49109#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49109#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:27,848 INFO L273 TraceCheckUtils]: 26: Hoare triple {49109#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49109#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:27,849 INFO L273 TraceCheckUtils]: 27: Hoare triple {49109#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {49110#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:27,849 INFO L273 TraceCheckUtils]: 28: Hoare triple {49110#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49110#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:27,850 INFO L273 TraceCheckUtils]: 29: Hoare triple {49110#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49110#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:27,850 INFO L273 TraceCheckUtils]: 30: Hoare triple {49110#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {49111#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:27,851 INFO L273 TraceCheckUtils]: 31: Hoare triple {49111#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49111#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:27,851 INFO L273 TraceCheckUtils]: 32: Hoare triple {49111#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49111#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:27,852 INFO L273 TraceCheckUtils]: 33: Hoare triple {49111#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {49112#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:27,852 INFO L273 TraceCheckUtils]: 34: Hoare triple {49112#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49112#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:27,853 INFO L273 TraceCheckUtils]: 35: Hoare triple {49112#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49112#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:27,854 INFO L273 TraceCheckUtils]: 36: Hoare triple {49112#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {49113#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:27,854 INFO L273 TraceCheckUtils]: 37: Hoare triple {49113#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49113#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:27,855 INFO L273 TraceCheckUtils]: 38: Hoare triple {49113#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49113#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:27,855 INFO L273 TraceCheckUtils]: 39: Hoare triple {49113#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {49114#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:27,856 INFO L273 TraceCheckUtils]: 40: Hoare triple {49114#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49114#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:27,856 INFO L273 TraceCheckUtils]: 41: Hoare triple {49114#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49114#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:27,857 INFO L273 TraceCheckUtils]: 42: Hoare triple {49114#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {49115#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:27,858 INFO L273 TraceCheckUtils]: 43: Hoare triple {49115#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49115#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:27,858 INFO L273 TraceCheckUtils]: 44: Hoare triple {49115#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49115#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:27,859 INFO L273 TraceCheckUtils]: 45: Hoare triple {49115#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {49116#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:27,860 INFO L273 TraceCheckUtils]: 46: Hoare triple {49116#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49116#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:27,860 INFO L273 TraceCheckUtils]: 47: Hoare triple {49116#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49116#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:27,861 INFO L273 TraceCheckUtils]: 48: Hoare triple {49116#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {49117#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:27,861 INFO L273 TraceCheckUtils]: 49: Hoare triple {49117#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49117#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:27,862 INFO L273 TraceCheckUtils]: 50: Hoare triple {49117#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49117#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:27,862 INFO L273 TraceCheckUtils]: 51: Hoare triple {49117#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {49118#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:27,863 INFO L273 TraceCheckUtils]: 52: Hoare triple {49118#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49118#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:27,863 INFO L273 TraceCheckUtils]: 53: Hoare triple {49118#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49118#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:27,864 INFO L273 TraceCheckUtils]: 54: Hoare triple {49118#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {49119#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:27,865 INFO L273 TraceCheckUtils]: 55: Hoare triple {49119#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49119#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:27,865 INFO L273 TraceCheckUtils]: 56: Hoare triple {49119#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49119#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:27,866 INFO L273 TraceCheckUtils]: 57: Hoare triple {49119#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {49120#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:27,866 INFO L273 TraceCheckUtils]: 58: Hoare triple {49120#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49120#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:27,867 INFO L273 TraceCheckUtils]: 59: Hoare triple {49120#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49120#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:27,868 INFO L273 TraceCheckUtils]: 60: Hoare triple {49120#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {49121#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:27,868 INFO L273 TraceCheckUtils]: 61: Hoare triple {49121#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49121#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:27,869 INFO L273 TraceCheckUtils]: 62: Hoare triple {49121#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49121#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:27,869 INFO L273 TraceCheckUtils]: 63: Hoare triple {49121#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {49122#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:27,870 INFO L273 TraceCheckUtils]: 64: Hoare triple {49122#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49122#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:27,870 INFO L273 TraceCheckUtils]: 65: Hoare triple {49122#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49122#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:27,871 INFO L273 TraceCheckUtils]: 66: Hoare triple {49122#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {49123#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:27,872 INFO L273 TraceCheckUtils]: 67: Hoare triple {49123#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49123#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:27,872 INFO L273 TraceCheckUtils]: 68: Hoare triple {49123#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49123#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:27,873 INFO L273 TraceCheckUtils]: 69: Hoare triple {49123#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {49124#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:27,874 INFO L273 TraceCheckUtils]: 70: Hoare triple {49124#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49124#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:27,874 INFO L273 TraceCheckUtils]: 71: Hoare triple {49124#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49124#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:27,875 INFO L273 TraceCheckUtils]: 72: Hoare triple {49124#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {49125#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:27,875 INFO L273 TraceCheckUtils]: 73: Hoare triple {49125#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49125#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:27,876 INFO L273 TraceCheckUtils]: 74: Hoare triple {49125#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49125#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:27,877 INFO L273 TraceCheckUtils]: 75: Hoare triple {49125#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {49126#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:27,877 INFO L273 TraceCheckUtils]: 76: Hoare triple {49126#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49126#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:27,878 INFO L273 TraceCheckUtils]: 77: Hoare triple {49126#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49126#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:27,878 INFO L273 TraceCheckUtils]: 78: Hoare triple {49126#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {49127#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:27,879 INFO L273 TraceCheckUtils]: 79: Hoare triple {49127#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49127#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:27,879 INFO L273 TraceCheckUtils]: 80: Hoare triple {49127#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49127#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:27,880 INFO L273 TraceCheckUtils]: 81: Hoare triple {49127#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {49128#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:27,881 INFO L273 TraceCheckUtils]: 82: Hoare triple {49128#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49128#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:27,881 INFO L273 TraceCheckUtils]: 83: Hoare triple {49128#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49128#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:27,882 INFO L273 TraceCheckUtils]: 84: Hoare triple {49128#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {49129#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:27,882 INFO L273 TraceCheckUtils]: 85: Hoare triple {49129#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49129#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:27,883 INFO L273 TraceCheckUtils]: 86: Hoare triple {49129#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49129#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:27,884 INFO L273 TraceCheckUtils]: 87: Hoare triple {49129#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {49130#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:27,884 INFO L273 TraceCheckUtils]: 88: Hoare triple {49130#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49130#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:27,885 INFO L273 TraceCheckUtils]: 89: Hoare triple {49130#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49130#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:27,885 INFO L273 TraceCheckUtils]: 90: Hoare triple {49130#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {49131#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:27,886 INFO L273 TraceCheckUtils]: 91: Hoare triple {49131#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49131#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:27,886 INFO L273 TraceCheckUtils]: 92: Hoare triple {49131#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49131#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:27,887 INFO L273 TraceCheckUtils]: 93: Hoare triple {49131#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {49132#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:27,888 INFO L273 TraceCheckUtils]: 94: Hoare triple {49132#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49132#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:27,888 INFO L273 TraceCheckUtils]: 95: Hoare triple {49132#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49132#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:27,889 INFO L273 TraceCheckUtils]: 96: Hoare triple {49132#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {49133#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:27,889 INFO L273 TraceCheckUtils]: 97: Hoare triple {49133#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49133#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:27,890 INFO L273 TraceCheckUtils]: 98: Hoare triple {49133#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49133#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:27,891 INFO L273 TraceCheckUtils]: 99: Hoare triple {49133#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {49134#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:27,891 INFO L273 TraceCheckUtils]: 100: Hoare triple {49134#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49134#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:27,892 INFO L273 TraceCheckUtils]: 101: Hoare triple {49134#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49134#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:27,892 INFO L273 TraceCheckUtils]: 102: Hoare triple {49134#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {49135#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:27,893 INFO L273 TraceCheckUtils]: 103: Hoare triple {49135#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49135#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:27,893 INFO L273 TraceCheckUtils]: 104: Hoare triple {49135#(<= main_~i~0 33)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49135#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:27,894 INFO L273 TraceCheckUtils]: 105: Hoare triple {49135#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {49136#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:27,895 INFO L273 TraceCheckUtils]: 106: Hoare triple {49136#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49136#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:27,895 INFO L273 TraceCheckUtils]: 107: Hoare triple {49136#(<= main_~i~0 34)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49136#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:27,896 INFO L273 TraceCheckUtils]: 108: Hoare triple {49136#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {49137#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:27,896 INFO L273 TraceCheckUtils]: 109: Hoare triple {49137#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49137#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:27,897 INFO L273 TraceCheckUtils]: 110: Hoare triple {49137#(<= main_~i~0 35)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49137#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:27,898 INFO L273 TraceCheckUtils]: 111: Hoare triple {49137#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {49138#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:27,898 INFO L273 TraceCheckUtils]: 112: Hoare triple {49138#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49138#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:27,899 INFO L273 TraceCheckUtils]: 113: Hoare triple {49138#(<= main_~i~0 36)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49138#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:27,899 INFO L273 TraceCheckUtils]: 114: Hoare triple {49138#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {49139#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:27,900 INFO L273 TraceCheckUtils]: 115: Hoare triple {49139#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49139#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:27,900 INFO L273 TraceCheckUtils]: 116: Hoare triple {49139#(<= main_~i~0 37)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49139#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:27,901 INFO L273 TraceCheckUtils]: 117: Hoare triple {49139#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {49140#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:27,902 INFO L273 TraceCheckUtils]: 118: Hoare triple {49140#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49140#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:27,902 INFO L273 TraceCheckUtils]: 119: Hoare triple {49140#(<= main_~i~0 38)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49140#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:27,903 INFO L273 TraceCheckUtils]: 120: Hoare triple {49140#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {49141#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:27,903 INFO L273 TraceCheckUtils]: 121: Hoare triple {49141#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49141#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:27,904 INFO L273 TraceCheckUtils]: 122: Hoare triple {49141#(<= main_~i~0 39)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49141#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:27,905 INFO L273 TraceCheckUtils]: 123: Hoare triple {49141#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {49142#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:27,905 INFO L273 TraceCheckUtils]: 124: Hoare triple {49142#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49142#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:27,906 INFO L273 TraceCheckUtils]: 125: Hoare triple {49142#(<= main_~i~0 40)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49142#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:27,906 INFO L273 TraceCheckUtils]: 126: Hoare triple {49142#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {49143#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:27,907 INFO L273 TraceCheckUtils]: 127: Hoare triple {49143#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49143#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:27,907 INFO L273 TraceCheckUtils]: 128: Hoare triple {49143#(<= main_~i~0 41)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49143#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:27,908 INFO L273 TraceCheckUtils]: 129: Hoare triple {49143#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {49144#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:27,908 INFO L273 TraceCheckUtils]: 130: Hoare triple {49144#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49144#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:27,909 INFO L273 TraceCheckUtils]: 131: Hoare triple {49144#(<= main_~i~0 42)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49144#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:27,910 INFO L273 TraceCheckUtils]: 132: Hoare triple {49144#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {49145#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:27,910 INFO L273 TraceCheckUtils]: 133: Hoare triple {49145#(<= main_~i~0 43)} assume !(~i~0 < 100000); {49102#false} is VALID [2018-11-23 11:53:27,911 INFO L273 TraceCheckUtils]: 134: Hoare triple {49102#false} assume !(0 != ~swapped~0); {49102#false} is VALID [2018-11-23 11:53:27,911 INFO L273 TraceCheckUtils]: 135: Hoare triple {49102#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {49102#false} is VALID [2018-11-23 11:53:27,911 INFO L273 TraceCheckUtils]: 136: Hoare triple {49102#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {49102#false} is VALID [2018-11-23 11:53:27,911 INFO L273 TraceCheckUtils]: 137: Hoare triple {49102#false} assume !!(~y~0 < 100000);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); {49102#false} is VALID [2018-11-23 11:53:27,911 INFO L256 TraceCheckUtils]: 138: Hoare triple {49102#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {49102#false} is VALID [2018-11-23 11:53:27,912 INFO L273 TraceCheckUtils]: 139: Hoare triple {49102#false} ~cond := #in~cond; {49102#false} is VALID [2018-11-23 11:53:27,912 INFO L273 TraceCheckUtils]: 140: Hoare triple {49102#false} assume 0 == ~cond; {49102#false} is VALID [2018-11-23 11:53:27,912 INFO L273 TraceCheckUtils]: 141: Hoare triple {49102#false} assume !false; {49102#false} is VALID [2018-11-23 11:53:27,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2626 backedges. 1 proven. 2625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:53:27,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:27,925 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 11:53:27,934 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:53:28,091 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 44 check-sat command(s) [2018-11-23 11:53:28,092 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:28,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:28,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:28,446 INFO L256 TraceCheckUtils]: 0: Hoare triple {49101#true} call ULTIMATE.init(); {49101#true} is VALID [2018-11-23 11:53:28,446 INFO L273 TraceCheckUtils]: 1: Hoare triple {49101#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {49101#true} is VALID [2018-11-23 11:53:28,446 INFO L273 TraceCheckUtils]: 2: Hoare triple {49101#true} assume true; {49101#true} is VALID [2018-11-23 11:53:28,446 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {49101#true} {49101#true} #79#return; {49101#true} is VALID [2018-11-23 11:53:28,447 INFO L256 TraceCheckUtils]: 4: Hoare triple {49101#true} call #t~ret8 := main(); {49101#true} is VALID [2018-11-23 11:53:28,447 INFO L273 TraceCheckUtils]: 5: Hoare triple {49101#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {49101#true} is VALID [2018-11-23 11:53:28,447 INFO L273 TraceCheckUtils]: 6: Hoare triple {49101#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {49167#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:28,448 INFO L273 TraceCheckUtils]: 7: Hoare triple {49167#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49167#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:28,448 INFO L273 TraceCheckUtils]: 8: Hoare triple {49167#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49167#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:28,449 INFO L273 TraceCheckUtils]: 9: Hoare triple {49167#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {49104#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:28,449 INFO L273 TraceCheckUtils]: 10: Hoare triple {49104#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49104#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:28,449 INFO L273 TraceCheckUtils]: 11: Hoare triple {49104#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49104#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:28,450 INFO L273 TraceCheckUtils]: 12: Hoare triple {49104#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {49105#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:28,450 INFO L273 TraceCheckUtils]: 13: Hoare triple {49105#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49105#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:28,450 INFO L273 TraceCheckUtils]: 14: Hoare triple {49105#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49105#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:28,451 INFO L273 TraceCheckUtils]: 15: Hoare triple {49105#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {49106#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:28,452 INFO L273 TraceCheckUtils]: 16: Hoare triple {49106#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49106#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:28,452 INFO L273 TraceCheckUtils]: 17: Hoare triple {49106#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49106#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:28,453 INFO L273 TraceCheckUtils]: 18: Hoare triple {49106#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {49107#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:28,453 INFO L273 TraceCheckUtils]: 19: Hoare triple {49107#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49107#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:28,454 INFO L273 TraceCheckUtils]: 20: Hoare triple {49107#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49107#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:28,455 INFO L273 TraceCheckUtils]: 21: Hoare triple {49107#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {49108#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:28,455 INFO L273 TraceCheckUtils]: 22: Hoare triple {49108#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49108#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:28,456 INFO L273 TraceCheckUtils]: 23: Hoare triple {49108#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49108#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:28,456 INFO L273 TraceCheckUtils]: 24: Hoare triple {49108#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {49109#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:28,457 INFO L273 TraceCheckUtils]: 25: Hoare triple {49109#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49109#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:28,457 INFO L273 TraceCheckUtils]: 26: Hoare triple {49109#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49109#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:28,458 INFO L273 TraceCheckUtils]: 27: Hoare triple {49109#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {49110#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:28,459 INFO L273 TraceCheckUtils]: 28: Hoare triple {49110#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49110#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:28,459 INFO L273 TraceCheckUtils]: 29: Hoare triple {49110#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49110#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:28,460 INFO L273 TraceCheckUtils]: 30: Hoare triple {49110#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {49111#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:28,460 INFO L273 TraceCheckUtils]: 31: Hoare triple {49111#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49111#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:28,461 INFO L273 TraceCheckUtils]: 32: Hoare triple {49111#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49111#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:28,461 INFO L273 TraceCheckUtils]: 33: Hoare triple {49111#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {49112#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:28,462 INFO L273 TraceCheckUtils]: 34: Hoare triple {49112#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49112#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:28,462 INFO L273 TraceCheckUtils]: 35: Hoare triple {49112#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49112#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:28,463 INFO L273 TraceCheckUtils]: 36: Hoare triple {49112#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {49113#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:28,464 INFO L273 TraceCheckUtils]: 37: Hoare triple {49113#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49113#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:28,464 INFO L273 TraceCheckUtils]: 38: Hoare triple {49113#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49113#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:28,465 INFO L273 TraceCheckUtils]: 39: Hoare triple {49113#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {49114#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:28,465 INFO L273 TraceCheckUtils]: 40: Hoare triple {49114#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49114#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:28,466 INFO L273 TraceCheckUtils]: 41: Hoare triple {49114#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49114#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:28,466 INFO L273 TraceCheckUtils]: 42: Hoare triple {49114#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {49115#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:28,467 INFO L273 TraceCheckUtils]: 43: Hoare triple {49115#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49115#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:28,467 INFO L273 TraceCheckUtils]: 44: Hoare triple {49115#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49115#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:28,468 INFO L273 TraceCheckUtils]: 45: Hoare triple {49115#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {49116#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:28,469 INFO L273 TraceCheckUtils]: 46: Hoare triple {49116#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49116#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:28,469 INFO L273 TraceCheckUtils]: 47: Hoare triple {49116#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49116#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:28,470 INFO L273 TraceCheckUtils]: 48: Hoare triple {49116#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {49117#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:28,470 INFO L273 TraceCheckUtils]: 49: Hoare triple {49117#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49117#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:28,471 INFO L273 TraceCheckUtils]: 50: Hoare triple {49117#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49117#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:28,472 INFO L273 TraceCheckUtils]: 51: Hoare triple {49117#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {49118#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:28,472 INFO L273 TraceCheckUtils]: 52: Hoare triple {49118#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49118#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:28,473 INFO L273 TraceCheckUtils]: 53: Hoare triple {49118#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49118#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:28,473 INFO L273 TraceCheckUtils]: 54: Hoare triple {49118#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {49119#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:28,474 INFO L273 TraceCheckUtils]: 55: Hoare triple {49119#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49119#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:28,474 INFO L273 TraceCheckUtils]: 56: Hoare triple {49119#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49119#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:28,475 INFO L273 TraceCheckUtils]: 57: Hoare triple {49119#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {49120#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:28,476 INFO L273 TraceCheckUtils]: 58: Hoare triple {49120#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49120#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:28,476 INFO L273 TraceCheckUtils]: 59: Hoare triple {49120#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49120#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:28,477 INFO L273 TraceCheckUtils]: 60: Hoare triple {49120#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {49121#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:28,477 INFO L273 TraceCheckUtils]: 61: Hoare triple {49121#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49121#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:28,478 INFO L273 TraceCheckUtils]: 62: Hoare triple {49121#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49121#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:28,478 INFO L273 TraceCheckUtils]: 63: Hoare triple {49121#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {49122#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:28,479 INFO L273 TraceCheckUtils]: 64: Hoare triple {49122#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49122#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:28,479 INFO L273 TraceCheckUtils]: 65: Hoare triple {49122#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49122#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:28,480 INFO L273 TraceCheckUtils]: 66: Hoare triple {49122#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {49123#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:28,481 INFO L273 TraceCheckUtils]: 67: Hoare triple {49123#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49123#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:28,481 INFO L273 TraceCheckUtils]: 68: Hoare triple {49123#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49123#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:28,482 INFO L273 TraceCheckUtils]: 69: Hoare triple {49123#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {49124#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:28,482 INFO L273 TraceCheckUtils]: 70: Hoare triple {49124#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49124#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:28,483 INFO L273 TraceCheckUtils]: 71: Hoare triple {49124#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49124#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:28,484 INFO L273 TraceCheckUtils]: 72: Hoare triple {49124#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {49125#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:28,484 INFO L273 TraceCheckUtils]: 73: Hoare triple {49125#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49125#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:28,485 INFO L273 TraceCheckUtils]: 74: Hoare triple {49125#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49125#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:28,485 INFO L273 TraceCheckUtils]: 75: Hoare triple {49125#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {49126#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:28,486 INFO L273 TraceCheckUtils]: 76: Hoare triple {49126#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49126#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:28,486 INFO L273 TraceCheckUtils]: 77: Hoare triple {49126#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49126#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:28,487 INFO L273 TraceCheckUtils]: 78: Hoare triple {49126#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {49127#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:28,487 INFO L273 TraceCheckUtils]: 79: Hoare triple {49127#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49127#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:28,488 INFO L273 TraceCheckUtils]: 80: Hoare triple {49127#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49127#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:28,489 INFO L273 TraceCheckUtils]: 81: Hoare triple {49127#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {49128#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:28,489 INFO L273 TraceCheckUtils]: 82: Hoare triple {49128#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49128#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:28,490 INFO L273 TraceCheckUtils]: 83: Hoare triple {49128#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49128#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:28,490 INFO L273 TraceCheckUtils]: 84: Hoare triple {49128#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {49129#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:28,491 INFO L273 TraceCheckUtils]: 85: Hoare triple {49129#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49129#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:28,491 INFO L273 TraceCheckUtils]: 86: Hoare triple {49129#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49129#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:28,492 INFO L273 TraceCheckUtils]: 87: Hoare triple {49129#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {49130#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:28,493 INFO L273 TraceCheckUtils]: 88: Hoare triple {49130#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49130#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:28,493 INFO L273 TraceCheckUtils]: 89: Hoare triple {49130#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49130#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:28,494 INFO L273 TraceCheckUtils]: 90: Hoare triple {49130#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {49131#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:28,494 INFO L273 TraceCheckUtils]: 91: Hoare triple {49131#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49131#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:28,495 INFO L273 TraceCheckUtils]: 92: Hoare triple {49131#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49131#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:28,496 INFO L273 TraceCheckUtils]: 93: Hoare triple {49131#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {49132#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:28,496 INFO L273 TraceCheckUtils]: 94: Hoare triple {49132#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49132#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:28,496 INFO L273 TraceCheckUtils]: 95: Hoare triple {49132#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49132#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:28,497 INFO L273 TraceCheckUtils]: 96: Hoare triple {49132#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {49133#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:28,498 INFO L273 TraceCheckUtils]: 97: Hoare triple {49133#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49133#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:28,498 INFO L273 TraceCheckUtils]: 98: Hoare triple {49133#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49133#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:28,499 INFO L273 TraceCheckUtils]: 99: Hoare triple {49133#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {49134#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:28,499 INFO L273 TraceCheckUtils]: 100: Hoare triple {49134#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49134#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:28,500 INFO L273 TraceCheckUtils]: 101: Hoare triple {49134#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49134#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:28,501 INFO L273 TraceCheckUtils]: 102: Hoare triple {49134#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {49135#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:28,501 INFO L273 TraceCheckUtils]: 103: Hoare triple {49135#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49135#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:28,502 INFO L273 TraceCheckUtils]: 104: Hoare triple {49135#(<= main_~i~0 33)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49135#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:28,502 INFO L273 TraceCheckUtils]: 105: Hoare triple {49135#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {49136#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:28,503 INFO L273 TraceCheckUtils]: 106: Hoare triple {49136#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49136#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:28,503 INFO L273 TraceCheckUtils]: 107: Hoare triple {49136#(<= main_~i~0 34)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49136#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:28,504 INFO L273 TraceCheckUtils]: 108: Hoare triple {49136#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {49137#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:28,505 INFO L273 TraceCheckUtils]: 109: Hoare triple {49137#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49137#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:28,505 INFO L273 TraceCheckUtils]: 110: Hoare triple {49137#(<= main_~i~0 35)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49137#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:28,506 INFO L273 TraceCheckUtils]: 111: Hoare triple {49137#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {49138#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:28,506 INFO L273 TraceCheckUtils]: 112: Hoare triple {49138#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49138#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:28,507 INFO L273 TraceCheckUtils]: 113: Hoare triple {49138#(<= main_~i~0 36)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49138#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:28,507 INFO L273 TraceCheckUtils]: 114: Hoare triple {49138#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {49139#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:28,508 INFO L273 TraceCheckUtils]: 115: Hoare triple {49139#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49139#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:28,508 INFO L273 TraceCheckUtils]: 116: Hoare triple {49139#(<= main_~i~0 37)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49139#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:28,509 INFO L273 TraceCheckUtils]: 117: Hoare triple {49139#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {49140#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:28,510 INFO L273 TraceCheckUtils]: 118: Hoare triple {49140#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49140#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:28,510 INFO L273 TraceCheckUtils]: 119: Hoare triple {49140#(<= main_~i~0 38)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49140#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:28,511 INFO L273 TraceCheckUtils]: 120: Hoare triple {49140#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {49141#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:28,511 INFO L273 TraceCheckUtils]: 121: Hoare triple {49141#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49141#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:28,512 INFO L273 TraceCheckUtils]: 122: Hoare triple {49141#(<= main_~i~0 39)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49141#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:28,513 INFO L273 TraceCheckUtils]: 123: Hoare triple {49141#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {49142#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:28,513 INFO L273 TraceCheckUtils]: 124: Hoare triple {49142#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49142#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:28,514 INFO L273 TraceCheckUtils]: 125: Hoare triple {49142#(<= main_~i~0 40)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49142#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:28,514 INFO L273 TraceCheckUtils]: 126: Hoare triple {49142#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {49143#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:28,515 INFO L273 TraceCheckUtils]: 127: Hoare triple {49143#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49143#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:28,515 INFO L273 TraceCheckUtils]: 128: Hoare triple {49143#(<= main_~i~0 41)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49143#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:28,516 INFO L273 TraceCheckUtils]: 129: Hoare triple {49143#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {49144#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:28,516 INFO L273 TraceCheckUtils]: 130: Hoare triple {49144#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {49144#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:28,517 INFO L273 TraceCheckUtils]: 131: Hoare triple {49144#(<= main_~i~0 42)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {49144#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:28,518 INFO L273 TraceCheckUtils]: 132: Hoare triple {49144#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {49145#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:28,518 INFO L273 TraceCheckUtils]: 133: Hoare triple {49145#(<= main_~i~0 43)} assume !(~i~0 < 100000); {49102#false} is VALID [2018-11-23 11:53:28,518 INFO L273 TraceCheckUtils]: 134: Hoare triple {49102#false} assume !(0 != ~swapped~0); {49102#false} is VALID [2018-11-23 11:53:28,519 INFO L273 TraceCheckUtils]: 135: Hoare triple {49102#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {49102#false} is VALID [2018-11-23 11:53:28,519 INFO L273 TraceCheckUtils]: 136: Hoare triple {49102#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {49102#false} is VALID [2018-11-23 11:53:28,519 INFO L273 TraceCheckUtils]: 137: Hoare triple {49102#false} assume !!(~y~0 < 100000);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); {49102#false} is VALID [2018-11-23 11:53:28,519 INFO L256 TraceCheckUtils]: 138: Hoare triple {49102#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {49102#false} is VALID [2018-11-23 11:53:28,519 INFO L273 TraceCheckUtils]: 139: Hoare triple {49102#false} ~cond := #in~cond; {49102#false} is VALID [2018-11-23 11:53:28,520 INFO L273 TraceCheckUtils]: 140: Hoare triple {49102#false} assume 0 == ~cond; {49102#false} is VALID [2018-11-23 11:53:28,520 INFO L273 TraceCheckUtils]: 141: Hoare triple {49102#false} assume !false; {49102#false} is VALID [2018-11-23 11:53:28,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2626 backedges. 1 proven. 2625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:53:28,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:28,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 46 [2018-11-23 11:53:28,552 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 142 [2018-11-23 11:53:28,553 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:28,553 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states. [2018-11-23 11:53:28,693 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:28,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-23 11:53:28,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-23 11:53:28,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 11:53:28,695 INFO L87 Difference]: Start difference. First operand 273 states and 360 transitions. Second operand 46 states. [2018-11-23 11:53:29,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:29,922 INFO L93 Difference]: Finished difference Result 550 states and 730 transitions. [2018-11-23 11:53:29,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-23 11:53:29,922 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 142 [2018-11-23 11:53:29,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:29,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 11:53:29,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 221 transitions. [2018-11-23 11:53:29,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 11:53:29,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 221 transitions. [2018-11-23 11:53:29,925 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states and 221 transitions. [2018-11-23 11:53:30,232 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 221 edges. 221 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:30,238 INFO L225 Difference]: With dead ends: 550 [2018-11-23 11:53:30,238 INFO L226 Difference]: Without dead ends: 283 [2018-11-23 11:53:30,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 11:53:30,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-11-23 11:53:30,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 279. [2018-11-23 11:53:30,415 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:30,416 INFO L82 GeneralOperation]: Start isEquivalent. First operand 283 states. Second operand 279 states. [2018-11-23 11:53:30,416 INFO L74 IsIncluded]: Start isIncluded. First operand 283 states. Second operand 279 states. [2018-11-23 11:53:30,416 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 279 states. [2018-11-23 11:53:30,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:30,421 INFO L93 Difference]: Finished difference Result 283 states and 374 transitions. [2018-11-23 11:53:30,421 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 374 transitions. [2018-11-23 11:53:30,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:30,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:30,422 INFO L74 IsIncluded]: Start isIncluded. First operand 279 states. Second operand 283 states. [2018-11-23 11:53:30,422 INFO L87 Difference]: Start difference. First operand 279 states. Second operand 283 states. [2018-11-23 11:53:30,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:30,426 INFO L93 Difference]: Finished difference Result 283 states and 374 transitions. [2018-11-23 11:53:30,426 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 374 transitions. [2018-11-23 11:53:30,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:30,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:30,427 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:30,427 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:30,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-11-23 11:53:30,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 368 transitions. [2018-11-23 11:53:30,431 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 368 transitions. Word has length 142 [2018-11-23 11:53:30,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:30,431 INFO L480 AbstractCegarLoop]: Abstraction has 279 states and 368 transitions. [2018-11-23 11:53:30,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-23 11:53:30,432 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 368 transitions. [2018-11-23 11:53:30,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-23 11:53:30,432 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:30,432 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:53:30,432 INFO L423 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:30,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:30,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1815679000, now seen corresponding path program 43 times [2018-11-23 11:53:30,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:30,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:30,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:30,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:30,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:30,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:31,532 INFO L256 TraceCheckUtils]: 0: Hoare triple {51252#true} call ULTIMATE.init(); {51252#true} is VALID [2018-11-23 11:53:31,532 INFO L273 TraceCheckUtils]: 1: Hoare triple {51252#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {51252#true} is VALID [2018-11-23 11:53:31,533 INFO L273 TraceCheckUtils]: 2: Hoare triple {51252#true} assume true; {51252#true} is VALID [2018-11-23 11:53:31,533 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {51252#true} {51252#true} #79#return; {51252#true} is VALID [2018-11-23 11:53:31,533 INFO L256 TraceCheckUtils]: 4: Hoare triple {51252#true} call #t~ret8 := main(); {51252#true} is VALID [2018-11-23 11:53:31,533 INFO L273 TraceCheckUtils]: 5: Hoare triple {51252#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {51252#true} is VALID [2018-11-23 11:53:31,534 INFO L273 TraceCheckUtils]: 6: Hoare triple {51252#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {51254#(= main_~i~0 1)} is VALID [2018-11-23 11:53:31,534 INFO L273 TraceCheckUtils]: 7: Hoare triple {51254#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51254#(= main_~i~0 1)} is VALID [2018-11-23 11:53:31,535 INFO L273 TraceCheckUtils]: 8: Hoare triple {51254#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51254#(= main_~i~0 1)} is VALID [2018-11-23 11:53:31,535 INFO L273 TraceCheckUtils]: 9: Hoare triple {51254#(= main_~i~0 1)} ~i~0 := 1 + ~i~0; {51255#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:31,535 INFO L273 TraceCheckUtils]: 10: Hoare triple {51255#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51255#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:31,536 INFO L273 TraceCheckUtils]: 11: Hoare triple {51255#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51255#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:31,536 INFO L273 TraceCheckUtils]: 12: Hoare triple {51255#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {51256#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:31,536 INFO L273 TraceCheckUtils]: 13: Hoare triple {51256#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51256#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:31,537 INFO L273 TraceCheckUtils]: 14: Hoare triple {51256#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51256#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:31,537 INFO L273 TraceCheckUtils]: 15: Hoare triple {51256#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {51257#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:31,537 INFO L273 TraceCheckUtils]: 16: Hoare triple {51257#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51257#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:31,538 INFO L273 TraceCheckUtils]: 17: Hoare triple {51257#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51257#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:31,538 INFO L273 TraceCheckUtils]: 18: Hoare triple {51257#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {51258#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:31,539 INFO L273 TraceCheckUtils]: 19: Hoare triple {51258#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51258#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:31,539 INFO L273 TraceCheckUtils]: 20: Hoare triple {51258#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51258#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:31,540 INFO L273 TraceCheckUtils]: 21: Hoare triple {51258#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {51259#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:31,541 INFO L273 TraceCheckUtils]: 22: Hoare triple {51259#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51259#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:31,541 INFO L273 TraceCheckUtils]: 23: Hoare triple {51259#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51259#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:31,542 INFO L273 TraceCheckUtils]: 24: Hoare triple {51259#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {51260#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:31,542 INFO L273 TraceCheckUtils]: 25: Hoare triple {51260#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51260#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:31,543 INFO L273 TraceCheckUtils]: 26: Hoare triple {51260#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51260#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:31,544 INFO L273 TraceCheckUtils]: 27: Hoare triple {51260#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {51261#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:31,544 INFO L273 TraceCheckUtils]: 28: Hoare triple {51261#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51261#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:31,545 INFO L273 TraceCheckUtils]: 29: Hoare triple {51261#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51261#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:31,545 INFO L273 TraceCheckUtils]: 30: Hoare triple {51261#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {51262#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:31,546 INFO L273 TraceCheckUtils]: 31: Hoare triple {51262#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51262#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:31,546 INFO L273 TraceCheckUtils]: 32: Hoare triple {51262#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51262#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:31,547 INFO L273 TraceCheckUtils]: 33: Hoare triple {51262#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {51263#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:31,548 INFO L273 TraceCheckUtils]: 34: Hoare triple {51263#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51263#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:31,548 INFO L273 TraceCheckUtils]: 35: Hoare triple {51263#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51263#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:31,549 INFO L273 TraceCheckUtils]: 36: Hoare triple {51263#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {51264#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:31,549 INFO L273 TraceCheckUtils]: 37: Hoare triple {51264#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51264#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:31,550 INFO L273 TraceCheckUtils]: 38: Hoare triple {51264#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51264#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:31,550 INFO L273 TraceCheckUtils]: 39: Hoare triple {51264#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {51265#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:31,551 INFO L273 TraceCheckUtils]: 40: Hoare triple {51265#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51265#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:31,551 INFO L273 TraceCheckUtils]: 41: Hoare triple {51265#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51265#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:31,552 INFO L273 TraceCheckUtils]: 42: Hoare triple {51265#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {51266#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:31,553 INFO L273 TraceCheckUtils]: 43: Hoare triple {51266#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51266#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:31,553 INFO L273 TraceCheckUtils]: 44: Hoare triple {51266#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51266#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:31,554 INFO L273 TraceCheckUtils]: 45: Hoare triple {51266#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {51267#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:31,554 INFO L273 TraceCheckUtils]: 46: Hoare triple {51267#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51267#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:31,555 INFO L273 TraceCheckUtils]: 47: Hoare triple {51267#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51267#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:31,556 INFO L273 TraceCheckUtils]: 48: Hoare triple {51267#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {51268#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:31,556 INFO L273 TraceCheckUtils]: 49: Hoare triple {51268#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51268#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:31,557 INFO L273 TraceCheckUtils]: 50: Hoare triple {51268#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51268#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:31,557 INFO L273 TraceCheckUtils]: 51: Hoare triple {51268#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {51269#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:31,558 INFO L273 TraceCheckUtils]: 52: Hoare triple {51269#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51269#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:31,558 INFO L273 TraceCheckUtils]: 53: Hoare triple {51269#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51269#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:31,559 INFO L273 TraceCheckUtils]: 54: Hoare triple {51269#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {51270#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:31,560 INFO L273 TraceCheckUtils]: 55: Hoare triple {51270#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51270#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:31,560 INFO L273 TraceCheckUtils]: 56: Hoare triple {51270#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51270#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:31,561 INFO L273 TraceCheckUtils]: 57: Hoare triple {51270#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {51271#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:31,561 INFO L273 TraceCheckUtils]: 58: Hoare triple {51271#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51271#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:31,562 INFO L273 TraceCheckUtils]: 59: Hoare triple {51271#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51271#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:31,562 INFO L273 TraceCheckUtils]: 60: Hoare triple {51271#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {51272#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:31,563 INFO L273 TraceCheckUtils]: 61: Hoare triple {51272#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51272#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:31,563 INFO L273 TraceCheckUtils]: 62: Hoare triple {51272#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51272#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:31,564 INFO L273 TraceCheckUtils]: 63: Hoare triple {51272#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {51273#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:31,565 INFO L273 TraceCheckUtils]: 64: Hoare triple {51273#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51273#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:31,565 INFO L273 TraceCheckUtils]: 65: Hoare triple {51273#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51273#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:31,566 INFO L273 TraceCheckUtils]: 66: Hoare triple {51273#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {51274#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:31,566 INFO L273 TraceCheckUtils]: 67: Hoare triple {51274#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51274#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:31,567 INFO L273 TraceCheckUtils]: 68: Hoare triple {51274#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51274#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:31,568 INFO L273 TraceCheckUtils]: 69: Hoare triple {51274#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {51275#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:31,568 INFO L273 TraceCheckUtils]: 70: Hoare triple {51275#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51275#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:31,569 INFO L273 TraceCheckUtils]: 71: Hoare triple {51275#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51275#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:31,569 INFO L273 TraceCheckUtils]: 72: Hoare triple {51275#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {51276#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:31,570 INFO L273 TraceCheckUtils]: 73: Hoare triple {51276#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51276#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:31,570 INFO L273 TraceCheckUtils]: 74: Hoare triple {51276#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51276#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:31,571 INFO L273 TraceCheckUtils]: 75: Hoare triple {51276#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {51277#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:31,572 INFO L273 TraceCheckUtils]: 76: Hoare triple {51277#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51277#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:31,572 INFO L273 TraceCheckUtils]: 77: Hoare triple {51277#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51277#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:31,573 INFO L273 TraceCheckUtils]: 78: Hoare triple {51277#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {51278#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:31,573 INFO L273 TraceCheckUtils]: 79: Hoare triple {51278#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51278#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:31,574 INFO L273 TraceCheckUtils]: 80: Hoare triple {51278#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51278#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:31,574 INFO L273 TraceCheckUtils]: 81: Hoare triple {51278#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {51279#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:31,575 INFO L273 TraceCheckUtils]: 82: Hoare triple {51279#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51279#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:31,575 INFO L273 TraceCheckUtils]: 83: Hoare triple {51279#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51279#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:31,576 INFO L273 TraceCheckUtils]: 84: Hoare triple {51279#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {51280#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:31,577 INFO L273 TraceCheckUtils]: 85: Hoare triple {51280#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51280#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:31,577 INFO L273 TraceCheckUtils]: 86: Hoare triple {51280#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51280#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:31,578 INFO L273 TraceCheckUtils]: 87: Hoare triple {51280#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {51281#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:31,578 INFO L273 TraceCheckUtils]: 88: Hoare triple {51281#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51281#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:31,579 INFO L273 TraceCheckUtils]: 89: Hoare triple {51281#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51281#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:31,580 INFO L273 TraceCheckUtils]: 90: Hoare triple {51281#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {51282#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:31,580 INFO L273 TraceCheckUtils]: 91: Hoare triple {51282#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51282#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:31,581 INFO L273 TraceCheckUtils]: 92: Hoare triple {51282#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51282#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:31,581 INFO L273 TraceCheckUtils]: 93: Hoare triple {51282#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {51283#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:31,582 INFO L273 TraceCheckUtils]: 94: Hoare triple {51283#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51283#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:31,582 INFO L273 TraceCheckUtils]: 95: Hoare triple {51283#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51283#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:31,583 INFO L273 TraceCheckUtils]: 96: Hoare triple {51283#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {51284#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:31,584 INFO L273 TraceCheckUtils]: 97: Hoare triple {51284#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51284#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:31,584 INFO L273 TraceCheckUtils]: 98: Hoare triple {51284#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51284#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:31,585 INFO L273 TraceCheckUtils]: 99: Hoare triple {51284#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {51285#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:31,585 INFO L273 TraceCheckUtils]: 100: Hoare triple {51285#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51285#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:31,586 INFO L273 TraceCheckUtils]: 101: Hoare triple {51285#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51285#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:31,586 INFO L273 TraceCheckUtils]: 102: Hoare triple {51285#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {51286#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:31,587 INFO L273 TraceCheckUtils]: 103: Hoare triple {51286#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51286#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:31,587 INFO L273 TraceCheckUtils]: 104: Hoare triple {51286#(<= main_~i~0 33)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51286#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:31,588 INFO L273 TraceCheckUtils]: 105: Hoare triple {51286#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {51287#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:31,589 INFO L273 TraceCheckUtils]: 106: Hoare triple {51287#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51287#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:31,589 INFO L273 TraceCheckUtils]: 107: Hoare triple {51287#(<= main_~i~0 34)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51287#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:31,590 INFO L273 TraceCheckUtils]: 108: Hoare triple {51287#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {51288#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:31,590 INFO L273 TraceCheckUtils]: 109: Hoare triple {51288#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51288#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:31,591 INFO L273 TraceCheckUtils]: 110: Hoare triple {51288#(<= main_~i~0 35)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51288#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:31,592 INFO L273 TraceCheckUtils]: 111: Hoare triple {51288#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {51289#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:31,592 INFO L273 TraceCheckUtils]: 112: Hoare triple {51289#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51289#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:31,593 INFO L273 TraceCheckUtils]: 113: Hoare triple {51289#(<= main_~i~0 36)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51289#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:31,593 INFO L273 TraceCheckUtils]: 114: Hoare triple {51289#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {51290#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:31,594 INFO L273 TraceCheckUtils]: 115: Hoare triple {51290#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51290#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:31,594 INFO L273 TraceCheckUtils]: 116: Hoare triple {51290#(<= main_~i~0 37)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51290#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:31,595 INFO L273 TraceCheckUtils]: 117: Hoare triple {51290#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {51291#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:31,596 INFO L273 TraceCheckUtils]: 118: Hoare triple {51291#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51291#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:31,596 INFO L273 TraceCheckUtils]: 119: Hoare triple {51291#(<= main_~i~0 38)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51291#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:31,597 INFO L273 TraceCheckUtils]: 120: Hoare triple {51291#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {51292#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:31,597 INFO L273 TraceCheckUtils]: 121: Hoare triple {51292#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51292#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:31,598 INFO L273 TraceCheckUtils]: 122: Hoare triple {51292#(<= main_~i~0 39)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51292#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:31,598 INFO L273 TraceCheckUtils]: 123: Hoare triple {51292#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {51293#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:31,599 INFO L273 TraceCheckUtils]: 124: Hoare triple {51293#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51293#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:31,599 INFO L273 TraceCheckUtils]: 125: Hoare triple {51293#(<= main_~i~0 40)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51293#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:31,600 INFO L273 TraceCheckUtils]: 126: Hoare triple {51293#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {51294#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:31,601 INFO L273 TraceCheckUtils]: 127: Hoare triple {51294#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51294#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:31,601 INFO L273 TraceCheckUtils]: 128: Hoare triple {51294#(<= main_~i~0 41)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51294#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:31,602 INFO L273 TraceCheckUtils]: 129: Hoare triple {51294#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {51295#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:31,602 INFO L273 TraceCheckUtils]: 130: Hoare triple {51295#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51295#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:31,603 INFO L273 TraceCheckUtils]: 131: Hoare triple {51295#(<= main_~i~0 42)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51295#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:31,604 INFO L273 TraceCheckUtils]: 132: Hoare triple {51295#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {51296#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:31,604 INFO L273 TraceCheckUtils]: 133: Hoare triple {51296#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51296#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:31,605 INFO L273 TraceCheckUtils]: 134: Hoare triple {51296#(<= main_~i~0 43)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51296#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:31,605 INFO L273 TraceCheckUtils]: 135: Hoare triple {51296#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {51297#(<= main_~i~0 44)} is VALID [2018-11-23 11:53:31,606 INFO L273 TraceCheckUtils]: 136: Hoare triple {51297#(<= main_~i~0 44)} assume !(~i~0 < 100000); {51253#false} is VALID [2018-11-23 11:53:31,606 INFO L273 TraceCheckUtils]: 137: Hoare triple {51253#false} assume !(0 != ~swapped~0); {51253#false} is VALID [2018-11-23 11:53:31,606 INFO L273 TraceCheckUtils]: 138: Hoare triple {51253#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {51253#false} is VALID [2018-11-23 11:53:31,607 INFO L273 TraceCheckUtils]: 139: Hoare triple {51253#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {51253#false} is VALID [2018-11-23 11:53:31,607 INFO L273 TraceCheckUtils]: 140: Hoare triple {51253#false} assume !!(~y~0 < 100000);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); {51253#false} is VALID [2018-11-23 11:53:31,607 INFO L256 TraceCheckUtils]: 141: Hoare triple {51253#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {51253#false} is VALID [2018-11-23 11:53:31,607 INFO L273 TraceCheckUtils]: 142: Hoare triple {51253#false} ~cond := #in~cond; {51253#false} is VALID [2018-11-23 11:53:31,607 INFO L273 TraceCheckUtils]: 143: Hoare triple {51253#false} assume 0 == ~cond; {51253#false} is VALID [2018-11-23 11:53:31,607 INFO L273 TraceCheckUtils]: 144: Hoare triple {51253#false} assume !false; {51253#false} is VALID [2018-11-23 11:53:31,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2753 backedges. 1 proven. 2752 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:53:31,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:31,621 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 11:53:31,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:53:31,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:31,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:31,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:32,106 INFO L256 TraceCheckUtils]: 0: Hoare triple {51252#true} call ULTIMATE.init(); {51252#true} is VALID [2018-11-23 11:53:32,106 INFO L273 TraceCheckUtils]: 1: Hoare triple {51252#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {51252#true} is VALID [2018-11-23 11:53:32,106 INFO L273 TraceCheckUtils]: 2: Hoare triple {51252#true} assume true; {51252#true} is VALID [2018-11-23 11:53:32,106 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {51252#true} {51252#true} #79#return; {51252#true} is VALID [2018-11-23 11:53:32,107 INFO L256 TraceCheckUtils]: 4: Hoare triple {51252#true} call #t~ret8 := main(); {51252#true} is VALID [2018-11-23 11:53:32,107 INFO L273 TraceCheckUtils]: 5: Hoare triple {51252#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {51252#true} is VALID [2018-11-23 11:53:32,107 INFO L273 TraceCheckUtils]: 6: Hoare triple {51252#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {51319#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:32,108 INFO L273 TraceCheckUtils]: 7: Hoare triple {51319#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51319#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:32,108 INFO L273 TraceCheckUtils]: 8: Hoare triple {51319#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51319#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:32,109 INFO L273 TraceCheckUtils]: 9: Hoare triple {51319#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {51255#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:32,109 INFO L273 TraceCheckUtils]: 10: Hoare triple {51255#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51255#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:32,110 INFO L273 TraceCheckUtils]: 11: Hoare triple {51255#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51255#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:32,110 INFO L273 TraceCheckUtils]: 12: Hoare triple {51255#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {51256#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:32,110 INFO L273 TraceCheckUtils]: 13: Hoare triple {51256#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51256#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:32,111 INFO L273 TraceCheckUtils]: 14: Hoare triple {51256#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51256#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:32,111 INFO L273 TraceCheckUtils]: 15: Hoare triple {51256#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {51257#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:32,112 INFO L273 TraceCheckUtils]: 16: Hoare triple {51257#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51257#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:32,112 INFO L273 TraceCheckUtils]: 17: Hoare triple {51257#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51257#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:32,113 INFO L273 TraceCheckUtils]: 18: Hoare triple {51257#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {51258#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:32,113 INFO L273 TraceCheckUtils]: 19: Hoare triple {51258#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51258#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:32,114 INFO L273 TraceCheckUtils]: 20: Hoare triple {51258#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51258#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:32,114 INFO L273 TraceCheckUtils]: 21: Hoare triple {51258#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {51259#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:32,115 INFO L273 TraceCheckUtils]: 22: Hoare triple {51259#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51259#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:32,115 INFO L273 TraceCheckUtils]: 23: Hoare triple {51259#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51259#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:32,116 INFO L273 TraceCheckUtils]: 24: Hoare triple {51259#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {51260#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:32,117 INFO L273 TraceCheckUtils]: 25: Hoare triple {51260#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51260#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:32,117 INFO L273 TraceCheckUtils]: 26: Hoare triple {51260#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51260#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:32,118 INFO L273 TraceCheckUtils]: 27: Hoare triple {51260#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {51261#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:32,118 INFO L273 TraceCheckUtils]: 28: Hoare triple {51261#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51261#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:32,119 INFO L273 TraceCheckUtils]: 29: Hoare triple {51261#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51261#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:32,119 INFO L273 TraceCheckUtils]: 30: Hoare triple {51261#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {51262#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:32,120 INFO L273 TraceCheckUtils]: 31: Hoare triple {51262#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51262#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:32,120 INFO L273 TraceCheckUtils]: 32: Hoare triple {51262#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51262#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:32,121 INFO L273 TraceCheckUtils]: 33: Hoare triple {51262#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {51263#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:32,121 INFO L273 TraceCheckUtils]: 34: Hoare triple {51263#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51263#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:32,122 INFO L273 TraceCheckUtils]: 35: Hoare triple {51263#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51263#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:32,122 INFO L273 TraceCheckUtils]: 36: Hoare triple {51263#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {51264#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:32,123 INFO L273 TraceCheckUtils]: 37: Hoare triple {51264#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51264#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:32,123 INFO L273 TraceCheckUtils]: 38: Hoare triple {51264#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51264#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:32,124 INFO L273 TraceCheckUtils]: 39: Hoare triple {51264#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {51265#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:32,125 INFO L273 TraceCheckUtils]: 40: Hoare triple {51265#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51265#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:32,125 INFO L273 TraceCheckUtils]: 41: Hoare triple {51265#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51265#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:32,126 INFO L273 TraceCheckUtils]: 42: Hoare triple {51265#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {51266#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:32,126 INFO L273 TraceCheckUtils]: 43: Hoare triple {51266#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51266#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:32,127 INFO L273 TraceCheckUtils]: 44: Hoare triple {51266#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51266#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:32,127 INFO L273 TraceCheckUtils]: 45: Hoare triple {51266#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {51267#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:32,128 INFO L273 TraceCheckUtils]: 46: Hoare triple {51267#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51267#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:32,128 INFO L273 TraceCheckUtils]: 47: Hoare triple {51267#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51267#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:32,129 INFO L273 TraceCheckUtils]: 48: Hoare triple {51267#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {51268#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:32,129 INFO L273 TraceCheckUtils]: 49: Hoare triple {51268#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51268#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:32,130 INFO L273 TraceCheckUtils]: 50: Hoare triple {51268#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51268#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:32,131 INFO L273 TraceCheckUtils]: 51: Hoare triple {51268#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {51269#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:32,131 INFO L273 TraceCheckUtils]: 52: Hoare triple {51269#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51269#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:32,131 INFO L273 TraceCheckUtils]: 53: Hoare triple {51269#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51269#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:32,132 INFO L273 TraceCheckUtils]: 54: Hoare triple {51269#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {51270#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:32,133 INFO L273 TraceCheckUtils]: 55: Hoare triple {51270#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51270#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:32,133 INFO L273 TraceCheckUtils]: 56: Hoare triple {51270#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51270#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:32,134 INFO L273 TraceCheckUtils]: 57: Hoare triple {51270#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {51271#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:32,134 INFO L273 TraceCheckUtils]: 58: Hoare triple {51271#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51271#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:32,135 INFO L273 TraceCheckUtils]: 59: Hoare triple {51271#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51271#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:32,135 INFO L273 TraceCheckUtils]: 60: Hoare triple {51271#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {51272#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:32,136 INFO L273 TraceCheckUtils]: 61: Hoare triple {51272#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51272#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:32,136 INFO L273 TraceCheckUtils]: 62: Hoare triple {51272#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51272#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:32,137 INFO L273 TraceCheckUtils]: 63: Hoare triple {51272#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {51273#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:32,137 INFO L273 TraceCheckUtils]: 64: Hoare triple {51273#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51273#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:32,138 INFO L273 TraceCheckUtils]: 65: Hoare triple {51273#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51273#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:32,139 INFO L273 TraceCheckUtils]: 66: Hoare triple {51273#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {51274#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:32,139 INFO L273 TraceCheckUtils]: 67: Hoare triple {51274#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51274#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:32,140 INFO L273 TraceCheckUtils]: 68: Hoare triple {51274#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51274#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:32,140 INFO L273 TraceCheckUtils]: 69: Hoare triple {51274#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {51275#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:32,141 INFO L273 TraceCheckUtils]: 70: Hoare triple {51275#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51275#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:32,141 INFO L273 TraceCheckUtils]: 71: Hoare triple {51275#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51275#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:32,142 INFO L273 TraceCheckUtils]: 72: Hoare triple {51275#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {51276#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:32,142 INFO L273 TraceCheckUtils]: 73: Hoare triple {51276#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51276#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:32,143 INFO L273 TraceCheckUtils]: 74: Hoare triple {51276#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51276#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:32,144 INFO L273 TraceCheckUtils]: 75: Hoare triple {51276#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {51277#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:32,144 INFO L273 TraceCheckUtils]: 76: Hoare triple {51277#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51277#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:32,144 INFO L273 TraceCheckUtils]: 77: Hoare triple {51277#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51277#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:32,145 INFO L273 TraceCheckUtils]: 78: Hoare triple {51277#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {51278#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:32,146 INFO L273 TraceCheckUtils]: 79: Hoare triple {51278#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51278#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:32,146 INFO L273 TraceCheckUtils]: 80: Hoare triple {51278#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51278#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:32,147 INFO L273 TraceCheckUtils]: 81: Hoare triple {51278#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {51279#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:32,147 INFO L273 TraceCheckUtils]: 82: Hoare triple {51279#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51279#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:32,148 INFO L273 TraceCheckUtils]: 83: Hoare triple {51279#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51279#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:32,148 INFO L273 TraceCheckUtils]: 84: Hoare triple {51279#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {51280#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:32,149 INFO L273 TraceCheckUtils]: 85: Hoare triple {51280#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51280#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:32,149 INFO L273 TraceCheckUtils]: 86: Hoare triple {51280#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51280#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:32,150 INFO L273 TraceCheckUtils]: 87: Hoare triple {51280#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {51281#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:32,151 INFO L273 TraceCheckUtils]: 88: Hoare triple {51281#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51281#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:32,151 INFO L273 TraceCheckUtils]: 89: Hoare triple {51281#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51281#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:32,152 INFO L273 TraceCheckUtils]: 90: Hoare triple {51281#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {51282#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:32,152 INFO L273 TraceCheckUtils]: 91: Hoare triple {51282#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51282#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:32,153 INFO L273 TraceCheckUtils]: 92: Hoare triple {51282#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51282#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:32,153 INFO L273 TraceCheckUtils]: 93: Hoare triple {51282#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {51283#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:32,154 INFO L273 TraceCheckUtils]: 94: Hoare triple {51283#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51283#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:32,154 INFO L273 TraceCheckUtils]: 95: Hoare triple {51283#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51283#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:32,155 INFO L273 TraceCheckUtils]: 96: Hoare triple {51283#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {51284#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:32,155 INFO L273 TraceCheckUtils]: 97: Hoare triple {51284#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51284#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:32,156 INFO L273 TraceCheckUtils]: 98: Hoare triple {51284#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51284#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:32,157 INFO L273 TraceCheckUtils]: 99: Hoare triple {51284#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {51285#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:32,157 INFO L273 TraceCheckUtils]: 100: Hoare triple {51285#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51285#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:32,157 INFO L273 TraceCheckUtils]: 101: Hoare triple {51285#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51285#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:32,158 INFO L273 TraceCheckUtils]: 102: Hoare triple {51285#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {51286#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:32,159 INFO L273 TraceCheckUtils]: 103: Hoare triple {51286#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51286#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:32,159 INFO L273 TraceCheckUtils]: 104: Hoare triple {51286#(<= main_~i~0 33)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51286#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:32,160 INFO L273 TraceCheckUtils]: 105: Hoare triple {51286#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {51287#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:32,160 INFO L273 TraceCheckUtils]: 106: Hoare triple {51287#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51287#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:32,161 INFO L273 TraceCheckUtils]: 107: Hoare triple {51287#(<= main_~i~0 34)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51287#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:32,161 INFO L273 TraceCheckUtils]: 108: Hoare triple {51287#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {51288#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:32,162 INFO L273 TraceCheckUtils]: 109: Hoare triple {51288#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51288#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:32,162 INFO L273 TraceCheckUtils]: 110: Hoare triple {51288#(<= main_~i~0 35)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51288#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:32,163 INFO L273 TraceCheckUtils]: 111: Hoare triple {51288#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {51289#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:32,163 INFO L273 TraceCheckUtils]: 112: Hoare triple {51289#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51289#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:32,164 INFO L273 TraceCheckUtils]: 113: Hoare triple {51289#(<= main_~i~0 36)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51289#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:32,165 INFO L273 TraceCheckUtils]: 114: Hoare triple {51289#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {51290#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:32,165 INFO L273 TraceCheckUtils]: 115: Hoare triple {51290#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51290#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:32,165 INFO L273 TraceCheckUtils]: 116: Hoare triple {51290#(<= main_~i~0 37)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51290#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:32,166 INFO L273 TraceCheckUtils]: 117: Hoare triple {51290#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {51291#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:32,167 INFO L273 TraceCheckUtils]: 118: Hoare triple {51291#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51291#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:32,167 INFO L273 TraceCheckUtils]: 119: Hoare triple {51291#(<= main_~i~0 38)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51291#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:32,168 INFO L273 TraceCheckUtils]: 120: Hoare triple {51291#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {51292#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:32,168 INFO L273 TraceCheckUtils]: 121: Hoare triple {51292#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51292#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:32,169 INFO L273 TraceCheckUtils]: 122: Hoare triple {51292#(<= main_~i~0 39)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51292#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:32,169 INFO L273 TraceCheckUtils]: 123: Hoare triple {51292#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {51293#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:32,170 INFO L273 TraceCheckUtils]: 124: Hoare triple {51293#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51293#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:32,170 INFO L273 TraceCheckUtils]: 125: Hoare triple {51293#(<= main_~i~0 40)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51293#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:32,171 INFO L273 TraceCheckUtils]: 126: Hoare triple {51293#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {51294#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:32,171 INFO L273 TraceCheckUtils]: 127: Hoare triple {51294#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51294#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:32,172 INFO L273 TraceCheckUtils]: 128: Hoare triple {51294#(<= main_~i~0 41)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51294#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:32,173 INFO L273 TraceCheckUtils]: 129: Hoare triple {51294#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {51295#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:32,173 INFO L273 TraceCheckUtils]: 130: Hoare triple {51295#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51295#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:32,174 INFO L273 TraceCheckUtils]: 131: Hoare triple {51295#(<= main_~i~0 42)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51295#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:32,174 INFO L273 TraceCheckUtils]: 132: Hoare triple {51295#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {51296#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:32,175 INFO L273 TraceCheckUtils]: 133: Hoare triple {51296#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {51296#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:32,175 INFO L273 TraceCheckUtils]: 134: Hoare triple {51296#(<= main_~i~0 43)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {51296#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:32,176 INFO L273 TraceCheckUtils]: 135: Hoare triple {51296#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {51297#(<= main_~i~0 44)} is VALID [2018-11-23 11:53:32,176 INFO L273 TraceCheckUtils]: 136: Hoare triple {51297#(<= main_~i~0 44)} assume !(~i~0 < 100000); {51253#false} is VALID [2018-11-23 11:53:32,177 INFO L273 TraceCheckUtils]: 137: Hoare triple {51253#false} assume !(0 != ~swapped~0); {51253#false} is VALID [2018-11-23 11:53:32,177 INFO L273 TraceCheckUtils]: 138: Hoare triple {51253#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {51253#false} is VALID [2018-11-23 11:53:32,177 INFO L273 TraceCheckUtils]: 139: Hoare triple {51253#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {51253#false} is VALID [2018-11-23 11:53:32,177 INFO L273 TraceCheckUtils]: 140: Hoare triple {51253#false} assume !!(~y~0 < 100000);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); {51253#false} is VALID [2018-11-23 11:53:32,177 INFO L256 TraceCheckUtils]: 141: Hoare triple {51253#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {51253#false} is VALID [2018-11-23 11:53:32,177 INFO L273 TraceCheckUtils]: 142: Hoare triple {51253#false} ~cond := #in~cond; {51253#false} is VALID [2018-11-23 11:53:32,178 INFO L273 TraceCheckUtils]: 143: Hoare triple {51253#false} assume 0 == ~cond; {51253#false} is VALID [2018-11-23 11:53:32,178 INFO L273 TraceCheckUtils]: 144: Hoare triple {51253#false} assume !false; {51253#false} is VALID [2018-11-23 11:53:32,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2753 backedges. 1 proven. 2752 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:53:32,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:32,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 47 [2018-11-23 11:53:32,210 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 145 [2018-11-23 11:53:32,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:32,211 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states. [2018-11-23 11:53:32,349 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:32,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-23 11:53:32,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-23 11:53:32,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-11-23 11:53:32,350 INFO L87 Difference]: Start difference. First operand 279 states and 368 transitions. Second operand 47 states. [2018-11-23 11:53:33,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:33,412 INFO L93 Difference]: Finished difference Result 562 states and 746 transitions. [2018-11-23 11:53:33,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-23 11:53:33,412 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 145 [2018-11-23 11:53:33,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:33,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 11:53:33,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 225 transitions. [2018-11-23 11:53:33,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 11:53:33,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 225 transitions. [2018-11-23 11:53:33,416 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states and 225 transitions. [2018-11-23 11:53:33,632 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 225 edges. 225 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:33,638 INFO L225 Difference]: With dead ends: 562 [2018-11-23 11:53:33,638 INFO L226 Difference]: Without dead ends: 289 [2018-11-23 11:53:33,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-11-23 11:53:33,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-11-23 11:53:33,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 285. [2018-11-23 11:53:33,737 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:33,737 INFO L82 GeneralOperation]: Start isEquivalent. First operand 289 states. Second operand 285 states. [2018-11-23 11:53:33,737 INFO L74 IsIncluded]: Start isIncluded. First operand 289 states. Second operand 285 states. [2018-11-23 11:53:33,737 INFO L87 Difference]: Start difference. First operand 289 states. Second operand 285 states. [2018-11-23 11:53:33,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:33,744 INFO L93 Difference]: Finished difference Result 289 states and 382 transitions. [2018-11-23 11:53:33,744 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 382 transitions. [2018-11-23 11:53:33,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:33,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:33,744 INFO L74 IsIncluded]: Start isIncluded. First operand 285 states. Second operand 289 states. [2018-11-23 11:53:33,744 INFO L87 Difference]: Start difference. First operand 285 states. Second operand 289 states. [2018-11-23 11:53:33,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:33,750 INFO L93 Difference]: Finished difference Result 289 states and 382 transitions. [2018-11-23 11:53:33,750 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 382 transitions. [2018-11-23 11:53:33,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:33,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:33,751 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:33,751 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:33,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-11-23 11:53:33,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 376 transitions. [2018-11-23 11:53:33,756 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 376 transitions. Word has length 145 [2018-11-23 11:53:33,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:33,756 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 376 transitions. [2018-11-23 11:53:33,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-23 11:53:33,756 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 376 transitions. [2018-11-23 11:53:33,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-11-23 11:53:33,757 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:33,757 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:53:33,757 INFO L423 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:33,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:33,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1362303343, now seen corresponding path program 44 times [2018-11-23 11:53:33,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:33,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:33,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:33,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:53:33,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:33,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:34,715 INFO L256 TraceCheckUtils]: 0: Hoare triple {53449#true} call ULTIMATE.init(); {53449#true} is VALID [2018-11-23 11:53:34,715 INFO L273 TraceCheckUtils]: 1: Hoare triple {53449#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {53449#true} is VALID [2018-11-23 11:53:34,716 INFO L273 TraceCheckUtils]: 2: Hoare triple {53449#true} assume true; {53449#true} is VALID [2018-11-23 11:53:34,716 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {53449#true} {53449#true} #79#return; {53449#true} is VALID [2018-11-23 11:53:34,716 INFO L256 TraceCheckUtils]: 4: Hoare triple {53449#true} call #t~ret8 := main(); {53449#true} is VALID [2018-11-23 11:53:34,716 INFO L273 TraceCheckUtils]: 5: Hoare triple {53449#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {53449#true} is VALID [2018-11-23 11:53:34,717 INFO L273 TraceCheckUtils]: 6: Hoare triple {53449#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {53451#(= main_~i~0 1)} is VALID [2018-11-23 11:53:34,717 INFO L273 TraceCheckUtils]: 7: Hoare triple {53451#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53451#(= main_~i~0 1)} is VALID [2018-11-23 11:53:34,718 INFO L273 TraceCheckUtils]: 8: Hoare triple {53451#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53451#(= main_~i~0 1)} is VALID [2018-11-23 11:53:34,718 INFO L273 TraceCheckUtils]: 9: Hoare triple {53451#(= main_~i~0 1)} ~i~0 := 1 + ~i~0; {53452#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:34,718 INFO L273 TraceCheckUtils]: 10: Hoare triple {53452#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53452#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:34,719 INFO L273 TraceCheckUtils]: 11: Hoare triple {53452#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53452#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:34,719 INFO L273 TraceCheckUtils]: 12: Hoare triple {53452#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {53453#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:34,719 INFO L273 TraceCheckUtils]: 13: Hoare triple {53453#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53453#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:34,720 INFO L273 TraceCheckUtils]: 14: Hoare triple {53453#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53453#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:34,720 INFO L273 TraceCheckUtils]: 15: Hoare triple {53453#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {53454#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:34,720 INFO L273 TraceCheckUtils]: 16: Hoare triple {53454#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53454#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:34,721 INFO L273 TraceCheckUtils]: 17: Hoare triple {53454#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53454#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:34,721 INFO L273 TraceCheckUtils]: 18: Hoare triple {53454#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {53455#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:34,722 INFO L273 TraceCheckUtils]: 19: Hoare triple {53455#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53455#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:34,722 INFO L273 TraceCheckUtils]: 20: Hoare triple {53455#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53455#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:34,723 INFO L273 TraceCheckUtils]: 21: Hoare triple {53455#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {53456#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:34,723 INFO L273 TraceCheckUtils]: 22: Hoare triple {53456#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53456#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:34,724 INFO L273 TraceCheckUtils]: 23: Hoare triple {53456#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53456#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:34,725 INFO L273 TraceCheckUtils]: 24: Hoare triple {53456#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {53457#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:34,725 INFO L273 TraceCheckUtils]: 25: Hoare triple {53457#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53457#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:34,726 INFO L273 TraceCheckUtils]: 26: Hoare triple {53457#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53457#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:34,726 INFO L273 TraceCheckUtils]: 27: Hoare triple {53457#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {53458#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:34,727 INFO L273 TraceCheckUtils]: 28: Hoare triple {53458#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53458#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:34,727 INFO L273 TraceCheckUtils]: 29: Hoare triple {53458#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53458#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:34,728 INFO L273 TraceCheckUtils]: 30: Hoare triple {53458#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {53459#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:34,728 INFO L273 TraceCheckUtils]: 31: Hoare triple {53459#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53459#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:34,729 INFO L273 TraceCheckUtils]: 32: Hoare triple {53459#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53459#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:34,729 INFO L273 TraceCheckUtils]: 33: Hoare triple {53459#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {53460#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:34,730 INFO L273 TraceCheckUtils]: 34: Hoare triple {53460#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53460#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:34,730 INFO L273 TraceCheckUtils]: 35: Hoare triple {53460#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53460#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:34,731 INFO L273 TraceCheckUtils]: 36: Hoare triple {53460#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {53461#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:34,732 INFO L273 TraceCheckUtils]: 37: Hoare triple {53461#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53461#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:34,732 INFO L273 TraceCheckUtils]: 38: Hoare triple {53461#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53461#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:34,733 INFO L273 TraceCheckUtils]: 39: Hoare triple {53461#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {53462#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:34,733 INFO L273 TraceCheckUtils]: 40: Hoare triple {53462#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53462#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:34,734 INFO L273 TraceCheckUtils]: 41: Hoare triple {53462#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53462#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:34,734 INFO L273 TraceCheckUtils]: 42: Hoare triple {53462#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {53463#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:34,735 INFO L273 TraceCheckUtils]: 43: Hoare triple {53463#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53463#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:34,735 INFO L273 TraceCheckUtils]: 44: Hoare triple {53463#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53463#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:34,736 INFO L273 TraceCheckUtils]: 45: Hoare triple {53463#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {53464#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:34,736 INFO L273 TraceCheckUtils]: 46: Hoare triple {53464#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53464#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:34,737 INFO L273 TraceCheckUtils]: 47: Hoare triple {53464#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53464#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:34,738 INFO L273 TraceCheckUtils]: 48: Hoare triple {53464#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {53465#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:34,738 INFO L273 TraceCheckUtils]: 49: Hoare triple {53465#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53465#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:34,738 INFO L273 TraceCheckUtils]: 50: Hoare triple {53465#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53465#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:34,739 INFO L273 TraceCheckUtils]: 51: Hoare triple {53465#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {53466#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:34,740 INFO L273 TraceCheckUtils]: 52: Hoare triple {53466#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53466#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:34,740 INFO L273 TraceCheckUtils]: 53: Hoare triple {53466#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53466#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:34,741 INFO L273 TraceCheckUtils]: 54: Hoare triple {53466#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {53467#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:34,741 INFO L273 TraceCheckUtils]: 55: Hoare triple {53467#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53467#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:34,742 INFO L273 TraceCheckUtils]: 56: Hoare triple {53467#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53467#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:34,742 INFO L273 TraceCheckUtils]: 57: Hoare triple {53467#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {53468#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:34,743 INFO L273 TraceCheckUtils]: 58: Hoare triple {53468#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53468#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:34,743 INFO L273 TraceCheckUtils]: 59: Hoare triple {53468#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53468#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:34,744 INFO L273 TraceCheckUtils]: 60: Hoare triple {53468#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {53469#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:34,745 INFO L273 TraceCheckUtils]: 61: Hoare triple {53469#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53469#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:34,745 INFO L273 TraceCheckUtils]: 62: Hoare triple {53469#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53469#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:34,746 INFO L273 TraceCheckUtils]: 63: Hoare triple {53469#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {53470#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:34,746 INFO L273 TraceCheckUtils]: 64: Hoare triple {53470#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53470#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:34,747 INFO L273 TraceCheckUtils]: 65: Hoare triple {53470#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53470#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:34,747 INFO L273 TraceCheckUtils]: 66: Hoare triple {53470#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {53471#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:34,748 INFO L273 TraceCheckUtils]: 67: Hoare triple {53471#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53471#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:34,748 INFO L273 TraceCheckUtils]: 68: Hoare triple {53471#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53471#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:34,749 INFO L273 TraceCheckUtils]: 69: Hoare triple {53471#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {53472#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:34,749 INFO L273 TraceCheckUtils]: 70: Hoare triple {53472#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53472#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:34,750 INFO L273 TraceCheckUtils]: 71: Hoare triple {53472#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53472#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:34,751 INFO L273 TraceCheckUtils]: 72: Hoare triple {53472#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {53473#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:34,751 INFO L273 TraceCheckUtils]: 73: Hoare triple {53473#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53473#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:34,751 INFO L273 TraceCheckUtils]: 74: Hoare triple {53473#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53473#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:34,752 INFO L273 TraceCheckUtils]: 75: Hoare triple {53473#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {53474#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:34,753 INFO L273 TraceCheckUtils]: 76: Hoare triple {53474#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53474#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:34,753 INFO L273 TraceCheckUtils]: 77: Hoare triple {53474#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53474#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:34,754 INFO L273 TraceCheckUtils]: 78: Hoare triple {53474#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {53475#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:34,754 INFO L273 TraceCheckUtils]: 79: Hoare triple {53475#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53475#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:34,755 INFO L273 TraceCheckUtils]: 80: Hoare triple {53475#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53475#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:34,755 INFO L273 TraceCheckUtils]: 81: Hoare triple {53475#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {53476#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:34,756 INFO L273 TraceCheckUtils]: 82: Hoare triple {53476#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53476#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:34,756 INFO L273 TraceCheckUtils]: 83: Hoare triple {53476#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53476#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:34,757 INFO L273 TraceCheckUtils]: 84: Hoare triple {53476#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {53477#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:34,757 INFO L273 TraceCheckUtils]: 85: Hoare triple {53477#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53477#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:34,758 INFO L273 TraceCheckUtils]: 86: Hoare triple {53477#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53477#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:34,759 INFO L273 TraceCheckUtils]: 87: Hoare triple {53477#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {53478#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:34,759 INFO L273 TraceCheckUtils]: 88: Hoare triple {53478#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53478#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:34,760 INFO L273 TraceCheckUtils]: 89: Hoare triple {53478#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53478#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:34,760 INFO L273 TraceCheckUtils]: 90: Hoare triple {53478#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {53479#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:34,761 INFO L273 TraceCheckUtils]: 91: Hoare triple {53479#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53479#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:34,761 INFO L273 TraceCheckUtils]: 92: Hoare triple {53479#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53479#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:34,762 INFO L273 TraceCheckUtils]: 93: Hoare triple {53479#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {53480#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:34,762 INFO L273 TraceCheckUtils]: 94: Hoare triple {53480#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53480#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:34,763 INFO L273 TraceCheckUtils]: 95: Hoare triple {53480#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53480#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:34,763 INFO L273 TraceCheckUtils]: 96: Hoare triple {53480#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {53481#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:34,764 INFO L273 TraceCheckUtils]: 97: Hoare triple {53481#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53481#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:34,764 INFO L273 TraceCheckUtils]: 98: Hoare triple {53481#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53481#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:34,765 INFO L273 TraceCheckUtils]: 99: Hoare triple {53481#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {53482#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:34,766 INFO L273 TraceCheckUtils]: 100: Hoare triple {53482#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53482#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:34,766 INFO L273 TraceCheckUtils]: 101: Hoare triple {53482#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53482#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:34,767 INFO L273 TraceCheckUtils]: 102: Hoare triple {53482#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {53483#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:34,767 INFO L273 TraceCheckUtils]: 103: Hoare triple {53483#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53483#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:34,768 INFO L273 TraceCheckUtils]: 104: Hoare triple {53483#(<= main_~i~0 33)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53483#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:34,768 INFO L273 TraceCheckUtils]: 105: Hoare triple {53483#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {53484#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:34,769 INFO L273 TraceCheckUtils]: 106: Hoare triple {53484#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53484#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:34,769 INFO L273 TraceCheckUtils]: 107: Hoare triple {53484#(<= main_~i~0 34)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53484#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:34,770 INFO L273 TraceCheckUtils]: 108: Hoare triple {53484#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {53485#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:34,770 INFO L273 TraceCheckUtils]: 109: Hoare triple {53485#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53485#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:34,771 INFO L273 TraceCheckUtils]: 110: Hoare triple {53485#(<= main_~i~0 35)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53485#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:34,772 INFO L273 TraceCheckUtils]: 111: Hoare triple {53485#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {53486#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:34,772 INFO L273 TraceCheckUtils]: 112: Hoare triple {53486#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53486#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:34,772 INFO L273 TraceCheckUtils]: 113: Hoare triple {53486#(<= main_~i~0 36)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53486#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:34,773 INFO L273 TraceCheckUtils]: 114: Hoare triple {53486#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {53487#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:34,774 INFO L273 TraceCheckUtils]: 115: Hoare triple {53487#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53487#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:34,774 INFO L273 TraceCheckUtils]: 116: Hoare triple {53487#(<= main_~i~0 37)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53487#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:34,775 INFO L273 TraceCheckUtils]: 117: Hoare triple {53487#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {53488#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:34,775 INFO L273 TraceCheckUtils]: 118: Hoare triple {53488#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53488#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:34,776 INFO L273 TraceCheckUtils]: 119: Hoare triple {53488#(<= main_~i~0 38)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53488#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:34,776 INFO L273 TraceCheckUtils]: 120: Hoare triple {53488#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {53489#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:34,777 INFO L273 TraceCheckUtils]: 121: Hoare triple {53489#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53489#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:34,777 INFO L273 TraceCheckUtils]: 122: Hoare triple {53489#(<= main_~i~0 39)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53489#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:34,778 INFO L273 TraceCheckUtils]: 123: Hoare triple {53489#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {53490#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:34,778 INFO L273 TraceCheckUtils]: 124: Hoare triple {53490#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53490#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:34,779 INFO L273 TraceCheckUtils]: 125: Hoare triple {53490#(<= main_~i~0 40)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53490#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:34,780 INFO L273 TraceCheckUtils]: 126: Hoare triple {53490#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {53491#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:34,780 INFO L273 TraceCheckUtils]: 127: Hoare triple {53491#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53491#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:34,781 INFO L273 TraceCheckUtils]: 128: Hoare triple {53491#(<= main_~i~0 41)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53491#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:34,781 INFO L273 TraceCheckUtils]: 129: Hoare triple {53491#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {53492#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:34,782 INFO L273 TraceCheckUtils]: 130: Hoare triple {53492#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53492#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:34,782 INFO L273 TraceCheckUtils]: 131: Hoare triple {53492#(<= main_~i~0 42)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53492#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:34,783 INFO L273 TraceCheckUtils]: 132: Hoare triple {53492#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {53493#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:34,783 INFO L273 TraceCheckUtils]: 133: Hoare triple {53493#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53493#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:34,784 INFO L273 TraceCheckUtils]: 134: Hoare triple {53493#(<= main_~i~0 43)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53493#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:34,784 INFO L273 TraceCheckUtils]: 135: Hoare triple {53493#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {53494#(<= main_~i~0 44)} is VALID [2018-11-23 11:53:34,785 INFO L273 TraceCheckUtils]: 136: Hoare triple {53494#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53494#(<= main_~i~0 44)} is VALID [2018-11-23 11:53:34,785 INFO L273 TraceCheckUtils]: 137: Hoare triple {53494#(<= main_~i~0 44)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53494#(<= main_~i~0 44)} is VALID [2018-11-23 11:53:34,786 INFO L273 TraceCheckUtils]: 138: Hoare triple {53494#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {53495#(<= main_~i~0 45)} is VALID [2018-11-23 11:53:34,787 INFO L273 TraceCheckUtils]: 139: Hoare triple {53495#(<= main_~i~0 45)} assume !(~i~0 < 100000); {53450#false} is VALID [2018-11-23 11:53:34,787 INFO L273 TraceCheckUtils]: 140: Hoare triple {53450#false} assume !(0 != ~swapped~0); {53450#false} is VALID [2018-11-23 11:53:34,787 INFO L273 TraceCheckUtils]: 141: Hoare triple {53450#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {53450#false} is VALID [2018-11-23 11:53:34,787 INFO L273 TraceCheckUtils]: 142: Hoare triple {53450#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {53450#false} is VALID [2018-11-23 11:53:34,787 INFO L273 TraceCheckUtils]: 143: Hoare triple {53450#false} assume !!(~y~0 < 100000);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); {53450#false} is VALID [2018-11-23 11:53:34,788 INFO L256 TraceCheckUtils]: 144: Hoare triple {53450#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {53450#false} is VALID [2018-11-23 11:53:34,788 INFO L273 TraceCheckUtils]: 145: Hoare triple {53450#false} ~cond := #in~cond; {53450#false} is VALID [2018-11-23 11:53:34,788 INFO L273 TraceCheckUtils]: 146: Hoare triple {53450#false} assume 0 == ~cond; {53450#false} is VALID [2018-11-23 11:53:34,788 INFO L273 TraceCheckUtils]: 147: Hoare triple {53450#false} assume !false; {53450#false} is VALID [2018-11-23 11:53:34,802 INFO L134 CoverageAnalysis]: Checked inductivity of 2883 backedges. 1 proven. 2882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:53:34,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:34,802 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:53:34,811 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:53:34,876 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:53:34,877 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:34,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:34,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:35,405 INFO L256 TraceCheckUtils]: 0: Hoare triple {53449#true} call ULTIMATE.init(); {53449#true} is VALID [2018-11-23 11:53:35,405 INFO L273 TraceCheckUtils]: 1: Hoare triple {53449#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {53449#true} is VALID [2018-11-23 11:53:35,405 INFO L273 TraceCheckUtils]: 2: Hoare triple {53449#true} assume true; {53449#true} is VALID [2018-11-23 11:53:35,405 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {53449#true} {53449#true} #79#return; {53449#true} is VALID [2018-11-23 11:53:35,405 INFO L256 TraceCheckUtils]: 4: Hoare triple {53449#true} call #t~ret8 := main(); {53449#true} is VALID [2018-11-23 11:53:35,405 INFO L273 TraceCheckUtils]: 5: Hoare triple {53449#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {53449#true} is VALID [2018-11-23 11:53:35,406 INFO L273 TraceCheckUtils]: 6: Hoare triple {53449#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {53517#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:35,408 INFO L273 TraceCheckUtils]: 7: Hoare triple {53517#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53517#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:35,408 INFO L273 TraceCheckUtils]: 8: Hoare triple {53517#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53517#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:35,408 INFO L273 TraceCheckUtils]: 9: Hoare triple {53517#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {53452#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:35,409 INFO L273 TraceCheckUtils]: 10: Hoare triple {53452#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53452#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:35,411 INFO L273 TraceCheckUtils]: 11: Hoare triple {53452#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53452#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:35,411 INFO L273 TraceCheckUtils]: 12: Hoare triple {53452#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {53453#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:35,413 INFO L273 TraceCheckUtils]: 13: Hoare triple {53453#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53453#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:35,413 INFO L273 TraceCheckUtils]: 14: Hoare triple {53453#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53453#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:35,413 INFO L273 TraceCheckUtils]: 15: Hoare triple {53453#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {53454#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:35,414 INFO L273 TraceCheckUtils]: 16: Hoare triple {53454#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53454#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:35,414 INFO L273 TraceCheckUtils]: 17: Hoare triple {53454#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53454#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:35,414 INFO L273 TraceCheckUtils]: 18: Hoare triple {53454#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {53455#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:35,416 INFO L273 TraceCheckUtils]: 19: Hoare triple {53455#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53455#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:35,416 INFO L273 TraceCheckUtils]: 20: Hoare triple {53455#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53455#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:35,419 INFO L273 TraceCheckUtils]: 21: Hoare triple {53455#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {53456#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:35,419 INFO L273 TraceCheckUtils]: 22: Hoare triple {53456#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53456#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:35,421 INFO L273 TraceCheckUtils]: 23: Hoare triple {53456#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53456#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:35,421 INFO L273 TraceCheckUtils]: 24: Hoare triple {53456#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {53457#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:35,424 INFO L273 TraceCheckUtils]: 25: Hoare triple {53457#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53457#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:35,424 INFO L273 TraceCheckUtils]: 26: Hoare triple {53457#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53457#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:35,426 INFO L273 TraceCheckUtils]: 27: Hoare triple {53457#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {53458#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:35,426 INFO L273 TraceCheckUtils]: 28: Hoare triple {53458#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53458#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:35,429 INFO L273 TraceCheckUtils]: 29: Hoare triple {53458#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53458#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:35,429 INFO L273 TraceCheckUtils]: 30: Hoare triple {53458#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {53459#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:35,432 INFO L273 TraceCheckUtils]: 31: Hoare triple {53459#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53459#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:35,432 INFO L273 TraceCheckUtils]: 32: Hoare triple {53459#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53459#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:35,435 INFO L273 TraceCheckUtils]: 33: Hoare triple {53459#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {53460#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:35,435 INFO L273 TraceCheckUtils]: 34: Hoare triple {53460#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53460#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:35,437 INFO L273 TraceCheckUtils]: 35: Hoare triple {53460#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53460#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:35,437 INFO L273 TraceCheckUtils]: 36: Hoare triple {53460#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {53461#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:35,440 INFO L273 TraceCheckUtils]: 37: Hoare triple {53461#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53461#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:35,440 INFO L273 TraceCheckUtils]: 38: Hoare triple {53461#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53461#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:35,442 INFO L273 TraceCheckUtils]: 39: Hoare triple {53461#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {53462#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:35,442 INFO L273 TraceCheckUtils]: 40: Hoare triple {53462#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53462#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:35,444 INFO L273 TraceCheckUtils]: 41: Hoare triple {53462#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53462#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:35,444 INFO L273 TraceCheckUtils]: 42: Hoare triple {53462#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {53463#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:35,444 INFO L273 TraceCheckUtils]: 43: Hoare triple {53463#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53463#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:35,445 INFO L273 TraceCheckUtils]: 44: Hoare triple {53463#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53463#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:35,446 INFO L273 TraceCheckUtils]: 45: Hoare triple {53463#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {53464#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:35,446 INFO L273 TraceCheckUtils]: 46: Hoare triple {53464#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53464#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:35,446 INFO L273 TraceCheckUtils]: 47: Hoare triple {53464#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53464#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:35,447 INFO L273 TraceCheckUtils]: 48: Hoare triple {53464#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {53465#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:35,449 INFO L273 TraceCheckUtils]: 49: Hoare triple {53465#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53465#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:35,449 INFO L273 TraceCheckUtils]: 50: Hoare triple {53465#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53465#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:35,452 INFO L273 TraceCheckUtils]: 51: Hoare triple {53465#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {53466#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:35,452 INFO L273 TraceCheckUtils]: 52: Hoare triple {53466#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53466#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:35,452 INFO L273 TraceCheckUtils]: 53: Hoare triple {53466#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53466#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:35,453 INFO L273 TraceCheckUtils]: 54: Hoare triple {53466#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {53467#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:35,453 INFO L273 TraceCheckUtils]: 55: Hoare triple {53467#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53467#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:35,453 INFO L273 TraceCheckUtils]: 56: Hoare triple {53467#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53467#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:35,454 INFO L273 TraceCheckUtils]: 57: Hoare triple {53467#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {53468#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:35,454 INFO L273 TraceCheckUtils]: 58: Hoare triple {53468#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53468#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:35,459 INFO L273 TraceCheckUtils]: 59: Hoare triple {53468#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53468#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:35,459 INFO L273 TraceCheckUtils]: 60: Hoare triple {53468#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {53469#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:35,459 INFO L273 TraceCheckUtils]: 61: Hoare triple {53469#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53469#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:35,460 INFO L273 TraceCheckUtils]: 62: Hoare triple {53469#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53469#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:35,460 INFO L273 TraceCheckUtils]: 63: Hoare triple {53469#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {53470#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:35,460 INFO L273 TraceCheckUtils]: 64: Hoare triple {53470#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53470#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:35,461 INFO L273 TraceCheckUtils]: 65: Hoare triple {53470#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53470#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:35,461 INFO L273 TraceCheckUtils]: 66: Hoare triple {53470#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {53471#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:35,461 INFO L273 TraceCheckUtils]: 67: Hoare triple {53471#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53471#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:35,465 INFO L273 TraceCheckUtils]: 68: Hoare triple {53471#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53471#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:35,465 INFO L273 TraceCheckUtils]: 69: Hoare triple {53471#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {53472#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:35,466 INFO L273 TraceCheckUtils]: 70: Hoare triple {53472#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53472#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:35,466 INFO L273 TraceCheckUtils]: 71: Hoare triple {53472#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53472#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:35,466 INFO L273 TraceCheckUtils]: 72: Hoare triple {53472#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {53473#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:35,467 INFO L273 TraceCheckUtils]: 73: Hoare triple {53473#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53473#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:35,467 INFO L273 TraceCheckUtils]: 74: Hoare triple {53473#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53473#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:35,467 INFO L273 TraceCheckUtils]: 75: Hoare triple {53473#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {53474#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:35,468 INFO L273 TraceCheckUtils]: 76: Hoare triple {53474#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53474#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:35,468 INFO L273 TraceCheckUtils]: 77: Hoare triple {53474#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53474#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:35,468 INFO L273 TraceCheckUtils]: 78: Hoare triple {53474#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {53475#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:35,469 INFO L273 TraceCheckUtils]: 79: Hoare triple {53475#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53475#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:35,469 INFO L273 TraceCheckUtils]: 80: Hoare triple {53475#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53475#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:35,469 INFO L273 TraceCheckUtils]: 81: Hoare triple {53475#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {53476#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:35,470 INFO L273 TraceCheckUtils]: 82: Hoare triple {53476#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53476#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:35,470 INFO L273 TraceCheckUtils]: 83: Hoare triple {53476#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53476#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:35,471 INFO L273 TraceCheckUtils]: 84: Hoare triple {53476#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {53477#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:35,472 INFO L273 TraceCheckUtils]: 85: Hoare triple {53477#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53477#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:35,472 INFO L273 TraceCheckUtils]: 86: Hoare triple {53477#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53477#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:35,473 INFO L273 TraceCheckUtils]: 87: Hoare triple {53477#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {53478#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:35,473 INFO L273 TraceCheckUtils]: 88: Hoare triple {53478#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53478#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:35,474 INFO L273 TraceCheckUtils]: 89: Hoare triple {53478#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53478#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:35,474 INFO L273 TraceCheckUtils]: 90: Hoare triple {53478#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {53479#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:35,475 INFO L273 TraceCheckUtils]: 91: Hoare triple {53479#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53479#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:35,475 INFO L273 TraceCheckUtils]: 92: Hoare triple {53479#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53479#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:35,476 INFO L273 TraceCheckUtils]: 93: Hoare triple {53479#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {53480#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:35,476 INFO L273 TraceCheckUtils]: 94: Hoare triple {53480#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53480#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:35,477 INFO L273 TraceCheckUtils]: 95: Hoare triple {53480#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53480#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:35,477 INFO L273 TraceCheckUtils]: 96: Hoare triple {53480#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {53481#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:35,478 INFO L273 TraceCheckUtils]: 97: Hoare triple {53481#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53481#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:35,478 INFO L273 TraceCheckUtils]: 98: Hoare triple {53481#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53481#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:35,479 INFO L273 TraceCheckUtils]: 99: Hoare triple {53481#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {53482#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:35,480 INFO L273 TraceCheckUtils]: 100: Hoare triple {53482#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53482#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:35,480 INFO L273 TraceCheckUtils]: 101: Hoare triple {53482#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53482#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:35,481 INFO L273 TraceCheckUtils]: 102: Hoare triple {53482#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {53483#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:35,481 INFO L273 TraceCheckUtils]: 103: Hoare triple {53483#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53483#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:35,482 INFO L273 TraceCheckUtils]: 104: Hoare triple {53483#(<= main_~i~0 33)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53483#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:35,482 INFO L273 TraceCheckUtils]: 105: Hoare triple {53483#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {53484#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:35,483 INFO L273 TraceCheckUtils]: 106: Hoare triple {53484#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53484#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:35,483 INFO L273 TraceCheckUtils]: 107: Hoare triple {53484#(<= main_~i~0 34)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53484#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:35,484 INFO L273 TraceCheckUtils]: 108: Hoare triple {53484#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {53485#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:35,484 INFO L273 TraceCheckUtils]: 109: Hoare triple {53485#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53485#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:35,485 INFO L273 TraceCheckUtils]: 110: Hoare triple {53485#(<= main_~i~0 35)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53485#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:35,486 INFO L273 TraceCheckUtils]: 111: Hoare triple {53485#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {53486#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:35,486 INFO L273 TraceCheckUtils]: 112: Hoare triple {53486#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53486#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:35,486 INFO L273 TraceCheckUtils]: 113: Hoare triple {53486#(<= main_~i~0 36)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53486#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:35,487 INFO L273 TraceCheckUtils]: 114: Hoare triple {53486#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {53487#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:35,488 INFO L273 TraceCheckUtils]: 115: Hoare triple {53487#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53487#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:35,488 INFO L273 TraceCheckUtils]: 116: Hoare triple {53487#(<= main_~i~0 37)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53487#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:35,489 INFO L273 TraceCheckUtils]: 117: Hoare triple {53487#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {53488#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:35,489 INFO L273 TraceCheckUtils]: 118: Hoare triple {53488#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53488#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:35,490 INFO L273 TraceCheckUtils]: 119: Hoare triple {53488#(<= main_~i~0 38)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53488#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:35,490 INFO L273 TraceCheckUtils]: 120: Hoare triple {53488#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {53489#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:35,491 INFO L273 TraceCheckUtils]: 121: Hoare triple {53489#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53489#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:35,491 INFO L273 TraceCheckUtils]: 122: Hoare triple {53489#(<= main_~i~0 39)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53489#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:35,492 INFO L273 TraceCheckUtils]: 123: Hoare triple {53489#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {53490#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:35,492 INFO L273 TraceCheckUtils]: 124: Hoare triple {53490#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53490#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:35,493 INFO L273 TraceCheckUtils]: 125: Hoare triple {53490#(<= main_~i~0 40)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53490#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:35,494 INFO L273 TraceCheckUtils]: 126: Hoare triple {53490#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {53491#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:35,494 INFO L273 TraceCheckUtils]: 127: Hoare triple {53491#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53491#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:35,495 INFO L273 TraceCheckUtils]: 128: Hoare triple {53491#(<= main_~i~0 41)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53491#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:35,495 INFO L273 TraceCheckUtils]: 129: Hoare triple {53491#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {53492#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:35,496 INFO L273 TraceCheckUtils]: 130: Hoare triple {53492#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53492#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:35,496 INFO L273 TraceCheckUtils]: 131: Hoare triple {53492#(<= main_~i~0 42)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53492#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:35,497 INFO L273 TraceCheckUtils]: 132: Hoare triple {53492#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {53493#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:35,497 INFO L273 TraceCheckUtils]: 133: Hoare triple {53493#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53493#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:35,498 INFO L273 TraceCheckUtils]: 134: Hoare triple {53493#(<= main_~i~0 43)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53493#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:35,498 INFO L273 TraceCheckUtils]: 135: Hoare triple {53493#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {53494#(<= main_~i~0 44)} is VALID [2018-11-23 11:53:35,499 INFO L273 TraceCheckUtils]: 136: Hoare triple {53494#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {53494#(<= main_~i~0 44)} is VALID [2018-11-23 11:53:35,499 INFO L273 TraceCheckUtils]: 137: Hoare triple {53494#(<= main_~i~0 44)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {53494#(<= main_~i~0 44)} is VALID [2018-11-23 11:53:35,500 INFO L273 TraceCheckUtils]: 138: Hoare triple {53494#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {53495#(<= main_~i~0 45)} is VALID [2018-11-23 11:53:35,501 INFO L273 TraceCheckUtils]: 139: Hoare triple {53495#(<= main_~i~0 45)} assume !(~i~0 < 100000); {53450#false} is VALID [2018-11-23 11:53:35,501 INFO L273 TraceCheckUtils]: 140: Hoare triple {53450#false} assume !(0 != ~swapped~0); {53450#false} is VALID [2018-11-23 11:53:35,501 INFO L273 TraceCheckUtils]: 141: Hoare triple {53450#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {53450#false} is VALID [2018-11-23 11:53:35,501 INFO L273 TraceCheckUtils]: 142: Hoare triple {53450#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {53450#false} is VALID [2018-11-23 11:53:35,501 INFO L273 TraceCheckUtils]: 143: Hoare triple {53450#false} assume !!(~y~0 < 100000);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); {53450#false} is VALID [2018-11-23 11:53:35,502 INFO L256 TraceCheckUtils]: 144: Hoare triple {53450#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {53450#false} is VALID [2018-11-23 11:53:35,502 INFO L273 TraceCheckUtils]: 145: Hoare triple {53450#false} ~cond := #in~cond; {53450#false} is VALID [2018-11-23 11:53:35,502 INFO L273 TraceCheckUtils]: 146: Hoare triple {53450#false} assume 0 == ~cond; {53450#false} is VALID [2018-11-23 11:53:35,502 INFO L273 TraceCheckUtils]: 147: Hoare triple {53450#false} assume !false; {53450#false} is VALID [2018-11-23 11:53:35,516 INFO L134 CoverageAnalysis]: Checked inductivity of 2883 backedges. 1 proven. 2882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:53:35,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:35,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 48 [2018-11-23 11:53:35,535 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 148 [2018-11-23 11:53:35,536 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:35,536 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 11:53:35,673 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:35,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 11:53:35,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 11:53:35,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 11:53:35,674 INFO L87 Difference]: Start difference. First operand 285 states and 376 transitions. Second operand 48 states. [2018-11-23 11:53:36,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:36,881 INFO L93 Difference]: Finished difference Result 574 states and 762 transitions. [2018-11-23 11:53:36,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-23 11:53:36,881 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 148 [2018-11-23 11:53:36,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:36,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 11:53:36,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 229 transitions. [2018-11-23 11:53:36,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 11:53:36,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 229 transitions. [2018-11-23 11:53:36,884 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states and 229 transitions. [2018-11-23 11:53:37,108 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 229 edges. 229 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:37,115 INFO L225 Difference]: With dead ends: 574 [2018-11-23 11:53:37,115 INFO L226 Difference]: Without dead ends: 295 [2018-11-23 11:53:37,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 11:53:37,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-11-23 11:53:37,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 291. [2018-11-23 11:53:37,235 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:37,235 INFO L82 GeneralOperation]: Start isEquivalent. First operand 295 states. Second operand 291 states. [2018-11-23 11:53:37,235 INFO L74 IsIncluded]: Start isIncluded. First operand 295 states. Second operand 291 states. [2018-11-23 11:53:37,235 INFO L87 Difference]: Start difference. First operand 295 states. Second operand 291 states. [2018-11-23 11:53:37,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:37,240 INFO L93 Difference]: Finished difference Result 295 states and 390 transitions. [2018-11-23 11:53:37,241 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 390 transitions. [2018-11-23 11:53:37,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:37,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:37,241 INFO L74 IsIncluded]: Start isIncluded. First operand 291 states. Second operand 295 states. [2018-11-23 11:53:37,241 INFO L87 Difference]: Start difference. First operand 291 states. Second operand 295 states. [2018-11-23 11:53:37,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:37,246 INFO L93 Difference]: Finished difference Result 295 states and 390 transitions. [2018-11-23 11:53:37,246 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 390 transitions. [2018-11-23 11:53:37,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:37,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:37,246 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:37,246 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:37,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-11-23 11:53:37,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 384 transitions. [2018-11-23 11:53:37,251 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 384 transitions. Word has length 148 [2018-11-23 11:53:37,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:37,251 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 384 transitions. [2018-11-23 11:53:37,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 11:53:37,251 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 384 transitions. [2018-11-23 11:53:37,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-23 11:53:37,252 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:37,252 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:53:37,252 INFO L423 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:37,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:37,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1774715720, now seen corresponding path program 45 times [2018-11-23 11:53:37,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:37,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:37,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:37,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:37,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:37,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:38,276 INFO L256 TraceCheckUtils]: 0: Hoare triple {55692#true} call ULTIMATE.init(); {55692#true} is VALID [2018-11-23 11:53:38,277 INFO L273 TraceCheckUtils]: 1: Hoare triple {55692#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {55692#true} is VALID [2018-11-23 11:53:38,277 INFO L273 TraceCheckUtils]: 2: Hoare triple {55692#true} assume true; {55692#true} is VALID [2018-11-23 11:53:38,277 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {55692#true} {55692#true} #79#return; {55692#true} is VALID [2018-11-23 11:53:38,277 INFO L256 TraceCheckUtils]: 4: Hoare triple {55692#true} call #t~ret8 := main(); {55692#true} is VALID [2018-11-23 11:53:38,277 INFO L273 TraceCheckUtils]: 5: Hoare triple {55692#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {55692#true} is VALID [2018-11-23 11:53:38,277 INFO L273 TraceCheckUtils]: 6: Hoare triple {55692#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {55694#(= main_~i~0 1)} is VALID [2018-11-23 11:53:38,278 INFO L273 TraceCheckUtils]: 7: Hoare triple {55694#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55694#(= main_~i~0 1)} is VALID [2018-11-23 11:53:38,278 INFO L273 TraceCheckUtils]: 8: Hoare triple {55694#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55694#(= main_~i~0 1)} is VALID [2018-11-23 11:53:38,279 INFO L273 TraceCheckUtils]: 9: Hoare triple {55694#(= main_~i~0 1)} ~i~0 := 1 + ~i~0; {55695#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:38,279 INFO L273 TraceCheckUtils]: 10: Hoare triple {55695#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55695#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:38,279 INFO L273 TraceCheckUtils]: 11: Hoare triple {55695#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55695#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:38,280 INFO L273 TraceCheckUtils]: 12: Hoare triple {55695#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {55696#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:38,280 INFO L273 TraceCheckUtils]: 13: Hoare triple {55696#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55696#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:38,280 INFO L273 TraceCheckUtils]: 14: Hoare triple {55696#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55696#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:38,281 INFO L273 TraceCheckUtils]: 15: Hoare triple {55696#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {55697#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:38,281 INFO L273 TraceCheckUtils]: 16: Hoare triple {55697#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55697#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:38,282 INFO L273 TraceCheckUtils]: 17: Hoare triple {55697#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55697#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:38,282 INFO L273 TraceCheckUtils]: 18: Hoare triple {55697#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {55698#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:38,283 INFO L273 TraceCheckUtils]: 19: Hoare triple {55698#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55698#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:38,283 INFO L273 TraceCheckUtils]: 20: Hoare triple {55698#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55698#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:38,284 INFO L273 TraceCheckUtils]: 21: Hoare triple {55698#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {55699#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:38,284 INFO L273 TraceCheckUtils]: 22: Hoare triple {55699#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55699#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:38,285 INFO L273 TraceCheckUtils]: 23: Hoare triple {55699#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55699#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:38,286 INFO L273 TraceCheckUtils]: 24: Hoare triple {55699#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {55700#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:38,286 INFO L273 TraceCheckUtils]: 25: Hoare triple {55700#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55700#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:38,287 INFO L273 TraceCheckUtils]: 26: Hoare triple {55700#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55700#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:38,287 INFO L273 TraceCheckUtils]: 27: Hoare triple {55700#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {55701#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:38,288 INFO L273 TraceCheckUtils]: 28: Hoare triple {55701#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55701#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:38,288 INFO L273 TraceCheckUtils]: 29: Hoare triple {55701#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55701#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:38,289 INFO L273 TraceCheckUtils]: 30: Hoare triple {55701#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {55702#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:38,290 INFO L273 TraceCheckUtils]: 31: Hoare triple {55702#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55702#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:38,290 INFO L273 TraceCheckUtils]: 32: Hoare triple {55702#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55702#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:38,291 INFO L273 TraceCheckUtils]: 33: Hoare triple {55702#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {55703#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:38,291 INFO L273 TraceCheckUtils]: 34: Hoare triple {55703#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55703#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:38,292 INFO L273 TraceCheckUtils]: 35: Hoare triple {55703#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55703#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:38,292 INFO L273 TraceCheckUtils]: 36: Hoare triple {55703#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {55704#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:38,293 INFO L273 TraceCheckUtils]: 37: Hoare triple {55704#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55704#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:38,293 INFO L273 TraceCheckUtils]: 38: Hoare triple {55704#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55704#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:38,294 INFO L273 TraceCheckUtils]: 39: Hoare triple {55704#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {55705#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:38,295 INFO L273 TraceCheckUtils]: 40: Hoare triple {55705#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55705#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:38,295 INFO L273 TraceCheckUtils]: 41: Hoare triple {55705#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55705#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:38,296 INFO L273 TraceCheckUtils]: 42: Hoare triple {55705#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {55706#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:38,296 INFO L273 TraceCheckUtils]: 43: Hoare triple {55706#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55706#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:38,297 INFO L273 TraceCheckUtils]: 44: Hoare triple {55706#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55706#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:38,297 INFO L273 TraceCheckUtils]: 45: Hoare triple {55706#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {55707#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:38,298 INFO L273 TraceCheckUtils]: 46: Hoare triple {55707#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55707#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:38,298 INFO L273 TraceCheckUtils]: 47: Hoare triple {55707#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55707#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:38,299 INFO L273 TraceCheckUtils]: 48: Hoare triple {55707#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {55708#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:38,300 INFO L273 TraceCheckUtils]: 49: Hoare triple {55708#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55708#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:38,300 INFO L273 TraceCheckUtils]: 50: Hoare triple {55708#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55708#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:38,301 INFO L273 TraceCheckUtils]: 51: Hoare triple {55708#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {55709#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:38,301 INFO L273 TraceCheckUtils]: 52: Hoare triple {55709#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55709#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:38,302 INFO L273 TraceCheckUtils]: 53: Hoare triple {55709#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55709#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:38,302 INFO L273 TraceCheckUtils]: 54: Hoare triple {55709#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {55710#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:38,303 INFO L273 TraceCheckUtils]: 55: Hoare triple {55710#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55710#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:38,303 INFO L273 TraceCheckUtils]: 56: Hoare triple {55710#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55710#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:38,304 INFO L273 TraceCheckUtils]: 57: Hoare triple {55710#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {55711#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:38,305 INFO L273 TraceCheckUtils]: 58: Hoare triple {55711#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55711#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:38,305 INFO L273 TraceCheckUtils]: 59: Hoare triple {55711#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55711#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:38,306 INFO L273 TraceCheckUtils]: 60: Hoare triple {55711#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {55712#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:38,306 INFO L273 TraceCheckUtils]: 61: Hoare triple {55712#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55712#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:38,307 INFO L273 TraceCheckUtils]: 62: Hoare triple {55712#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55712#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:38,307 INFO L273 TraceCheckUtils]: 63: Hoare triple {55712#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {55713#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:38,308 INFO L273 TraceCheckUtils]: 64: Hoare triple {55713#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55713#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:38,308 INFO L273 TraceCheckUtils]: 65: Hoare triple {55713#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55713#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:38,309 INFO L273 TraceCheckUtils]: 66: Hoare triple {55713#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {55714#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:38,309 INFO L273 TraceCheckUtils]: 67: Hoare triple {55714#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55714#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:38,310 INFO L273 TraceCheckUtils]: 68: Hoare triple {55714#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55714#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:38,311 INFO L273 TraceCheckUtils]: 69: Hoare triple {55714#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {55715#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:38,311 INFO L273 TraceCheckUtils]: 70: Hoare triple {55715#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55715#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:38,312 INFO L273 TraceCheckUtils]: 71: Hoare triple {55715#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55715#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:38,312 INFO L273 TraceCheckUtils]: 72: Hoare triple {55715#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {55716#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:38,313 INFO L273 TraceCheckUtils]: 73: Hoare triple {55716#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55716#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:38,313 INFO L273 TraceCheckUtils]: 74: Hoare triple {55716#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55716#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:38,314 INFO L273 TraceCheckUtils]: 75: Hoare triple {55716#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {55717#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:38,314 INFO L273 TraceCheckUtils]: 76: Hoare triple {55717#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55717#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:38,315 INFO L273 TraceCheckUtils]: 77: Hoare triple {55717#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55717#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:38,315 INFO L273 TraceCheckUtils]: 78: Hoare triple {55717#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {55718#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:38,316 INFO L273 TraceCheckUtils]: 79: Hoare triple {55718#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55718#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:38,316 INFO L273 TraceCheckUtils]: 80: Hoare triple {55718#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55718#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:38,317 INFO L273 TraceCheckUtils]: 81: Hoare triple {55718#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {55719#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:38,318 INFO L273 TraceCheckUtils]: 82: Hoare triple {55719#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55719#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:38,318 INFO L273 TraceCheckUtils]: 83: Hoare triple {55719#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55719#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:38,319 INFO L273 TraceCheckUtils]: 84: Hoare triple {55719#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {55720#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:38,319 INFO L273 TraceCheckUtils]: 85: Hoare triple {55720#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55720#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:38,320 INFO L273 TraceCheckUtils]: 86: Hoare triple {55720#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55720#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:38,320 INFO L273 TraceCheckUtils]: 87: Hoare triple {55720#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {55721#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:38,321 INFO L273 TraceCheckUtils]: 88: Hoare triple {55721#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55721#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:38,321 INFO L273 TraceCheckUtils]: 89: Hoare triple {55721#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55721#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:38,322 INFO L273 TraceCheckUtils]: 90: Hoare triple {55721#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {55722#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:38,323 INFO L273 TraceCheckUtils]: 91: Hoare triple {55722#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55722#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:38,323 INFO L273 TraceCheckUtils]: 92: Hoare triple {55722#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55722#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:38,324 INFO L273 TraceCheckUtils]: 93: Hoare triple {55722#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {55723#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:38,324 INFO L273 TraceCheckUtils]: 94: Hoare triple {55723#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55723#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:38,325 INFO L273 TraceCheckUtils]: 95: Hoare triple {55723#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55723#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:38,325 INFO L273 TraceCheckUtils]: 96: Hoare triple {55723#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {55724#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:38,326 INFO L273 TraceCheckUtils]: 97: Hoare triple {55724#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55724#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:38,326 INFO L273 TraceCheckUtils]: 98: Hoare triple {55724#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55724#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:38,327 INFO L273 TraceCheckUtils]: 99: Hoare triple {55724#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {55725#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:38,328 INFO L273 TraceCheckUtils]: 100: Hoare triple {55725#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55725#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:38,328 INFO L273 TraceCheckUtils]: 101: Hoare triple {55725#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55725#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:38,329 INFO L273 TraceCheckUtils]: 102: Hoare triple {55725#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {55726#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:38,329 INFO L273 TraceCheckUtils]: 103: Hoare triple {55726#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55726#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:38,330 INFO L273 TraceCheckUtils]: 104: Hoare triple {55726#(<= main_~i~0 33)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55726#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:38,331 INFO L273 TraceCheckUtils]: 105: Hoare triple {55726#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {55727#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:38,331 INFO L273 TraceCheckUtils]: 106: Hoare triple {55727#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55727#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:38,332 INFO L273 TraceCheckUtils]: 107: Hoare triple {55727#(<= main_~i~0 34)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55727#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:38,332 INFO L273 TraceCheckUtils]: 108: Hoare triple {55727#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {55728#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:38,333 INFO L273 TraceCheckUtils]: 109: Hoare triple {55728#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55728#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:38,333 INFO L273 TraceCheckUtils]: 110: Hoare triple {55728#(<= main_~i~0 35)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55728#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:38,334 INFO L273 TraceCheckUtils]: 111: Hoare triple {55728#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {55729#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:38,334 INFO L273 TraceCheckUtils]: 112: Hoare triple {55729#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55729#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:38,335 INFO L273 TraceCheckUtils]: 113: Hoare triple {55729#(<= main_~i~0 36)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55729#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:38,336 INFO L273 TraceCheckUtils]: 114: Hoare triple {55729#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {55730#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:38,336 INFO L273 TraceCheckUtils]: 115: Hoare triple {55730#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55730#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:38,337 INFO L273 TraceCheckUtils]: 116: Hoare triple {55730#(<= main_~i~0 37)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55730#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:38,337 INFO L273 TraceCheckUtils]: 117: Hoare triple {55730#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {55731#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:38,338 INFO L273 TraceCheckUtils]: 118: Hoare triple {55731#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55731#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:38,338 INFO L273 TraceCheckUtils]: 119: Hoare triple {55731#(<= main_~i~0 38)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55731#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:38,339 INFO L273 TraceCheckUtils]: 120: Hoare triple {55731#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {55732#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:38,340 INFO L273 TraceCheckUtils]: 121: Hoare triple {55732#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55732#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:38,340 INFO L273 TraceCheckUtils]: 122: Hoare triple {55732#(<= main_~i~0 39)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55732#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:38,341 INFO L273 TraceCheckUtils]: 123: Hoare triple {55732#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {55733#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:38,341 INFO L273 TraceCheckUtils]: 124: Hoare triple {55733#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55733#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:38,342 INFO L273 TraceCheckUtils]: 125: Hoare triple {55733#(<= main_~i~0 40)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55733#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:38,342 INFO L273 TraceCheckUtils]: 126: Hoare triple {55733#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {55734#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:38,343 INFO L273 TraceCheckUtils]: 127: Hoare triple {55734#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55734#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:38,343 INFO L273 TraceCheckUtils]: 128: Hoare triple {55734#(<= main_~i~0 41)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55734#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:38,344 INFO L273 TraceCheckUtils]: 129: Hoare triple {55734#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {55735#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:38,345 INFO L273 TraceCheckUtils]: 130: Hoare triple {55735#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55735#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:38,345 INFO L273 TraceCheckUtils]: 131: Hoare triple {55735#(<= main_~i~0 42)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55735#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:38,346 INFO L273 TraceCheckUtils]: 132: Hoare triple {55735#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {55736#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:38,346 INFO L273 TraceCheckUtils]: 133: Hoare triple {55736#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55736#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:38,347 INFO L273 TraceCheckUtils]: 134: Hoare triple {55736#(<= main_~i~0 43)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55736#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:38,348 INFO L273 TraceCheckUtils]: 135: Hoare triple {55736#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {55737#(<= main_~i~0 44)} is VALID [2018-11-23 11:53:38,348 INFO L273 TraceCheckUtils]: 136: Hoare triple {55737#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55737#(<= main_~i~0 44)} is VALID [2018-11-23 11:53:38,349 INFO L273 TraceCheckUtils]: 137: Hoare triple {55737#(<= main_~i~0 44)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55737#(<= main_~i~0 44)} is VALID [2018-11-23 11:53:38,349 INFO L273 TraceCheckUtils]: 138: Hoare triple {55737#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {55738#(<= main_~i~0 45)} is VALID [2018-11-23 11:53:38,350 INFO L273 TraceCheckUtils]: 139: Hoare triple {55738#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55738#(<= main_~i~0 45)} is VALID [2018-11-23 11:53:38,350 INFO L273 TraceCheckUtils]: 140: Hoare triple {55738#(<= main_~i~0 45)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55738#(<= main_~i~0 45)} is VALID [2018-11-23 11:53:38,351 INFO L273 TraceCheckUtils]: 141: Hoare triple {55738#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {55739#(<= main_~i~0 46)} is VALID [2018-11-23 11:53:38,352 INFO L273 TraceCheckUtils]: 142: Hoare triple {55739#(<= main_~i~0 46)} assume !(~i~0 < 100000); {55693#false} is VALID [2018-11-23 11:53:38,352 INFO L273 TraceCheckUtils]: 143: Hoare triple {55693#false} assume !(0 != ~swapped~0); {55693#false} is VALID [2018-11-23 11:53:38,352 INFO L273 TraceCheckUtils]: 144: Hoare triple {55693#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {55693#false} is VALID [2018-11-23 11:53:38,352 INFO L273 TraceCheckUtils]: 145: Hoare triple {55693#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {55693#false} is VALID [2018-11-23 11:53:38,352 INFO L273 TraceCheckUtils]: 146: Hoare triple {55693#false} assume !!(~y~0 < 100000);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); {55693#false} is VALID [2018-11-23 11:53:38,353 INFO L256 TraceCheckUtils]: 147: Hoare triple {55693#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {55693#false} is VALID [2018-11-23 11:53:38,353 INFO L273 TraceCheckUtils]: 148: Hoare triple {55693#false} ~cond := #in~cond; {55693#false} is VALID [2018-11-23 11:53:38,353 INFO L273 TraceCheckUtils]: 149: Hoare triple {55693#false} assume 0 == ~cond; {55693#false} is VALID [2018-11-23 11:53:38,353 INFO L273 TraceCheckUtils]: 150: Hoare triple {55693#false} assume !false; {55693#false} is VALID [2018-11-23 11:53:38,367 INFO L134 CoverageAnalysis]: Checked inductivity of 3016 backedges. 1 proven. 3015 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:53:38,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:38,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 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:53:38,378 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:53:38,554 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2018-11-23 11:53:38,554 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:38,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:38,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:38,951 INFO L256 TraceCheckUtils]: 0: Hoare triple {55692#true} call ULTIMATE.init(); {55692#true} is VALID [2018-11-23 11:53:38,952 INFO L273 TraceCheckUtils]: 1: Hoare triple {55692#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {55692#true} is VALID [2018-11-23 11:53:38,952 INFO L273 TraceCheckUtils]: 2: Hoare triple {55692#true} assume true; {55692#true} is VALID [2018-11-23 11:53:38,952 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {55692#true} {55692#true} #79#return; {55692#true} is VALID [2018-11-23 11:53:38,952 INFO L256 TraceCheckUtils]: 4: Hoare triple {55692#true} call #t~ret8 := main(); {55692#true} is VALID [2018-11-23 11:53:38,952 INFO L273 TraceCheckUtils]: 5: Hoare triple {55692#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {55692#true} is VALID [2018-11-23 11:53:38,953 INFO L273 TraceCheckUtils]: 6: Hoare triple {55692#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {55761#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:38,953 INFO L273 TraceCheckUtils]: 7: Hoare triple {55761#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55761#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:38,954 INFO L273 TraceCheckUtils]: 8: Hoare triple {55761#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55761#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:38,955 INFO L273 TraceCheckUtils]: 9: Hoare triple {55761#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {55695#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:38,955 INFO L273 TraceCheckUtils]: 10: Hoare triple {55695#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55695#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:38,955 INFO L273 TraceCheckUtils]: 11: Hoare triple {55695#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55695#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:38,956 INFO L273 TraceCheckUtils]: 12: Hoare triple {55695#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {55696#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:38,956 INFO L273 TraceCheckUtils]: 13: Hoare triple {55696#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55696#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:38,956 INFO L273 TraceCheckUtils]: 14: Hoare triple {55696#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55696#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:38,957 INFO L273 TraceCheckUtils]: 15: Hoare triple {55696#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {55697#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:38,957 INFO L273 TraceCheckUtils]: 16: Hoare triple {55697#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55697#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:38,957 INFO L273 TraceCheckUtils]: 17: Hoare triple {55697#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55697#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:38,958 INFO L273 TraceCheckUtils]: 18: Hoare triple {55697#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {55698#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:38,958 INFO L273 TraceCheckUtils]: 19: Hoare triple {55698#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55698#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:38,959 INFO L273 TraceCheckUtils]: 20: Hoare triple {55698#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55698#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:38,959 INFO L273 TraceCheckUtils]: 21: Hoare triple {55698#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {55699#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:38,960 INFO L273 TraceCheckUtils]: 22: Hoare triple {55699#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55699#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:38,960 INFO L273 TraceCheckUtils]: 23: Hoare triple {55699#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55699#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:38,961 INFO L273 TraceCheckUtils]: 24: Hoare triple {55699#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {55700#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:38,961 INFO L273 TraceCheckUtils]: 25: Hoare triple {55700#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55700#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:38,962 INFO L273 TraceCheckUtils]: 26: Hoare triple {55700#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55700#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:38,963 INFO L273 TraceCheckUtils]: 27: Hoare triple {55700#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {55701#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:38,963 INFO L273 TraceCheckUtils]: 28: Hoare triple {55701#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55701#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:38,964 INFO L273 TraceCheckUtils]: 29: Hoare triple {55701#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55701#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:38,964 INFO L273 TraceCheckUtils]: 30: Hoare triple {55701#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {55702#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:38,965 INFO L273 TraceCheckUtils]: 31: Hoare triple {55702#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55702#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:38,965 INFO L273 TraceCheckUtils]: 32: Hoare triple {55702#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55702#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:38,966 INFO L273 TraceCheckUtils]: 33: Hoare triple {55702#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {55703#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:38,966 INFO L273 TraceCheckUtils]: 34: Hoare triple {55703#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55703#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:38,967 INFO L273 TraceCheckUtils]: 35: Hoare triple {55703#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55703#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:38,967 INFO L273 TraceCheckUtils]: 36: Hoare triple {55703#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {55704#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:38,968 INFO L273 TraceCheckUtils]: 37: Hoare triple {55704#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55704#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:38,968 INFO L273 TraceCheckUtils]: 38: Hoare triple {55704#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55704#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:38,969 INFO L273 TraceCheckUtils]: 39: Hoare triple {55704#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {55705#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:38,969 INFO L273 TraceCheckUtils]: 40: Hoare triple {55705#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55705#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:38,970 INFO L273 TraceCheckUtils]: 41: Hoare triple {55705#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55705#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:38,971 INFO L273 TraceCheckUtils]: 42: Hoare triple {55705#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {55706#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:38,971 INFO L273 TraceCheckUtils]: 43: Hoare triple {55706#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55706#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:38,972 INFO L273 TraceCheckUtils]: 44: Hoare triple {55706#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55706#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:38,972 INFO L273 TraceCheckUtils]: 45: Hoare triple {55706#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {55707#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:38,973 INFO L273 TraceCheckUtils]: 46: Hoare triple {55707#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55707#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:38,973 INFO L273 TraceCheckUtils]: 47: Hoare triple {55707#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55707#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:38,974 INFO L273 TraceCheckUtils]: 48: Hoare triple {55707#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {55708#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:38,974 INFO L273 TraceCheckUtils]: 49: Hoare triple {55708#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55708#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:38,975 INFO L273 TraceCheckUtils]: 50: Hoare triple {55708#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55708#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:38,975 INFO L273 TraceCheckUtils]: 51: Hoare triple {55708#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {55709#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:38,976 INFO L273 TraceCheckUtils]: 52: Hoare triple {55709#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55709#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:38,976 INFO L273 TraceCheckUtils]: 53: Hoare triple {55709#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55709#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:38,977 INFO L273 TraceCheckUtils]: 54: Hoare triple {55709#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {55710#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:38,978 INFO L273 TraceCheckUtils]: 55: Hoare triple {55710#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55710#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:38,978 INFO L273 TraceCheckUtils]: 56: Hoare triple {55710#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55710#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:38,979 INFO L273 TraceCheckUtils]: 57: Hoare triple {55710#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {55711#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:38,979 INFO L273 TraceCheckUtils]: 58: Hoare triple {55711#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55711#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:38,980 INFO L273 TraceCheckUtils]: 59: Hoare triple {55711#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55711#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:38,980 INFO L273 TraceCheckUtils]: 60: Hoare triple {55711#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {55712#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:38,981 INFO L273 TraceCheckUtils]: 61: Hoare triple {55712#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55712#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:38,981 INFO L273 TraceCheckUtils]: 62: Hoare triple {55712#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55712#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:38,982 INFO L273 TraceCheckUtils]: 63: Hoare triple {55712#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {55713#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:38,982 INFO L273 TraceCheckUtils]: 64: Hoare triple {55713#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55713#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:38,983 INFO L273 TraceCheckUtils]: 65: Hoare triple {55713#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55713#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:38,983 INFO L273 TraceCheckUtils]: 66: Hoare triple {55713#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {55714#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:38,984 INFO L273 TraceCheckUtils]: 67: Hoare triple {55714#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55714#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:38,984 INFO L273 TraceCheckUtils]: 68: Hoare triple {55714#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55714#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:38,985 INFO L273 TraceCheckUtils]: 69: Hoare triple {55714#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {55715#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:38,986 INFO L273 TraceCheckUtils]: 70: Hoare triple {55715#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55715#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:38,986 INFO L273 TraceCheckUtils]: 71: Hoare triple {55715#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55715#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:38,987 INFO L273 TraceCheckUtils]: 72: Hoare triple {55715#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {55716#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:38,987 INFO L273 TraceCheckUtils]: 73: Hoare triple {55716#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55716#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:38,988 INFO L273 TraceCheckUtils]: 74: Hoare triple {55716#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55716#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:38,988 INFO L273 TraceCheckUtils]: 75: Hoare triple {55716#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {55717#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:38,989 INFO L273 TraceCheckUtils]: 76: Hoare triple {55717#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55717#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:38,989 INFO L273 TraceCheckUtils]: 77: Hoare triple {55717#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55717#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:38,990 INFO L273 TraceCheckUtils]: 78: Hoare triple {55717#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {55718#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:38,990 INFO L273 TraceCheckUtils]: 79: Hoare triple {55718#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55718#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:38,991 INFO L273 TraceCheckUtils]: 80: Hoare triple {55718#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55718#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:38,992 INFO L273 TraceCheckUtils]: 81: Hoare triple {55718#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {55719#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:38,992 INFO L273 TraceCheckUtils]: 82: Hoare triple {55719#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55719#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:38,993 INFO L273 TraceCheckUtils]: 83: Hoare triple {55719#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55719#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:38,993 INFO L273 TraceCheckUtils]: 84: Hoare triple {55719#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {55720#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:38,994 INFO L273 TraceCheckUtils]: 85: Hoare triple {55720#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55720#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:38,994 INFO L273 TraceCheckUtils]: 86: Hoare triple {55720#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55720#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:38,995 INFO L273 TraceCheckUtils]: 87: Hoare triple {55720#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {55721#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:38,995 INFO L273 TraceCheckUtils]: 88: Hoare triple {55721#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55721#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:38,996 INFO L273 TraceCheckUtils]: 89: Hoare triple {55721#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55721#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:38,996 INFO L273 TraceCheckUtils]: 90: Hoare triple {55721#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {55722#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:38,997 INFO L273 TraceCheckUtils]: 91: Hoare triple {55722#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55722#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:38,997 INFO L273 TraceCheckUtils]: 92: Hoare triple {55722#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55722#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:38,998 INFO L273 TraceCheckUtils]: 93: Hoare triple {55722#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {55723#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:38,998 INFO L273 TraceCheckUtils]: 94: Hoare triple {55723#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55723#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:38,999 INFO L273 TraceCheckUtils]: 95: Hoare triple {55723#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55723#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:39,000 INFO L273 TraceCheckUtils]: 96: Hoare triple {55723#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {55724#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:39,000 INFO L273 TraceCheckUtils]: 97: Hoare triple {55724#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55724#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:39,001 INFO L273 TraceCheckUtils]: 98: Hoare triple {55724#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55724#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:39,001 INFO L273 TraceCheckUtils]: 99: Hoare triple {55724#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {55725#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:39,002 INFO L273 TraceCheckUtils]: 100: Hoare triple {55725#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55725#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:39,002 INFO L273 TraceCheckUtils]: 101: Hoare triple {55725#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55725#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:39,003 INFO L273 TraceCheckUtils]: 102: Hoare triple {55725#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {55726#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:39,003 INFO L273 TraceCheckUtils]: 103: Hoare triple {55726#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55726#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:39,004 INFO L273 TraceCheckUtils]: 104: Hoare triple {55726#(<= main_~i~0 33)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55726#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:39,005 INFO L273 TraceCheckUtils]: 105: Hoare triple {55726#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {55727#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:39,005 INFO L273 TraceCheckUtils]: 106: Hoare triple {55727#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55727#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:39,005 INFO L273 TraceCheckUtils]: 107: Hoare triple {55727#(<= main_~i~0 34)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55727#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:39,006 INFO L273 TraceCheckUtils]: 108: Hoare triple {55727#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {55728#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:39,007 INFO L273 TraceCheckUtils]: 109: Hoare triple {55728#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55728#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:39,007 INFO L273 TraceCheckUtils]: 110: Hoare triple {55728#(<= main_~i~0 35)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55728#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:39,008 INFO L273 TraceCheckUtils]: 111: Hoare triple {55728#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {55729#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:39,008 INFO L273 TraceCheckUtils]: 112: Hoare triple {55729#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55729#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:39,009 INFO L273 TraceCheckUtils]: 113: Hoare triple {55729#(<= main_~i~0 36)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55729#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:39,009 INFO L273 TraceCheckUtils]: 114: Hoare triple {55729#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {55730#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:39,010 INFO L273 TraceCheckUtils]: 115: Hoare triple {55730#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55730#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:39,010 INFO L273 TraceCheckUtils]: 116: Hoare triple {55730#(<= main_~i~0 37)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55730#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:39,011 INFO L273 TraceCheckUtils]: 117: Hoare triple {55730#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {55731#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:39,011 INFO L273 TraceCheckUtils]: 118: Hoare triple {55731#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55731#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:39,012 INFO L273 TraceCheckUtils]: 119: Hoare triple {55731#(<= main_~i~0 38)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55731#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:39,013 INFO L273 TraceCheckUtils]: 120: Hoare triple {55731#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {55732#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:39,013 INFO L273 TraceCheckUtils]: 121: Hoare triple {55732#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55732#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:39,014 INFO L273 TraceCheckUtils]: 122: Hoare triple {55732#(<= main_~i~0 39)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55732#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:39,014 INFO L273 TraceCheckUtils]: 123: Hoare triple {55732#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {55733#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:39,015 INFO L273 TraceCheckUtils]: 124: Hoare triple {55733#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55733#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:39,015 INFO L273 TraceCheckUtils]: 125: Hoare triple {55733#(<= main_~i~0 40)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55733#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:39,016 INFO L273 TraceCheckUtils]: 126: Hoare triple {55733#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {55734#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:39,016 INFO L273 TraceCheckUtils]: 127: Hoare triple {55734#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55734#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:39,017 INFO L273 TraceCheckUtils]: 128: Hoare triple {55734#(<= main_~i~0 41)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55734#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:39,017 INFO L273 TraceCheckUtils]: 129: Hoare triple {55734#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {55735#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:39,018 INFO L273 TraceCheckUtils]: 130: Hoare triple {55735#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55735#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:39,018 INFO L273 TraceCheckUtils]: 131: Hoare triple {55735#(<= main_~i~0 42)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55735#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:39,019 INFO L273 TraceCheckUtils]: 132: Hoare triple {55735#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {55736#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:39,020 INFO L273 TraceCheckUtils]: 133: Hoare triple {55736#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55736#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:39,020 INFO L273 TraceCheckUtils]: 134: Hoare triple {55736#(<= main_~i~0 43)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55736#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:39,021 INFO L273 TraceCheckUtils]: 135: Hoare triple {55736#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {55737#(<= main_~i~0 44)} is VALID [2018-11-23 11:53:39,021 INFO L273 TraceCheckUtils]: 136: Hoare triple {55737#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55737#(<= main_~i~0 44)} is VALID [2018-11-23 11:53:39,022 INFO L273 TraceCheckUtils]: 137: Hoare triple {55737#(<= main_~i~0 44)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55737#(<= main_~i~0 44)} is VALID [2018-11-23 11:53:39,022 INFO L273 TraceCheckUtils]: 138: Hoare triple {55737#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {55738#(<= main_~i~0 45)} is VALID [2018-11-23 11:53:39,023 INFO L273 TraceCheckUtils]: 139: Hoare triple {55738#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {55738#(<= main_~i~0 45)} is VALID [2018-11-23 11:53:39,023 INFO L273 TraceCheckUtils]: 140: Hoare triple {55738#(<= main_~i~0 45)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {55738#(<= main_~i~0 45)} is VALID [2018-11-23 11:53:39,024 INFO L273 TraceCheckUtils]: 141: Hoare triple {55738#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {55739#(<= main_~i~0 46)} is VALID [2018-11-23 11:53:39,025 INFO L273 TraceCheckUtils]: 142: Hoare triple {55739#(<= main_~i~0 46)} assume !(~i~0 < 100000); {55693#false} is VALID [2018-11-23 11:53:39,025 INFO L273 TraceCheckUtils]: 143: Hoare triple {55693#false} assume !(0 != ~swapped~0); {55693#false} is VALID [2018-11-23 11:53:39,025 INFO L273 TraceCheckUtils]: 144: Hoare triple {55693#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {55693#false} is VALID [2018-11-23 11:53:39,025 INFO L273 TraceCheckUtils]: 145: Hoare triple {55693#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {55693#false} is VALID [2018-11-23 11:53:39,025 INFO L273 TraceCheckUtils]: 146: Hoare triple {55693#false} assume !!(~y~0 < 100000);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); {55693#false} is VALID [2018-11-23 11:53:39,025 INFO L256 TraceCheckUtils]: 147: Hoare triple {55693#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {55693#false} is VALID [2018-11-23 11:53:39,026 INFO L273 TraceCheckUtils]: 148: Hoare triple {55693#false} ~cond := #in~cond; {55693#false} is VALID [2018-11-23 11:53:39,026 INFO L273 TraceCheckUtils]: 149: Hoare triple {55693#false} assume 0 == ~cond; {55693#false} is VALID [2018-11-23 11:53:39,026 INFO L273 TraceCheckUtils]: 150: Hoare triple {55693#false} assume !false; {55693#false} is VALID [2018-11-23 11:53:39,040 INFO L134 CoverageAnalysis]: Checked inductivity of 3016 backedges. 1 proven. 3015 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:53:39,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:39,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 49 [2018-11-23 11:53:39,071 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 151 [2018-11-23 11:53:39,071 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:39,071 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states. [2018-11-23 11:53:39,294 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:53:39,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-23 11:53:39,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-23 11:53:39,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-23 11:53:39,295 INFO L87 Difference]: Start difference. First operand 291 states and 384 transitions. Second operand 49 states. [2018-11-23 11:53:40,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:40,886 INFO L93 Difference]: Finished difference Result 586 states and 778 transitions. [2018-11-23 11:53:40,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 11:53:40,886 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 151 [2018-11-23 11:53:40,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:40,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 11:53:40,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 233 transitions. [2018-11-23 11:53:40,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 11:53:40,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 233 transitions. [2018-11-23 11:53:40,889 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 233 transitions. [2018-11-23 11:53:41,131 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 233 edges. 233 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:41,137 INFO L225 Difference]: With dead ends: 586 [2018-11-23 11:53:41,138 INFO L226 Difference]: Without dead ends: 301 [2018-11-23 11:53:41,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-23 11:53:41,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-11-23 11:53:41,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 297. [2018-11-23 11:53:41,309 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:41,309 INFO L82 GeneralOperation]: Start isEquivalent. First operand 301 states. Second operand 297 states. [2018-11-23 11:53:41,309 INFO L74 IsIncluded]: Start isIncluded. First operand 301 states. Second operand 297 states. [2018-11-23 11:53:41,310 INFO L87 Difference]: Start difference. First operand 301 states. Second operand 297 states. [2018-11-23 11:53:41,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:41,316 INFO L93 Difference]: Finished difference Result 301 states and 398 transitions. [2018-11-23 11:53:41,316 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 398 transitions. [2018-11-23 11:53:41,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:41,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:41,317 INFO L74 IsIncluded]: Start isIncluded. First operand 297 states. Second operand 301 states. [2018-11-23 11:53:41,317 INFO L87 Difference]: Start difference. First operand 297 states. Second operand 301 states. [2018-11-23 11:53:41,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:41,322 INFO L93 Difference]: Finished difference Result 301 states and 398 transitions. [2018-11-23 11:53:41,322 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 398 transitions. [2018-11-23 11:53:41,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:41,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:41,322 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:41,322 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:41,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-11-23 11:53:41,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 392 transitions. [2018-11-23 11:53:41,327 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 392 transitions. Word has length 151 [2018-11-23 11:53:41,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:41,328 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 392 transitions. [2018-11-23 11:53:41,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-23 11:53:41,328 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 392 transitions. [2018-11-23 11:53:41,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-23 11:53:41,328 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:41,328 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:53:41,329 INFO L423 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:41,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:41,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1778739407, now seen corresponding path program 46 times [2018-11-23 11:53:41,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:41,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:41,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:41,330 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:41,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:41,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:42,443 INFO L256 TraceCheckUtils]: 0: Hoare triple {57981#true} call ULTIMATE.init(); {57981#true} is VALID [2018-11-23 11:53:42,444 INFO L273 TraceCheckUtils]: 1: Hoare triple {57981#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {57981#true} is VALID [2018-11-23 11:53:42,444 INFO L273 TraceCheckUtils]: 2: Hoare triple {57981#true} assume true; {57981#true} is VALID [2018-11-23 11:53:42,444 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {57981#true} {57981#true} #79#return; {57981#true} is VALID [2018-11-23 11:53:42,444 INFO L256 TraceCheckUtils]: 4: Hoare triple {57981#true} call #t~ret8 := main(); {57981#true} is VALID [2018-11-23 11:53:42,444 INFO L273 TraceCheckUtils]: 5: Hoare triple {57981#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {57981#true} is VALID [2018-11-23 11:53:42,444 INFO L273 TraceCheckUtils]: 6: Hoare triple {57981#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {57983#(= main_~i~0 1)} is VALID [2018-11-23 11:53:42,445 INFO L273 TraceCheckUtils]: 7: Hoare triple {57983#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {57983#(= main_~i~0 1)} is VALID [2018-11-23 11:53:42,445 INFO L273 TraceCheckUtils]: 8: Hoare triple {57983#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {57983#(= main_~i~0 1)} is VALID [2018-11-23 11:53:42,446 INFO L273 TraceCheckUtils]: 9: Hoare triple {57983#(= main_~i~0 1)} ~i~0 := 1 + ~i~0; {57984#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:42,446 INFO L273 TraceCheckUtils]: 10: Hoare triple {57984#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {57984#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:42,447 INFO L273 TraceCheckUtils]: 11: Hoare triple {57984#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {57984#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:42,447 INFO L273 TraceCheckUtils]: 12: Hoare triple {57984#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {57985#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:42,448 INFO L273 TraceCheckUtils]: 13: Hoare triple {57985#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {57985#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:42,448 INFO L273 TraceCheckUtils]: 14: Hoare triple {57985#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {57985#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:42,449 INFO L273 TraceCheckUtils]: 15: Hoare triple {57985#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {57986#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:42,450 INFO L273 TraceCheckUtils]: 16: Hoare triple {57986#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {57986#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:42,450 INFO L273 TraceCheckUtils]: 17: Hoare triple {57986#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {57986#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:42,451 INFO L273 TraceCheckUtils]: 18: Hoare triple {57986#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {57987#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:42,451 INFO L273 TraceCheckUtils]: 19: Hoare triple {57987#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {57987#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:42,452 INFO L273 TraceCheckUtils]: 20: Hoare triple {57987#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {57987#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:42,453 INFO L273 TraceCheckUtils]: 21: Hoare triple {57987#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {57988#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:42,453 INFO L273 TraceCheckUtils]: 22: Hoare triple {57988#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {57988#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:42,454 INFO L273 TraceCheckUtils]: 23: Hoare triple {57988#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {57988#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:42,454 INFO L273 TraceCheckUtils]: 24: Hoare triple {57988#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {57989#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:42,455 INFO L273 TraceCheckUtils]: 25: Hoare triple {57989#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {57989#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:42,455 INFO L273 TraceCheckUtils]: 26: Hoare triple {57989#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {57989#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:42,456 INFO L273 TraceCheckUtils]: 27: Hoare triple {57989#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {57990#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:42,457 INFO L273 TraceCheckUtils]: 28: Hoare triple {57990#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {57990#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:42,457 INFO L273 TraceCheckUtils]: 29: Hoare triple {57990#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {57990#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:42,458 INFO L273 TraceCheckUtils]: 30: Hoare triple {57990#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {57991#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:42,458 INFO L273 TraceCheckUtils]: 31: Hoare triple {57991#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {57991#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:42,459 INFO L273 TraceCheckUtils]: 32: Hoare triple {57991#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {57991#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:42,459 INFO L273 TraceCheckUtils]: 33: Hoare triple {57991#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {57992#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:42,460 INFO L273 TraceCheckUtils]: 34: Hoare triple {57992#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {57992#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:42,460 INFO L273 TraceCheckUtils]: 35: Hoare triple {57992#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {57992#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:42,461 INFO L273 TraceCheckUtils]: 36: Hoare triple {57992#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {57993#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:42,462 INFO L273 TraceCheckUtils]: 37: Hoare triple {57993#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {57993#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:42,462 INFO L273 TraceCheckUtils]: 38: Hoare triple {57993#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {57993#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:42,463 INFO L273 TraceCheckUtils]: 39: Hoare triple {57993#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {57994#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:42,463 INFO L273 TraceCheckUtils]: 40: Hoare triple {57994#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {57994#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:42,464 INFO L273 TraceCheckUtils]: 41: Hoare triple {57994#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {57994#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:42,465 INFO L273 TraceCheckUtils]: 42: Hoare triple {57994#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {57995#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:42,465 INFO L273 TraceCheckUtils]: 43: Hoare triple {57995#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {57995#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:42,466 INFO L273 TraceCheckUtils]: 44: Hoare triple {57995#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {57995#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:42,466 INFO L273 TraceCheckUtils]: 45: Hoare triple {57995#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {57996#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:42,467 INFO L273 TraceCheckUtils]: 46: Hoare triple {57996#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {57996#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:42,467 INFO L273 TraceCheckUtils]: 47: Hoare triple {57996#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {57996#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:42,468 INFO L273 TraceCheckUtils]: 48: Hoare triple {57996#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {57997#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:42,469 INFO L273 TraceCheckUtils]: 49: Hoare triple {57997#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {57997#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:42,469 INFO L273 TraceCheckUtils]: 50: Hoare triple {57997#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {57997#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:42,470 INFO L273 TraceCheckUtils]: 51: Hoare triple {57997#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {57998#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:42,470 INFO L273 TraceCheckUtils]: 52: Hoare triple {57998#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {57998#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:42,471 INFO L273 TraceCheckUtils]: 53: Hoare triple {57998#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {57998#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:42,471 INFO L273 TraceCheckUtils]: 54: Hoare triple {57998#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {57999#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:42,472 INFO L273 TraceCheckUtils]: 55: Hoare triple {57999#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {57999#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:42,472 INFO L273 TraceCheckUtils]: 56: Hoare triple {57999#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {57999#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:42,473 INFO L273 TraceCheckUtils]: 57: Hoare triple {57999#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {58000#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:42,474 INFO L273 TraceCheckUtils]: 58: Hoare triple {58000#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {58000#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:42,474 INFO L273 TraceCheckUtils]: 59: Hoare triple {58000#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {58000#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:42,475 INFO L273 TraceCheckUtils]: 60: Hoare triple {58000#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {58001#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:42,475 INFO L273 TraceCheckUtils]: 61: Hoare triple {58001#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {58001#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:42,476 INFO L273 TraceCheckUtils]: 62: Hoare triple {58001#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {58001#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:42,477 INFO L273 TraceCheckUtils]: 63: Hoare triple {58001#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {58002#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:42,477 INFO L273 TraceCheckUtils]: 64: Hoare triple {58002#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {58002#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:42,478 INFO L273 TraceCheckUtils]: 65: Hoare triple {58002#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {58002#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:42,478 INFO L273 TraceCheckUtils]: 66: Hoare triple {58002#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {58003#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:42,479 INFO L273 TraceCheckUtils]: 67: Hoare triple {58003#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {58003#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:42,479 INFO L273 TraceCheckUtils]: 68: Hoare triple {58003#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {58003#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:42,480 INFO L273 TraceCheckUtils]: 69: Hoare triple {58003#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {58004#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:42,481 INFO L273 TraceCheckUtils]: 70: Hoare triple {58004#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {58004#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:42,481 INFO L273 TraceCheckUtils]: 71: Hoare triple {58004#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {58004#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:42,482 INFO L273 TraceCheckUtils]: 72: Hoare triple {58004#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {58005#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:42,482 INFO L273 TraceCheckUtils]: 73: Hoare triple {58005#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {58005#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:42,483 INFO L273 TraceCheckUtils]: 74: Hoare triple {58005#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {58005#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:42,483 INFO L273 TraceCheckUtils]: 75: Hoare triple {58005#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {58006#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:42,484 INFO L273 TraceCheckUtils]: 76: Hoare triple {58006#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {58006#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:42,484 INFO L273 TraceCheckUtils]: 77: Hoare triple {58006#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {58006#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:42,485 INFO L273 TraceCheckUtils]: 78: Hoare triple {58006#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {58007#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:42,486 INFO L273 TraceCheckUtils]: 79: Hoare triple {58007#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {58007#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:42,486 INFO L273 TraceCheckUtils]: 80: Hoare triple {58007#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {58007#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:42,487 INFO L273 TraceCheckUtils]: 81: Hoare triple {58007#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {58008#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:42,487 INFO L273 TraceCheckUtils]: 82: Hoare triple {58008#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {58008#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:42,488 INFO L273 TraceCheckUtils]: 83: Hoare triple {58008#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {58008#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:42,489 INFO L273 TraceCheckUtils]: 84: Hoare triple {58008#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {58009#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:42,489 INFO L273 TraceCheckUtils]: 85: Hoare triple {58009#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {58009#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:42,490 INFO L273 TraceCheckUtils]: 86: Hoare triple {58009#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {58009#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:42,490 INFO L273 TraceCheckUtils]: 87: Hoare triple {58009#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {58010#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:42,491 INFO L273 TraceCheckUtils]: 88: Hoare triple {58010#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {58010#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:42,491 INFO L273 TraceCheckUtils]: 89: Hoare triple {58010#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {58010#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:42,492 INFO L273 TraceCheckUtils]: 90: Hoare triple {58010#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {58011#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:42,493 INFO L273 TraceCheckUtils]: 91: Hoare triple {58011#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {58011#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:42,493 INFO L273 TraceCheckUtils]: 92: Hoare triple {58011#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {58011#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:42,494 INFO L273 TraceCheckUtils]: 93: Hoare triple {58011#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {58012#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:42,494 INFO L273 TraceCheckUtils]: 94: Hoare triple {58012#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {58012#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:42,495 INFO L273 TraceCheckUtils]: 95: Hoare triple {58012#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {58012#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:42,496 INFO L273 TraceCheckUtils]: 96: Hoare triple {58012#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {58013#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:42,496 INFO L273 TraceCheckUtils]: 97: Hoare triple {58013#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {58013#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:42,497 INFO L273 TraceCheckUtils]: 98: Hoare triple {58013#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {58013#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:42,497 INFO L273 TraceCheckUtils]: 99: Hoare triple {58013#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {58014#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:42,498 INFO L273 TraceCheckUtils]: 100: Hoare triple {58014#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {58014#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:42,498 INFO L273 TraceCheckUtils]: 101: Hoare triple {58014#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {58014#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:42,499 INFO L273 TraceCheckUtils]: 102: Hoare triple {58014#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {58015#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:42,500 INFO L273 TraceCheckUtils]: 103: Hoare triple {58015#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {58015#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:42,500 INFO L273 TraceCheckUtils]: 104: Hoare triple {58015#(<= main_~i~0 33)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {58015#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:42,501 INFO L273 TraceCheckUtils]: 105: Hoare triple {58015#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {58016#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:42,501 INFO L273 TraceCheckUtils]: 106: Hoare triple {58016#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {58016#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:42,502 INFO L273 TraceCheckUtils]: 107: Hoare triple {58016#(<= main_~i~0 34)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {58016#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:42,502 INFO L273 TraceCheckUtils]: 108: Hoare triple {58016#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {58017#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:42,503 INFO L273 TraceCheckUtils]: 109: Hoare triple {58017#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {58017#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:42,503 INFO L273 TraceCheckUtils]: 110: Hoare triple {58017#(<= main_~i~0 35)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {58017#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:42,504 INFO L273 TraceCheckUtils]: 111: Hoare triple {58017#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {58018#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:42,505 INFO L273 TraceCheckUtils]: 112: Hoare triple {58018#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {58018#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:42,505 INFO L273 TraceCheckUtils]: 113: Hoare triple {58018#(<= main_~i~0 36)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {58018#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:42,506 INFO L273 TraceCheckUtils]: 114: Hoare triple {58018#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {58019#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:42,506 INFO L273 TraceCheckUtils]: 115: Hoare triple {58019#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {58019#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:42,507 INFO L273 TraceCheckUtils]: 116: Hoare triple {58019#(<= main_~i~0 37)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {58019#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:42,508 INFO L273 TraceCheckUtils]: 117: Hoare triple {58019#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {58020#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:42,508 INFO L273 TraceCheckUtils]: 118: Hoare triple {58020#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {58020#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:42,509 INFO L273 TraceCheckUtils]: 119: Hoare triple {58020#(<= main_~i~0 38)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {58020#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:42,509 INFO L273 TraceCheckUtils]: 120: Hoare triple {58020#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {58021#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:42,510 INFO L273 TraceCheckUtils]: 121: Hoare triple {58021#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {58021#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:42,510 INFO L273 TraceCheckUtils]: 122: Hoare triple {58021#(<= main_~i~0 39)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {58021#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:42,511 INFO L273 TraceCheckUtils]: 123: Hoare triple {58021#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {58022#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:42,512 INFO L273 TraceCheckUtils]: 124: Hoare triple {58022#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {58022#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:42,512 INFO L273 TraceCheckUtils]: 125: Hoare triple {58022#(<= main_~i~0 40)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {58022#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:42,513 INFO L273 TraceCheckUtils]: 126: Hoare triple {58022#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {58023#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:42,513 INFO L273 TraceCheckUtils]: 127: Hoare triple {58023#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {58023#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:42,514 INFO L273 TraceCheckUtils]: 128: Hoare triple {58023#(<= main_~i~0 41)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {58023#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:42,514 INFO L273 TraceCheckUtils]: 129: Hoare triple {58023#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {58024#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:42,515 INFO L273 TraceCheckUtils]: 130: Hoare triple {58024#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {58024#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:42,515 INFO L273 TraceCheckUtils]: 131: Hoare triple {58024#(<= main_~i~0 42)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {58024#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:42,516 INFO L273 TraceCheckUtils]: 132: Hoare triple {58024#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {58025#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:42,517 INFO L273 TraceCheckUtils]: 133: Hoare triple {58025#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {58025#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:42,517 INFO L273 TraceCheckUtils]: 134: Hoare triple {58025#(<= main_~i~0 43)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {58025#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:42,518 INFO L273 TraceCheckUtils]: 135: Hoare triple {58025#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {58026#(<= main_~i~0 44)} is VALID [2018-11-23 11:53:42,518 INFO L273 TraceCheckUtils]: 136: Hoare triple {58026#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {58026#(<= main_~i~0 44)} is VALID [2018-11-23 11:53:42,519 INFO L273 TraceCheckUtils]: 137: Hoare triple {58026#(<= main_~i~0 44)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {58026#(<= main_~i~0 44)} is VALID [2018-11-23 11:53:42,520 INFO L273 TraceCheckUtils]: 138: Hoare triple {58026#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {58027#(<= main_~i~0 45)} is VALID [2018-11-23 11:53:42,520 INFO L273 TraceCheckUtils]: 139: Hoare triple {58027#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {58027#(<= main_~i~0 45)} is VALID [2018-11-23 11:53:42,521 INFO L273 TraceCheckUtils]: 140: Hoare triple {58027#(<= main_~i~0 45)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {58027#(<= main_~i~0 45)} is VALID [2018-11-23 11:53:42,521 INFO L273 TraceCheckUtils]: 141: Hoare triple {58027#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {58028#(<= main_~i~0 46)} is VALID [2018-11-23 11:53:42,522 INFO L273 TraceCheckUtils]: 142: Hoare triple {58028#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {58028#(<= main_~i~0 46)} is VALID [2018-11-23 11:53:42,522 INFO L273 TraceCheckUtils]: 143: Hoare triple {58028#(<= main_~i~0 46)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {58028#(<= main_~i~0 46)} is VALID [2018-11-23 11:53:42,523 INFO L273 TraceCheckUtils]: 144: Hoare triple {58028#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {58029#(<= main_~i~0 47)} is VALID [2018-11-23 11:53:42,524 INFO L273 TraceCheckUtils]: 145: Hoare triple {58029#(<= main_~i~0 47)} assume !(~i~0 < 100000); {57982#false} is VALID [2018-11-23 11:53:42,524 INFO L273 TraceCheckUtils]: 146: Hoare triple {57982#false} assume !(0 != ~swapped~0); {57982#false} is VALID [2018-11-23 11:53:42,524 INFO L273 TraceCheckUtils]: 147: Hoare triple {57982#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {57982#false} is VALID [2018-11-23 11:53:42,524 INFO L273 TraceCheckUtils]: 148: Hoare triple {57982#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {57982#false} is VALID [2018-11-23 11:53:42,524 INFO L273 TraceCheckUtils]: 149: Hoare triple {57982#false} assume !!(~y~0 < 100000);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); {57982#false} is VALID [2018-11-23 11:53:42,525 INFO L256 TraceCheckUtils]: 150: Hoare triple {57982#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {57982#false} is VALID [2018-11-23 11:53:42,525 INFO L273 TraceCheckUtils]: 151: Hoare triple {57982#false} ~cond := #in~cond; {57982#false} is VALID [2018-11-23 11:53:42,525 INFO L273 TraceCheckUtils]: 152: Hoare triple {57982#false} assume 0 == ~cond; {57982#false} is VALID [2018-11-23 11:53:42,525 INFO L273 TraceCheckUtils]: 153: Hoare triple {57982#false} assume !false; {57982#false} is VALID [2018-11-23 11:53:42,540 INFO L134 CoverageAnalysis]: Checked inductivity of 3152 backedges. 1 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:53:42,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:42,540 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:53:42,548 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:53:42,616 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:53:42,616 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:42,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:42,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:43,005 INFO L256 TraceCheckUtils]: 0: Hoare triple {57981#true} call ULTIMATE.init(); {57981#true} is VALID [2018-11-23 11:53:43,005 INFO L273 TraceCheckUtils]: 1: Hoare triple {57981#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {57981#true} is VALID [2018-11-23 11:53:43,006 INFO L273 TraceCheckUtils]: 2: Hoare triple {57981#true} assume true; {57981#true} is VALID [2018-11-23 11:53:43,006 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {57981#true} {57981#true} #79#return; {57981#true} is VALID [2018-11-23 11:53:43,006 INFO L256 TraceCheckUtils]: 4: Hoare triple {57981#true} call #t~ret8 := main(); {57981#true} is VALID [2018-11-23 11:53:43,006 INFO L273 TraceCheckUtils]: 5: Hoare triple {57981#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {57981#true} is VALID [2018-11-23 11:53:43,007 INFO L273 TraceCheckUtils]: 6: Hoare triple {57981#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {58051#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:43,007 INFO L273 TraceCheckUtils]: 7: Hoare triple {58051#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {58051#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:43,007 INFO L273 TraceCheckUtils]: 8: Hoare triple {58051#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {58051#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:43,008 INFO L273 TraceCheckUtils]: 9: Hoare triple {58051#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {57984#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:43,008 INFO L273 TraceCheckUtils]: 10: Hoare triple {57984#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {57984#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:43,008 INFO L273 TraceCheckUtils]: 11: Hoare triple {57984#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {57984#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:43,009 INFO L273 TraceCheckUtils]: 12: Hoare triple {57984#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {57985#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:43,009 INFO L273 TraceCheckUtils]: 13: Hoare triple {57985#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {57985#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:43,009 INFO L273 TraceCheckUtils]: 14: Hoare triple {57985#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {57985#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:43,010 INFO L273 TraceCheckUtils]: 15: Hoare triple {57985#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {57986#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:43,011 INFO L273 TraceCheckUtils]: 16: Hoare triple {57986#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {57986#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:43,011 INFO L273 TraceCheckUtils]: 17: Hoare triple {57986#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {57986#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:43,012 INFO L273 TraceCheckUtils]: 18: Hoare triple {57986#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {57987#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:43,012 INFO L273 TraceCheckUtils]: 19: Hoare triple {57987#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {57987#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:43,013 INFO L273 TraceCheckUtils]: 20: Hoare triple {57987#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {57987#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:43,013 INFO L273 TraceCheckUtils]: 21: Hoare triple {57987#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {57988#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:43,014 INFO L273 TraceCheckUtils]: 22: Hoare triple {57988#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {57988#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:43,015 INFO L273 TraceCheckUtils]: 23: Hoare triple {57988#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {57988#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:43,015 INFO L273 TraceCheckUtils]: 24: Hoare triple {57988#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {57989#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:43,016 INFO L273 TraceCheckUtils]: 25: Hoare triple {57989#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {57989#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:43,016 INFO L273 TraceCheckUtils]: 26: Hoare triple {57989#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {57989#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:43,017 INFO L273 TraceCheckUtils]: 27: Hoare triple {57989#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {57990#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:43,017 INFO L273 TraceCheckUtils]: 28: Hoare triple {57990#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {57990#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:43,018 INFO L273 TraceCheckUtils]: 29: Hoare triple {57990#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {57990#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:43,019 INFO L273 TraceCheckUtils]: 30: Hoare triple {57990#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {57991#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:43,019 INFO L273 TraceCheckUtils]: 31: Hoare triple {57991#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {57991#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:43,020 INFO L273 TraceCheckUtils]: 32: Hoare triple {57991#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {57991#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:43,020 INFO L273 TraceCheckUtils]: 33: Hoare triple {57991#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {57992#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:43,021 INFO L273 TraceCheckUtils]: 34: Hoare triple {57992#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {57992#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:43,021 INFO L273 TraceCheckUtils]: 35: Hoare triple {57992#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {57992#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:43,022 INFO L273 TraceCheckUtils]: 36: Hoare triple {57992#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {57993#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:43,023 INFO L273 TraceCheckUtils]: 37: Hoare triple {57993#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {57993#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:43,023 INFO L273 TraceCheckUtils]: 38: Hoare triple {57993#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {57993#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:43,024 INFO L273 TraceCheckUtils]: 39: Hoare triple {57993#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {57994#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:43,024 INFO L273 TraceCheckUtils]: 40: Hoare triple {57994#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {57994#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:43,025 INFO L273 TraceCheckUtils]: 41: Hoare triple {57994#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {57994#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:43,026 INFO L273 TraceCheckUtils]: 42: Hoare triple {57994#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {57995#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:43,026 INFO L273 TraceCheckUtils]: 43: Hoare triple {57995#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {57995#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:43,027 INFO L273 TraceCheckUtils]: 44: Hoare triple {57995#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {57995#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:43,027 INFO L273 TraceCheckUtils]: 45: Hoare triple {57995#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {57996#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:43,028 INFO L273 TraceCheckUtils]: 46: Hoare triple {57996#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {57996#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:43,028 INFO L273 TraceCheckUtils]: 47: Hoare triple {57996#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {57996#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:43,029 INFO L273 TraceCheckUtils]: 48: Hoare triple {57996#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {57997#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:43,030 INFO L273 TraceCheckUtils]: 49: Hoare triple {57997#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {57997#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:43,030 INFO L273 TraceCheckUtils]: 50: Hoare triple {57997#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {57997#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:43,031 INFO L273 TraceCheckUtils]: 51: Hoare triple {57997#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {57998#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:43,031 INFO L273 TraceCheckUtils]: 52: Hoare triple {57998#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {57998#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:43,032 INFO L273 TraceCheckUtils]: 53: Hoare triple {57998#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {57998#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:43,032 INFO L273 TraceCheckUtils]: 54: Hoare triple {57998#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {57999#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:43,033 INFO L273 TraceCheckUtils]: 55: Hoare triple {57999#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {57999#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:43,033 INFO L273 TraceCheckUtils]: 56: Hoare triple {57999#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {57999#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:43,034 INFO L273 TraceCheckUtils]: 57: Hoare triple {57999#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {58000#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:43,035 INFO L273 TraceCheckUtils]: 58: Hoare triple {58000#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {58000#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:43,035 INFO L273 TraceCheckUtils]: 59: Hoare triple {58000#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {58000#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:43,036 INFO L273 TraceCheckUtils]: 60: Hoare triple {58000#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {58001#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:43,036 INFO L273 TraceCheckUtils]: 61: Hoare triple {58001#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {58001#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:43,037 INFO L273 TraceCheckUtils]: 62: Hoare triple {58001#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {58001#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:43,038 INFO L273 TraceCheckUtils]: 63: Hoare triple {58001#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {58002#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:43,038 INFO L273 TraceCheckUtils]: 64: Hoare triple {58002#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {58002#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:43,039 INFO L273 TraceCheckUtils]: 65: Hoare triple {58002#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {58002#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:43,039 INFO L273 TraceCheckUtils]: 66: Hoare triple {58002#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {58003#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:43,040 INFO L273 TraceCheckUtils]: 67: Hoare triple {58003#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {58003#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:43,040 INFO L273 TraceCheckUtils]: 68: Hoare triple {58003#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {58003#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:43,041 INFO L273 TraceCheckUtils]: 69: Hoare triple {58003#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {58004#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:43,042 INFO L273 TraceCheckUtils]: 70: Hoare triple {58004#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {58004#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:43,042 INFO L273 TraceCheckUtils]: 71: Hoare triple {58004#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {58004#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:43,043 INFO L273 TraceCheckUtils]: 72: Hoare triple {58004#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {58005#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:43,043 INFO L273 TraceCheckUtils]: 73: Hoare triple {58005#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {58005#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:43,044 INFO L273 TraceCheckUtils]: 74: Hoare triple {58005#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {58005#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:43,045 INFO L273 TraceCheckUtils]: 75: Hoare triple {58005#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {58006#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:43,045 INFO L273 TraceCheckUtils]: 76: Hoare triple {58006#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {58006#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:43,046 INFO L273 TraceCheckUtils]: 77: Hoare triple {58006#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {58006#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:43,046 INFO L273 TraceCheckUtils]: 78: Hoare triple {58006#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {58007#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:43,047 INFO L273 TraceCheckUtils]: 79: Hoare triple {58007#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {58007#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:43,047 INFO L273 TraceCheckUtils]: 80: Hoare triple {58007#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {58007#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:43,048 INFO L273 TraceCheckUtils]: 81: Hoare triple {58007#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {58008#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:43,049 INFO L273 TraceCheckUtils]: 82: Hoare triple {58008#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {58008#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:43,049 INFO L273 TraceCheckUtils]: 83: Hoare triple {58008#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {58008#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:43,050 INFO L273 TraceCheckUtils]: 84: Hoare triple {58008#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {58009#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:43,050 INFO L273 TraceCheckUtils]: 85: Hoare triple {58009#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {58009#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:43,051 INFO L273 TraceCheckUtils]: 86: Hoare triple {58009#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {58009#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:43,052 INFO L273 TraceCheckUtils]: 87: Hoare triple {58009#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {58010#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:43,052 INFO L273 TraceCheckUtils]: 88: Hoare triple {58010#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {58010#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:43,053 INFO L273 TraceCheckUtils]: 89: Hoare triple {58010#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {58010#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:43,053 INFO L273 TraceCheckUtils]: 90: Hoare triple {58010#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {58011#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:43,054 INFO L273 TraceCheckUtils]: 91: Hoare triple {58011#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {58011#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:43,054 INFO L273 TraceCheckUtils]: 92: Hoare triple {58011#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {58011#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:43,055 INFO L273 TraceCheckUtils]: 93: Hoare triple {58011#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {58012#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:43,055 INFO L273 TraceCheckUtils]: 94: Hoare triple {58012#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {58012#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:43,056 INFO L273 TraceCheckUtils]: 95: Hoare triple {58012#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {58012#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:43,057 INFO L273 TraceCheckUtils]: 96: Hoare triple {58012#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {58013#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:43,057 INFO L273 TraceCheckUtils]: 97: Hoare triple {58013#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {58013#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:43,058 INFO L273 TraceCheckUtils]: 98: Hoare triple {58013#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {58013#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:43,058 INFO L273 TraceCheckUtils]: 99: Hoare triple {58013#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {58014#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:43,059 INFO L273 TraceCheckUtils]: 100: Hoare triple {58014#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {58014#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:43,059 INFO L273 TraceCheckUtils]: 101: Hoare triple {58014#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {58014#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:43,060 INFO L273 TraceCheckUtils]: 102: Hoare triple {58014#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {58015#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:43,061 INFO L273 TraceCheckUtils]: 103: Hoare triple {58015#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {58015#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:43,061 INFO L273 TraceCheckUtils]: 104: Hoare triple {58015#(<= main_~i~0 33)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {58015#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:43,062 INFO L273 TraceCheckUtils]: 105: Hoare triple {58015#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {58016#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:43,062 INFO L273 TraceCheckUtils]: 106: Hoare triple {58016#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {58016#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:43,063 INFO L273 TraceCheckUtils]: 107: Hoare triple {58016#(<= main_~i~0 34)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {58016#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:43,064 INFO L273 TraceCheckUtils]: 108: Hoare triple {58016#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {58017#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:43,064 INFO L273 TraceCheckUtils]: 109: Hoare triple {58017#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {58017#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:43,065 INFO L273 TraceCheckUtils]: 110: Hoare triple {58017#(<= main_~i~0 35)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {58017#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:43,065 INFO L273 TraceCheckUtils]: 111: Hoare triple {58017#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {58018#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:43,066 INFO L273 TraceCheckUtils]: 112: Hoare triple {58018#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {58018#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:43,066 INFO L273 TraceCheckUtils]: 113: Hoare triple {58018#(<= main_~i~0 36)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {58018#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:43,067 INFO L273 TraceCheckUtils]: 114: Hoare triple {58018#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {58019#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:43,068 INFO L273 TraceCheckUtils]: 115: Hoare triple {58019#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {58019#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:43,068 INFO L273 TraceCheckUtils]: 116: Hoare triple {58019#(<= main_~i~0 37)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {58019#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:43,069 INFO L273 TraceCheckUtils]: 117: Hoare triple {58019#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {58020#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:43,069 INFO L273 TraceCheckUtils]: 118: Hoare triple {58020#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {58020#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:43,070 INFO L273 TraceCheckUtils]: 119: Hoare triple {58020#(<= main_~i~0 38)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {58020#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:43,071 INFO L273 TraceCheckUtils]: 120: Hoare triple {58020#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {58021#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:43,071 INFO L273 TraceCheckUtils]: 121: Hoare triple {58021#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {58021#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:43,072 INFO L273 TraceCheckUtils]: 122: Hoare triple {58021#(<= main_~i~0 39)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {58021#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:43,072 INFO L273 TraceCheckUtils]: 123: Hoare triple {58021#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {58022#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:43,073 INFO L273 TraceCheckUtils]: 124: Hoare triple {58022#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {58022#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:43,073 INFO L273 TraceCheckUtils]: 125: Hoare triple {58022#(<= main_~i~0 40)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {58022#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:43,074 INFO L273 TraceCheckUtils]: 126: Hoare triple {58022#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {58023#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:43,075 INFO L273 TraceCheckUtils]: 127: Hoare triple {58023#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {58023#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:43,075 INFO L273 TraceCheckUtils]: 128: Hoare triple {58023#(<= main_~i~0 41)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {58023#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:43,076 INFO L273 TraceCheckUtils]: 129: Hoare triple {58023#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {58024#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:43,076 INFO L273 TraceCheckUtils]: 130: Hoare triple {58024#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {58024#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:43,077 INFO L273 TraceCheckUtils]: 131: Hoare triple {58024#(<= main_~i~0 42)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {58024#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:43,078 INFO L273 TraceCheckUtils]: 132: Hoare triple {58024#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {58025#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:43,078 INFO L273 TraceCheckUtils]: 133: Hoare triple {58025#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {58025#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:43,079 INFO L273 TraceCheckUtils]: 134: Hoare triple {58025#(<= main_~i~0 43)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {58025#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:43,079 INFO L273 TraceCheckUtils]: 135: Hoare triple {58025#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {58026#(<= main_~i~0 44)} is VALID [2018-11-23 11:53:43,080 INFO L273 TraceCheckUtils]: 136: Hoare triple {58026#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {58026#(<= main_~i~0 44)} is VALID [2018-11-23 11:53:43,080 INFO L273 TraceCheckUtils]: 137: Hoare triple {58026#(<= main_~i~0 44)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {58026#(<= main_~i~0 44)} is VALID [2018-11-23 11:53:43,081 INFO L273 TraceCheckUtils]: 138: Hoare triple {58026#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {58027#(<= main_~i~0 45)} is VALID [2018-11-23 11:53:43,081 INFO L273 TraceCheckUtils]: 139: Hoare triple {58027#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {58027#(<= main_~i~0 45)} is VALID [2018-11-23 11:53:43,082 INFO L273 TraceCheckUtils]: 140: Hoare triple {58027#(<= main_~i~0 45)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {58027#(<= main_~i~0 45)} is VALID [2018-11-23 11:53:43,083 INFO L273 TraceCheckUtils]: 141: Hoare triple {58027#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {58028#(<= main_~i~0 46)} is VALID [2018-11-23 11:53:43,083 INFO L273 TraceCheckUtils]: 142: Hoare triple {58028#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {58028#(<= main_~i~0 46)} is VALID [2018-11-23 11:53:43,084 INFO L273 TraceCheckUtils]: 143: Hoare triple {58028#(<= main_~i~0 46)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {58028#(<= main_~i~0 46)} is VALID [2018-11-23 11:53:43,084 INFO L273 TraceCheckUtils]: 144: Hoare triple {58028#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {58029#(<= main_~i~0 47)} is VALID [2018-11-23 11:53:43,085 INFO L273 TraceCheckUtils]: 145: Hoare triple {58029#(<= main_~i~0 47)} assume !(~i~0 < 100000); {57982#false} is VALID [2018-11-23 11:53:43,085 INFO L273 TraceCheckUtils]: 146: Hoare triple {57982#false} assume !(0 != ~swapped~0); {57982#false} is VALID [2018-11-23 11:53:43,085 INFO L273 TraceCheckUtils]: 147: Hoare triple {57982#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {57982#false} is VALID [2018-11-23 11:53:43,086 INFO L273 TraceCheckUtils]: 148: Hoare triple {57982#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {57982#false} is VALID [2018-11-23 11:53:43,086 INFO L273 TraceCheckUtils]: 149: Hoare triple {57982#false} assume !!(~y~0 < 100000);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); {57982#false} is VALID [2018-11-23 11:53:43,086 INFO L256 TraceCheckUtils]: 150: Hoare triple {57982#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {57982#false} is VALID [2018-11-23 11:53:43,086 INFO L273 TraceCheckUtils]: 151: Hoare triple {57982#false} ~cond := #in~cond; {57982#false} is VALID [2018-11-23 11:53:43,086 INFO L273 TraceCheckUtils]: 152: Hoare triple {57982#false} assume 0 == ~cond; {57982#false} is VALID [2018-11-23 11:53:43,087 INFO L273 TraceCheckUtils]: 153: Hoare triple {57982#false} assume !false; {57982#false} is VALID [2018-11-23 11:53:43,102 INFO L134 CoverageAnalysis]: Checked inductivity of 3152 backedges. 1 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:53:43,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:43,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 50 [2018-11-23 11:53:43,122 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 154 [2018-11-23 11:53:43,122 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:43,122 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states. [2018-11-23 11:53:43,275 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:43,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-23 11:53:43,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-23 11:53:43,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-11-23 11:53:43,277 INFO L87 Difference]: Start difference. First operand 297 states and 392 transitions. Second operand 50 states. [2018-11-23 11:53:44,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:44,627 INFO L93 Difference]: Finished difference Result 598 states and 794 transitions. [2018-11-23 11:53:44,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-23 11:53:44,627 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 154 [2018-11-23 11:53:44,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:44,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 11:53:44,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 237 transitions. [2018-11-23 11:53:44,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 11:53:44,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 237 transitions. [2018-11-23 11:53:44,630 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states and 237 transitions. [2018-11-23 11:53:44,869 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 237 edges. 237 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:44,876 INFO L225 Difference]: With dead ends: 598 [2018-11-23 11:53:44,876 INFO L226 Difference]: Without dead ends: 307 [2018-11-23 11:53:44,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-11-23 11:53:44,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-11-23 11:53:45,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 303. [2018-11-23 11:53:45,010 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:45,010 INFO L82 GeneralOperation]: Start isEquivalent. First operand 307 states. Second operand 303 states. [2018-11-23 11:53:45,010 INFO L74 IsIncluded]: Start isIncluded. First operand 307 states. Second operand 303 states. [2018-11-23 11:53:45,010 INFO L87 Difference]: Start difference. First operand 307 states. Second operand 303 states. [2018-11-23 11:53:45,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:45,017 INFO L93 Difference]: Finished difference Result 307 states and 406 transitions. [2018-11-23 11:53:45,017 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 406 transitions. [2018-11-23 11:53:45,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:45,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:45,017 INFO L74 IsIncluded]: Start isIncluded. First operand 303 states. Second operand 307 states. [2018-11-23 11:53:45,017 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 307 states. [2018-11-23 11:53:45,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:45,023 INFO L93 Difference]: Finished difference Result 307 states and 406 transitions. [2018-11-23 11:53:45,023 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 406 transitions. [2018-11-23 11:53:45,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:45,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:45,023 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:45,023 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:45,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-11-23 11:53:45,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 400 transitions. [2018-11-23 11:53:45,029 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 400 transitions. Word has length 154 [2018-11-23 11:53:45,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:45,029 INFO L480 AbstractCegarLoop]: Abstraction has 303 states and 400 transitions. [2018-11-23 11:53:45,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-23 11:53:45,029 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 400 transitions. [2018-11-23 11:53:45,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-11-23 11:53:45,030 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:45,030 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:53:45,030 INFO L423 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:45,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:45,030 INFO L82 PathProgramCache]: Analyzing trace with hash -406516056, now seen corresponding path program 47 times [2018-11-23 11:53:45,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:45,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:45,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:45,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:45,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:45,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:46,453 INFO L256 TraceCheckUtils]: 0: Hoare triple {60316#true} call ULTIMATE.init(); {60316#true} is VALID [2018-11-23 11:53:46,454 INFO L273 TraceCheckUtils]: 1: Hoare triple {60316#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {60316#true} is VALID [2018-11-23 11:53:46,454 INFO L273 TraceCheckUtils]: 2: Hoare triple {60316#true} assume true; {60316#true} is VALID [2018-11-23 11:53:46,454 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {60316#true} {60316#true} #79#return; {60316#true} is VALID [2018-11-23 11:53:46,454 INFO L256 TraceCheckUtils]: 4: Hoare triple {60316#true} call #t~ret8 := main(); {60316#true} is VALID [2018-11-23 11:53:46,454 INFO L273 TraceCheckUtils]: 5: Hoare triple {60316#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {60316#true} is VALID [2018-11-23 11:53:46,455 INFO L273 TraceCheckUtils]: 6: Hoare triple {60316#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {60318#(= main_~i~0 1)} is VALID [2018-11-23 11:53:46,455 INFO L273 TraceCheckUtils]: 7: Hoare triple {60318#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60318#(= main_~i~0 1)} is VALID [2018-11-23 11:53:46,456 INFO L273 TraceCheckUtils]: 8: Hoare triple {60318#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60318#(= main_~i~0 1)} is VALID [2018-11-23 11:53:46,456 INFO L273 TraceCheckUtils]: 9: Hoare triple {60318#(= main_~i~0 1)} ~i~0 := 1 + ~i~0; {60319#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:46,457 INFO L273 TraceCheckUtils]: 10: Hoare triple {60319#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60319#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:46,457 INFO L273 TraceCheckUtils]: 11: Hoare triple {60319#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60319#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:46,457 INFO L273 TraceCheckUtils]: 12: Hoare triple {60319#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {60320#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:46,458 INFO L273 TraceCheckUtils]: 13: Hoare triple {60320#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60320#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:46,458 INFO L273 TraceCheckUtils]: 14: Hoare triple {60320#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60320#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:46,459 INFO L273 TraceCheckUtils]: 15: Hoare triple {60320#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {60321#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:46,459 INFO L273 TraceCheckUtils]: 16: Hoare triple {60321#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60321#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:46,460 INFO L273 TraceCheckUtils]: 17: Hoare triple {60321#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60321#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:46,460 INFO L273 TraceCheckUtils]: 18: Hoare triple {60321#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {60322#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:46,461 INFO L273 TraceCheckUtils]: 19: Hoare triple {60322#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60322#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:46,461 INFO L273 TraceCheckUtils]: 20: Hoare triple {60322#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60322#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:46,462 INFO L273 TraceCheckUtils]: 21: Hoare triple {60322#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {60323#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:46,463 INFO L273 TraceCheckUtils]: 22: Hoare triple {60323#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60323#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:46,463 INFO L273 TraceCheckUtils]: 23: Hoare triple {60323#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60323#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:46,464 INFO L273 TraceCheckUtils]: 24: Hoare triple {60323#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {60324#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:46,464 INFO L273 TraceCheckUtils]: 25: Hoare triple {60324#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60324#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:46,465 INFO L273 TraceCheckUtils]: 26: Hoare triple {60324#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60324#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:46,466 INFO L273 TraceCheckUtils]: 27: Hoare triple {60324#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {60325#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:46,466 INFO L273 TraceCheckUtils]: 28: Hoare triple {60325#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60325#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:46,467 INFO L273 TraceCheckUtils]: 29: Hoare triple {60325#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60325#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:46,467 INFO L273 TraceCheckUtils]: 30: Hoare triple {60325#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {60326#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:46,468 INFO L273 TraceCheckUtils]: 31: Hoare triple {60326#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60326#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:46,468 INFO L273 TraceCheckUtils]: 32: Hoare triple {60326#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60326#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:46,469 INFO L273 TraceCheckUtils]: 33: Hoare triple {60326#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {60327#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:46,470 INFO L273 TraceCheckUtils]: 34: Hoare triple {60327#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60327#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:46,470 INFO L273 TraceCheckUtils]: 35: Hoare triple {60327#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60327#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:46,471 INFO L273 TraceCheckUtils]: 36: Hoare triple {60327#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {60328#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:46,471 INFO L273 TraceCheckUtils]: 37: Hoare triple {60328#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60328#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:46,472 INFO L273 TraceCheckUtils]: 38: Hoare triple {60328#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60328#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:46,472 INFO L273 TraceCheckUtils]: 39: Hoare triple {60328#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {60329#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:46,473 INFO L273 TraceCheckUtils]: 40: Hoare triple {60329#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60329#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:46,473 INFO L273 TraceCheckUtils]: 41: Hoare triple {60329#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60329#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:46,474 INFO L273 TraceCheckUtils]: 42: Hoare triple {60329#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {60330#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:46,475 INFO L273 TraceCheckUtils]: 43: Hoare triple {60330#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60330#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:46,475 INFO L273 TraceCheckUtils]: 44: Hoare triple {60330#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60330#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:46,476 INFO L273 TraceCheckUtils]: 45: Hoare triple {60330#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {60331#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:46,476 INFO L273 TraceCheckUtils]: 46: Hoare triple {60331#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60331#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:46,477 INFO L273 TraceCheckUtils]: 47: Hoare triple {60331#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60331#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:46,478 INFO L273 TraceCheckUtils]: 48: Hoare triple {60331#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {60332#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:46,478 INFO L273 TraceCheckUtils]: 49: Hoare triple {60332#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60332#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:46,479 INFO L273 TraceCheckUtils]: 50: Hoare triple {60332#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60332#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:46,479 INFO L273 TraceCheckUtils]: 51: Hoare triple {60332#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {60333#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:46,480 INFO L273 TraceCheckUtils]: 52: Hoare triple {60333#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60333#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:46,480 INFO L273 TraceCheckUtils]: 53: Hoare triple {60333#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60333#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:46,481 INFO L273 TraceCheckUtils]: 54: Hoare triple {60333#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {60334#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:46,482 INFO L273 TraceCheckUtils]: 55: Hoare triple {60334#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60334#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:46,482 INFO L273 TraceCheckUtils]: 56: Hoare triple {60334#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60334#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:46,483 INFO L273 TraceCheckUtils]: 57: Hoare triple {60334#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {60335#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:46,483 INFO L273 TraceCheckUtils]: 58: Hoare triple {60335#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60335#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:46,484 INFO L273 TraceCheckUtils]: 59: Hoare triple {60335#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60335#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:46,485 INFO L273 TraceCheckUtils]: 60: Hoare triple {60335#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {60336#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:46,485 INFO L273 TraceCheckUtils]: 61: Hoare triple {60336#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60336#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:46,486 INFO L273 TraceCheckUtils]: 62: Hoare triple {60336#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60336#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:46,486 INFO L273 TraceCheckUtils]: 63: Hoare triple {60336#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {60337#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:46,487 INFO L273 TraceCheckUtils]: 64: Hoare triple {60337#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60337#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:46,487 INFO L273 TraceCheckUtils]: 65: Hoare triple {60337#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60337#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:46,488 INFO L273 TraceCheckUtils]: 66: Hoare triple {60337#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {60338#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:46,488 INFO L273 TraceCheckUtils]: 67: Hoare triple {60338#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60338#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:46,489 INFO L273 TraceCheckUtils]: 68: Hoare triple {60338#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60338#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:46,490 INFO L273 TraceCheckUtils]: 69: Hoare triple {60338#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {60339#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:46,490 INFO L273 TraceCheckUtils]: 70: Hoare triple {60339#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60339#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:46,491 INFO L273 TraceCheckUtils]: 71: Hoare triple {60339#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60339#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:46,491 INFO L273 TraceCheckUtils]: 72: Hoare triple {60339#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {60340#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:46,492 INFO L273 TraceCheckUtils]: 73: Hoare triple {60340#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60340#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:46,492 INFO L273 TraceCheckUtils]: 74: Hoare triple {60340#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60340#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:46,493 INFO L273 TraceCheckUtils]: 75: Hoare triple {60340#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {60341#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:46,494 INFO L273 TraceCheckUtils]: 76: Hoare triple {60341#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60341#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:46,494 INFO L273 TraceCheckUtils]: 77: Hoare triple {60341#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60341#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:46,495 INFO L273 TraceCheckUtils]: 78: Hoare triple {60341#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {60342#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:46,495 INFO L273 TraceCheckUtils]: 79: Hoare triple {60342#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60342#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:46,496 INFO L273 TraceCheckUtils]: 80: Hoare triple {60342#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60342#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:46,497 INFO L273 TraceCheckUtils]: 81: Hoare triple {60342#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {60343#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:46,497 INFO L273 TraceCheckUtils]: 82: Hoare triple {60343#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60343#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:46,498 INFO L273 TraceCheckUtils]: 83: Hoare triple {60343#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60343#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:46,498 INFO L273 TraceCheckUtils]: 84: Hoare triple {60343#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {60344#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:46,499 INFO L273 TraceCheckUtils]: 85: Hoare triple {60344#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60344#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:46,499 INFO L273 TraceCheckUtils]: 86: Hoare triple {60344#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60344#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:46,500 INFO L273 TraceCheckUtils]: 87: Hoare triple {60344#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {60345#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:46,501 INFO L273 TraceCheckUtils]: 88: Hoare triple {60345#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60345#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:46,501 INFO L273 TraceCheckUtils]: 89: Hoare triple {60345#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60345#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:46,502 INFO L273 TraceCheckUtils]: 90: Hoare triple {60345#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {60346#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:46,502 INFO L273 TraceCheckUtils]: 91: Hoare triple {60346#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60346#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:46,503 INFO L273 TraceCheckUtils]: 92: Hoare triple {60346#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60346#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:46,503 INFO L273 TraceCheckUtils]: 93: Hoare triple {60346#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {60347#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:46,504 INFO L273 TraceCheckUtils]: 94: Hoare triple {60347#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60347#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:46,504 INFO L273 TraceCheckUtils]: 95: Hoare triple {60347#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60347#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:46,505 INFO L273 TraceCheckUtils]: 96: Hoare triple {60347#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {60348#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:46,506 INFO L273 TraceCheckUtils]: 97: Hoare triple {60348#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60348#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:46,506 INFO L273 TraceCheckUtils]: 98: Hoare triple {60348#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60348#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:46,507 INFO L273 TraceCheckUtils]: 99: Hoare triple {60348#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {60349#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:46,507 INFO L273 TraceCheckUtils]: 100: Hoare triple {60349#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60349#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:46,508 INFO L273 TraceCheckUtils]: 101: Hoare triple {60349#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60349#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:46,509 INFO L273 TraceCheckUtils]: 102: Hoare triple {60349#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {60350#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:46,509 INFO L273 TraceCheckUtils]: 103: Hoare triple {60350#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60350#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:46,510 INFO L273 TraceCheckUtils]: 104: Hoare triple {60350#(<= main_~i~0 33)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60350#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:46,510 INFO L273 TraceCheckUtils]: 105: Hoare triple {60350#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {60351#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:46,511 INFO L273 TraceCheckUtils]: 106: Hoare triple {60351#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60351#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:46,511 INFO L273 TraceCheckUtils]: 107: Hoare triple {60351#(<= main_~i~0 34)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60351#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:46,512 INFO L273 TraceCheckUtils]: 108: Hoare triple {60351#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {60352#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:46,513 INFO L273 TraceCheckUtils]: 109: Hoare triple {60352#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60352#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:46,513 INFO L273 TraceCheckUtils]: 110: Hoare triple {60352#(<= main_~i~0 35)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60352#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:46,514 INFO L273 TraceCheckUtils]: 111: Hoare triple {60352#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {60353#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:46,514 INFO L273 TraceCheckUtils]: 112: Hoare triple {60353#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60353#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:46,515 INFO L273 TraceCheckUtils]: 113: Hoare triple {60353#(<= main_~i~0 36)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60353#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:46,516 INFO L273 TraceCheckUtils]: 114: Hoare triple {60353#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {60354#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:46,516 INFO L273 TraceCheckUtils]: 115: Hoare triple {60354#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60354#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:46,517 INFO L273 TraceCheckUtils]: 116: Hoare triple {60354#(<= main_~i~0 37)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60354#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:46,517 INFO L273 TraceCheckUtils]: 117: Hoare triple {60354#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {60355#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:46,518 INFO L273 TraceCheckUtils]: 118: Hoare triple {60355#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60355#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:46,518 INFO L273 TraceCheckUtils]: 119: Hoare triple {60355#(<= main_~i~0 38)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60355#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:46,519 INFO L273 TraceCheckUtils]: 120: Hoare triple {60355#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {60356#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:46,519 INFO L273 TraceCheckUtils]: 121: Hoare triple {60356#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60356#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:46,520 INFO L273 TraceCheckUtils]: 122: Hoare triple {60356#(<= main_~i~0 39)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60356#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:46,521 INFO L273 TraceCheckUtils]: 123: Hoare triple {60356#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {60357#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:46,521 INFO L273 TraceCheckUtils]: 124: Hoare triple {60357#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60357#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:46,522 INFO L273 TraceCheckUtils]: 125: Hoare triple {60357#(<= main_~i~0 40)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60357#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:46,522 INFO L273 TraceCheckUtils]: 126: Hoare triple {60357#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {60358#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:46,523 INFO L273 TraceCheckUtils]: 127: Hoare triple {60358#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60358#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:46,523 INFO L273 TraceCheckUtils]: 128: Hoare triple {60358#(<= main_~i~0 41)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60358#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:46,524 INFO L273 TraceCheckUtils]: 129: Hoare triple {60358#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {60359#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:46,525 INFO L273 TraceCheckUtils]: 130: Hoare triple {60359#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60359#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:46,525 INFO L273 TraceCheckUtils]: 131: Hoare triple {60359#(<= main_~i~0 42)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60359#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:46,526 INFO L273 TraceCheckUtils]: 132: Hoare triple {60359#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {60360#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:46,526 INFO L273 TraceCheckUtils]: 133: Hoare triple {60360#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60360#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:46,527 INFO L273 TraceCheckUtils]: 134: Hoare triple {60360#(<= main_~i~0 43)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60360#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:46,528 INFO L273 TraceCheckUtils]: 135: Hoare triple {60360#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {60361#(<= main_~i~0 44)} is VALID [2018-11-23 11:53:46,528 INFO L273 TraceCheckUtils]: 136: Hoare triple {60361#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60361#(<= main_~i~0 44)} is VALID [2018-11-23 11:53:46,529 INFO L273 TraceCheckUtils]: 137: Hoare triple {60361#(<= main_~i~0 44)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60361#(<= main_~i~0 44)} is VALID [2018-11-23 11:53:46,529 INFO L273 TraceCheckUtils]: 138: Hoare triple {60361#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {60362#(<= main_~i~0 45)} is VALID [2018-11-23 11:53:46,530 INFO L273 TraceCheckUtils]: 139: Hoare triple {60362#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60362#(<= main_~i~0 45)} is VALID [2018-11-23 11:53:46,530 INFO L273 TraceCheckUtils]: 140: Hoare triple {60362#(<= main_~i~0 45)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60362#(<= main_~i~0 45)} is VALID [2018-11-23 11:53:46,531 INFO L273 TraceCheckUtils]: 141: Hoare triple {60362#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {60363#(<= main_~i~0 46)} is VALID [2018-11-23 11:53:46,532 INFO L273 TraceCheckUtils]: 142: Hoare triple {60363#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60363#(<= main_~i~0 46)} is VALID [2018-11-23 11:53:46,532 INFO L273 TraceCheckUtils]: 143: Hoare triple {60363#(<= main_~i~0 46)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60363#(<= main_~i~0 46)} is VALID [2018-11-23 11:53:46,533 INFO L273 TraceCheckUtils]: 144: Hoare triple {60363#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {60364#(<= main_~i~0 47)} is VALID [2018-11-23 11:53:46,533 INFO L273 TraceCheckUtils]: 145: Hoare triple {60364#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60364#(<= main_~i~0 47)} is VALID [2018-11-23 11:53:46,534 INFO L273 TraceCheckUtils]: 146: Hoare triple {60364#(<= main_~i~0 47)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60364#(<= main_~i~0 47)} is VALID [2018-11-23 11:53:46,534 INFO L273 TraceCheckUtils]: 147: Hoare triple {60364#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {60365#(<= main_~i~0 48)} is VALID [2018-11-23 11:53:46,535 INFO L273 TraceCheckUtils]: 148: Hoare triple {60365#(<= main_~i~0 48)} assume !(~i~0 < 100000); {60317#false} is VALID [2018-11-23 11:53:46,535 INFO L273 TraceCheckUtils]: 149: Hoare triple {60317#false} assume !(0 != ~swapped~0); {60317#false} is VALID [2018-11-23 11:53:46,536 INFO L273 TraceCheckUtils]: 150: Hoare triple {60317#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {60317#false} is VALID [2018-11-23 11:53:46,536 INFO L273 TraceCheckUtils]: 151: Hoare triple {60317#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {60317#false} is VALID [2018-11-23 11:53:46,536 INFO L273 TraceCheckUtils]: 152: Hoare triple {60317#false} assume !!(~y~0 < 100000);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); {60317#false} is VALID [2018-11-23 11:53:46,536 INFO L256 TraceCheckUtils]: 153: Hoare triple {60317#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {60317#false} is VALID [2018-11-23 11:53:46,536 INFO L273 TraceCheckUtils]: 154: Hoare triple {60317#false} ~cond := #in~cond; {60317#false} is VALID [2018-11-23 11:53:46,536 INFO L273 TraceCheckUtils]: 155: Hoare triple {60317#false} assume 0 == ~cond; {60317#false} is VALID [2018-11-23 11:53:46,537 INFO L273 TraceCheckUtils]: 156: Hoare triple {60317#false} assume !false; {60317#false} is VALID [2018-11-23 11:53:46,552 INFO L134 CoverageAnalysis]: Checked inductivity of 3291 backedges. 1 proven. 3290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:53:46,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:46,553 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:53:46,569 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:53:46,894 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-11-23 11:53:46,895 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:46,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:46,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:47,427 INFO L256 TraceCheckUtils]: 0: Hoare triple {60316#true} call ULTIMATE.init(); {60316#true} is VALID [2018-11-23 11:53:47,427 INFO L273 TraceCheckUtils]: 1: Hoare triple {60316#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {60316#true} is VALID [2018-11-23 11:53:47,427 INFO L273 TraceCheckUtils]: 2: Hoare triple {60316#true} assume true; {60316#true} is VALID [2018-11-23 11:53:47,427 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {60316#true} {60316#true} #79#return; {60316#true} is VALID [2018-11-23 11:53:47,427 INFO L256 TraceCheckUtils]: 4: Hoare triple {60316#true} call #t~ret8 := main(); {60316#true} is VALID [2018-11-23 11:53:47,428 INFO L273 TraceCheckUtils]: 5: Hoare triple {60316#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {60316#true} is VALID [2018-11-23 11:53:47,428 INFO L273 TraceCheckUtils]: 6: Hoare triple {60316#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {60387#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:47,429 INFO L273 TraceCheckUtils]: 7: Hoare triple {60387#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60387#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:47,429 INFO L273 TraceCheckUtils]: 8: Hoare triple {60387#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60387#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:47,430 INFO L273 TraceCheckUtils]: 9: Hoare triple {60387#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {60319#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:47,430 INFO L273 TraceCheckUtils]: 10: Hoare triple {60319#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60319#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:47,430 INFO L273 TraceCheckUtils]: 11: Hoare triple {60319#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60319#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:47,431 INFO L273 TraceCheckUtils]: 12: Hoare triple {60319#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {60320#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:47,431 INFO L273 TraceCheckUtils]: 13: Hoare triple {60320#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60320#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:47,431 INFO L273 TraceCheckUtils]: 14: Hoare triple {60320#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60320#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:47,432 INFO L273 TraceCheckUtils]: 15: Hoare triple {60320#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {60321#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:47,433 INFO L273 TraceCheckUtils]: 16: Hoare triple {60321#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60321#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:47,433 INFO L273 TraceCheckUtils]: 17: Hoare triple {60321#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60321#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:47,434 INFO L273 TraceCheckUtils]: 18: Hoare triple {60321#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {60322#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:47,434 INFO L273 TraceCheckUtils]: 19: Hoare triple {60322#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60322#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:47,435 INFO L273 TraceCheckUtils]: 20: Hoare triple {60322#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60322#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:47,436 INFO L273 TraceCheckUtils]: 21: Hoare triple {60322#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {60323#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:47,436 INFO L273 TraceCheckUtils]: 22: Hoare triple {60323#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60323#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:47,437 INFO L273 TraceCheckUtils]: 23: Hoare triple {60323#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60323#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:47,437 INFO L273 TraceCheckUtils]: 24: Hoare triple {60323#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {60324#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:47,438 INFO L273 TraceCheckUtils]: 25: Hoare triple {60324#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60324#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:47,438 INFO L273 TraceCheckUtils]: 26: Hoare triple {60324#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60324#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:47,439 INFO L273 TraceCheckUtils]: 27: Hoare triple {60324#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {60325#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:47,440 INFO L273 TraceCheckUtils]: 28: Hoare triple {60325#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60325#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:47,440 INFO L273 TraceCheckUtils]: 29: Hoare triple {60325#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60325#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:47,441 INFO L273 TraceCheckUtils]: 30: Hoare triple {60325#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {60326#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:47,442 INFO L273 TraceCheckUtils]: 31: Hoare triple {60326#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60326#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:47,442 INFO L273 TraceCheckUtils]: 32: Hoare triple {60326#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60326#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:47,443 INFO L273 TraceCheckUtils]: 33: Hoare triple {60326#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {60327#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:47,443 INFO L273 TraceCheckUtils]: 34: Hoare triple {60327#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60327#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:47,444 INFO L273 TraceCheckUtils]: 35: Hoare triple {60327#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60327#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:47,444 INFO L273 TraceCheckUtils]: 36: Hoare triple {60327#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {60328#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:47,445 INFO L273 TraceCheckUtils]: 37: Hoare triple {60328#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60328#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:47,445 INFO L273 TraceCheckUtils]: 38: Hoare triple {60328#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60328#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:47,446 INFO L273 TraceCheckUtils]: 39: Hoare triple {60328#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {60329#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:47,447 INFO L273 TraceCheckUtils]: 40: Hoare triple {60329#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60329#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:47,447 INFO L273 TraceCheckUtils]: 41: Hoare triple {60329#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60329#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:47,448 INFO L273 TraceCheckUtils]: 42: Hoare triple {60329#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {60330#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:47,448 INFO L273 TraceCheckUtils]: 43: Hoare triple {60330#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60330#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:47,449 INFO L273 TraceCheckUtils]: 44: Hoare triple {60330#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60330#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:47,450 INFO L273 TraceCheckUtils]: 45: Hoare triple {60330#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {60331#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:47,450 INFO L273 TraceCheckUtils]: 46: Hoare triple {60331#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60331#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:47,451 INFO L273 TraceCheckUtils]: 47: Hoare triple {60331#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60331#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:47,451 INFO L273 TraceCheckUtils]: 48: Hoare triple {60331#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {60332#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:47,452 INFO L273 TraceCheckUtils]: 49: Hoare triple {60332#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60332#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:47,452 INFO L273 TraceCheckUtils]: 50: Hoare triple {60332#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60332#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:47,453 INFO L273 TraceCheckUtils]: 51: Hoare triple {60332#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {60333#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:47,454 INFO L273 TraceCheckUtils]: 52: Hoare triple {60333#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60333#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:47,454 INFO L273 TraceCheckUtils]: 53: Hoare triple {60333#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60333#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:47,455 INFO L273 TraceCheckUtils]: 54: Hoare triple {60333#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {60334#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:47,455 INFO L273 TraceCheckUtils]: 55: Hoare triple {60334#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60334#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:47,456 INFO L273 TraceCheckUtils]: 56: Hoare triple {60334#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60334#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:47,457 INFO L273 TraceCheckUtils]: 57: Hoare triple {60334#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {60335#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:47,457 INFO L273 TraceCheckUtils]: 58: Hoare triple {60335#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60335#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:47,458 INFO L273 TraceCheckUtils]: 59: Hoare triple {60335#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60335#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:47,458 INFO L273 TraceCheckUtils]: 60: Hoare triple {60335#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {60336#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:47,459 INFO L273 TraceCheckUtils]: 61: Hoare triple {60336#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60336#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:47,459 INFO L273 TraceCheckUtils]: 62: Hoare triple {60336#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60336#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:47,460 INFO L273 TraceCheckUtils]: 63: Hoare triple {60336#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {60337#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:47,461 INFO L273 TraceCheckUtils]: 64: Hoare triple {60337#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60337#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:47,461 INFO L273 TraceCheckUtils]: 65: Hoare triple {60337#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60337#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:47,462 INFO L273 TraceCheckUtils]: 66: Hoare triple {60337#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {60338#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:47,462 INFO L273 TraceCheckUtils]: 67: Hoare triple {60338#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60338#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:47,463 INFO L273 TraceCheckUtils]: 68: Hoare triple {60338#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60338#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:47,463 INFO L273 TraceCheckUtils]: 69: Hoare triple {60338#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {60339#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:47,464 INFO L273 TraceCheckUtils]: 70: Hoare triple {60339#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60339#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:47,464 INFO L273 TraceCheckUtils]: 71: Hoare triple {60339#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60339#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:47,465 INFO L273 TraceCheckUtils]: 72: Hoare triple {60339#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {60340#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:47,466 INFO L273 TraceCheckUtils]: 73: Hoare triple {60340#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60340#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:47,466 INFO L273 TraceCheckUtils]: 74: Hoare triple {60340#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60340#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:47,467 INFO L273 TraceCheckUtils]: 75: Hoare triple {60340#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {60341#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:47,467 INFO L273 TraceCheckUtils]: 76: Hoare triple {60341#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60341#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:47,468 INFO L273 TraceCheckUtils]: 77: Hoare triple {60341#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60341#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:47,469 INFO L273 TraceCheckUtils]: 78: Hoare triple {60341#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {60342#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:47,469 INFO L273 TraceCheckUtils]: 79: Hoare triple {60342#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60342#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:47,470 INFO L273 TraceCheckUtils]: 80: Hoare triple {60342#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60342#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:47,470 INFO L273 TraceCheckUtils]: 81: Hoare triple {60342#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {60343#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:47,471 INFO L273 TraceCheckUtils]: 82: Hoare triple {60343#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60343#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:47,471 INFO L273 TraceCheckUtils]: 83: Hoare triple {60343#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60343#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:47,472 INFO L273 TraceCheckUtils]: 84: Hoare triple {60343#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {60344#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:47,473 INFO L273 TraceCheckUtils]: 85: Hoare triple {60344#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60344#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:47,473 INFO L273 TraceCheckUtils]: 86: Hoare triple {60344#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60344#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:47,474 INFO L273 TraceCheckUtils]: 87: Hoare triple {60344#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {60345#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:47,474 INFO L273 TraceCheckUtils]: 88: Hoare triple {60345#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60345#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:47,475 INFO L273 TraceCheckUtils]: 89: Hoare triple {60345#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60345#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:47,476 INFO L273 TraceCheckUtils]: 90: Hoare triple {60345#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {60346#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:47,476 INFO L273 TraceCheckUtils]: 91: Hoare triple {60346#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60346#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:47,477 INFO L273 TraceCheckUtils]: 92: Hoare triple {60346#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60346#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:47,477 INFO L273 TraceCheckUtils]: 93: Hoare triple {60346#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {60347#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:47,478 INFO L273 TraceCheckUtils]: 94: Hoare triple {60347#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60347#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:47,478 INFO L273 TraceCheckUtils]: 95: Hoare triple {60347#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60347#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:47,479 INFO L273 TraceCheckUtils]: 96: Hoare triple {60347#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {60348#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:47,480 INFO L273 TraceCheckUtils]: 97: Hoare triple {60348#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60348#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:47,480 INFO L273 TraceCheckUtils]: 98: Hoare triple {60348#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60348#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:47,481 INFO L273 TraceCheckUtils]: 99: Hoare triple {60348#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {60349#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:47,481 INFO L273 TraceCheckUtils]: 100: Hoare triple {60349#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60349#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:47,482 INFO L273 TraceCheckUtils]: 101: Hoare triple {60349#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60349#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:47,483 INFO L273 TraceCheckUtils]: 102: Hoare triple {60349#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {60350#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:47,483 INFO L273 TraceCheckUtils]: 103: Hoare triple {60350#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60350#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:47,484 INFO L273 TraceCheckUtils]: 104: Hoare triple {60350#(<= main_~i~0 33)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60350#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:47,484 INFO L273 TraceCheckUtils]: 105: Hoare triple {60350#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {60351#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:47,485 INFO L273 TraceCheckUtils]: 106: Hoare triple {60351#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60351#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:47,485 INFO L273 TraceCheckUtils]: 107: Hoare triple {60351#(<= main_~i~0 34)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60351#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:47,486 INFO L273 TraceCheckUtils]: 108: Hoare triple {60351#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {60352#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:47,486 INFO L273 TraceCheckUtils]: 109: Hoare triple {60352#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60352#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:47,487 INFO L273 TraceCheckUtils]: 110: Hoare triple {60352#(<= main_~i~0 35)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60352#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:47,488 INFO L273 TraceCheckUtils]: 111: Hoare triple {60352#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {60353#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:47,488 INFO L273 TraceCheckUtils]: 112: Hoare triple {60353#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60353#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:47,489 INFO L273 TraceCheckUtils]: 113: Hoare triple {60353#(<= main_~i~0 36)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60353#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:47,489 INFO L273 TraceCheckUtils]: 114: Hoare triple {60353#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {60354#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:47,490 INFO L273 TraceCheckUtils]: 115: Hoare triple {60354#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60354#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:47,490 INFO L273 TraceCheckUtils]: 116: Hoare triple {60354#(<= main_~i~0 37)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60354#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:47,491 INFO L273 TraceCheckUtils]: 117: Hoare triple {60354#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {60355#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:47,492 INFO L273 TraceCheckUtils]: 118: Hoare triple {60355#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60355#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:47,492 INFO L273 TraceCheckUtils]: 119: Hoare triple {60355#(<= main_~i~0 38)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60355#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:47,493 INFO L273 TraceCheckUtils]: 120: Hoare triple {60355#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {60356#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:47,493 INFO L273 TraceCheckUtils]: 121: Hoare triple {60356#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60356#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:47,494 INFO L273 TraceCheckUtils]: 122: Hoare triple {60356#(<= main_~i~0 39)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60356#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:47,495 INFO L273 TraceCheckUtils]: 123: Hoare triple {60356#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {60357#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:47,495 INFO L273 TraceCheckUtils]: 124: Hoare triple {60357#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60357#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:47,496 INFO L273 TraceCheckUtils]: 125: Hoare triple {60357#(<= main_~i~0 40)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60357#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:47,496 INFO L273 TraceCheckUtils]: 126: Hoare triple {60357#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {60358#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:47,497 INFO L273 TraceCheckUtils]: 127: Hoare triple {60358#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60358#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:47,497 INFO L273 TraceCheckUtils]: 128: Hoare triple {60358#(<= main_~i~0 41)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60358#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:47,498 INFO L273 TraceCheckUtils]: 129: Hoare triple {60358#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {60359#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:47,499 INFO L273 TraceCheckUtils]: 130: Hoare triple {60359#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60359#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:47,499 INFO L273 TraceCheckUtils]: 131: Hoare triple {60359#(<= main_~i~0 42)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60359#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:47,500 INFO L273 TraceCheckUtils]: 132: Hoare triple {60359#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {60360#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:47,500 INFO L273 TraceCheckUtils]: 133: Hoare triple {60360#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60360#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:47,501 INFO L273 TraceCheckUtils]: 134: Hoare triple {60360#(<= main_~i~0 43)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60360#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:47,502 INFO L273 TraceCheckUtils]: 135: Hoare triple {60360#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {60361#(<= main_~i~0 44)} is VALID [2018-11-23 11:53:47,502 INFO L273 TraceCheckUtils]: 136: Hoare triple {60361#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60361#(<= main_~i~0 44)} is VALID [2018-11-23 11:53:47,503 INFO L273 TraceCheckUtils]: 137: Hoare triple {60361#(<= main_~i~0 44)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60361#(<= main_~i~0 44)} is VALID [2018-11-23 11:53:47,503 INFO L273 TraceCheckUtils]: 138: Hoare triple {60361#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {60362#(<= main_~i~0 45)} is VALID [2018-11-23 11:53:47,504 INFO L273 TraceCheckUtils]: 139: Hoare triple {60362#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60362#(<= main_~i~0 45)} is VALID [2018-11-23 11:53:47,504 INFO L273 TraceCheckUtils]: 140: Hoare triple {60362#(<= main_~i~0 45)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60362#(<= main_~i~0 45)} is VALID [2018-11-23 11:53:47,505 INFO L273 TraceCheckUtils]: 141: Hoare triple {60362#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {60363#(<= main_~i~0 46)} is VALID [2018-11-23 11:53:47,505 INFO L273 TraceCheckUtils]: 142: Hoare triple {60363#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60363#(<= main_~i~0 46)} is VALID [2018-11-23 11:53:47,506 INFO L273 TraceCheckUtils]: 143: Hoare triple {60363#(<= main_~i~0 46)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60363#(<= main_~i~0 46)} is VALID [2018-11-23 11:53:47,507 INFO L273 TraceCheckUtils]: 144: Hoare triple {60363#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {60364#(<= main_~i~0 47)} is VALID [2018-11-23 11:53:47,507 INFO L273 TraceCheckUtils]: 145: Hoare triple {60364#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {60364#(<= main_~i~0 47)} is VALID [2018-11-23 11:53:47,508 INFO L273 TraceCheckUtils]: 146: Hoare triple {60364#(<= main_~i~0 47)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {60364#(<= main_~i~0 47)} is VALID [2018-11-23 11:53:47,508 INFO L273 TraceCheckUtils]: 147: Hoare triple {60364#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {60365#(<= main_~i~0 48)} is VALID [2018-11-23 11:53:47,509 INFO L273 TraceCheckUtils]: 148: Hoare triple {60365#(<= main_~i~0 48)} assume !(~i~0 < 100000); {60317#false} is VALID [2018-11-23 11:53:47,509 INFO L273 TraceCheckUtils]: 149: Hoare triple {60317#false} assume !(0 != ~swapped~0); {60317#false} is VALID [2018-11-23 11:53:47,510 INFO L273 TraceCheckUtils]: 150: Hoare triple {60317#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {60317#false} is VALID [2018-11-23 11:53:47,510 INFO L273 TraceCheckUtils]: 151: Hoare triple {60317#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {60317#false} is VALID [2018-11-23 11:53:47,510 INFO L273 TraceCheckUtils]: 152: Hoare triple {60317#false} assume !!(~y~0 < 100000);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); {60317#false} is VALID [2018-11-23 11:53:47,510 INFO L256 TraceCheckUtils]: 153: Hoare triple {60317#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {60317#false} is VALID [2018-11-23 11:53:47,510 INFO L273 TraceCheckUtils]: 154: Hoare triple {60317#false} ~cond := #in~cond; {60317#false} is VALID [2018-11-23 11:53:47,510 INFO L273 TraceCheckUtils]: 155: Hoare triple {60317#false} assume 0 == ~cond; {60317#false} is VALID [2018-11-23 11:53:47,511 INFO L273 TraceCheckUtils]: 156: Hoare triple {60317#false} assume !false; {60317#false} is VALID [2018-11-23 11:53:47,526 INFO L134 CoverageAnalysis]: Checked inductivity of 3291 backedges. 1 proven. 3290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:53:47,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:47,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 51 [2018-11-23 11:53:47,547 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 157 [2018-11-23 11:53:47,547 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:47,547 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states. [2018-11-23 11:53:47,703 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:47,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-23 11:53:47,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-23 11:53:47,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-11-23 11:53:47,704 INFO L87 Difference]: Start difference. First operand 303 states and 400 transitions. Second operand 51 states. [2018-11-23 11:53:49,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:49,082 INFO L93 Difference]: Finished difference Result 610 states and 810 transitions. [2018-11-23 11:53:49,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-23 11:53:49,082 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 157 [2018-11-23 11:53:49,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:49,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 11:53:49,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 241 transitions. [2018-11-23 11:53:49,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 11:53:49,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 241 transitions. [2018-11-23 11:53:49,086 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states and 241 transitions. [2018-11-23 11:53:49,329 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 241 edges. 241 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:49,336 INFO L225 Difference]: With dead ends: 610 [2018-11-23 11:53:49,336 INFO L226 Difference]: Without dead ends: 313 [2018-11-23 11:53:49,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-11-23 11:53:49,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-11-23 11:53:49,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 309. [2018-11-23 11:53:49,448 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:49,449 INFO L82 GeneralOperation]: Start isEquivalent. First operand 313 states. Second operand 309 states. [2018-11-23 11:53:49,449 INFO L74 IsIncluded]: Start isIncluded. First operand 313 states. Second operand 309 states. [2018-11-23 11:53:49,449 INFO L87 Difference]: Start difference. First operand 313 states. Second operand 309 states. [2018-11-23 11:53:49,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:49,456 INFO L93 Difference]: Finished difference Result 313 states and 414 transitions. [2018-11-23 11:53:49,456 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 414 transitions. [2018-11-23 11:53:49,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:49,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:49,456 INFO L74 IsIncluded]: Start isIncluded. First operand 309 states. Second operand 313 states. [2018-11-23 11:53:49,456 INFO L87 Difference]: Start difference. First operand 309 states. Second operand 313 states. [2018-11-23 11:53:49,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:49,462 INFO L93 Difference]: Finished difference Result 313 states and 414 transitions. [2018-11-23 11:53:49,462 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 414 transitions. [2018-11-23 11:53:49,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:49,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:49,462 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:49,462 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:49,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-11-23 11:53:49,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 408 transitions. [2018-11-23 11:53:49,468 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 408 transitions. Word has length 157 [2018-11-23 11:53:49,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:49,468 INFO L480 AbstractCegarLoop]: Abstraction has 309 states and 408 transitions. [2018-11-23 11:53:49,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-23 11:53:49,468 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 408 transitions. [2018-11-23 11:53:49,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-23 11:53:49,469 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:49,469 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:53:49,469 INFO L423 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:49,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:49,470 INFO L82 PathProgramCache]: Analyzing trace with hash 610257, now seen corresponding path program 48 times [2018-11-23 11:53:49,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:49,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:49,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:49,470 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:49,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:49,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:51,012 INFO L256 TraceCheckUtils]: 0: Hoare triple {62697#true} call ULTIMATE.init(); {62697#true} is VALID [2018-11-23 11:53:51,012 INFO L273 TraceCheckUtils]: 1: Hoare triple {62697#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {62697#true} is VALID [2018-11-23 11:53:51,012 INFO L273 TraceCheckUtils]: 2: Hoare triple {62697#true} assume true; {62697#true} is VALID [2018-11-23 11:53:51,012 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {62697#true} {62697#true} #79#return; {62697#true} is VALID [2018-11-23 11:53:51,012 INFO L256 TraceCheckUtils]: 4: Hoare triple {62697#true} call #t~ret8 := main(); {62697#true} is VALID [2018-11-23 11:53:51,012 INFO L273 TraceCheckUtils]: 5: Hoare triple {62697#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {62697#true} is VALID [2018-11-23 11:53:51,013 INFO L273 TraceCheckUtils]: 6: Hoare triple {62697#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {62699#(= main_~i~0 1)} is VALID [2018-11-23 11:53:51,013 INFO L273 TraceCheckUtils]: 7: Hoare triple {62699#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62699#(= main_~i~0 1)} is VALID [2018-11-23 11:53:51,014 INFO L273 TraceCheckUtils]: 8: Hoare triple {62699#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62699#(= main_~i~0 1)} is VALID [2018-11-23 11:53:51,014 INFO L273 TraceCheckUtils]: 9: Hoare triple {62699#(= main_~i~0 1)} ~i~0 := 1 + ~i~0; {62700#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:51,015 INFO L273 TraceCheckUtils]: 10: Hoare triple {62700#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62700#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:51,015 INFO L273 TraceCheckUtils]: 11: Hoare triple {62700#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62700#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:51,016 INFO L273 TraceCheckUtils]: 12: Hoare triple {62700#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {62701#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:51,017 INFO L273 TraceCheckUtils]: 13: Hoare triple {62701#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62701#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:51,017 INFO L273 TraceCheckUtils]: 14: Hoare triple {62701#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62701#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:51,018 INFO L273 TraceCheckUtils]: 15: Hoare triple {62701#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {62702#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:51,018 INFO L273 TraceCheckUtils]: 16: Hoare triple {62702#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62702#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:51,019 INFO L273 TraceCheckUtils]: 17: Hoare triple {62702#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62702#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:51,020 INFO L273 TraceCheckUtils]: 18: Hoare triple {62702#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {62703#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:51,020 INFO L273 TraceCheckUtils]: 19: Hoare triple {62703#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62703#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:51,021 INFO L273 TraceCheckUtils]: 20: Hoare triple {62703#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62703#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:51,021 INFO L273 TraceCheckUtils]: 21: Hoare triple {62703#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {62704#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:51,022 INFO L273 TraceCheckUtils]: 22: Hoare triple {62704#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62704#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:51,022 INFO L273 TraceCheckUtils]: 23: Hoare triple {62704#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62704#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:51,023 INFO L273 TraceCheckUtils]: 24: Hoare triple {62704#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {62705#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:51,024 INFO L273 TraceCheckUtils]: 25: Hoare triple {62705#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62705#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:51,024 INFO L273 TraceCheckUtils]: 26: Hoare triple {62705#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62705#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:51,025 INFO L273 TraceCheckUtils]: 27: Hoare triple {62705#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {62706#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:51,025 INFO L273 TraceCheckUtils]: 28: Hoare triple {62706#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62706#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:51,026 INFO L273 TraceCheckUtils]: 29: Hoare triple {62706#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62706#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:51,026 INFO L273 TraceCheckUtils]: 30: Hoare triple {62706#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {62707#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:51,027 INFO L273 TraceCheckUtils]: 31: Hoare triple {62707#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62707#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:51,027 INFO L273 TraceCheckUtils]: 32: Hoare triple {62707#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62707#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:51,028 INFO L273 TraceCheckUtils]: 33: Hoare triple {62707#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {62708#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:51,029 INFO L273 TraceCheckUtils]: 34: Hoare triple {62708#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62708#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:51,029 INFO L273 TraceCheckUtils]: 35: Hoare triple {62708#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62708#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:51,030 INFO L273 TraceCheckUtils]: 36: Hoare triple {62708#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {62709#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:51,030 INFO L273 TraceCheckUtils]: 37: Hoare triple {62709#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62709#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:51,031 INFO L273 TraceCheckUtils]: 38: Hoare triple {62709#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62709#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:51,032 INFO L273 TraceCheckUtils]: 39: Hoare triple {62709#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {62710#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:51,032 INFO L273 TraceCheckUtils]: 40: Hoare triple {62710#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62710#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:51,033 INFO L273 TraceCheckUtils]: 41: Hoare triple {62710#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62710#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:51,033 INFO L273 TraceCheckUtils]: 42: Hoare triple {62710#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {62711#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:51,034 INFO L273 TraceCheckUtils]: 43: Hoare triple {62711#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62711#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:51,034 INFO L273 TraceCheckUtils]: 44: Hoare triple {62711#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62711#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:51,035 INFO L273 TraceCheckUtils]: 45: Hoare triple {62711#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {62712#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:51,036 INFO L273 TraceCheckUtils]: 46: Hoare triple {62712#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62712#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:51,036 INFO L273 TraceCheckUtils]: 47: Hoare triple {62712#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62712#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:51,037 INFO L273 TraceCheckUtils]: 48: Hoare triple {62712#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {62713#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:51,037 INFO L273 TraceCheckUtils]: 49: Hoare triple {62713#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62713#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:51,038 INFO L273 TraceCheckUtils]: 50: Hoare triple {62713#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62713#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:51,039 INFO L273 TraceCheckUtils]: 51: Hoare triple {62713#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {62714#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:51,039 INFO L273 TraceCheckUtils]: 52: Hoare triple {62714#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62714#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:51,040 INFO L273 TraceCheckUtils]: 53: Hoare triple {62714#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62714#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:51,040 INFO L273 TraceCheckUtils]: 54: Hoare triple {62714#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {62715#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:51,041 INFO L273 TraceCheckUtils]: 55: Hoare triple {62715#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62715#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:51,041 INFO L273 TraceCheckUtils]: 56: Hoare triple {62715#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62715#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:51,042 INFO L273 TraceCheckUtils]: 57: Hoare triple {62715#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {62716#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:51,042 INFO L273 TraceCheckUtils]: 58: Hoare triple {62716#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62716#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:51,043 INFO L273 TraceCheckUtils]: 59: Hoare triple {62716#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62716#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:51,044 INFO L273 TraceCheckUtils]: 60: Hoare triple {62716#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {62717#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:51,044 INFO L273 TraceCheckUtils]: 61: Hoare triple {62717#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62717#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:51,045 INFO L273 TraceCheckUtils]: 62: Hoare triple {62717#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62717#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:51,045 INFO L273 TraceCheckUtils]: 63: Hoare triple {62717#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {62718#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:51,046 INFO L273 TraceCheckUtils]: 64: Hoare triple {62718#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62718#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:51,046 INFO L273 TraceCheckUtils]: 65: Hoare triple {62718#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62718#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:51,047 INFO L273 TraceCheckUtils]: 66: Hoare triple {62718#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {62719#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:51,048 INFO L273 TraceCheckUtils]: 67: Hoare triple {62719#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62719#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:51,048 INFO L273 TraceCheckUtils]: 68: Hoare triple {62719#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62719#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:51,049 INFO L273 TraceCheckUtils]: 69: Hoare triple {62719#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {62720#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:51,049 INFO L273 TraceCheckUtils]: 70: Hoare triple {62720#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62720#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:51,050 INFO L273 TraceCheckUtils]: 71: Hoare triple {62720#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62720#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:51,051 INFO L273 TraceCheckUtils]: 72: Hoare triple {62720#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {62721#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:51,051 INFO L273 TraceCheckUtils]: 73: Hoare triple {62721#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62721#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:51,052 INFO L273 TraceCheckUtils]: 74: Hoare triple {62721#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62721#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:51,052 INFO L273 TraceCheckUtils]: 75: Hoare triple {62721#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {62722#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:51,053 INFO L273 TraceCheckUtils]: 76: Hoare triple {62722#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62722#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:51,053 INFO L273 TraceCheckUtils]: 77: Hoare triple {62722#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62722#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:51,054 INFO L273 TraceCheckUtils]: 78: Hoare triple {62722#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {62723#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:51,055 INFO L273 TraceCheckUtils]: 79: Hoare triple {62723#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62723#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:51,055 INFO L273 TraceCheckUtils]: 80: Hoare triple {62723#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62723#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:51,056 INFO L273 TraceCheckUtils]: 81: Hoare triple {62723#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {62724#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:51,056 INFO L273 TraceCheckUtils]: 82: Hoare triple {62724#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62724#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:51,057 INFO L273 TraceCheckUtils]: 83: Hoare triple {62724#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62724#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:51,057 INFO L273 TraceCheckUtils]: 84: Hoare triple {62724#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {62725#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:51,058 INFO L273 TraceCheckUtils]: 85: Hoare triple {62725#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62725#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:51,058 INFO L273 TraceCheckUtils]: 86: Hoare triple {62725#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62725#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:51,059 INFO L273 TraceCheckUtils]: 87: Hoare triple {62725#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {62726#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:51,060 INFO L273 TraceCheckUtils]: 88: Hoare triple {62726#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62726#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:51,060 INFO L273 TraceCheckUtils]: 89: Hoare triple {62726#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62726#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:51,061 INFO L273 TraceCheckUtils]: 90: Hoare triple {62726#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {62727#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:51,061 INFO L273 TraceCheckUtils]: 91: Hoare triple {62727#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62727#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:51,062 INFO L273 TraceCheckUtils]: 92: Hoare triple {62727#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62727#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:51,063 INFO L273 TraceCheckUtils]: 93: Hoare triple {62727#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {62728#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:51,063 INFO L273 TraceCheckUtils]: 94: Hoare triple {62728#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62728#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:51,064 INFO L273 TraceCheckUtils]: 95: Hoare triple {62728#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62728#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:51,064 INFO L273 TraceCheckUtils]: 96: Hoare triple {62728#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {62729#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:51,065 INFO L273 TraceCheckUtils]: 97: Hoare triple {62729#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62729#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:51,065 INFO L273 TraceCheckUtils]: 98: Hoare triple {62729#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62729#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:51,066 INFO L273 TraceCheckUtils]: 99: Hoare triple {62729#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {62730#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:51,067 INFO L273 TraceCheckUtils]: 100: Hoare triple {62730#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62730#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:51,067 INFO L273 TraceCheckUtils]: 101: Hoare triple {62730#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62730#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:51,068 INFO L273 TraceCheckUtils]: 102: Hoare triple {62730#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {62731#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:51,068 INFO L273 TraceCheckUtils]: 103: Hoare triple {62731#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62731#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:51,069 INFO L273 TraceCheckUtils]: 104: Hoare triple {62731#(<= main_~i~0 33)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62731#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:51,070 INFO L273 TraceCheckUtils]: 105: Hoare triple {62731#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {62732#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:51,070 INFO L273 TraceCheckUtils]: 106: Hoare triple {62732#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62732#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:51,071 INFO L273 TraceCheckUtils]: 107: Hoare triple {62732#(<= main_~i~0 34)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62732#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:51,071 INFO L273 TraceCheckUtils]: 108: Hoare triple {62732#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {62733#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:51,072 INFO L273 TraceCheckUtils]: 109: Hoare triple {62733#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62733#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:51,072 INFO L273 TraceCheckUtils]: 110: Hoare triple {62733#(<= main_~i~0 35)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62733#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:51,073 INFO L273 TraceCheckUtils]: 111: Hoare triple {62733#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {62734#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:51,074 INFO L273 TraceCheckUtils]: 112: Hoare triple {62734#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62734#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:51,074 INFO L273 TraceCheckUtils]: 113: Hoare triple {62734#(<= main_~i~0 36)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62734#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:51,075 INFO L273 TraceCheckUtils]: 114: Hoare triple {62734#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {62735#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:51,075 INFO L273 TraceCheckUtils]: 115: Hoare triple {62735#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62735#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:51,076 INFO L273 TraceCheckUtils]: 116: Hoare triple {62735#(<= main_~i~0 37)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62735#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:51,076 INFO L273 TraceCheckUtils]: 117: Hoare triple {62735#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {62736#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:51,077 INFO L273 TraceCheckUtils]: 118: Hoare triple {62736#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62736#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:51,077 INFO L273 TraceCheckUtils]: 119: Hoare triple {62736#(<= main_~i~0 38)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62736#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:51,078 INFO L273 TraceCheckUtils]: 120: Hoare triple {62736#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {62737#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:51,079 INFO L273 TraceCheckUtils]: 121: Hoare triple {62737#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62737#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:51,079 INFO L273 TraceCheckUtils]: 122: Hoare triple {62737#(<= main_~i~0 39)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62737#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:51,080 INFO L273 TraceCheckUtils]: 123: Hoare triple {62737#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {62738#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:51,080 INFO L273 TraceCheckUtils]: 124: Hoare triple {62738#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62738#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:51,081 INFO L273 TraceCheckUtils]: 125: Hoare triple {62738#(<= main_~i~0 40)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62738#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:51,082 INFO L273 TraceCheckUtils]: 126: Hoare triple {62738#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {62739#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:51,082 INFO L273 TraceCheckUtils]: 127: Hoare triple {62739#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62739#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:51,083 INFO L273 TraceCheckUtils]: 128: Hoare triple {62739#(<= main_~i~0 41)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62739#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:51,083 INFO L273 TraceCheckUtils]: 129: Hoare triple {62739#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {62740#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:51,084 INFO L273 TraceCheckUtils]: 130: Hoare triple {62740#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62740#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:51,084 INFO L273 TraceCheckUtils]: 131: Hoare triple {62740#(<= main_~i~0 42)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62740#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:51,085 INFO L273 TraceCheckUtils]: 132: Hoare triple {62740#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {62741#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:51,086 INFO L273 TraceCheckUtils]: 133: Hoare triple {62741#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62741#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:51,086 INFO L273 TraceCheckUtils]: 134: Hoare triple {62741#(<= main_~i~0 43)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62741#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:51,087 INFO L273 TraceCheckUtils]: 135: Hoare triple {62741#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {62742#(<= main_~i~0 44)} is VALID [2018-11-23 11:53:51,087 INFO L273 TraceCheckUtils]: 136: Hoare triple {62742#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62742#(<= main_~i~0 44)} is VALID [2018-11-23 11:53:51,088 INFO L273 TraceCheckUtils]: 137: Hoare triple {62742#(<= main_~i~0 44)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62742#(<= main_~i~0 44)} is VALID [2018-11-23 11:53:51,089 INFO L273 TraceCheckUtils]: 138: Hoare triple {62742#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {62743#(<= main_~i~0 45)} is VALID [2018-11-23 11:53:51,089 INFO L273 TraceCheckUtils]: 139: Hoare triple {62743#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62743#(<= main_~i~0 45)} is VALID [2018-11-23 11:53:51,090 INFO L273 TraceCheckUtils]: 140: Hoare triple {62743#(<= main_~i~0 45)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62743#(<= main_~i~0 45)} is VALID [2018-11-23 11:53:51,090 INFO L273 TraceCheckUtils]: 141: Hoare triple {62743#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {62744#(<= main_~i~0 46)} is VALID [2018-11-23 11:53:51,091 INFO L273 TraceCheckUtils]: 142: Hoare triple {62744#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62744#(<= main_~i~0 46)} is VALID [2018-11-23 11:53:51,091 INFO L273 TraceCheckUtils]: 143: Hoare triple {62744#(<= main_~i~0 46)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62744#(<= main_~i~0 46)} is VALID [2018-11-23 11:53:51,092 INFO L273 TraceCheckUtils]: 144: Hoare triple {62744#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {62745#(<= main_~i~0 47)} is VALID [2018-11-23 11:53:51,093 INFO L273 TraceCheckUtils]: 145: Hoare triple {62745#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62745#(<= main_~i~0 47)} is VALID [2018-11-23 11:53:51,093 INFO L273 TraceCheckUtils]: 146: Hoare triple {62745#(<= main_~i~0 47)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62745#(<= main_~i~0 47)} is VALID [2018-11-23 11:53:51,094 INFO L273 TraceCheckUtils]: 147: Hoare triple {62745#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {62746#(<= main_~i~0 48)} is VALID [2018-11-23 11:53:51,094 INFO L273 TraceCheckUtils]: 148: Hoare triple {62746#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62746#(<= main_~i~0 48)} is VALID [2018-11-23 11:53:51,095 INFO L273 TraceCheckUtils]: 149: Hoare triple {62746#(<= main_~i~0 48)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62746#(<= main_~i~0 48)} is VALID [2018-11-23 11:53:51,096 INFO L273 TraceCheckUtils]: 150: Hoare triple {62746#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {62747#(<= main_~i~0 49)} is VALID [2018-11-23 11:53:51,096 INFO L273 TraceCheckUtils]: 151: Hoare triple {62747#(<= main_~i~0 49)} assume !(~i~0 < 100000); {62698#false} is VALID [2018-11-23 11:53:51,096 INFO L273 TraceCheckUtils]: 152: Hoare triple {62698#false} assume !(0 != ~swapped~0); {62698#false} is VALID [2018-11-23 11:53:51,097 INFO L273 TraceCheckUtils]: 153: Hoare triple {62698#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {62698#false} is VALID [2018-11-23 11:53:51,097 INFO L273 TraceCheckUtils]: 154: Hoare triple {62698#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {62698#false} is VALID [2018-11-23 11:53:51,097 INFO L273 TraceCheckUtils]: 155: Hoare triple {62698#false} assume !!(~y~0 < 100000);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); {62698#false} is VALID [2018-11-23 11:53:51,097 INFO L256 TraceCheckUtils]: 156: Hoare triple {62698#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {62698#false} is VALID [2018-11-23 11:53:51,097 INFO L273 TraceCheckUtils]: 157: Hoare triple {62698#false} ~cond := #in~cond; {62698#false} is VALID [2018-11-23 11:53:51,097 INFO L273 TraceCheckUtils]: 158: Hoare triple {62698#false} assume 0 == ~cond; {62698#false} is VALID [2018-11-23 11:53:51,098 INFO L273 TraceCheckUtils]: 159: Hoare triple {62698#false} assume !false; {62698#false} is VALID [2018-11-23 11:53:51,114 INFO L134 CoverageAnalysis]: Checked inductivity of 3433 backedges. 1 proven. 3432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:53:51,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:51,114 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:53:51,133 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:53:51,771 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 50 check-sat command(s) [2018-11-23 11:53:51,771 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:51,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:51,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:52,157 INFO L256 TraceCheckUtils]: 0: Hoare triple {62697#true} call ULTIMATE.init(); {62697#true} is VALID [2018-11-23 11:53:52,157 INFO L273 TraceCheckUtils]: 1: Hoare triple {62697#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {62697#true} is VALID [2018-11-23 11:53:52,158 INFO L273 TraceCheckUtils]: 2: Hoare triple {62697#true} assume true; {62697#true} is VALID [2018-11-23 11:53:52,158 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {62697#true} {62697#true} #79#return; {62697#true} is VALID [2018-11-23 11:53:52,158 INFO L256 TraceCheckUtils]: 4: Hoare triple {62697#true} call #t~ret8 := main(); {62697#true} is VALID [2018-11-23 11:53:52,158 INFO L273 TraceCheckUtils]: 5: Hoare triple {62697#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {62697#true} is VALID [2018-11-23 11:53:52,159 INFO L273 TraceCheckUtils]: 6: Hoare triple {62697#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {62769#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:52,159 INFO L273 TraceCheckUtils]: 7: Hoare triple {62769#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62769#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:52,160 INFO L273 TraceCheckUtils]: 8: Hoare triple {62769#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62769#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:52,160 INFO L273 TraceCheckUtils]: 9: Hoare triple {62769#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {62700#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:52,160 INFO L273 TraceCheckUtils]: 10: Hoare triple {62700#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62700#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:52,161 INFO L273 TraceCheckUtils]: 11: Hoare triple {62700#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62700#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:52,161 INFO L273 TraceCheckUtils]: 12: Hoare triple {62700#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {62701#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:52,161 INFO L273 TraceCheckUtils]: 13: Hoare triple {62701#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62701#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:52,162 INFO L273 TraceCheckUtils]: 14: Hoare triple {62701#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62701#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:52,163 INFO L273 TraceCheckUtils]: 15: Hoare triple {62701#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {62702#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:52,163 INFO L273 TraceCheckUtils]: 16: Hoare triple {62702#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62702#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:52,164 INFO L273 TraceCheckUtils]: 17: Hoare triple {62702#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62702#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:52,164 INFO L273 TraceCheckUtils]: 18: Hoare triple {62702#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {62703#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:52,165 INFO L273 TraceCheckUtils]: 19: Hoare triple {62703#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62703#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:52,165 INFO L273 TraceCheckUtils]: 20: Hoare triple {62703#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62703#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:52,166 INFO L273 TraceCheckUtils]: 21: Hoare triple {62703#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {62704#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:52,167 INFO L273 TraceCheckUtils]: 22: Hoare triple {62704#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62704#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:52,167 INFO L273 TraceCheckUtils]: 23: Hoare triple {62704#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62704#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:52,168 INFO L273 TraceCheckUtils]: 24: Hoare triple {62704#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {62705#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:52,168 INFO L273 TraceCheckUtils]: 25: Hoare triple {62705#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62705#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:52,169 INFO L273 TraceCheckUtils]: 26: Hoare triple {62705#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62705#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:52,169 INFO L273 TraceCheckUtils]: 27: Hoare triple {62705#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {62706#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:52,170 INFO L273 TraceCheckUtils]: 28: Hoare triple {62706#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62706#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:52,170 INFO L273 TraceCheckUtils]: 29: Hoare triple {62706#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62706#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:52,171 INFO L273 TraceCheckUtils]: 30: Hoare triple {62706#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {62707#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:52,172 INFO L273 TraceCheckUtils]: 31: Hoare triple {62707#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62707#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:52,172 INFO L273 TraceCheckUtils]: 32: Hoare triple {62707#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62707#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:52,173 INFO L273 TraceCheckUtils]: 33: Hoare triple {62707#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {62708#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:52,173 INFO L273 TraceCheckUtils]: 34: Hoare triple {62708#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62708#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:52,174 INFO L273 TraceCheckUtils]: 35: Hoare triple {62708#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62708#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:52,175 INFO L273 TraceCheckUtils]: 36: Hoare triple {62708#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {62709#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:52,175 INFO L273 TraceCheckUtils]: 37: Hoare triple {62709#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62709#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:52,176 INFO L273 TraceCheckUtils]: 38: Hoare triple {62709#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62709#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:52,176 INFO L273 TraceCheckUtils]: 39: Hoare triple {62709#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {62710#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:52,177 INFO L273 TraceCheckUtils]: 40: Hoare triple {62710#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62710#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:52,177 INFO L273 TraceCheckUtils]: 41: Hoare triple {62710#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62710#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:52,178 INFO L273 TraceCheckUtils]: 42: Hoare triple {62710#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {62711#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:52,178 INFO L273 TraceCheckUtils]: 43: Hoare triple {62711#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62711#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:52,179 INFO L273 TraceCheckUtils]: 44: Hoare triple {62711#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62711#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:52,180 INFO L273 TraceCheckUtils]: 45: Hoare triple {62711#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {62712#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:52,180 INFO L273 TraceCheckUtils]: 46: Hoare triple {62712#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62712#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:52,181 INFO L273 TraceCheckUtils]: 47: Hoare triple {62712#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62712#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:52,181 INFO L273 TraceCheckUtils]: 48: Hoare triple {62712#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {62713#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:52,182 INFO L273 TraceCheckUtils]: 49: Hoare triple {62713#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62713#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:52,182 INFO L273 TraceCheckUtils]: 50: Hoare triple {62713#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62713#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:52,183 INFO L273 TraceCheckUtils]: 51: Hoare triple {62713#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {62714#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:52,184 INFO L273 TraceCheckUtils]: 52: Hoare triple {62714#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62714#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:52,184 INFO L273 TraceCheckUtils]: 53: Hoare triple {62714#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62714#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:52,185 INFO L273 TraceCheckUtils]: 54: Hoare triple {62714#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {62715#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:52,185 INFO L273 TraceCheckUtils]: 55: Hoare triple {62715#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62715#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:52,186 INFO L273 TraceCheckUtils]: 56: Hoare triple {62715#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62715#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:52,186 INFO L273 TraceCheckUtils]: 57: Hoare triple {62715#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {62716#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:52,187 INFO L273 TraceCheckUtils]: 58: Hoare triple {62716#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62716#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:52,187 INFO L273 TraceCheckUtils]: 59: Hoare triple {62716#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62716#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:52,188 INFO L273 TraceCheckUtils]: 60: Hoare triple {62716#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {62717#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:52,189 INFO L273 TraceCheckUtils]: 61: Hoare triple {62717#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62717#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:52,189 INFO L273 TraceCheckUtils]: 62: Hoare triple {62717#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62717#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:52,190 INFO L273 TraceCheckUtils]: 63: Hoare triple {62717#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {62718#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:52,190 INFO L273 TraceCheckUtils]: 64: Hoare triple {62718#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62718#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:52,191 INFO L273 TraceCheckUtils]: 65: Hoare triple {62718#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62718#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:52,192 INFO L273 TraceCheckUtils]: 66: Hoare triple {62718#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {62719#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:52,192 INFO L273 TraceCheckUtils]: 67: Hoare triple {62719#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62719#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:52,193 INFO L273 TraceCheckUtils]: 68: Hoare triple {62719#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62719#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:52,193 INFO L273 TraceCheckUtils]: 69: Hoare triple {62719#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {62720#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:52,194 INFO L273 TraceCheckUtils]: 70: Hoare triple {62720#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62720#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:52,194 INFO L273 TraceCheckUtils]: 71: Hoare triple {62720#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62720#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:52,195 INFO L273 TraceCheckUtils]: 72: Hoare triple {62720#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {62721#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:52,195 INFO L273 TraceCheckUtils]: 73: Hoare triple {62721#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62721#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:52,196 INFO L273 TraceCheckUtils]: 74: Hoare triple {62721#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62721#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:52,197 INFO L273 TraceCheckUtils]: 75: Hoare triple {62721#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {62722#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:52,197 INFO L273 TraceCheckUtils]: 76: Hoare triple {62722#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62722#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:52,198 INFO L273 TraceCheckUtils]: 77: Hoare triple {62722#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62722#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:52,198 INFO L273 TraceCheckUtils]: 78: Hoare triple {62722#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {62723#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:52,199 INFO L273 TraceCheckUtils]: 79: Hoare triple {62723#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62723#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:52,199 INFO L273 TraceCheckUtils]: 80: Hoare triple {62723#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62723#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:52,200 INFO L273 TraceCheckUtils]: 81: Hoare triple {62723#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {62724#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:52,201 INFO L273 TraceCheckUtils]: 82: Hoare triple {62724#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62724#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:52,201 INFO L273 TraceCheckUtils]: 83: Hoare triple {62724#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62724#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:52,202 INFO L273 TraceCheckUtils]: 84: Hoare triple {62724#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {62725#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:52,202 INFO L273 TraceCheckUtils]: 85: Hoare triple {62725#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62725#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:52,203 INFO L273 TraceCheckUtils]: 86: Hoare triple {62725#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62725#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:52,203 INFO L273 TraceCheckUtils]: 87: Hoare triple {62725#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {62726#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:52,204 INFO L273 TraceCheckUtils]: 88: Hoare triple {62726#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62726#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:52,204 INFO L273 TraceCheckUtils]: 89: Hoare triple {62726#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62726#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:52,205 INFO L273 TraceCheckUtils]: 90: Hoare triple {62726#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {62727#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:52,206 INFO L273 TraceCheckUtils]: 91: Hoare triple {62727#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62727#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:52,206 INFO L273 TraceCheckUtils]: 92: Hoare triple {62727#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62727#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:52,207 INFO L273 TraceCheckUtils]: 93: Hoare triple {62727#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {62728#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:52,207 INFO L273 TraceCheckUtils]: 94: Hoare triple {62728#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62728#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:52,208 INFO L273 TraceCheckUtils]: 95: Hoare triple {62728#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62728#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:52,209 INFO L273 TraceCheckUtils]: 96: Hoare triple {62728#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {62729#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:52,209 INFO L273 TraceCheckUtils]: 97: Hoare triple {62729#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62729#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:52,210 INFO L273 TraceCheckUtils]: 98: Hoare triple {62729#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62729#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:52,210 INFO L273 TraceCheckUtils]: 99: Hoare triple {62729#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {62730#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:52,211 INFO L273 TraceCheckUtils]: 100: Hoare triple {62730#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62730#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:52,211 INFO L273 TraceCheckUtils]: 101: Hoare triple {62730#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62730#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:52,212 INFO L273 TraceCheckUtils]: 102: Hoare triple {62730#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {62731#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:52,212 INFO L273 TraceCheckUtils]: 103: Hoare triple {62731#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62731#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:52,213 INFO L273 TraceCheckUtils]: 104: Hoare triple {62731#(<= main_~i~0 33)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62731#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:52,214 INFO L273 TraceCheckUtils]: 105: Hoare triple {62731#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {62732#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:52,214 INFO L273 TraceCheckUtils]: 106: Hoare triple {62732#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62732#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:52,215 INFO L273 TraceCheckUtils]: 107: Hoare triple {62732#(<= main_~i~0 34)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62732#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:52,215 INFO L273 TraceCheckUtils]: 108: Hoare triple {62732#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {62733#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:52,216 INFO L273 TraceCheckUtils]: 109: Hoare triple {62733#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62733#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:52,216 INFO L273 TraceCheckUtils]: 110: Hoare triple {62733#(<= main_~i~0 35)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62733#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:52,217 INFO L273 TraceCheckUtils]: 111: Hoare triple {62733#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {62734#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:52,218 INFO L273 TraceCheckUtils]: 112: Hoare triple {62734#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62734#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:52,218 INFO L273 TraceCheckUtils]: 113: Hoare triple {62734#(<= main_~i~0 36)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62734#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:52,219 INFO L273 TraceCheckUtils]: 114: Hoare triple {62734#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {62735#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:52,219 INFO L273 TraceCheckUtils]: 115: Hoare triple {62735#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62735#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:52,220 INFO L273 TraceCheckUtils]: 116: Hoare triple {62735#(<= main_~i~0 37)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62735#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:52,220 INFO L273 TraceCheckUtils]: 117: Hoare triple {62735#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {62736#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:52,221 INFO L273 TraceCheckUtils]: 118: Hoare triple {62736#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62736#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:52,221 INFO L273 TraceCheckUtils]: 119: Hoare triple {62736#(<= main_~i~0 38)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62736#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:52,222 INFO L273 TraceCheckUtils]: 120: Hoare triple {62736#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {62737#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:52,223 INFO L273 TraceCheckUtils]: 121: Hoare triple {62737#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62737#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:52,223 INFO L273 TraceCheckUtils]: 122: Hoare triple {62737#(<= main_~i~0 39)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62737#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:52,224 INFO L273 TraceCheckUtils]: 123: Hoare triple {62737#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {62738#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:52,224 INFO L273 TraceCheckUtils]: 124: Hoare triple {62738#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62738#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:52,225 INFO L273 TraceCheckUtils]: 125: Hoare triple {62738#(<= main_~i~0 40)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62738#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:52,226 INFO L273 TraceCheckUtils]: 126: Hoare triple {62738#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {62739#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:52,226 INFO L273 TraceCheckUtils]: 127: Hoare triple {62739#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62739#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:52,227 INFO L273 TraceCheckUtils]: 128: Hoare triple {62739#(<= main_~i~0 41)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62739#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:52,227 INFO L273 TraceCheckUtils]: 129: Hoare triple {62739#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {62740#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:52,228 INFO L273 TraceCheckUtils]: 130: Hoare triple {62740#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62740#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:52,228 INFO L273 TraceCheckUtils]: 131: Hoare triple {62740#(<= main_~i~0 42)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62740#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:52,229 INFO L273 TraceCheckUtils]: 132: Hoare triple {62740#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {62741#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:52,230 INFO L273 TraceCheckUtils]: 133: Hoare triple {62741#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62741#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:52,230 INFO L273 TraceCheckUtils]: 134: Hoare triple {62741#(<= main_~i~0 43)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62741#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:52,231 INFO L273 TraceCheckUtils]: 135: Hoare triple {62741#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {62742#(<= main_~i~0 44)} is VALID [2018-11-23 11:53:52,231 INFO L273 TraceCheckUtils]: 136: Hoare triple {62742#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62742#(<= main_~i~0 44)} is VALID [2018-11-23 11:53:52,232 INFO L273 TraceCheckUtils]: 137: Hoare triple {62742#(<= main_~i~0 44)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62742#(<= main_~i~0 44)} is VALID [2018-11-23 11:53:52,232 INFO L273 TraceCheckUtils]: 138: Hoare triple {62742#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {62743#(<= main_~i~0 45)} is VALID [2018-11-23 11:53:52,233 INFO L273 TraceCheckUtils]: 139: Hoare triple {62743#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62743#(<= main_~i~0 45)} is VALID [2018-11-23 11:53:52,233 INFO L273 TraceCheckUtils]: 140: Hoare triple {62743#(<= main_~i~0 45)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62743#(<= main_~i~0 45)} is VALID [2018-11-23 11:53:52,234 INFO L273 TraceCheckUtils]: 141: Hoare triple {62743#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {62744#(<= main_~i~0 46)} is VALID [2018-11-23 11:53:52,235 INFO L273 TraceCheckUtils]: 142: Hoare triple {62744#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62744#(<= main_~i~0 46)} is VALID [2018-11-23 11:53:52,235 INFO L273 TraceCheckUtils]: 143: Hoare triple {62744#(<= main_~i~0 46)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62744#(<= main_~i~0 46)} is VALID [2018-11-23 11:53:52,236 INFO L273 TraceCheckUtils]: 144: Hoare triple {62744#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {62745#(<= main_~i~0 47)} is VALID [2018-11-23 11:53:52,236 INFO L273 TraceCheckUtils]: 145: Hoare triple {62745#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62745#(<= main_~i~0 47)} is VALID [2018-11-23 11:53:52,237 INFO L273 TraceCheckUtils]: 146: Hoare triple {62745#(<= main_~i~0 47)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62745#(<= main_~i~0 47)} is VALID [2018-11-23 11:53:52,238 INFO L273 TraceCheckUtils]: 147: Hoare triple {62745#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {62746#(<= main_~i~0 48)} is VALID [2018-11-23 11:53:52,238 INFO L273 TraceCheckUtils]: 148: Hoare triple {62746#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {62746#(<= main_~i~0 48)} is VALID [2018-11-23 11:53:52,239 INFO L273 TraceCheckUtils]: 149: Hoare triple {62746#(<= main_~i~0 48)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {62746#(<= main_~i~0 48)} is VALID [2018-11-23 11:53:52,239 INFO L273 TraceCheckUtils]: 150: Hoare triple {62746#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {62747#(<= main_~i~0 49)} is VALID [2018-11-23 11:53:52,240 INFO L273 TraceCheckUtils]: 151: Hoare triple {62747#(<= main_~i~0 49)} assume !(~i~0 < 100000); {62698#false} is VALID [2018-11-23 11:53:52,240 INFO L273 TraceCheckUtils]: 152: Hoare triple {62698#false} assume !(0 != ~swapped~0); {62698#false} is VALID [2018-11-23 11:53:52,240 INFO L273 TraceCheckUtils]: 153: Hoare triple {62698#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {62698#false} is VALID [2018-11-23 11:53:52,240 INFO L273 TraceCheckUtils]: 154: Hoare triple {62698#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {62698#false} is VALID [2018-11-23 11:53:52,241 INFO L273 TraceCheckUtils]: 155: Hoare triple {62698#false} assume !!(~y~0 < 100000);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); {62698#false} is VALID [2018-11-23 11:53:52,241 INFO L256 TraceCheckUtils]: 156: Hoare triple {62698#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {62698#false} is VALID [2018-11-23 11:53:52,241 INFO L273 TraceCheckUtils]: 157: Hoare triple {62698#false} ~cond := #in~cond; {62698#false} is VALID [2018-11-23 11:53:52,241 INFO L273 TraceCheckUtils]: 158: Hoare triple {62698#false} assume 0 == ~cond; {62698#false} is VALID [2018-11-23 11:53:52,241 INFO L273 TraceCheckUtils]: 159: Hoare triple {62698#false} assume !false; {62698#false} is VALID [2018-11-23 11:53:52,258 INFO L134 CoverageAnalysis]: Checked inductivity of 3433 backedges. 1 proven. 3432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:53:52,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:52,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 52 [2018-11-23 11:53:52,278 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 160 [2018-11-23 11:53:52,278 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:52,278 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states. [2018-11-23 11:53:52,461 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:52,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-11-23 11:53:52,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-11-23 11:53:52,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-23 11:53:52,462 INFO L87 Difference]: Start difference. First operand 309 states and 408 transitions. Second operand 52 states. [2018-11-23 11:53:53,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:53,498 INFO L93 Difference]: Finished difference Result 622 states and 826 transitions. [2018-11-23 11:53:53,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-23 11:53:53,499 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 160 [2018-11-23 11:53:53,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:53,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 11:53:53,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 245 transitions. [2018-11-23 11:53:53,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 11:53:53,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 245 transitions. [2018-11-23 11:53:53,502 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states and 245 transitions. [2018-11-23 11:53:53,733 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 245 edges. 245 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:53,740 INFO L225 Difference]: With dead ends: 622 [2018-11-23 11:53:53,741 INFO L226 Difference]: Without dead ends: 319 [2018-11-23 11:53:53,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-23 11:53:53,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-11-23 11:53:53,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 315. [2018-11-23 11:53:53,955 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:53,956 INFO L82 GeneralOperation]: Start isEquivalent. First operand 319 states. Second operand 315 states. [2018-11-23 11:53:53,956 INFO L74 IsIncluded]: Start isIncluded. First operand 319 states. Second operand 315 states. [2018-11-23 11:53:53,956 INFO L87 Difference]: Start difference. First operand 319 states. Second operand 315 states. [2018-11-23 11:53:53,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:53,962 INFO L93 Difference]: Finished difference Result 319 states and 422 transitions. [2018-11-23 11:53:53,962 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 422 transitions. [2018-11-23 11:53:53,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:53,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:53,963 INFO L74 IsIncluded]: Start isIncluded. First operand 315 states. Second operand 319 states. [2018-11-23 11:53:53,963 INFO L87 Difference]: Start difference. First operand 315 states. Second operand 319 states. [2018-11-23 11:53:53,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:53,968 INFO L93 Difference]: Finished difference Result 319 states and 422 transitions. [2018-11-23 11:53:53,968 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 422 transitions. [2018-11-23 11:53:53,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:53,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:53,969 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:53,969 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:53,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-11-23 11:53:53,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 416 transitions. [2018-11-23 11:53:53,974 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 416 transitions. Word has length 160 [2018-11-23 11:53:53,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:53,975 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 416 transitions. [2018-11-23 11:53:53,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-11-23 11:53:53,975 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 416 transitions. [2018-11-23 11:53:53,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-23 11:53:53,976 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:53,976 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:53:53,976 INFO L423 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:53,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:53,976 INFO L82 PathProgramCache]: Analyzing trace with hash -287043064, now seen corresponding path program 49 times [2018-11-23 11:53:53,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:53,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:53,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:53,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:53,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:54,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:55,058 INFO L256 TraceCheckUtils]: 0: Hoare triple {65124#true} call ULTIMATE.init(); {65124#true} is VALID [2018-11-23 11:53:55,058 INFO L273 TraceCheckUtils]: 1: Hoare triple {65124#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {65124#true} is VALID [2018-11-23 11:53:55,059 INFO L273 TraceCheckUtils]: 2: Hoare triple {65124#true} assume true; {65124#true} is VALID [2018-11-23 11:53:55,059 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {65124#true} {65124#true} #79#return; {65124#true} is VALID [2018-11-23 11:53:55,059 INFO L256 TraceCheckUtils]: 4: Hoare triple {65124#true} call #t~ret8 := main(); {65124#true} is VALID [2018-11-23 11:53:55,059 INFO L273 TraceCheckUtils]: 5: Hoare triple {65124#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {65124#true} is VALID [2018-11-23 11:53:55,059 INFO L273 TraceCheckUtils]: 6: Hoare triple {65124#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {65126#(= main_~i~0 1)} is VALID [2018-11-23 11:53:55,060 INFO L273 TraceCheckUtils]: 7: Hoare triple {65126#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65126#(= main_~i~0 1)} is VALID [2018-11-23 11:53:55,060 INFO L273 TraceCheckUtils]: 8: Hoare triple {65126#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65126#(= main_~i~0 1)} is VALID [2018-11-23 11:53:55,061 INFO L273 TraceCheckUtils]: 9: Hoare triple {65126#(= main_~i~0 1)} ~i~0 := 1 + ~i~0; {65127#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:55,061 INFO L273 TraceCheckUtils]: 10: Hoare triple {65127#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65127#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:55,061 INFO L273 TraceCheckUtils]: 11: Hoare triple {65127#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65127#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:55,062 INFO L273 TraceCheckUtils]: 12: Hoare triple {65127#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {65128#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:55,062 INFO L273 TraceCheckUtils]: 13: Hoare triple {65128#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65128#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:55,063 INFO L273 TraceCheckUtils]: 14: Hoare triple {65128#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65128#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:55,063 INFO L273 TraceCheckUtils]: 15: Hoare triple {65128#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {65129#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:55,064 INFO L273 TraceCheckUtils]: 16: Hoare triple {65129#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65129#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:55,064 INFO L273 TraceCheckUtils]: 17: Hoare triple {65129#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65129#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:55,065 INFO L273 TraceCheckUtils]: 18: Hoare triple {65129#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {65130#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:55,066 INFO L273 TraceCheckUtils]: 19: Hoare triple {65130#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65130#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:55,066 INFO L273 TraceCheckUtils]: 20: Hoare triple {65130#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65130#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:55,067 INFO L273 TraceCheckUtils]: 21: Hoare triple {65130#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {65131#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:55,067 INFO L273 TraceCheckUtils]: 22: Hoare triple {65131#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65131#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:55,068 INFO L273 TraceCheckUtils]: 23: Hoare triple {65131#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65131#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:55,068 INFO L273 TraceCheckUtils]: 24: Hoare triple {65131#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {65132#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:55,069 INFO L273 TraceCheckUtils]: 25: Hoare triple {65132#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65132#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:55,069 INFO L273 TraceCheckUtils]: 26: Hoare triple {65132#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65132#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:55,070 INFO L273 TraceCheckUtils]: 27: Hoare triple {65132#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {65133#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:55,070 INFO L273 TraceCheckUtils]: 28: Hoare triple {65133#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65133#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:55,071 INFO L273 TraceCheckUtils]: 29: Hoare triple {65133#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65133#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:55,071 INFO L273 TraceCheckUtils]: 30: Hoare triple {65133#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {65134#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:55,072 INFO L273 TraceCheckUtils]: 31: Hoare triple {65134#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65134#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:55,072 INFO L273 TraceCheckUtils]: 32: Hoare triple {65134#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65134#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:55,073 INFO L273 TraceCheckUtils]: 33: Hoare triple {65134#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {65135#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:55,074 INFO L273 TraceCheckUtils]: 34: Hoare triple {65135#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65135#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:55,074 INFO L273 TraceCheckUtils]: 35: Hoare triple {65135#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65135#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:55,075 INFO L273 TraceCheckUtils]: 36: Hoare triple {65135#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {65136#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:55,075 INFO L273 TraceCheckUtils]: 37: Hoare triple {65136#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65136#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:55,076 INFO L273 TraceCheckUtils]: 38: Hoare triple {65136#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65136#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:55,076 INFO L273 TraceCheckUtils]: 39: Hoare triple {65136#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {65137#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:55,077 INFO L273 TraceCheckUtils]: 40: Hoare triple {65137#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65137#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:55,077 INFO L273 TraceCheckUtils]: 41: Hoare triple {65137#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65137#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:55,078 INFO L273 TraceCheckUtils]: 42: Hoare triple {65137#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {65138#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:55,078 INFO L273 TraceCheckUtils]: 43: Hoare triple {65138#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65138#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:55,079 INFO L273 TraceCheckUtils]: 44: Hoare triple {65138#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65138#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:55,080 INFO L273 TraceCheckUtils]: 45: Hoare triple {65138#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {65139#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:55,080 INFO L273 TraceCheckUtils]: 46: Hoare triple {65139#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65139#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:55,081 INFO L273 TraceCheckUtils]: 47: Hoare triple {65139#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65139#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:55,081 INFO L273 TraceCheckUtils]: 48: Hoare triple {65139#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {65140#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:55,082 INFO L273 TraceCheckUtils]: 49: Hoare triple {65140#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65140#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:55,082 INFO L273 TraceCheckUtils]: 50: Hoare triple {65140#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65140#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:55,083 INFO L273 TraceCheckUtils]: 51: Hoare triple {65140#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {65141#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:55,083 INFO L273 TraceCheckUtils]: 52: Hoare triple {65141#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65141#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:55,084 INFO L273 TraceCheckUtils]: 53: Hoare triple {65141#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65141#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:55,084 INFO L273 TraceCheckUtils]: 54: Hoare triple {65141#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {65142#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:55,085 INFO L273 TraceCheckUtils]: 55: Hoare triple {65142#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65142#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:55,085 INFO L273 TraceCheckUtils]: 56: Hoare triple {65142#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65142#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:55,086 INFO L273 TraceCheckUtils]: 57: Hoare triple {65142#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {65143#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:55,087 INFO L273 TraceCheckUtils]: 58: Hoare triple {65143#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65143#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:55,087 INFO L273 TraceCheckUtils]: 59: Hoare triple {65143#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65143#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:55,088 INFO L273 TraceCheckUtils]: 60: Hoare triple {65143#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {65144#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:55,088 INFO L273 TraceCheckUtils]: 61: Hoare triple {65144#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65144#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:55,089 INFO L273 TraceCheckUtils]: 62: Hoare triple {65144#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65144#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:55,089 INFO L273 TraceCheckUtils]: 63: Hoare triple {65144#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {65145#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:55,090 INFO L273 TraceCheckUtils]: 64: Hoare triple {65145#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65145#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:55,090 INFO L273 TraceCheckUtils]: 65: Hoare triple {65145#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65145#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:55,091 INFO L273 TraceCheckUtils]: 66: Hoare triple {65145#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {65146#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:55,091 INFO L273 TraceCheckUtils]: 67: Hoare triple {65146#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65146#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:55,092 INFO L273 TraceCheckUtils]: 68: Hoare triple {65146#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65146#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:55,092 INFO L273 TraceCheckUtils]: 69: Hoare triple {65146#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {65147#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:55,093 INFO L273 TraceCheckUtils]: 70: Hoare triple {65147#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65147#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:55,093 INFO L273 TraceCheckUtils]: 71: Hoare triple {65147#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65147#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:55,094 INFO L273 TraceCheckUtils]: 72: Hoare triple {65147#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {65148#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:55,095 INFO L273 TraceCheckUtils]: 73: Hoare triple {65148#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65148#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:55,095 INFO L273 TraceCheckUtils]: 74: Hoare triple {65148#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65148#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:55,096 INFO L273 TraceCheckUtils]: 75: Hoare triple {65148#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {65149#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:55,096 INFO L273 TraceCheckUtils]: 76: Hoare triple {65149#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65149#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:55,097 INFO L273 TraceCheckUtils]: 77: Hoare triple {65149#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65149#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:55,097 INFO L273 TraceCheckUtils]: 78: Hoare triple {65149#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {65150#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:55,098 INFO L273 TraceCheckUtils]: 79: Hoare triple {65150#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65150#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:55,098 INFO L273 TraceCheckUtils]: 80: Hoare triple {65150#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65150#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:55,099 INFO L273 TraceCheckUtils]: 81: Hoare triple {65150#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {65151#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:55,099 INFO L273 TraceCheckUtils]: 82: Hoare triple {65151#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65151#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:55,100 INFO L273 TraceCheckUtils]: 83: Hoare triple {65151#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65151#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:55,101 INFO L273 TraceCheckUtils]: 84: Hoare triple {65151#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {65152#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:55,101 INFO L273 TraceCheckUtils]: 85: Hoare triple {65152#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65152#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:55,102 INFO L273 TraceCheckUtils]: 86: Hoare triple {65152#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65152#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:55,102 INFO L273 TraceCheckUtils]: 87: Hoare triple {65152#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {65153#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:55,103 INFO L273 TraceCheckUtils]: 88: Hoare triple {65153#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65153#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:55,103 INFO L273 TraceCheckUtils]: 89: Hoare triple {65153#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65153#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:55,104 INFO L273 TraceCheckUtils]: 90: Hoare triple {65153#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {65154#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:55,104 INFO L273 TraceCheckUtils]: 91: Hoare triple {65154#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65154#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:55,105 INFO L273 TraceCheckUtils]: 92: Hoare triple {65154#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65154#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:55,105 INFO L273 TraceCheckUtils]: 93: Hoare triple {65154#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {65155#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:55,106 INFO L273 TraceCheckUtils]: 94: Hoare triple {65155#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65155#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:55,106 INFO L273 TraceCheckUtils]: 95: Hoare triple {65155#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65155#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:55,107 INFO L273 TraceCheckUtils]: 96: Hoare triple {65155#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {65156#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:55,108 INFO L273 TraceCheckUtils]: 97: Hoare triple {65156#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65156#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:55,108 INFO L273 TraceCheckUtils]: 98: Hoare triple {65156#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65156#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:55,109 INFO L273 TraceCheckUtils]: 99: Hoare triple {65156#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {65157#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:55,109 INFO L273 TraceCheckUtils]: 100: Hoare triple {65157#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65157#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:55,110 INFO L273 TraceCheckUtils]: 101: Hoare triple {65157#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65157#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:55,110 INFO L273 TraceCheckUtils]: 102: Hoare triple {65157#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {65158#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:55,111 INFO L273 TraceCheckUtils]: 103: Hoare triple {65158#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65158#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:55,111 INFO L273 TraceCheckUtils]: 104: Hoare triple {65158#(<= main_~i~0 33)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65158#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:55,112 INFO L273 TraceCheckUtils]: 105: Hoare triple {65158#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {65159#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:55,112 INFO L273 TraceCheckUtils]: 106: Hoare triple {65159#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65159#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:55,113 INFO L273 TraceCheckUtils]: 107: Hoare triple {65159#(<= main_~i~0 34)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65159#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:55,113 INFO L273 TraceCheckUtils]: 108: Hoare triple {65159#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {65160#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:55,114 INFO L273 TraceCheckUtils]: 109: Hoare triple {65160#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65160#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:55,114 INFO L273 TraceCheckUtils]: 110: Hoare triple {65160#(<= main_~i~0 35)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65160#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:55,115 INFO L273 TraceCheckUtils]: 111: Hoare triple {65160#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {65161#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:55,116 INFO L273 TraceCheckUtils]: 112: Hoare triple {65161#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65161#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:55,116 INFO L273 TraceCheckUtils]: 113: Hoare triple {65161#(<= main_~i~0 36)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65161#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:55,117 INFO L273 TraceCheckUtils]: 114: Hoare triple {65161#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {65162#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:55,117 INFO L273 TraceCheckUtils]: 115: Hoare triple {65162#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65162#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:55,118 INFO L273 TraceCheckUtils]: 116: Hoare triple {65162#(<= main_~i~0 37)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65162#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:55,118 INFO L273 TraceCheckUtils]: 117: Hoare triple {65162#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {65163#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:55,119 INFO L273 TraceCheckUtils]: 118: Hoare triple {65163#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65163#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:55,119 INFO L273 TraceCheckUtils]: 119: Hoare triple {65163#(<= main_~i~0 38)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65163#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:55,120 INFO L273 TraceCheckUtils]: 120: Hoare triple {65163#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {65164#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:55,121 INFO L273 TraceCheckUtils]: 121: Hoare triple {65164#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65164#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:55,121 INFO L273 TraceCheckUtils]: 122: Hoare triple {65164#(<= main_~i~0 39)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65164#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:55,122 INFO L273 TraceCheckUtils]: 123: Hoare triple {65164#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {65165#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:55,122 INFO L273 TraceCheckUtils]: 124: Hoare triple {65165#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65165#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:55,123 INFO L273 TraceCheckUtils]: 125: Hoare triple {65165#(<= main_~i~0 40)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65165#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:55,123 INFO L273 TraceCheckUtils]: 126: Hoare triple {65165#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {65166#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:55,124 INFO L273 TraceCheckUtils]: 127: Hoare triple {65166#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65166#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:55,124 INFO L273 TraceCheckUtils]: 128: Hoare triple {65166#(<= main_~i~0 41)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65166#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:55,125 INFO L273 TraceCheckUtils]: 129: Hoare triple {65166#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {65167#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:55,126 INFO L273 TraceCheckUtils]: 130: Hoare triple {65167#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65167#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:55,126 INFO L273 TraceCheckUtils]: 131: Hoare triple {65167#(<= main_~i~0 42)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65167#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:55,127 INFO L273 TraceCheckUtils]: 132: Hoare triple {65167#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {65168#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:55,127 INFO L273 TraceCheckUtils]: 133: Hoare triple {65168#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65168#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:55,128 INFO L273 TraceCheckUtils]: 134: Hoare triple {65168#(<= main_~i~0 43)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65168#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:55,128 INFO L273 TraceCheckUtils]: 135: Hoare triple {65168#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {65169#(<= main_~i~0 44)} is VALID [2018-11-23 11:53:55,129 INFO L273 TraceCheckUtils]: 136: Hoare triple {65169#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65169#(<= main_~i~0 44)} is VALID [2018-11-23 11:53:55,129 INFO L273 TraceCheckUtils]: 137: Hoare triple {65169#(<= main_~i~0 44)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65169#(<= main_~i~0 44)} is VALID [2018-11-23 11:53:55,130 INFO L273 TraceCheckUtils]: 138: Hoare triple {65169#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {65170#(<= main_~i~0 45)} is VALID [2018-11-23 11:53:55,130 INFO L273 TraceCheckUtils]: 139: Hoare triple {65170#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65170#(<= main_~i~0 45)} is VALID [2018-11-23 11:53:55,131 INFO L273 TraceCheckUtils]: 140: Hoare triple {65170#(<= main_~i~0 45)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65170#(<= main_~i~0 45)} is VALID [2018-11-23 11:53:55,132 INFO L273 TraceCheckUtils]: 141: Hoare triple {65170#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {65171#(<= main_~i~0 46)} is VALID [2018-11-23 11:53:55,132 INFO L273 TraceCheckUtils]: 142: Hoare triple {65171#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65171#(<= main_~i~0 46)} is VALID [2018-11-23 11:53:55,132 INFO L273 TraceCheckUtils]: 143: Hoare triple {65171#(<= main_~i~0 46)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65171#(<= main_~i~0 46)} is VALID [2018-11-23 11:53:55,133 INFO L273 TraceCheckUtils]: 144: Hoare triple {65171#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {65172#(<= main_~i~0 47)} is VALID [2018-11-23 11:53:55,134 INFO L273 TraceCheckUtils]: 145: Hoare triple {65172#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65172#(<= main_~i~0 47)} is VALID [2018-11-23 11:53:55,134 INFO L273 TraceCheckUtils]: 146: Hoare triple {65172#(<= main_~i~0 47)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65172#(<= main_~i~0 47)} is VALID [2018-11-23 11:53:55,135 INFO L273 TraceCheckUtils]: 147: Hoare triple {65172#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {65173#(<= main_~i~0 48)} is VALID [2018-11-23 11:53:55,135 INFO L273 TraceCheckUtils]: 148: Hoare triple {65173#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65173#(<= main_~i~0 48)} is VALID [2018-11-23 11:53:55,136 INFO L273 TraceCheckUtils]: 149: Hoare triple {65173#(<= main_~i~0 48)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65173#(<= main_~i~0 48)} is VALID [2018-11-23 11:53:55,136 INFO L273 TraceCheckUtils]: 150: Hoare triple {65173#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {65174#(<= main_~i~0 49)} is VALID [2018-11-23 11:53:55,137 INFO L273 TraceCheckUtils]: 151: Hoare triple {65174#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65174#(<= main_~i~0 49)} is VALID [2018-11-23 11:53:55,137 INFO L273 TraceCheckUtils]: 152: Hoare triple {65174#(<= main_~i~0 49)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65174#(<= main_~i~0 49)} is VALID [2018-11-23 11:53:55,138 INFO L273 TraceCheckUtils]: 153: Hoare triple {65174#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {65175#(<= main_~i~0 50)} is VALID [2018-11-23 11:53:55,139 INFO L273 TraceCheckUtils]: 154: Hoare triple {65175#(<= main_~i~0 50)} assume !(~i~0 < 100000); {65125#false} is VALID [2018-11-23 11:53:55,139 INFO L273 TraceCheckUtils]: 155: Hoare triple {65125#false} assume !(0 != ~swapped~0); {65125#false} is VALID [2018-11-23 11:53:55,139 INFO L273 TraceCheckUtils]: 156: Hoare triple {65125#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {65125#false} is VALID [2018-11-23 11:53:55,139 INFO L273 TraceCheckUtils]: 157: Hoare triple {65125#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {65125#false} is VALID [2018-11-23 11:53:55,139 INFO L273 TraceCheckUtils]: 158: Hoare triple {65125#false} assume !!(~y~0 < 100000);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); {65125#false} is VALID [2018-11-23 11:53:55,139 INFO L256 TraceCheckUtils]: 159: Hoare triple {65125#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {65125#false} is VALID [2018-11-23 11:53:55,140 INFO L273 TraceCheckUtils]: 160: Hoare triple {65125#false} ~cond := #in~cond; {65125#false} is VALID [2018-11-23 11:53:55,140 INFO L273 TraceCheckUtils]: 161: Hoare triple {65125#false} assume 0 == ~cond; {65125#false} is VALID [2018-11-23 11:53:55,140 INFO L273 TraceCheckUtils]: 162: Hoare triple {65125#false} assume !false; {65125#false} is VALID [2018-11-23 11:53:55,157 INFO L134 CoverageAnalysis]: Checked inductivity of 3578 backedges. 1 proven. 3577 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:53:55,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:55,157 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:53:55,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:53:55,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:55,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:55,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:55,702 INFO L256 TraceCheckUtils]: 0: Hoare triple {65124#true} call ULTIMATE.init(); {65124#true} is VALID [2018-11-23 11:53:55,702 INFO L273 TraceCheckUtils]: 1: Hoare triple {65124#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {65124#true} is VALID [2018-11-23 11:53:55,702 INFO L273 TraceCheckUtils]: 2: Hoare triple {65124#true} assume true; {65124#true} is VALID [2018-11-23 11:53:55,702 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {65124#true} {65124#true} #79#return; {65124#true} is VALID [2018-11-23 11:53:55,702 INFO L256 TraceCheckUtils]: 4: Hoare triple {65124#true} call #t~ret8 := main(); {65124#true} is VALID [2018-11-23 11:53:55,702 INFO L273 TraceCheckUtils]: 5: Hoare triple {65124#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {65124#true} is VALID [2018-11-23 11:53:55,703 INFO L273 TraceCheckUtils]: 6: Hoare triple {65124#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {65197#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:55,704 INFO L273 TraceCheckUtils]: 7: Hoare triple {65197#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65197#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:55,704 INFO L273 TraceCheckUtils]: 8: Hoare triple {65197#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65197#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:55,707 INFO L273 TraceCheckUtils]: 9: Hoare triple {65197#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {65127#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:55,707 INFO L273 TraceCheckUtils]: 10: Hoare triple {65127#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65127#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:55,710 INFO L273 TraceCheckUtils]: 11: Hoare triple {65127#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65127#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:55,710 INFO L273 TraceCheckUtils]: 12: Hoare triple {65127#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {65128#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:55,712 INFO L273 TraceCheckUtils]: 13: Hoare triple {65128#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65128#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:55,712 INFO L273 TraceCheckUtils]: 14: Hoare triple {65128#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65128#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:55,715 INFO L273 TraceCheckUtils]: 15: Hoare triple {65128#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {65129#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:55,715 INFO L273 TraceCheckUtils]: 16: Hoare triple {65129#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65129#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:55,717 INFO L273 TraceCheckUtils]: 17: Hoare triple {65129#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65129#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:55,717 INFO L273 TraceCheckUtils]: 18: Hoare triple {65129#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {65130#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:55,720 INFO L273 TraceCheckUtils]: 19: Hoare triple {65130#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65130#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:55,720 INFO L273 TraceCheckUtils]: 20: Hoare triple {65130#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65130#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:55,722 INFO L273 TraceCheckUtils]: 21: Hoare triple {65130#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {65131#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:55,722 INFO L273 TraceCheckUtils]: 22: Hoare triple {65131#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65131#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:55,724 INFO L273 TraceCheckUtils]: 23: Hoare triple {65131#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65131#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:55,724 INFO L273 TraceCheckUtils]: 24: Hoare triple {65131#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {65132#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:55,726 INFO L273 TraceCheckUtils]: 25: Hoare triple {65132#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65132#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:55,726 INFO L273 TraceCheckUtils]: 26: Hoare triple {65132#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65132#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:55,729 INFO L273 TraceCheckUtils]: 27: Hoare triple {65132#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {65133#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:55,729 INFO L273 TraceCheckUtils]: 28: Hoare triple {65133#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65133#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:55,731 INFO L273 TraceCheckUtils]: 29: Hoare triple {65133#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65133#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:55,731 INFO L273 TraceCheckUtils]: 30: Hoare triple {65133#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {65134#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:55,733 INFO L273 TraceCheckUtils]: 31: Hoare triple {65134#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65134#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:55,733 INFO L273 TraceCheckUtils]: 32: Hoare triple {65134#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65134#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:55,735 INFO L273 TraceCheckUtils]: 33: Hoare triple {65134#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {65135#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:55,735 INFO L273 TraceCheckUtils]: 34: Hoare triple {65135#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65135#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:55,737 INFO L273 TraceCheckUtils]: 35: Hoare triple {65135#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65135#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:55,737 INFO L273 TraceCheckUtils]: 36: Hoare triple {65135#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {65136#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:55,740 INFO L273 TraceCheckUtils]: 37: Hoare triple {65136#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65136#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:55,740 INFO L273 TraceCheckUtils]: 38: Hoare triple {65136#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65136#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:55,742 INFO L273 TraceCheckUtils]: 39: Hoare triple {65136#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {65137#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:55,742 INFO L273 TraceCheckUtils]: 40: Hoare triple {65137#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65137#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:55,745 INFO L273 TraceCheckUtils]: 41: Hoare triple {65137#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65137#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:55,745 INFO L273 TraceCheckUtils]: 42: Hoare triple {65137#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {65138#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:55,747 INFO L273 TraceCheckUtils]: 43: Hoare triple {65138#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65138#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:55,747 INFO L273 TraceCheckUtils]: 44: Hoare triple {65138#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65138#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:55,749 INFO L273 TraceCheckUtils]: 45: Hoare triple {65138#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {65139#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:55,749 INFO L273 TraceCheckUtils]: 46: Hoare triple {65139#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65139#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:55,751 INFO L273 TraceCheckUtils]: 47: Hoare triple {65139#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65139#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:55,751 INFO L273 TraceCheckUtils]: 48: Hoare triple {65139#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {65140#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:55,753 INFO L273 TraceCheckUtils]: 49: Hoare triple {65140#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65140#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:55,753 INFO L273 TraceCheckUtils]: 50: Hoare triple {65140#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65140#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:55,756 INFO L273 TraceCheckUtils]: 51: Hoare triple {65140#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {65141#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:55,756 INFO L273 TraceCheckUtils]: 52: Hoare triple {65141#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65141#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:55,758 INFO L273 TraceCheckUtils]: 53: Hoare triple {65141#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65141#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:55,758 INFO L273 TraceCheckUtils]: 54: Hoare triple {65141#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {65142#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:55,760 INFO L273 TraceCheckUtils]: 55: Hoare triple {65142#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65142#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:55,760 INFO L273 TraceCheckUtils]: 56: Hoare triple {65142#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65142#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:55,763 INFO L273 TraceCheckUtils]: 57: Hoare triple {65142#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {65143#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:55,763 INFO L273 TraceCheckUtils]: 58: Hoare triple {65143#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65143#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:55,766 INFO L273 TraceCheckUtils]: 59: Hoare triple {65143#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65143#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:55,766 INFO L273 TraceCheckUtils]: 60: Hoare triple {65143#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {65144#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:55,768 INFO L273 TraceCheckUtils]: 61: Hoare triple {65144#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65144#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:55,768 INFO L273 TraceCheckUtils]: 62: Hoare triple {65144#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65144#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:55,771 INFO L273 TraceCheckUtils]: 63: Hoare triple {65144#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {65145#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:55,771 INFO L273 TraceCheckUtils]: 64: Hoare triple {65145#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65145#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:55,774 INFO L273 TraceCheckUtils]: 65: Hoare triple {65145#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65145#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:55,774 INFO L273 TraceCheckUtils]: 66: Hoare triple {65145#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {65146#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:55,776 INFO L273 TraceCheckUtils]: 67: Hoare triple {65146#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65146#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:55,776 INFO L273 TraceCheckUtils]: 68: Hoare triple {65146#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65146#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:55,778 INFO L273 TraceCheckUtils]: 69: Hoare triple {65146#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {65147#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:55,778 INFO L273 TraceCheckUtils]: 70: Hoare triple {65147#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65147#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:55,781 INFO L273 TraceCheckUtils]: 71: Hoare triple {65147#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65147#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:55,781 INFO L273 TraceCheckUtils]: 72: Hoare triple {65147#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {65148#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:55,783 INFO L273 TraceCheckUtils]: 73: Hoare triple {65148#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65148#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:55,783 INFO L273 TraceCheckUtils]: 74: Hoare triple {65148#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65148#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:55,786 INFO L273 TraceCheckUtils]: 75: Hoare triple {65148#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {65149#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:55,786 INFO L273 TraceCheckUtils]: 76: Hoare triple {65149#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65149#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:55,788 INFO L273 TraceCheckUtils]: 77: Hoare triple {65149#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65149#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:55,788 INFO L273 TraceCheckUtils]: 78: Hoare triple {65149#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {65150#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:55,791 INFO L273 TraceCheckUtils]: 79: Hoare triple {65150#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65150#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:55,791 INFO L273 TraceCheckUtils]: 80: Hoare triple {65150#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65150#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:55,793 INFO L273 TraceCheckUtils]: 81: Hoare triple {65150#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {65151#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:55,793 INFO L273 TraceCheckUtils]: 82: Hoare triple {65151#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65151#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:55,795 INFO L273 TraceCheckUtils]: 83: Hoare triple {65151#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65151#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:55,795 INFO L273 TraceCheckUtils]: 84: Hoare triple {65151#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {65152#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:55,797 INFO L273 TraceCheckUtils]: 85: Hoare triple {65152#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65152#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:55,799 INFO L273 TraceCheckUtils]: 86: Hoare triple {65152#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65152#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:55,799 INFO L273 TraceCheckUtils]: 87: Hoare triple {65152#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {65153#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:55,801 INFO L273 TraceCheckUtils]: 88: Hoare triple {65153#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65153#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:55,801 INFO L273 TraceCheckUtils]: 89: Hoare triple {65153#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65153#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:55,804 INFO L273 TraceCheckUtils]: 90: Hoare triple {65153#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {65154#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:55,804 INFO L273 TraceCheckUtils]: 91: Hoare triple {65154#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65154#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:55,807 INFO L273 TraceCheckUtils]: 92: Hoare triple {65154#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65154#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:55,807 INFO L273 TraceCheckUtils]: 93: Hoare triple {65154#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {65155#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:55,809 INFO L273 TraceCheckUtils]: 94: Hoare triple {65155#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65155#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:55,809 INFO L273 TraceCheckUtils]: 95: Hoare triple {65155#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65155#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:55,811 INFO L273 TraceCheckUtils]: 96: Hoare triple {65155#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {65156#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:55,811 INFO L273 TraceCheckUtils]: 97: Hoare triple {65156#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65156#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:55,813 INFO L273 TraceCheckUtils]: 98: Hoare triple {65156#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65156#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:55,813 INFO L273 TraceCheckUtils]: 99: Hoare triple {65156#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {65157#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:55,815 INFO L273 TraceCheckUtils]: 100: Hoare triple {65157#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65157#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:55,815 INFO L273 TraceCheckUtils]: 101: Hoare triple {65157#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65157#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:55,815 INFO L273 TraceCheckUtils]: 102: Hoare triple {65157#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {65158#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:55,817 INFO L273 TraceCheckUtils]: 103: Hoare triple {65158#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65158#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:55,817 INFO L273 TraceCheckUtils]: 104: Hoare triple {65158#(<= main_~i~0 33)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65158#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:55,819 INFO L273 TraceCheckUtils]: 105: Hoare triple {65158#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {65159#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:55,819 INFO L273 TraceCheckUtils]: 106: Hoare triple {65159#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65159#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:55,822 INFO L273 TraceCheckUtils]: 107: Hoare triple {65159#(<= main_~i~0 34)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65159#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:55,822 INFO L273 TraceCheckUtils]: 108: Hoare triple {65159#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {65160#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:55,824 INFO L273 TraceCheckUtils]: 109: Hoare triple {65160#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65160#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:55,824 INFO L273 TraceCheckUtils]: 110: Hoare triple {65160#(<= main_~i~0 35)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65160#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:55,827 INFO L273 TraceCheckUtils]: 111: Hoare triple {65160#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {65161#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:55,827 INFO L273 TraceCheckUtils]: 112: Hoare triple {65161#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65161#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:55,829 INFO L273 TraceCheckUtils]: 113: Hoare triple {65161#(<= main_~i~0 36)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65161#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:55,829 INFO L273 TraceCheckUtils]: 114: Hoare triple {65161#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {65162#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:55,831 INFO L273 TraceCheckUtils]: 115: Hoare triple {65162#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65162#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:55,831 INFO L273 TraceCheckUtils]: 116: Hoare triple {65162#(<= main_~i~0 37)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65162#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:55,833 INFO L273 TraceCheckUtils]: 117: Hoare triple {65162#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {65163#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:55,833 INFO L273 TraceCheckUtils]: 118: Hoare triple {65163#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65163#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:55,835 INFO L273 TraceCheckUtils]: 119: Hoare triple {65163#(<= main_~i~0 38)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65163#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:55,835 INFO L273 TraceCheckUtils]: 120: Hoare triple {65163#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {65164#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:55,837 INFO L273 TraceCheckUtils]: 121: Hoare triple {65164#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65164#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:55,837 INFO L273 TraceCheckUtils]: 122: Hoare triple {65164#(<= main_~i~0 39)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65164#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:55,840 INFO L273 TraceCheckUtils]: 123: Hoare triple {65164#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {65165#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:55,840 INFO L273 TraceCheckUtils]: 124: Hoare triple {65165#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65165#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:55,843 INFO L273 TraceCheckUtils]: 125: Hoare triple {65165#(<= main_~i~0 40)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65165#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:55,843 INFO L273 TraceCheckUtils]: 126: Hoare triple {65165#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {65166#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:55,845 INFO L273 TraceCheckUtils]: 127: Hoare triple {65166#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65166#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:55,845 INFO L273 TraceCheckUtils]: 128: Hoare triple {65166#(<= main_~i~0 41)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65166#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:55,847 INFO L273 TraceCheckUtils]: 129: Hoare triple {65166#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {65167#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:55,847 INFO L273 TraceCheckUtils]: 130: Hoare triple {65167#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65167#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:55,849 INFO L273 TraceCheckUtils]: 131: Hoare triple {65167#(<= main_~i~0 42)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65167#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:55,849 INFO L273 TraceCheckUtils]: 132: Hoare triple {65167#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {65168#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:55,852 INFO L273 TraceCheckUtils]: 133: Hoare triple {65168#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65168#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:55,852 INFO L273 TraceCheckUtils]: 134: Hoare triple {65168#(<= main_~i~0 43)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65168#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:55,854 INFO L273 TraceCheckUtils]: 135: Hoare triple {65168#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {65169#(<= main_~i~0 44)} is VALID [2018-11-23 11:53:55,854 INFO L273 TraceCheckUtils]: 136: Hoare triple {65169#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65169#(<= main_~i~0 44)} is VALID [2018-11-23 11:53:55,857 INFO L273 TraceCheckUtils]: 137: Hoare triple {65169#(<= main_~i~0 44)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65169#(<= main_~i~0 44)} is VALID [2018-11-23 11:53:55,857 INFO L273 TraceCheckUtils]: 138: Hoare triple {65169#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {65170#(<= main_~i~0 45)} is VALID [2018-11-23 11:53:55,860 INFO L273 TraceCheckUtils]: 139: Hoare triple {65170#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65170#(<= main_~i~0 45)} is VALID [2018-11-23 11:53:55,860 INFO L273 TraceCheckUtils]: 140: Hoare triple {65170#(<= main_~i~0 45)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65170#(<= main_~i~0 45)} is VALID [2018-11-23 11:53:55,863 INFO L273 TraceCheckUtils]: 141: Hoare triple {65170#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {65171#(<= main_~i~0 46)} is VALID [2018-11-23 11:53:55,863 INFO L273 TraceCheckUtils]: 142: Hoare triple {65171#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65171#(<= main_~i~0 46)} is VALID [2018-11-23 11:53:55,865 INFO L273 TraceCheckUtils]: 143: Hoare triple {65171#(<= main_~i~0 46)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65171#(<= main_~i~0 46)} is VALID [2018-11-23 11:53:55,865 INFO L273 TraceCheckUtils]: 144: Hoare triple {65171#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {65172#(<= main_~i~0 47)} is VALID [2018-11-23 11:53:55,867 INFO L273 TraceCheckUtils]: 145: Hoare triple {65172#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65172#(<= main_~i~0 47)} is VALID [2018-11-23 11:53:55,867 INFO L273 TraceCheckUtils]: 146: Hoare triple {65172#(<= main_~i~0 47)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65172#(<= main_~i~0 47)} is VALID [2018-11-23 11:53:55,869 INFO L273 TraceCheckUtils]: 147: Hoare triple {65172#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {65173#(<= main_~i~0 48)} is VALID [2018-11-23 11:53:55,869 INFO L273 TraceCheckUtils]: 148: Hoare triple {65173#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65173#(<= main_~i~0 48)} is VALID [2018-11-23 11:53:55,871 INFO L273 TraceCheckUtils]: 149: Hoare triple {65173#(<= main_~i~0 48)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65173#(<= main_~i~0 48)} is VALID [2018-11-23 11:53:55,871 INFO L273 TraceCheckUtils]: 150: Hoare triple {65173#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {65174#(<= main_~i~0 49)} is VALID [2018-11-23 11:53:55,873 INFO L273 TraceCheckUtils]: 151: Hoare triple {65174#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {65174#(<= main_~i~0 49)} is VALID [2018-11-23 11:53:55,873 INFO L273 TraceCheckUtils]: 152: Hoare triple {65174#(<= main_~i~0 49)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {65174#(<= main_~i~0 49)} is VALID [2018-11-23 11:53:55,875 INFO L273 TraceCheckUtils]: 153: Hoare triple {65174#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {65175#(<= main_~i~0 50)} is VALID [2018-11-23 11:53:55,875 INFO L273 TraceCheckUtils]: 154: Hoare triple {65175#(<= main_~i~0 50)} assume !(~i~0 < 100000); {65125#false} is VALID [2018-11-23 11:53:55,875 INFO L273 TraceCheckUtils]: 155: Hoare triple {65125#false} assume !(0 != ~swapped~0); {65125#false} is VALID [2018-11-23 11:53:55,875 INFO L273 TraceCheckUtils]: 156: Hoare triple {65125#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {65125#false} is VALID [2018-11-23 11:53:55,875 INFO L273 TraceCheckUtils]: 157: Hoare triple {65125#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {65125#false} is VALID [2018-11-23 11:53:55,875 INFO L273 TraceCheckUtils]: 158: Hoare triple {65125#false} assume !!(~y~0 < 100000);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); {65125#false} is VALID [2018-11-23 11:53:55,876 INFO L256 TraceCheckUtils]: 159: Hoare triple {65125#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {65125#false} is VALID [2018-11-23 11:53:55,876 INFO L273 TraceCheckUtils]: 160: Hoare triple {65125#false} ~cond := #in~cond; {65125#false} is VALID [2018-11-23 11:53:55,876 INFO L273 TraceCheckUtils]: 161: Hoare triple {65125#false} assume 0 == ~cond; {65125#false} is VALID [2018-11-23 11:53:55,876 INFO L273 TraceCheckUtils]: 162: Hoare triple {65125#false} assume !false; {65125#false} is VALID [2018-11-23 11:53:55,892 INFO L134 CoverageAnalysis]: Checked inductivity of 3578 backedges. 1 proven. 3577 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:53:55,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:55,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 53 [2018-11-23 11:53:55,912 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 163 [2018-11-23 11:53:55,913 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:55,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 53 states. [2018-11-23 11:53:56,084 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:53:56,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-11-23 11:53:56,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-11-23 11:53:56,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-11-23 11:53:56,086 INFO L87 Difference]: Start difference. First operand 315 states and 416 transitions. Second operand 53 states. [2018-11-23 11:53:57,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:57,126 INFO L93 Difference]: Finished difference Result 634 states and 842 transitions. [2018-11-23 11:53:57,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-23 11:53:57,126 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 163 [2018-11-23 11:53:57,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:57,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 11:53:57,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 249 transitions. [2018-11-23 11:53:57,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 11:53:57,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 249 transitions. [2018-11-23 11:53:57,133 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states and 249 transitions. [2018-11-23 11:53:57,387 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 249 edges. 249 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:57,396 INFO L225 Difference]: With dead ends: 634 [2018-11-23 11:53:57,396 INFO L226 Difference]: Without dead ends: 325 [2018-11-23 11:53:57,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-11-23 11:53:57,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-11-23 11:53:57,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 321. [2018-11-23 11:53:57,534 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:57,535 INFO L82 GeneralOperation]: Start isEquivalent. First operand 325 states. Second operand 321 states. [2018-11-23 11:53:57,535 INFO L74 IsIncluded]: Start isIncluded. First operand 325 states. Second operand 321 states. [2018-11-23 11:53:57,535 INFO L87 Difference]: Start difference. First operand 325 states. Second operand 321 states. [2018-11-23 11:53:57,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:57,541 INFO L93 Difference]: Finished difference Result 325 states and 430 transitions. [2018-11-23 11:53:57,541 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 430 transitions. [2018-11-23 11:53:57,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:57,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:57,542 INFO L74 IsIncluded]: Start isIncluded. First operand 321 states. Second operand 325 states. [2018-11-23 11:53:57,542 INFO L87 Difference]: Start difference. First operand 321 states. Second operand 325 states. [2018-11-23 11:53:57,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:57,548 INFO L93 Difference]: Finished difference Result 325 states and 430 transitions. [2018-11-23 11:53:57,548 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 430 transitions. [2018-11-23 11:53:57,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:57,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:57,549 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:57,549 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:57,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-11-23 11:53:57,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 424 transitions. [2018-11-23 11:53:57,554 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 424 transitions. Word has length 163 [2018-11-23 11:53:57,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:57,554 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 424 transitions. [2018-11-23 11:53:57,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-11-23 11:53:57,555 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 424 transitions. [2018-11-23 11:53:57,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-11-23 11:53:57,555 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:57,555 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:53:57,556 INFO L423 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:57,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:57,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1307373455, now seen corresponding path program 50 times [2018-11-23 11:53:57,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:57,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:57,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:57,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:53:57,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:57,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:58,764 INFO L256 TraceCheckUtils]: 0: Hoare triple {67597#true} call ULTIMATE.init(); {67597#true} is VALID [2018-11-23 11:53:58,764 INFO L273 TraceCheckUtils]: 1: Hoare triple {67597#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {67597#true} is VALID [2018-11-23 11:53:58,764 INFO L273 TraceCheckUtils]: 2: Hoare triple {67597#true} assume true; {67597#true} is VALID [2018-11-23 11:53:58,764 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {67597#true} {67597#true} #79#return; {67597#true} is VALID [2018-11-23 11:53:58,765 INFO L256 TraceCheckUtils]: 4: Hoare triple {67597#true} call #t~ret8 := main(); {67597#true} is VALID [2018-11-23 11:53:58,765 INFO L273 TraceCheckUtils]: 5: Hoare triple {67597#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {67597#true} is VALID [2018-11-23 11:53:58,765 INFO L273 TraceCheckUtils]: 6: Hoare triple {67597#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {67599#(= main_~i~0 1)} is VALID [2018-11-23 11:53:58,766 INFO L273 TraceCheckUtils]: 7: Hoare triple {67599#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67599#(= main_~i~0 1)} is VALID [2018-11-23 11:53:58,766 INFO L273 TraceCheckUtils]: 8: Hoare triple {67599#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67599#(= main_~i~0 1)} is VALID [2018-11-23 11:53:58,767 INFO L273 TraceCheckUtils]: 9: Hoare triple {67599#(= main_~i~0 1)} ~i~0 := 1 + ~i~0; {67600#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:58,768 INFO L273 TraceCheckUtils]: 10: Hoare triple {67600#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67600#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:58,768 INFO L273 TraceCheckUtils]: 11: Hoare triple {67600#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67600#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:58,769 INFO L273 TraceCheckUtils]: 12: Hoare triple {67600#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {67601#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:58,769 INFO L273 TraceCheckUtils]: 13: Hoare triple {67601#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67601#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:58,770 INFO L273 TraceCheckUtils]: 14: Hoare triple {67601#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67601#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:58,771 INFO L273 TraceCheckUtils]: 15: Hoare triple {67601#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {67602#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:58,771 INFO L273 TraceCheckUtils]: 16: Hoare triple {67602#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67602#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:58,772 INFO L273 TraceCheckUtils]: 17: Hoare triple {67602#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67602#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:58,772 INFO L273 TraceCheckUtils]: 18: Hoare triple {67602#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {67603#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:58,773 INFO L273 TraceCheckUtils]: 19: Hoare triple {67603#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67603#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:58,773 INFO L273 TraceCheckUtils]: 20: Hoare triple {67603#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67603#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:58,774 INFO L273 TraceCheckUtils]: 21: Hoare triple {67603#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {67604#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:58,775 INFO L273 TraceCheckUtils]: 22: Hoare triple {67604#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67604#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:58,775 INFO L273 TraceCheckUtils]: 23: Hoare triple {67604#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67604#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:58,776 INFO L273 TraceCheckUtils]: 24: Hoare triple {67604#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {67605#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:58,776 INFO L273 TraceCheckUtils]: 25: Hoare triple {67605#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67605#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:58,777 INFO L273 TraceCheckUtils]: 26: Hoare triple {67605#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67605#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:58,778 INFO L273 TraceCheckUtils]: 27: Hoare triple {67605#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {67606#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:58,778 INFO L273 TraceCheckUtils]: 28: Hoare triple {67606#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67606#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:58,779 INFO L273 TraceCheckUtils]: 29: Hoare triple {67606#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67606#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:58,779 INFO L273 TraceCheckUtils]: 30: Hoare triple {67606#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {67607#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:58,780 INFO L273 TraceCheckUtils]: 31: Hoare triple {67607#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67607#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:58,780 INFO L273 TraceCheckUtils]: 32: Hoare triple {67607#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67607#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:58,781 INFO L273 TraceCheckUtils]: 33: Hoare triple {67607#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {67608#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:58,782 INFO L273 TraceCheckUtils]: 34: Hoare triple {67608#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67608#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:58,782 INFO L273 TraceCheckUtils]: 35: Hoare triple {67608#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67608#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:58,783 INFO L273 TraceCheckUtils]: 36: Hoare triple {67608#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {67609#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:58,783 INFO L273 TraceCheckUtils]: 37: Hoare triple {67609#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67609#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:58,784 INFO L273 TraceCheckUtils]: 38: Hoare triple {67609#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67609#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:58,785 INFO L273 TraceCheckUtils]: 39: Hoare triple {67609#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {67610#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:58,785 INFO L273 TraceCheckUtils]: 40: Hoare triple {67610#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67610#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:58,786 INFO L273 TraceCheckUtils]: 41: Hoare triple {67610#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67610#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:58,786 INFO L273 TraceCheckUtils]: 42: Hoare triple {67610#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {67611#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:58,787 INFO L273 TraceCheckUtils]: 43: Hoare triple {67611#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67611#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:58,787 INFO L273 TraceCheckUtils]: 44: Hoare triple {67611#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67611#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:58,788 INFO L273 TraceCheckUtils]: 45: Hoare triple {67611#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {67612#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:58,789 INFO L273 TraceCheckUtils]: 46: Hoare triple {67612#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67612#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:58,789 INFO L273 TraceCheckUtils]: 47: Hoare triple {67612#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67612#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:58,790 INFO L273 TraceCheckUtils]: 48: Hoare triple {67612#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {67613#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:58,790 INFO L273 TraceCheckUtils]: 49: Hoare triple {67613#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67613#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:58,791 INFO L273 TraceCheckUtils]: 50: Hoare triple {67613#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67613#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:58,792 INFO L273 TraceCheckUtils]: 51: Hoare triple {67613#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {67614#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:58,792 INFO L273 TraceCheckUtils]: 52: Hoare triple {67614#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67614#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:58,793 INFO L273 TraceCheckUtils]: 53: Hoare triple {67614#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67614#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:58,793 INFO L273 TraceCheckUtils]: 54: Hoare triple {67614#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {67615#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:58,794 INFO L273 TraceCheckUtils]: 55: Hoare triple {67615#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67615#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:58,794 INFO L273 TraceCheckUtils]: 56: Hoare triple {67615#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67615#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:58,795 INFO L273 TraceCheckUtils]: 57: Hoare triple {67615#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {67616#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:58,796 INFO L273 TraceCheckUtils]: 58: Hoare triple {67616#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67616#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:58,796 INFO L273 TraceCheckUtils]: 59: Hoare triple {67616#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67616#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:58,797 INFO L273 TraceCheckUtils]: 60: Hoare triple {67616#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {67617#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:58,797 INFO L273 TraceCheckUtils]: 61: Hoare triple {67617#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67617#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:58,798 INFO L273 TraceCheckUtils]: 62: Hoare triple {67617#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67617#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:58,799 INFO L273 TraceCheckUtils]: 63: Hoare triple {67617#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {67618#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:58,799 INFO L273 TraceCheckUtils]: 64: Hoare triple {67618#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67618#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:58,800 INFO L273 TraceCheckUtils]: 65: Hoare triple {67618#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67618#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:58,800 INFO L273 TraceCheckUtils]: 66: Hoare triple {67618#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {67619#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:58,801 INFO L273 TraceCheckUtils]: 67: Hoare triple {67619#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67619#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:58,801 INFO L273 TraceCheckUtils]: 68: Hoare triple {67619#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67619#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:58,802 INFO L273 TraceCheckUtils]: 69: Hoare triple {67619#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {67620#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:58,803 INFO L273 TraceCheckUtils]: 70: Hoare triple {67620#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67620#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:58,803 INFO L273 TraceCheckUtils]: 71: Hoare triple {67620#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67620#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:58,804 INFO L273 TraceCheckUtils]: 72: Hoare triple {67620#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {67621#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:58,805 INFO L273 TraceCheckUtils]: 73: Hoare triple {67621#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67621#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:58,805 INFO L273 TraceCheckUtils]: 74: Hoare triple {67621#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67621#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:58,806 INFO L273 TraceCheckUtils]: 75: Hoare triple {67621#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {67622#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:58,806 INFO L273 TraceCheckUtils]: 76: Hoare triple {67622#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67622#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:58,807 INFO L273 TraceCheckUtils]: 77: Hoare triple {67622#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67622#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:58,808 INFO L273 TraceCheckUtils]: 78: Hoare triple {67622#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {67623#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:58,808 INFO L273 TraceCheckUtils]: 79: Hoare triple {67623#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67623#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:58,809 INFO L273 TraceCheckUtils]: 80: Hoare triple {67623#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67623#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:58,809 INFO L273 TraceCheckUtils]: 81: Hoare triple {67623#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {67624#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:58,810 INFO L273 TraceCheckUtils]: 82: Hoare triple {67624#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67624#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:58,810 INFO L273 TraceCheckUtils]: 83: Hoare triple {67624#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67624#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:58,811 INFO L273 TraceCheckUtils]: 84: Hoare triple {67624#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {67625#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:58,812 INFO L273 TraceCheckUtils]: 85: Hoare triple {67625#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67625#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:58,812 INFO L273 TraceCheckUtils]: 86: Hoare triple {67625#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67625#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:58,813 INFO L273 TraceCheckUtils]: 87: Hoare triple {67625#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {67626#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:58,813 INFO L273 TraceCheckUtils]: 88: Hoare triple {67626#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67626#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:58,814 INFO L273 TraceCheckUtils]: 89: Hoare triple {67626#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67626#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:58,815 INFO L273 TraceCheckUtils]: 90: Hoare triple {67626#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {67627#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:58,815 INFO L273 TraceCheckUtils]: 91: Hoare triple {67627#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67627#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:58,816 INFO L273 TraceCheckUtils]: 92: Hoare triple {67627#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67627#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:58,816 INFO L273 TraceCheckUtils]: 93: Hoare triple {67627#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {67628#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:58,817 INFO L273 TraceCheckUtils]: 94: Hoare triple {67628#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67628#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:58,817 INFO L273 TraceCheckUtils]: 95: Hoare triple {67628#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67628#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:58,818 INFO L273 TraceCheckUtils]: 96: Hoare triple {67628#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {67629#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:58,819 INFO L273 TraceCheckUtils]: 97: Hoare triple {67629#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67629#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:58,819 INFO L273 TraceCheckUtils]: 98: Hoare triple {67629#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67629#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:58,820 INFO L273 TraceCheckUtils]: 99: Hoare triple {67629#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {67630#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:58,820 INFO L273 TraceCheckUtils]: 100: Hoare triple {67630#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67630#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:58,821 INFO L273 TraceCheckUtils]: 101: Hoare triple {67630#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67630#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:58,822 INFO L273 TraceCheckUtils]: 102: Hoare triple {67630#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {67631#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:58,822 INFO L273 TraceCheckUtils]: 103: Hoare triple {67631#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67631#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:58,823 INFO L273 TraceCheckUtils]: 104: Hoare triple {67631#(<= main_~i~0 33)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67631#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:58,823 INFO L273 TraceCheckUtils]: 105: Hoare triple {67631#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {67632#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:58,824 INFO L273 TraceCheckUtils]: 106: Hoare triple {67632#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67632#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:58,824 INFO L273 TraceCheckUtils]: 107: Hoare triple {67632#(<= main_~i~0 34)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67632#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:58,825 INFO L273 TraceCheckUtils]: 108: Hoare triple {67632#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {67633#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:58,826 INFO L273 TraceCheckUtils]: 109: Hoare triple {67633#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67633#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:58,826 INFO L273 TraceCheckUtils]: 110: Hoare triple {67633#(<= main_~i~0 35)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67633#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:58,827 INFO L273 TraceCheckUtils]: 111: Hoare triple {67633#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {67634#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:58,827 INFO L273 TraceCheckUtils]: 112: Hoare triple {67634#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67634#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:58,828 INFO L273 TraceCheckUtils]: 113: Hoare triple {67634#(<= main_~i~0 36)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67634#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:58,829 INFO L273 TraceCheckUtils]: 114: Hoare triple {67634#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {67635#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:58,829 INFO L273 TraceCheckUtils]: 115: Hoare triple {67635#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67635#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:58,830 INFO L273 TraceCheckUtils]: 116: Hoare triple {67635#(<= main_~i~0 37)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67635#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:58,830 INFO L273 TraceCheckUtils]: 117: Hoare triple {67635#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {67636#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:58,831 INFO L273 TraceCheckUtils]: 118: Hoare triple {67636#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67636#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:58,831 INFO L273 TraceCheckUtils]: 119: Hoare triple {67636#(<= main_~i~0 38)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67636#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:58,832 INFO L273 TraceCheckUtils]: 120: Hoare triple {67636#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {67637#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:58,833 INFO L273 TraceCheckUtils]: 121: Hoare triple {67637#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67637#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:58,833 INFO L273 TraceCheckUtils]: 122: Hoare triple {67637#(<= main_~i~0 39)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67637#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:58,834 INFO L273 TraceCheckUtils]: 123: Hoare triple {67637#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {67638#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:58,834 INFO L273 TraceCheckUtils]: 124: Hoare triple {67638#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67638#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:58,835 INFO L273 TraceCheckUtils]: 125: Hoare triple {67638#(<= main_~i~0 40)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67638#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:58,836 INFO L273 TraceCheckUtils]: 126: Hoare triple {67638#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {67639#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:58,836 INFO L273 TraceCheckUtils]: 127: Hoare triple {67639#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67639#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:58,837 INFO L273 TraceCheckUtils]: 128: Hoare triple {67639#(<= main_~i~0 41)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67639#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:58,837 INFO L273 TraceCheckUtils]: 129: Hoare triple {67639#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {67640#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:58,838 INFO L273 TraceCheckUtils]: 130: Hoare triple {67640#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67640#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:58,838 INFO L273 TraceCheckUtils]: 131: Hoare triple {67640#(<= main_~i~0 42)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67640#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:58,839 INFO L273 TraceCheckUtils]: 132: Hoare triple {67640#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {67641#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:58,840 INFO L273 TraceCheckUtils]: 133: Hoare triple {67641#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67641#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:58,840 INFO L273 TraceCheckUtils]: 134: Hoare triple {67641#(<= main_~i~0 43)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67641#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:58,841 INFO L273 TraceCheckUtils]: 135: Hoare triple {67641#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {67642#(<= main_~i~0 44)} is VALID [2018-11-23 11:53:58,842 INFO L273 TraceCheckUtils]: 136: Hoare triple {67642#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67642#(<= main_~i~0 44)} is VALID [2018-11-23 11:53:58,842 INFO L273 TraceCheckUtils]: 137: Hoare triple {67642#(<= main_~i~0 44)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67642#(<= main_~i~0 44)} is VALID [2018-11-23 11:53:58,843 INFO L273 TraceCheckUtils]: 138: Hoare triple {67642#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {67643#(<= main_~i~0 45)} is VALID [2018-11-23 11:53:58,843 INFO L273 TraceCheckUtils]: 139: Hoare triple {67643#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67643#(<= main_~i~0 45)} is VALID [2018-11-23 11:53:58,844 INFO L273 TraceCheckUtils]: 140: Hoare triple {67643#(<= main_~i~0 45)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67643#(<= main_~i~0 45)} is VALID [2018-11-23 11:53:58,845 INFO L273 TraceCheckUtils]: 141: Hoare triple {67643#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {67644#(<= main_~i~0 46)} is VALID [2018-11-23 11:53:58,845 INFO L273 TraceCheckUtils]: 142: Hoare triple {67644#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67644#(<= main_~i~0 46)} is VALID [2018-11-23 11:53:58,846 INFO L273 TraceCheckUtils]: 143: Hoare triple {67644#(<= main_~i~0 46)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67644#(<= main_~i~0 46)} is VALID [2018-11-23 11:53:58,846 INFO L273 TraceCheckUtils]: 144: Hoare triple {67644#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {67645#(<= main_~i~0 47)} is VALID [2018-11-23 11:53:58,847 INFO L273 TraceCheckUtils]: 145: Hoare triple {67645#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67645#(<= main_~i~0 47)} is VALID [2018-11-23 11:53:58,847 INFO L273 TraceCheckUtils]: 146: Hoare triple {67645#(<= main_~i~0 47)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67645#(<= main_~i~0 47)} is VALID [2018-11-23 11:53:58,848 INFO L273 TraceCheckUtils]: 147: Hoare triple {67645#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {67646#(<= main_~i~0 48)} is VALID [2018-11-23 11:53:58,849 INFO L273 TraceCheckUtils]: 148: Hoare triple {67646#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67646#(<= main_~i~0 48)} is VALID [2018-11-23 11:53:58,849 INFO L273 TraceCheckUtils]: 149: Hoare triple {67646#(<= main_~i~0 48)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67646#(<= main_~i~0 48)} is VALID [2018-11-23 11:53:58,850 INFO L273 TraceCheckUtils]: 150: Hoare triple {67646#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {67647#(<= main_~i~0 49)} is VALID [2018-11-23 11:53:58,850 INFO L273 TraceCheckUtils]: 151: Hoare triple {67647#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67647#(<= main_~i~0 49)} is VALID [2018-11-23 11:53:58,851 INFO L273 TraceCheckUtils]: 152: Hoare triple {67647#(<= main_~i~0 49)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67647#(<= main_~i~0 49)} is VALID [2018-11-23 11:53:58,852 INFO L273 TraceCheckUtils]: 153: Hoare triple {67647#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {67648#(<= main_~i~0 50)} is VALID [2018-11-23 11:53:58,852 INFO L273 TraceCheckUtils]: 154: Hoare triple {67648#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67648#(<= main_~i~0 50)} is VALID [2018-11-23 11:53:58,853 INFO L273 TraceCheckUtils]: 155: Hoare triple {67648#(<= main_~i~0 50)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67648#(<= main_~i~0 50)} is VALID [2018-11-23 11:53:58,853 INFO L273 TraceCheckUtils]: 156: Hoare triple {67648#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {67649#(<= main_~i~0 51)} is VALID [2018-11-23 11:53:58,854 INFO L273 TraceCheckUtils]: 157: Hoare triple {67649#(<= main_~i~0 51)} assume !(~i~0 < 100000); {67598#false} is VALID [2018-11-23 11:53:58,854 INFO L273 TraceCheckUtils]: 158: Hoare triple {67598#false} assume !(0 != ~swapped~0); {67598#false} is VALID [2018-11-23 11:53:58,855 INFO L273 TraceCheckUtils]: 159: Hoare triple {67598#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {67598#false} is VALID [2018-11-23 11:53:58,855 INFO L273 TraceCheckUtils]: 160: Hoare triple {67598#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {67598#false} is VALID [2018-11-23 11:53:58,855 INFO L273 TraceCheckUtils]: 161: Hoare triple {67598#false} assume !!(~y~0 < 100000);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); {67598#false} is VALID [2018-11-23 11:53:58,855 INFO L256 TraceCheckUtils]: 162: Hoare triple {67598#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {67598#false} is VALID [2018-11-23 11:53:58,855 INFO L273 TraceCheckUtils]: 163: Hoare triple {67598#false} ~cond := #in~cond; {67598#false} is VALID [2018-11-23 11:53:58,855 INFO L273 TraceCheckUtils]: 164: Hoare triple {67598#false} assume 0 == ~cond; {67598#false} is VALID [2018-11-23 11:53:58,856 INFO L273 TraceCheckUtils]: 165: Hoare triple {67598#false} assume !false; {67598#false} is VALID [2018-11-23 11:53:58,873 INFO L134 CoverageAnalysis]: Checked inductivity of 3726 backedges. 1 proven. 3725 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:53:58,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:58,873 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:53:58,883 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:53:58,957 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:53:58,957 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:58,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:58,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:00,344 INFO L256 TraceCheckUtils]: 0: Hoare triple {67597#true} call ULTIMATE.init(); {67597#true} is VALID [2018-11-23 11:54:00,345 INFO L273 TraceCheckUtils]: 1: Hoare triple {67597#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {67597#true} is VALID [2018-11-23 11:54:00,345 INFO L273 TraceCheckUtils]: 2: Hoare triple {67597#true} assume true; {67597#true} is VALID [2018-11-23 11:54:00,345 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {67597#true} {67597#true} #79#return; {67597#true} is VALID [2018-11-23 11:54:00,345 INFO L256 TraceCheckUtils]: 4: Hoare triple {67597#true} call #t~ret8 := main(); {67597#true} is VALID [2018-11-23 11:54:00,345 INFO L273 TraceCheckUtils]: 5: Hoare triple {67597#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {67597#true} is VALID [2018-11-23 11:54:00,346 INFO L273 TraceCheckUtils]: 6: Hoare triple {67597#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {67671#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:00,346 INFO L273 TraceCheckUtils]: 7: Hoare triple {67671#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67671#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:00,347 INFO L273 TraceCheckUtils]: 8: Hoare triple {67671#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67671#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:00,347 INFO L273 TraceCheckUtils]: 9: Hoare triple {67671#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {67600#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:00,348 INFO L273 TraceCheckUtils]: 10: Hoare triple {67600#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67600#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:00,348 INFO L273 TraceCheckUtils]: 11: Hoare triple {67600#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67600#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:00,348 INFO L273 TraceCheckUtils]: 12: Hoare triple {67600#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {67601#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:00,349 INFO L273 TraceCheckUtils]: 13: Hoare triple {67601#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67601#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:00,349 INFO L273 TraceCheckUtils]: 14: Hoare triple {67601#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67601#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:00,350 INFO L273 TraceCheckUtils]: 15: Hoare triple {67601#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {67602#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:00,350 INFO L273 TraceCheckUtils]: 16: Hoare triple {67602#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67602#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:00,351 INFO L273 TraceCheckUtils]: 17: Hoare triple {67602#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67602#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:00,352 INFO L273 TraceCheckUtils]: 18: Hoare triple {67602#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {67603#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:00,352 INFO L273 TraceCheckUtils]: 19: Hoare triple {67603#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67603#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:00,353 INFO L273 TraceCheckUtils]: 20: Hoare triple {67603#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67603#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:00,353 INFO L273 TraceCheckUtils]: 21: Hoare triple {67603#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {67604#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:00,354 INFO L273 TraceCheckUtils]: 22: Hoare triple {67604#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67604#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:00,354 INFO L273 TraceCheckUtils]: 23: Hoare triple {67604#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67604#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:00,355 INFO L273 TraceCheckUtils]: 24: Hoare triple {67604#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {67605#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:00,356 INFO L273 TraceCheckUtils]: 25: Hoare triple {67605#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67605#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:00,356 INFO L273 TraceCheckUtils]: 26: Hoare triple {67605#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67605#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:00,357 INFO L273 TraceCheckUtils]: 27: Hoare triple {67605#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {67606#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:00,357 INFO L273 TraceCheckUtils]: 28: Hoare triple {67606#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67606#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:00,358 INFO L273 TraceCheckUtils]: 29: Hoare triple {67606#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67606#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:00,358 INFO L273 TraceCheckUtils]: 30: Hoare triple {67606#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {67607#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:00,359 INFO L273 TraceCheckUtils]: 31: Hoare triple {67607#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67607#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:00,359 INFO L273 TraceCheckUtils]: 32: Hoare triple {67607#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67607#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:00,360 INFO L273 TraceCheckUtils]: 33: Hoare triple {67607#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {67608#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:00,361 INFO L273 TraceCheckUtils]: 34: Hoare triple {67608#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67608#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:00,361 INFO L273 TraceCheckUtils]: 35: Hoare triple {67608#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67608#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:00,362 INFO L273 TraceCheckUtils]: 36: Hoare triple {67608#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {67609#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:00,362 INFO L273 TraceCheckUtils]: 37: Hoare triple {67609#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67609#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:00,363 INFO L273 TraceCheckUtils]: 38: Hoare triple {67609#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67609#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:00,364 INFO L273 TraceCheckUtils]: 39: Hoare triple {67609#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {67610#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:00,364 INFO L273 TraceCheckUtils]: 40: Hoare triple {67610#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67610#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:00,365 INFO L273 TraceCheckUtils]: 41: Hoare triple {67610#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67610#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:00,365 INFO L273 TraceCheckUtils]: 42: Hoare triple {67610#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {67611#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:00,366 INFO L273 TraceCheckUtils]: 43: Hoare triple {67611#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67611#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:00,366 INFO L273 TraceCheckUtils]: 44: Hoare triple {67611#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67611#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:00,367 INFO L273 TraceCheckUtils]: 45: Hoare triple {67611#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {67612#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:00,368 INFO L273 TraceCheckUtils]: 46: Hoare triple {67612#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67612#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:00,368 INFO L273 TraceCheckUtils]: 47: Hoare triple {67612#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67612#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:00,369 INFO L273 TraceCheckUtils]: 48: Hoare triple {67612#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {67613#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:00,369 INFO L273 TraceCheckUtils]: 49: Hoare triple {67613#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67613#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:00,370 INFO L273 TraceCheckUtils]: 50: Hoare triple {67613#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67613#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:00,371 INFO L273 TraceCheckUtils]: 51: Hoare triple {67613#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {67614#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:00,371 INFO L273 TraceCheckUtils]: 52: Hoare triple {67614#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67614#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:00,372 INFO L273 TraceCheckUtils]: 53: Hoare triple {67614#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67614#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:00,372 INFO L273 TraceCheckUtils]: 54: Hoare triple {67614#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {67615#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:00,373 INFO L273 TraceCheckUtils]: 55: Hoare triple {67615#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67615#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:00,373 INFO L273 TraceCheckUtils]: 56: Hoare triple {67615#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67615#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:00,374 INFO L273 TraceCheckUtils]: 57: Hoare triple {67615#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {67616#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:00,374 INFO L273 TraceCheckUtils]: 58: Hoare triple {67616#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67616#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:00,375 INFO L273 TraceCheckUtils]: 59: Hoare triple {67616#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67616#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:00,376 INFO L273 TraceCheckUtils]: 60: Hoare triple {67616#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {67617#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:00,376 INFO L273 TraceCheckUtils]: 61: Hoare triple {67617#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67617#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:00,377 INFO L273 TraceCheckUtils]: 62: Hoare triple {67617#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67617#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:00,377 INFO L273 TraceCheckUtils]: 63: Hoare triple {67617#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {67618#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:00,378 INFO L273 TraceCheckUtils]: 64: Hoare triple {67618#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67618#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:00,378 INFO L273 TraceCheckUtils]: 65: Hoare triple {67618#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67618#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:00,379 INFO L273 TraceCheckUtils]: 66: Hoare triple {67618#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {67619#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:00,380 INFO L273 TraceCheckUtils]: 67: Hoare triple {67619#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67619#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:00,380 INFO L273 TraceCheckUtils]: 68: Hoare triple {67619#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67619#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:00,381 INFO L273 TraceCheckUtils]: 69: Hoare triple {67619#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {67620#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:00,381 INFO L273 TraceCheckUtils]: 70: Hoare triple {67620#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67620#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:00,382 INFO L273 TraceCheckUtils]: 71: Hoare triple {67620#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67620#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:00,383 INFO L273 TraceCheckUtils]: 72: Hoare triple {67620#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {67621#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:00,383 INFO L273 TraceCheckUtils]: 73: Hoare triple {67621#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67621#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:00,384 INFO L273 TraceCheckUtils]: 74: Hoare triple {67621#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67621#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:00,384 INFO L273 TraceCheckUtils]: 75: Hoare triple {67621#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {67622#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:00,385 INFO L273 TraceCheckUtils]: 76: Hoare triple {67622#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67622#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:00,385 INFO L273 TraceCheckUtils]: 77: Hoare triple {67622#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67622#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:00,386 INFO L273 TraceCheckUtils]: 78: Hoare triple {67622#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {67623#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:00,387 INFO L273 TraceCheckUtils]: 79: Hoare triple {67623#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67623#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:00,387 INFO L273 TraceCheckUtils]: 80: Hoare triple {67623#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67623#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:00,388 INFO L273 TraceCheckUtils]: 81: Hoare triple {67623#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {67624#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:00,388 INFO L273 TraceCheckUtils]: 82: Hoare triple {67624#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67624#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:00,389 INFO L273 TraceCheckUtils]: 83: Hoare triple {67624#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67624#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:00,390 INFO L273 TraceCheckUtils]: 84: Hoare triple {67624#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {67625#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:00,390 INFO L273 TraceCheckUtils]: 85: Hoare triple {67625#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67625#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:00,391 INFO L273 TraceCheckUtils]: 86: Hoare triple {67625#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67625#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:00,393 INFO L273 TraceCheckUtils]: 87: Hoare triple {67625#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {67626#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:00,394 INFO L273 TraceCheckUtils]: 88: Hoare triple {67626#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67626#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:00,394 INFO L273 TraceCheckUtils]: 89: Hoare triple {67626#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67626#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:00,395 INFO L273 TraceCheckUtils]: 90: Hoare triple {67626#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {67627#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:00,395 INFO L273 TraceCheckUtils]: 91: Hoare triple {67627#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67627#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:00,395 INFO L273 TraceCheckUtils]: 92: Hoare triple {67627#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67627#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:00,396 INFO L273 TraceCheckUtils]: 93: Hoare triple {67627#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {67628#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:00,396 INFO L273 TraceCheckUtils]: 94: Hoare triple {67628#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67628#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:00,396 INFO L273 TraceCheckUtils]: 95: Hoare triple {67628#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67628#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:00,397 INFO L273 TraceCheckUtils]: 96: Hoare triple {67628#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {67629#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:00,398 INFO L273 TraceCheckUtils]: 97: Hoare triple {67629#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67629#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:00,398 INFO L273 TraceCheckUtils]: 98: Hoare triple {67629#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67629#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:00,399 INFO L273 TraceCheckUtils]: 99: Hoare triple {67629#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {67630#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:00,399 INFO L273 TraceCheckUtils]: 100: Hoare triple {67630#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67630#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:00,400 INFO L273 TraceCheckUtils]: 101: Hoare triple {67630#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67630#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:00,400 INFO L273 TraceCheckUtils]: 102: Hoare triple {67630#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {67631#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:00,401 INFO L273 TraceCheckUtils]: 103: Hoare triple {67631#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67631#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:00,401 INFO L273 TraceCheckUtils]: 104: Hoare triple {67631#(<= main_~i~0 33)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67631#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:00,402 INFO L273 TraceCheckUtils]: 105: Hoare triple {67631#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {67632#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:00,403 INFO L273 TraceCheckUtils]: 106: Hoare triple {67632#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67632#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:00,403 INFO L273 TraceCheckUtils]: 107: Hoare triple {67632#(<= main_~i~0 34)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67632#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:00,404 INFO L273 TraceCheckUtils]: 108: Hoare triple {67632#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {67633#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:00,404 INFO L273 TraceCheckUtils]: 109: Hoare triple {67633#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67633#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:00,405 INFO L273 TraceCheckUtils]: 110: Hoare triple {67633#(<= main_~i~0 35)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67633#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:00,406 INFO L273 TraceCheckUtils]: 111: Hoare triple {67633#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {67634#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:00,406 INFO L273 TraceCheckUtils]: 112: Hoare triple {67634#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67634#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:00,407 INFO L273 TraceCheckUtils]: 113: Hoare triple {67634#(<= main_~i~0 36)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67634#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:00,407 INFO L273 TraceCheckUtils]: 114: Hoare triple {67634#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {67635#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:00,408 INFO L273 TraceCheckUtils]: 115: Hoare triple {67635#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67635#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:00,408 INFO L273 TraceCheckUtils]: 116: Hoare triple {67635#(<= main_~i~0 37)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67635#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:00,409 INFO L273 TraceCheckUtils]: 117: Hoare triple {67635#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {67636#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:00,410 INFO L273 TraceCheckUtils]: 118: Hoare triple {67636#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67636#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:00,410 INFO L273 TraceCheckUtils]: 119: Hoare triple {67636#(<= main_~i~0 38)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67636#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:00,411 INFO L273 TraceCheckUtils]: 120: Hoare triple {67636#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {67637#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:00,411 INFO L273 TraceCheckUtils]: 121: Hoare triple {67637#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67637#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:00,412 INFO L273 TraceCheckUtils]: 122: Hoare triple {67637#(<= main_~i~0 39)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67637#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:00,413 INFO L273 TraceCheckUtils]: 123: Hoare triple {67637#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {67638#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:00,413 INFO L273 TraceCheckUtils]: 124: Hoare triple {67638#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67638#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:00,414 INFO L273 TraceCheckUtils]: 125: Hoare triple {67638#(<= main_~i~0 40)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67638#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:00,414 INFO L273 TraceCheckUtils]: 126: Hoare triple {67638#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {67639#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:00,415 INFO L273 TraceCheckUtils]: 127: Hoare triple {67639#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67639#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:00,415 INFO L273 TraceCheckUtils]: 128: Hoare triple {67639#(<= main_~i~0 41)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67639#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:00,416 INFO L273 TraceCheckUtils]: 129: Hoare triple {67639#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {67640#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:00,416 INFO L273 TraceCheckUtils]: 130: Hoare triple {67640#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67640#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:00,417 INFO L273 TraceCheckUtils]: 131: Hoare triple {67640#(<= main_~i~0 42)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67640#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:00,418 INFO L273 TraceCheckUtils]: 132: Hoare triple {67640#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {67641#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:00,418 INFO L273 TraceCheckUtils]: 133: Hoare triple {67641#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67641#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:00,419 INFO L273 TraceCheckUtils]: 134: Hoare triple {67641#(<= main_~i~0 43)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67641#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:00,419 INFO L273 TraceCheckUtils]: 135: Hoare triple {67641#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {67642#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:00,420 INFO L273 TraceCheckUtils]: 136: Hoare triple {67642#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67642#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:00,420 INFO L273 TraceCheckUtils]: 137: Hoare triple {67642#(<= main_~i~0 44)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67642#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:00,421 INFO L273 TraceCheckUtils]: 138: Hoare triple {67642#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {67643#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:00,422 INFO L273 TraceCheckUtils]: 139: Hoare triple {67643#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67643#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:00,422 INFO L273 TraceCheckUtils]: 140: Hoare triple {67643#(<= main_~i~0 45)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67643#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:00,423 INFO L273 TraceCheckUtils]: 141: Hoare triple {67643#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {67644#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:00,423 INFO L273 TraceCheckUtils]: 142: Hoare triple {67644#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67644#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:00,424 INFO L273 TraceCheckUtils]: 143: Hoare triple {67644#(<= main_~i~0 46)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67644#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:00,425 INFO L273 TraceCheckUtils]: 144: Hoare triple {67644#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {67645#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:00,425 INFO L273 TraceCheckUtils]: 145: Hoare triple {67645#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67645#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:00,426 INFO L273 TraceCheckUtils]: 146: Hoare triple {67645#(<= main_~i~0 47)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67645#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:00,426 INFO L273 TraceCheckUtils]: 147: Hoare triple {67645#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {67646#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:00,427 INFO L273 TraceCheckUtils]: 148: Hoare triple {67646#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67646#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:00,427 INFO L273 TraceCheckUtils]: 149: Hoare triple {67646#(<= main_~i~0 48)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67646#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:00,428 INFO L273 TraceCheckUtils]: 150: Hoare triple {67646#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {67647#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:00,429 INFO L273 TraceCheckUtils]: 151: Hoare triple {67647#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67647#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:00,429 INFO L273 TraceCheckUtils]: 152: Hoare triple {67647#(<= main_~i~0 49)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67647#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:00,430 INFO L273 TraceCheckUtils]: 153: Hoare triple {67647#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {67648#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:00,430 INFO L273 TraceCheckUtils]: 154: Hoare triple {67648#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {67648#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:00,431 INFO L273 TraceCheckUtils]: 155: Hoare triple {67648#(<= main_~i~0 50)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {67648#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:00,432 INFO L273 TraceCheckUtils]: 156: Hoare triple {67648#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {67649#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:00,432 INFO L273 TraceCheckUtils]: 157: Hoare triple {67649#(<= main_~i~0 51)} assume !(~i~0 < 100000); {67598#false} is VALID [2018-11-23 11:54:00,433 INFO L273 TraceCheckUtils]: 158: Hoare triple {67598#false} assume !(0 != ~swapped~0); {67598#false} is VALID [2018-11-23 11:54:00,433 INFO L273 TraceCheckUtils]: 159: Hoare triple {67598#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {67598#false} is VALID [2018-11-23 11:54:00,433 INFO L273 TraceCheckUtils]: 160: Hoare triple {67598#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {67598#false} is VALID [2018-11-23 11:54:00,433 INFO L273 TraceCheckUtils]: 161: Hoare triple {67598#false} assume !!(~y~0 < 100000);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); {67598#false} is VALID [2018-11-23 11:54:00,433 INFO L256 TraceCheckUtils]: 162: Hoare triple {67598#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {67598#false} is VALID [2018-11-23 11:54:00,433 INFO L273 TraceCheckUtils]: 163: Hoare triple {67598#false} ~cond := #in~cond; {67598#false} is VALID [2018-11-23 11:54:00,434 INFO L273 TraceCheckUtils]: 164: Hoare triple {67598#false} assume 0 == ~cond; {67598#false} is VALID [2018-11-23 11:54:00,434 INFO L273 TraceCheckUtils]: 165: Hoare triple {67598#false} assume !false; {67598#false} is VALID [2018-11-23 11:54:00,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3726 backedges. 1 proven. 3725 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:00,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:00,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 54 [2018-11-23 11:54:00,472 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 166 [2018-11-23 11:54:00,472 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:00,472 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states. [2018-11-23 11:54:00,626 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:00,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-11-23 11:54:00,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-11-23 11:54:00,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-11-23 11:54:00,628 INFO L87 Difference]: Start difference. First operand 321 states and 424 transitions. Second operand 54 states. [2018-11-23 11:54:01,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:01,896 INFO L93 Difference]: Finished difference Result 646 states and 858 transitions. [2018-11-23 11:54:01,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-11-23 11:54:01,896 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 166 [2018-11-23 11:54:01,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:01,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 11:54:01,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 253 transitions. [2018-11-23 11:54:01,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 11:54:01,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 253 transitions. [2018-11-23 11:54:01,900 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 53 states and 253 transitions. [2018-11-23 11:54:02,155 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 253 edges. 253 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:02,162 INFO L225 Difference]: With dead ends: 646 [2018-11-23 11:54:02,163 INFO L226 Difference]: Without dead ends: 331 [2018-11-23 11:54:02,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-11-23 11:54:02,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-11-23 11:54:02,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 327. [2018-11-23 11:54:02,277 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:02,278 INFO L82 GeneralOperation]: Start isEquivalent. First operand 331 states. Second operand 327 states. [2018-11-23 11:54:02,278 INFO L74 IsIncluded]: Start isIncluded. First operand 331 states. Second operand 327 states. [2018-11-23 11:54:02,278 INFO L87 Difference]: Start difference. First operand 331 states. Second operand 327 states. [2018-11-23 11:54:02,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:02,285 INFO L93 Difference]: Finished difference Result 331 states and 438 transitions. [2018-11-23 11:54:02,285 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 438 transitions. [2018-11-23 11:54:02,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:02,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:02,285 INFO L74 IsIncluded]: Start isIncluded. First operand 327 states. Second operand 331 states. [2018-11-23 11:54:02,285 INFO L87 Difference]: Start difference. First operand 327 states. Second operand 331 states. [2018-11-23 11:54:02,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:02,291 INFO L93 Difference]: Finished difference Result 331 states and 438 transitions. [2018-11-23 11:54:02,291 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 438 transitions. [2018-11-23 11:54:02,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:02,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:02,292 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:02,292 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:02,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-11-23 11:54:02,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 432 transitions. [2018-11-23 11:54:02,298 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 432 transitions. Word has length 166 [2018-11-23 11:54:02,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:02,298 INFO L480 AbstractCegarLoop]: Abstraction has 327 states and 432 transitions. [2018-11-23 11:54:02,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-11-23 11:54:02,298 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 432 transitions. [2018-11-23 11:54:02,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-23 11:54:02,299 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:02,299 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:02,299 INFO L423 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:02,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:02,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1808469352, now seen corresponding path program 51 times [2018-11-23 11:54:02,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:02,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:02,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:02,300 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:02,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:02,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:03,744 INFO L256 TraceCheckUtils]: 0: Hoare triple {70116#true} call ULTIMATE.init(); {70116#true} is VALID [2018-11-23 11:54:03,744 INFO L273 TraceCheckUtils]: 1: Hoare triple {70116#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {70116#true} is VALID [2018-11-23 11:54:03,744 INFO L273 TraceCheckUtils]: 2: Hoare triple {70116#true} assume true; {70116#true} is VALID [2018-11-23 11:54:03,745 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {70116#true} {70116#true} #79#return; {70116#true} is VALID [2018-11-23 11:54:03,745 INFO L256 TraceCheckUtils]: 4: Hoare triple {70116#true} call #t~ret8 := main(); {70116#true} is VALID [2018-11-23 11:54:03,745 INFO L273 TraceCheckUtils]: 5: Hoare triple {70116#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {70116#true} is VALID [2018-11-23 11:54:03,745 INFO L273 TraceCheckUtils]: 6: Hoare triple {70116#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {70118#(= main_~i~0 1)} is VALID [2018-11-23 11:54:03,745 INFO L273 TraceCheckUtils]: 7: Hoare triple {70118#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70118#(= main_~i~0 1)} is VALID [2018-11-23 11:54:03,746 INFO L273 TraceCheckUtils]: 8: Hoare triple {70118#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70118#(= main_~i~0 1)} is VALID [2018-11-23 11:54:03,746 INFO L273 TraceCheckUtils]: 9: Hoare triple {70118#(= main_~i~0 1)} ~i~0 := 1 + ~i~0; {70119#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:03,747 INFO L273 TraceCheckUtils]: 10: Hoare triple {70119#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70119#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:03,747 INFO L273 TraceCheckUtils]: 11: Hoare triple {70119#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70119#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:03,748 INFO L273 TraceCheckUtils]: 12: Hoare triple {70119#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {70120#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:03,749 INFO L273 TraceCheckUtils]: 13: Hoare triple {70120#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70120#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:03,749 INFO L273 TraceCheckUtils]: 14: Hoare triple {70120#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70120#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:03,750 INFO L273 TraceCheckUtils]: 15: Hoare triple {70120#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {70121#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:03,750 INFO L273 TraceCheckUtils]: 16: Hoare triple {70121#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70121#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:03,751 INFO L273 TraceCheckUtils]: 17: Hoare triple {70121#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70121#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:03,752 INFO L273 TraceCheckUtils]: 18: Hoare triple {70121#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {70122#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:03,752 INFO L273 TraceCheckUtils]: 19: Hoare triple {70122#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70122#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:03,753 INFO L273 TraceCheckUtils]: 20: Hoare triple {70122#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70122#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:03,753 INFO L273 TraceCheckUtils]: 21: Hoare triple {70122#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {70123#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:03,754 INFO L273 TraceCheckUtils]: 22: Hoare triple {70123#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70123#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:03,754 INFO L273 TraceCheckUtils]: 23: Hoare triple {70123#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70123#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:03,755 INFO L273 TraceCheckUtils]: 24: Hoare triple {70123#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {70124#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:03,755 INFO L273 TraceCheckUtils]: 25: Hoare triple {70124#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70124#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:03,756 INFO L273 TraceCheckUtils]: 26: Hoare triple {70124#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70124#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:03,756 INFO L273 TraceCheckUtils]: 27: Hoare triple {70124#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {70125#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:03,757 INFO L273 TraceCheckUtils]: 28: Hoare triple {70125#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70125#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:03,757 INFO L273 TraceCheckUtils]: 29: Hoare triple {70125#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70125#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:03,758 INFO L273 TraceCheckUtils]: 30: Hoare triple {70125#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {70126#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:03,759 INFO L273 TraceCheckUtils]: 31: Hoare triple {70126#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70126#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:03,759 INFO L273 TraceCheckUtils]: 32: Hoare triple {70126#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70126#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:03,760 INFO L273 TraceCheckUtils]: 33: Hoare triple {70126#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {70127#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:03,760 INFO L273 TraceCheckUtils]: 34: Hoare triple {70127#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70127#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:03,761 INFO L273 TraceCheckUtils]: 35: Hoare triple {70127#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70127#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:03,761 INFO L273 TraceCheckUtils]: 36: Hoare triple {70127#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {70128#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:03,762 INFO L273 TraceCheckUtils]: 37: Hoare triple {70128#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70128#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:03,762 INFO L273 TraceCheckUtils]: 38: Hoare triple {70128#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70128#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:03,763 INFO L273 TraceCheckUtils]: 39: Hoare triple {70128#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {70129#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:03,763 INFO L273 TraceCheckUtils]: 40: Hoare triple {70129#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70129#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:03,764 INFO L273 TraceCheckUtils]: 41: Hoare triple {70129#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70129#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:03,765 INFO L273 TraceCheckUtils]: 42: Hoare triple {70129#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {70130#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:03,765 INFO L273 TraceCheckUtils]: 43: Hoare triple {70130#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70130#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:03,766 INFO L273 TraceCheckUtils]: 44: Hoare triple {70130#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70130#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:03,766 INFO L273 TraceCheckUtils]: 45: Hoare triple {70130#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {70131#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:03,767 INFO L273 TraceCheckUtils]: 46: Hoare triple {70131#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70131#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:03,767 INFO L273 TraceCheckUtils]: 47: Hoare triple {70131#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70131#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:03,768 INFO L273 TraceCheckUtils]: 48: Hoare triple {70131#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {70132#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:03,768 INFO L273 TraceCheckUtils]: 49: Hoare triple {70132#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70132#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:03,769 INFO L273 TraceCheckUtils]: 50: Hoare triple {70132#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70132#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:03,770 INFO L273 TraceCheckUtils]: 51: Hoare triple {70132#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {70133#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:03,770 INFO L273 TraceCheckUtils]: 52: Hoare triple {70133#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70133#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:03,770 INFO L273 TraceCheckUtils]: 53: Hoare triple {70133#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70133#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:03,771 INFO L273 TraceCheckUtils]: 54: Hoare triple {70133#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {70134#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:03,772 INFO L273 TraceCheckUtils]: 55: Hoare triple {70134#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70134#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:03,772 INFO L273 TraceCheckUtils]: 56: Hoare triple {70134#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70134#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:03,773 INFO L273 TraceCheckUtils]: 57: Hoare triple {70134#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {70135#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:03,773 INFO L273 TraceCheckUtils]: 58: Hoare triple {70135#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70135#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:03,774 INFO L273 TraceCheckUtils]: 59: Hoare triple {70135#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70135#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:03,774 INFO L273 TraceCheckUtils]: 60: Hoare triple {70135#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {70136#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:03,775 INFO L273 TraceCheckUtils]: 61: Hoare triple {70136#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70136#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:03,775 INFO L273 TraceCheckUtils]: 62: Hoare triple {70136#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70136#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:03,776 INFO L273 TraceCheckUtils]: 63: Hoare triple {70136#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {70137#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:03,776 INFO L273 TraceCheckUtils]: 64: Hoare triple {70137#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70137#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:03,777 INFO L273 TraceCheckUtils]: 65: Hoare triple {70137#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70137#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:03,778 INFO L273 TraceCheckUtils]: 66: Hoare triple {70137#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {70138#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:03,778 INFO L273 TraceCheckUtils]: 67: Hoare triple {70138#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70138#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:03,778 INFO L273 TraceCheckUtils]: 68: Hoare triple {70138#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70138#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:03,779 INFO L273 TraceCheckUtils]: 69: Hoare triple {70138#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {70139#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:03,780 INFO L273 TraceCheckUtils]: 70: Hoare triple {70139#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70139#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:03,780 INFO L273 TraceCheckUtils]: 71: Hoare triple {70139#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70139#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:03,781 INFO L273 TraceCheckUtils]: 72: Hoare triple {70139#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {70140#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:03,781 INFO L273 TraceCheckUtils]: 73: Hoare triple {70140#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70140#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:03,782 INFO L273 TraceCheckUtils]: 74: Hoare triple {70140#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70140#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:03,782 INFO L273 TraceCheckUtils]: 75: Hoare triple {70140#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {70141#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:03,783 INFO L273 TraceCheckUtils]: 76: Hoare triple {70141#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70141#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:03,783 INFO L273 TraceCheckUtils]: 77: Hoare triple {70141#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70141#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:03,784 INFO L273 TraceCheckUtils]: 78: Hoare triple {70141#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {70142#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:03,784 INFO L273 TraceCheckUtils]: 79: Hoare triple {70142#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70142#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:03,785 INFO L273 TraceCheckUtils]: 80: Hoare triple {70142#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70142#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:03,786 INFO L273 TraceCheckUtils]: 81: Hoare triple {70142#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {70143#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:03,786 INFO L273 TraceCheckUtils]: 82: Hoare triple {70143#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70143#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:03,787 INFO L273 TraceCheckUtils]: 83: Hoare triple {70143#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70143#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:03,787 INFO L273 TraceCheckUtils]: 84: Hoare triple {70143#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {70144#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:03,788 INFO L273 TraceCheckUtils]: 85: Hoare triple {70144#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70144#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:03,788 INFO L273 TraceCheckUtils]: 86: Hoare triple {70144#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70144#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:03,789 INFO L273 TraceCheckUtils]: 87: Hoare triple {70144#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {70145#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:03,789 INFO L273 TraceCheckUtils]: 88: Hoare triple {70145#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70145#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:03,790 INFO L273 TraceCheckUtils]: 89: Hoare triple {70145#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70145#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:03,791 INFO L273 TraceCheckUtils]: 90: Hoare triple {70145#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {70146#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:03,791 INFO L273 TraceCheckUtils]: 91: Hoare triple {70146#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70146#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:03,791 INFO L273 TraceCheckUtils]: 92: Hoare triple {70146#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70146#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:03,792 INFO L273 TraceCheckUtils]: 93: Hoare triple {70146#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {70147#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:03,793 INFO L273 TraceCheckUtils]: 94: Hoare triple {70147#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70147#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:03,793 INFO L273 TraceCheckUtils]: 95: Hoare triple {70147#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70147#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:03,794 INFO L273 TraceCheckUtils]: 96: Hoare triple {70147#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {70148#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:03,794 INFO L273 TraceCheckUtils]: 97: Hoare triple {70148#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70148#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:03,795 INFO L273 TraceCheckUtils]: 98: Hoare triple {70148#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70148#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:03,795 INFO L273 TraceCheckUtils]: 99: Hoare triple {70148#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {70149#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:03,796 INFO L273 TraceCheckUtils]: 100: Hoare triple {70149#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70149#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:03,796 INFO L273 TraceCheckUtils]: 101: Hoare triple {70149#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70149#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:03,797 INFO L273 TraceCheckUtils]: 102: Hoare triple {70149#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {70150#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:03,797 INFO L273 TraceCheckUtils]: 103: Hoare triple {70150#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70150#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:03,798 INFO L273 TraceCheckUtils]: 104: Hoare triple {70150#(<= main_~i~0 33)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70150#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:03,799 INFO L273 TraceCheckUtils]: 105: Hoare triple {70150#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {70151#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:03,799 INFO L273 TraceCheckUtils]: 106: Hoare triple {70151#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70151#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:03,800 INFO L273 TraceCheckUtils]: 107: Hoare triple {70151#(<= main_~i~0 34)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70151#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:03,800 INFO L273 TraceCheckUtils]: 108: Hoare triple {70151#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {70152#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:03,801 INFO L273 TraceCheckUtils]: 109: Hoare triple {70152#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70152#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:03,801 INFO L273 TraceCheckUtils]: 110: Hoare triple {70152#(<= main_~i~0 35)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70152#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:03,802 INFO L273 TraceCheckUtils]: 111: Hoare triple {70152#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {70153#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:03,802 INFO L273 TraceCheckUtils]: 112: Hoare triple {70153#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70153#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:03,803 INFO L273 TraceCheckUtils]: 113: Hoare triple {70153#(<= main_~i~0 36)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70153#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:03,803 INFO L273 TraceCheckUtils]: 114: Hoare triple {70153#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {70154#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:03,804 INFO L273 TraceCheckUtils]: 115: Hoare triple {70154#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70154#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:03,804 INFO L273 TraceCheckUtils]: 116: Hoare triple {70154#(<= main_~i~0 37)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70154#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:03,805 INFO L273 TraceCheckUtils]: 117: Hoare triple {70154#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {70155#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:03,805 INFO L273 TraceCheckUtils]: 118: Hoare triple {70155#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70155#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:03,806 INFO L273 TraceCheckUtils]: 119: Hoare triple {70155#(<= main_~i~0 38)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70155#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:03,807 INFO L273 TraceCheckUtils]: 120: Hoare triple {70155#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {70156#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:03,807 INFO L273 TraceCheckUtils]: 121: Hoare triple {70156#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70156#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:03,808 INFO L273 TraceCheckUtils]: 122: Hoare triple {70156#(<= main_~i~0 39)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70156#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:03,808 INFO L273 TraceCheckUtils]: 123: Hoare triple {70156#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {70157#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:03,809 INFO L273 TraceCheckUtils]: 124: Hoare triple {70157#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70157#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:03,809 INFO L273 TraceCheckUtils]: 125: Hoare triple {70157#(<= main_~i~0 40)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70157#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:03,810 INFO L273 TraceCheckUtils]: 126: Hoare triple {70157#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {70158#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:03,810 INFO L273 TraceCheckUtils]: 127: Hoare triple {70158#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70158#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:03,811 INFO L273 TraceCheckUtils]: 128: Hoare triple {70158#(<= main_~i~0 41)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70158#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:03,811 INFO L273 TraceCheckUtils]: 129: Hoare triple {70158#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {70159#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:03,812 INFO L273 TraceCheckUtils]: 130: Hoare triple {70159#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70159#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:03,812 INFO L273 TraceCheckUtils]: 131: Hoare triple {70159#(<= main_~i~0 42)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70159#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:03,813 INFO L273 TraceCheckUtils]: 132: Hoare triple {70159#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {70160#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:03,814 INFO L273 TraceCheckUtils]: 133: Hoare triple {70160#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70160#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:03,814 INFO L273 TraceCheckUtils]: 134: Hoare triple {70160#(<= main_~i~0 43)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70160#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:03,815 INFO L273 TraceCheckUtils]: 135: Hoare triple {70160#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {70161#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:03,815 INFO L273 TraceCheckUtils]: 136: Hoare triple {70161#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70161#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:03,816 INFO L273 TraceCheckUtils]: 137: Hoare triple {70161#(<= main_~i~0 44)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70161#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:03,816 INFO L273 TraceCheckUtils]: 138: Hoare triple {70161#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {70162#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:03,817 INFO L273 TraceCheckUtils]: 139: Hoare triple {70162#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70162#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:03,817 INFO L273 TraceCheckUtils]: 140: Hoare triple {70162#(<= main_~i~0 45)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70162#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:03,818 INFO L273 TraceCheckUtils]: 141: Hoare triple {70162#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {70163#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:03,818 INFO L273 TraceCheckUtils]: 142: Hoare triple {70163#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70163#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:03,819 INFO L273 TraceCheckUtils]: 143: Hoare triple {70163#(<= main_~i~0 46)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70163#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:03,820 INFO L273 TraceCheckUtils]: 144: Hoare triple {70163#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {70164#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:03,820 INFO L273 TraceCheckUtils]: 145: Hoare triple {70164#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70164#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:03,821 INFO L273 TraceCheckUtils]: 146: Hoare triple {70164#(<= main_~i~0 47)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70164#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:03,821 INFO L273 TraceCheckUtils]: 147: Hoare triple {70164#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {70165#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:03,822 INFO L273 TraceCheckUtils]: 148: Hoare triple {70165#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70165#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:03,822 INFO L273 TraceCheckUtils]: 149: Hoare triple {70165#(<= main_~i~0 48)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70165#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:03,823 INFO L273 TraceCheckUtils]: 150: Hoare triple {70165#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {70166#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:03,823 INFO L273 TraceCheckUtils]: 151: Hoare triple {70166#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70166#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:03,824 INFO L273 TraceCheckUtils]: 152: Hoare triple {70166#(<= main_~i~0 49)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70166#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:03,825 INFO L273 TraceCheckUtils]: 153: Hoare triple {70166#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {70167#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:03,825 INFO L273 TraceCheckUtils]: 154: Hoare triple {70167#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70167#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:03,825 INFO L273 TraceCheckUtils]: 155: Hoare triple {70167#(<= main_~i~0 50)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70167#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:03,826 INFO L273 TraceCheckUtils]: 156: Hoare triple {70167#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {70168#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:03,827 INFO L273 TraceCheckUtils]: 157: Hoare triple {70168#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70168#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:03,827 INFO L273 TraceCheckUtils]: 158: Hoare triple {70168#(<= main_~i~0 51)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70168#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:03,828 INFO L273 TraceCheckUtils]: 159: Hoare triple {70168#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {70169#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:03,828 INFO L273 TraceCheckUtils]: 160: Hoare triple {70169#(<= main_~i~0 52)} assume !(~i~0 < 100000); {70117#false} is VALID [2018-11-23 11:54:03,829 INFO L273 TraceCheckUtils]: 161: Hoare triple {70117#false} assume !(0 != ~swapped~0); {70117#false} is VALID [2018-11-23 11:54:03,829 INFO L273 TraceCheckUtils]: 162: Hoare triple {70117#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {70117#false} is VALID [2018-11-23 11:54:03,829 INFO L273 TraceCheckUtils]: 163: Hoare triple {70117#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {70117#false} is VALID [2018-11-23 11:54:03,829 INFO L273 TraceCheckUtils]: 164: Hoare triple {70117#false} assume !!(~y~0 < 100000);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); {70117#false} is VALID [2018-11-23 11:54:03,829 INFO L256 TraceCheckUtils]: 165: Hoare triple {70117#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {70117#false} is VALID [2018-11-23 11:54:03,830 INFO L273 TraceCheckUtils]: 166: Hoare triple {70117#false} ~cond := #in~cond; {70117#false} is VALID [2018-11-23 11:54:03,830 INFO L273 TraceCheckUtils]: 167: Hoare triple {70117#false} assume 0 == ~cond; {70117#false} is VALID [2018-11-23 11:54:03,830 INFO L273 TraceCheckUtils]: 168: Hoare triple {70117#false} assume !false; {70117#false} is VALID [2018-11-23 11:54:03,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3877 backedges. 1 proven. 3876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:03,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:03,848 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:54:03,857 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:54:04,072 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2018-11-23 11:54:04,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:04,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:04,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:04,757 INFO L256 TraceCheckUtils]: 0: Hoare triple {70116#true} call ULTIMATE.init(); {70116#true} is VALID [2018-11-23 11:54:04,758 INFO L273 TraceCheckUtils]: 1: Hoare triple {70116#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {70116#true} is VALID [2018-11-23 11:54:04,758 INFO L273 TraceCheckUtils]: 2: Hoare triple {70116#true} assume true; {70116#true} is VALID [2018-11-23 11:54:04,758 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {70116#true} {70116#true} #79#return; {70116#true} is VALID [2018-11-23 11:54:04,758 INFO L256 TraceCheckUtils]: 4: Hoare triple {70116#true} call #t~ret8 := main(); {70116#true} is VALID [2018-11-23 11:54:04,758 INFO L273 TraceCheckUtils]: 5: Hoare triple {70116#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {70116#true} is VALID [2018-11-23 11:54:04,759 INFO L273 TraceCheckUtils]: 6: Hoare triple {70116#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {70191#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:04,759 INFO L273 TraceCheckUtils]: 7: Hoare triple {70191#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70191#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:04,760 INFO L273 TraceCheckUtils]: 8: Hoare triple {70191#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70191#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:04,760 INFO L273 TraceCheckUtils]: 9: Hoare triple {70191#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {70119#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:04,760 INFO L273 TraceCheckUtils]: 10: Hoare triple {70119#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70119#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:04,761 INFO L273 TraceCheckUtils]: 11: Hoare triple {70119#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70119#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:04,761 INFO L273 TraceCheckUtils]: 12: Hoare triple {70119#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {70120#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:04,761 INFO L273 TraceCheckUtils]: 13: Hoare triple {70120#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70120#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:04,762 INFO L273 TraceCheckUtils]: 14: Hoare triple {70120#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70120#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:04,763 INFO L273 TraceCheckUtils]: 15: Hoare triple {70120#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {70121#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:04,763 INFO L273 TraceCheckUtils]: 16: Hoare triple {70121#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70121#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:04,763 INFO L273 TraceCheckUtils]: 17: Hoare triple {70121#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70121#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:04,764 INFO L273 TraceCheckUtils]: 18: Hoare triple {70121#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {70122#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:04,765 INFO L273 TraceCheckUtils]: 19: Hoare triple {70122#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70122#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:04,765 INFO L273 TraceCheckUtils]: 20: Hoare triple {70122#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70122#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:04,766 INFO L273 TraceCheckUtils]: 21: Hoare triple {70122#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {70123#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:04,766 INFO L273 TraceCheckUtils]: 22: Hoare triple {70123#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70123#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:04,767 INFO L273 TraceCheckUtils]: 23: Hoare triple {70123#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70123#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:04,767 INFO L273 TraceCheckUtils]: 24: Hoare triple {70123#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {70124#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:04,768 INFO L273 TraceCheckUtils]: 25: Hoare triple {70124#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70124#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:04,768 INFO L273 TraceCheckUtils]: 26: Hoare triple {70124#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70124#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:04,769 INFO L273 TraceCheckUtils]: 27: Hoare triple {70124#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {70125#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:04,769 INFO L273 TraceCheckUtils]: 28: Hoare triple {70125#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70125#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:04,770 INFO L273 TraceCheckUtils]: 29: Hoare triple {70125#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70125#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:04,771 INFO L273 TraceCheckUtils]: 30: Hoare triple {70125#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {70126#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:04,771 INFO L273 TraceCheckUtils]: 31: Hoare triple {70126#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70126#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:04,772 INFO L273 TraceCheckUtils]: 32: Hoare triple {70126#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70126#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:04,772 INFO L273 TraceCheckUtils]: 33: Hoare triple {70126#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {70127#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:04,773 INFO L273 TraceCheckUtils]: 34: Hoare triple {70127#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70127#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:04,773 INFO L273 TraceCheckUtils]: 35: Hoare triple {70127#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70127#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:04,774 INFO L273 TraceCheckUtils]: 36: Hoare triple {70127#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {70128#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:04,774 INFO L273 TraceCheckUtils]: 37: Hoare triple {70128#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70128#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:04,775 INFO L273 TraceCheckUtils]: 38: Hoare triple {70128#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70128#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:04,775 INFO L273 TraceCheckUtils]: 39: Hoare triple {70128#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {70129#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:04,776 INFO L273 TraceCheckUtils]: 40: Hoare triple {70129#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70129#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:04,776 INFO L273 TraceCheckUtils]: 41: Hoare triple {70129#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70129#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:04,777 INFO L273 TraceCheckUtils]: 42: Hoare triple {70129#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {70130#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:04,778 INFO L273 TraceCheckUtils]: 43: Hoare triple {70130#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70130#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:04,778 INFO L273 TraceCheckUtils]: 44: Hoare triple {70130#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70130#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:04,779 INFO L273 TraceCheckUtils]: 45: Hoare triple {70130#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {70131#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:04,779 INFO L273 TraceCheckUtils]: 46: Hoare triple {70131#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70131#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:04,780 INFO L273 TraceCheckUtils]: 47: Hoare triple {70131#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70131#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:04,780 INFO L273 TraceCheckUtils]: 48: Hoare triple {70131#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {70132#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:04,781 INFO L273 TraceCheckUtils]: 49: Hoare triple {70132#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70132#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:04,781 INFO L273 TraceCheckUtils]: 50: Hoare triple {70132#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70132#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:04,782 INFO L273 TraceCheckUtils]: 51: Hoare triple {70132#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {70133#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:04,782 INFO L273 TraceCheckUtils]: 52: Hoare triple {70133#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70133#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:04,783 INFO L273 TraceCheckUtils]: 53: Hoare triple {70133#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70133#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:04,783 INFO L273 TraceCheckUtils]: 54: Hoare triple {70133#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {70134#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:04,784 INFO L273 TraceCheckUtils]: 55: Hoare triple {70134#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70134#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:04,784 INFO L273 TraceCheckUtils]: 56: Hoare triple {70134#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70134#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:04,785 INFO L273 TraceCheckUtils]: 57: Hoare triple {70134#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {70135#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:04,786 INFO L273 TraceCheckUtils]: 58: Hoare triple {70135#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70135#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:04,786 INFO L273 TraceCheckUtils]: 59: Hoare triple {70135#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70135#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:04,787 INFO L273 TraceCheckUtils]: 60: Hoare triple {70135#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {70136#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:04,787 INFO L273 TraceCheckUtils]: 61: Hoare triple {70136#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70136#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:04,788 INFO L273 TraceCheckUtils]: 62: Hoare triple {70136#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70136#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:04,788 INFO L273 TraceCheckUtils]: 63: Hoare triple {70136#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {70137#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:04,789 INFO L273 TraceCheckUtils]: 64: Hoare triple {70137#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70137#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:04,789 INFO L273 TraceCheckUtils]: 65: Hoare triple {70137#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70137#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:04,790 INFO L273 TraceCheckUtils]: 66: Hoare triple {70137#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {70138#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:04,790 INFO L273 TraceCheckUtils]: 67: Hoare triple {70138#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70138#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:04,791 INFO L273 TraceCheckUtils]: 68: Hoare triple {70138#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70138#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:04,791 INFO L273 TraceCheckUtils]: 69: Hoare triple {70138#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {70139#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:04,792 INFO L273 TraceCheckUtils]: 70: Hoare triple {70139#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70139#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:04,792 INFO L273 TraceCheckUtils]: 71: Hoare triple {70139#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70139#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:04,793 INFO L273 TraceCheckUtils]: 72: Hoare triple {70139#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {70140#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:04,794 INFO L273 TraceCheckUtils]: 73: Hoare triple {70140#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70140#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:04,794 INFO L273 TraceCheckUtils]: 74: Hoare triple {70140#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70140#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:04,795 INFO L273 TraceCheckUtils]: 75: Hoare triple {70140#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {70141#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:04,795 INFO L273 TraceCheckUtils]: 76: Hoare triple {70141#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70141#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:04,796 INFO L273 TraceCheckUtils]: 77: Hoare triple {70141#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70141#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:04,796 INFO L273 TraceCheckUtils]: 78: Hoare triple {70141#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {70142#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:04,797 INFO L273 TraceCheckUtils]: 79: Hoare triple {70142#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70142#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:04,797 INFO L273 TraceCheckUtils]: 80: Hoare triple {70142#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70142#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:04,798 INFO L273 TraceCheckUtils]: 81: Hoare triple {70142#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {70143#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:04,798 INFO L273 TraceCheckUtils]: 82: Hoare triple {70143#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70143#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:04,799 INFO L273 TraceCheckUtils]: 83: Hoare triple {70143#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70143#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:04,799 INFO L273 TraceCheckUtils]: 84: Hoare triple {70143#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {70144#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:04,800 INFO L273 TraceCheckUtils]: 85: Hoare triple {70144#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70144#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:04,800 INFO L273 TraceCheckUtils]: 86: Hoare triple {70144#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70144#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:04,801 INFO L273 TraceCheckUtils]: 87: Hoare triple {70144#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {70145#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:04,802 INFO L273 TraceCheckUtils]: 88: Hoare triple {70145#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70145#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:04,802 INFO L273 TraceCheckUtils]: 89: Hoare triple {70145#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70145#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:04,803 INFO L273 TraceCheckUtils]: 90: Hoare triple {70145#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {70146#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:04,803 INFO L273 TraceCheckUtils]: 91: Hoare triple {70146#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70146#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:04,804 INFO L273 TraceCheckUtils]: 92: Hoare triple {70146#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70146#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:04,804 INFO L273 TraceCheckUtils]: 93: Hoare triple {70146#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {70147#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:04,805 INFO L273 TraceCheckUtils]: 94: Hoare triple {70147#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70147#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:04,805 INFO L273 TraceCheckUtils]: 95: Hoare triple {70147#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70147#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:04,806 INFO L273 TraceCheckUtils]: 96: Hoare triple {70147#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {70148#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:04,806 INFO L273 TraceCheckUtils]: 97: Hoare triple {70148#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70148#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:04,807 INFO L273 TraceCheckUtils]: 98: Hoare triple {70148#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70148#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:04,808 INFO L273 TraceCheckUtils]: 99: Hoare triple {70148#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {70149#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:04,808 INFO L273 TraceCheckUtils]: 100: Hoare triple {70149#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70149#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:04,808 INFO L273 TraceCheckUtils]: 101: Hoare triple {70149#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70149#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:04,809 INFO L273 TraceCheckUtils]: 102: Hoare triple {70149#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {70150#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:04,810 INFO L273 TraceCheckUtils]: 103: Hoare triple {70150#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70150#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:04,810 INFO L273 TraceCheckUtils]: 104: Hoare triple {70150#(<= main_~i~0 33)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70150#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:04,811 INFO L273 TraceCheckUtils]: 105: Hoare triple {70150#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {70151#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:04,811 INFO L273 TraceCheckUtils]: 106: Hoare triple {70151#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70151#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:04,812 INFO L273 TraceCheckUtils]: 107: Hoare triple {70151#(<= main_~i~0 34)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70151#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:04,812 INFO L273 TraceCheckUtils]: 108: Hoare triple {70151#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {70152#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:04,813 INFO L273 TraceCheckUtils]: 109: Hoare triple {70152#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70152#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:04,813 INFO L273 TraceCheckUtils]: 110: Hoare triple {70152#(<= main_~i~0 35)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70152#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:04,814 INFO L273 TraceCheckUtils]: 111: Hoare triple {70152#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {70153#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:04,814 INFO L273 TraceCheckUtils]: 112: Hoare triple {70153#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70153#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:04,815 INFO L273 TraceCheckUtils]: 113: Hoare triple {70153#(<= main_~i~0 36)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70153#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:04,816 INFO L273 TraceCheckUtils]: 114: Hoare triple {70153#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {70154#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:04,816 INFO L273 TraceCheckUtils]: 115: Hoare triple {70154#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70154#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:04,816 INFO L273 TraceCheckUtils]: 116: Hoare triple {70154#(<= main_~i~0 37)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70154#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:04,817 INFO L273 TraceCheckUtils]: 117: Hoare triple {70154#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {70155#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:04,818 INFO L273 TraceCheckUtils]: 118: Hoare triple {70155#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70155#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:04,818 INFO L273 TraceCheckUtils]: 119: Hoare triple {70155#(<= main_~i~0 38)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70155#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:04,819 INFO L273 TraceCheckUtils]: 120: Hoare triple {70155#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {70156#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:04,819 INFO L273 TraceCheckUtils]: 121: Hoare triple {70156#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70156#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:04,820 INFO L273 TraceCheckUtils]: 122: Hoare triple {70156#(<= main_~i~0 39)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70156#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:04,820 INFO L273 TraceCheckUtils]: 123: Hoare triple {70156#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {70157#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:04,821 INFO L273 TraceCheckUtils]: 124: Hoare triple {70157#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70157#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:04,821 INFO L273 TraceCheckUtils]: 125: Hoare triple {70157#(<= main_~i~0 40)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70157#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:04,822 INFO L273 TraceCheckUtils]: 126: Hoare triple {70157#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {70158#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:04,823 INFO L273 TraceCheckUtils]: 127: Hoare triple {70158#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70158#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:04,823 INFO L273 TraceCheckUtils]: 128: Hoare triple {70158#(<= main_~i~0 41)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70158#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:04,824 INFO L273 TraceCheckUtils]: 129: Hoare triple {70158#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {70159#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:04,824 INFO L273 TraceCheckUtils]: 130: Hoare triple {70159#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70159#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:04,825 INFO L273 TraceCheckUtils]: 131: Hoare triple {70159#(<= main_~i~0 42)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70159#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:04,825 INFO L273 TraceCheckUtils]: 132: Hoare triple {70159#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {70160#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:04,826 INFO L273 TraceCheckUtils]: 133: Hoare triple {70160#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70160#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:04,826 INFO L273 TraceCheckUtils]: 134: Hoare triple {70160#(<= main_~i~0 43)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70160#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:04,827 INFO L273 TraceCheckUtils]: 135: Hoare triple {70160#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {70161#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:04,827 INFO L273 TraceCheckUtils]: 136: Hoare triple {70161#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70161#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:04,828 INFO L273 TraceCheckUtils]: 137: Hoare triple {70161#(<= main_~i~0 44)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70161#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:04,829 INFO L273 TraceCheckUtils]: 138: Hoare triple {70161#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {70162#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:04,829 INFO L273 TraceCheckUtils]: 139: Hoare triple {70162#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70162#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:04,829 INFO L273 TraceCheckUtils]: 140: Hoare triple {70162#(<= main_~i~0 45)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70162#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:04,830 INFO L273 TraceCheckUtils]: 141: Hoare triple {70162#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {70163#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:04,831 INFO L273 TraceCheckUtils]: 142: Hoare triple {70163#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70163#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:04,831 INFO L273 TraceCheckUtils]: 143: Hoare triple {70163#(<= main_~i~0 46)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70163#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:04,832 INFO L273 TraceCheckUtils]: 144: Hoare triple {70163#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {70164#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:04,832 INFO L273 TraceCheckUtils]: 145: Hoare triple {70164#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70164#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:04,833 INFO L273 TraceCheckUtils]: 146: Hoare triple {70164#(<= main_~i~0 47)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70164#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:04,833 INFO L273 TraceCheckUtils]: 147: Hoare triple {70164#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {70165#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:04,834 INFO L273 TraceCheckUtils]: 148: Hoare triple {70165#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70165#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:04,834 INFO L273 TraceCheckUtils]: 149: Hoare triple {70165#(<= main_~i~0 48)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70165#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:04,835 INFO L273 TraceCheckUtils]: 150: Hoare triple {70165#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {70166#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:04,835 INFO L273 TraceCheckUtils]: 151: Hoare triple {70166#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70166#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:04,836 INFO L273 TraceCheckUtils]: 152: Hoare triple {70166#(<= main_~i~0 49)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70166#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:04,837 INFO L273 TraceCheckUtils]: 153: Hoare triple {70166#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {70167#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:04,837 INFO L273 TraceCheckUtils]: 154: Hoare triple {70167#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70167#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:04,838 INFO L273 TraceCheckUtils]: 155: Hoare triple {70167#(<= main_~i~0 50)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70167#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:04,838 INFO L273 TraceCheckUtils]: 156: Hoare triple {70167#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {70168#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:04,839 INFO L273 TraceCheckUtils]: 157: Hoare triple {70168#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {70168#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:04,839 INFO L273 TraceCheckUtils]: 158: Hoare triple {70168#(<= main_~i~0 51)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {70168#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:04,840 INFO L273 TraceCheckUtils]: 159: Hoare triple {70168#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {70169#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:04,840 INFO L273 TraceCheckUtils]: 160: Hoare triple {70169#(<= main_~i~0 52)} assume !(~i~0 < 100000); {70117#false} is VALID [2018-11-23 11:54:04,841 INFO L273 TraceCheckUtils]: 161: Hoare triple {70117#false} assume !(0 != ~swapped~0); {70117#false} is VALID [2018-11-23 11:54:04,841 INFO L273 TraceCheckUtils]: 162: Hoare triple {70117#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {70117#false} is VALID [2018-11-23 11:54:04,841 INFO L273 TraceCheckUtils]: 163: Hoare triple {70117#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {70117#false} is VALID [2018-11-23 11:54:04,841 INFO L273 TraceCheckUtils]: 164: Hoare triple {70117#false} assume !!(~y~0 < 100000);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); {70117#false} is VALID [2018-11-23 11:54:04,841 INFO L256 TraceCheckUtils]: 165: Hoare triple {70117#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {70117#false} is VALID [2018-11-23 11:54:04,841 INFO L273 TraceCheckUtils]: 166: Hoare triple {70117#false} ~cond := #in~cond; {70117#false} is VALID [2018-11-23 11:54:04,842 INFO L273 TraceCheckUtils]: 167: Hoare triple {70117#false} assume 0 == ~cond; {70117#false} is VALID [2018-11-23 11:54:04,842 INFO L273 TraceCheckUtils]: 168: Hoare triple {70117#false} assume !false; {70117#false} is VALID [2018-11-23 11:54:04,861 INFO L134 CoverageAnalysis]: Checked inductivity of 3877 backedges. 1 proven. 3876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:04,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:04,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 55 [2018-11-23 11:54:04,882 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 169 [2018-11-23 11:54:04,882 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:04,882 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 55 states. [2018-11-23 11:54:05,039 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:05,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-11-23 11:54:05,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-11-23 11:54:05,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-11-23 11:54:05,040 INFO L87 Difference]: Start difference. First operand 327 states and 432 transitions. Second operand 55 states. [2018-11-23 11:54:06,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:06,221 INFO L93 Difference]: Finished difference Result 658 states and 874 transitions. [2018-11-23 11:54:06,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-11-23 11:54:06,222 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 169 [2018-11-23 11:54:06,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:06,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 11:54:06,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 257 transitions. [2018-11-23 11:54:06,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 11:54:06,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 257 transitions. [2018-11-23 11:54:06,225 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states and 257 transitions. [2018-11-23 11:54:06,476 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 257 edges. 257 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:06,483 INFO L225 Difference]: With dead ends: 658 [2018-11-23 11:54:06,484 INFO L226 Difference]: Without dead ends: 337 [2018-11-23 11:54:06,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-11-23 11:54:06,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-11-23 11:54:06,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 333. [2018-11-23 11:54:06,616 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:06,616 INFO L82 GeneralOperation]: Start isEquivalent. First operand 337 states. Second operand 333 states. [2018-11-23 11:54:06,617 INFO L74 IsIncluded]: Start isIncluded. First operand 337 states. Second operand 333 states. [2018-11-23 11:54:06,617 INFO L87 Difference]: Start difference. First operand 337 states. Second operand 333 states. [2018-11-23 11:54:06,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:06,623 INFO L93 Difference]: Finished difference Result 337 states and 446 transitions. [2018-11-23 11:54:06,624 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 446 transitions. [2018-11-23 11:54:06,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:06,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:06,624 INFO L74 IsIncluded]: Start isIncluded. First operand 333 states. Second operand 337 states. [2018-11-23 11:54:06,624 INFO L87 Difference]: Start difference. First operand 333 states. Second operand 337 states. [2018-11-23 11:54:06,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:06,630 INFO L93 Difference]: Finished difference Result 337 states and 446 transitions. [2018-11-23 11:54:06,630 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 446 transitions. [2018-11-23 11:54:06,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:06,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:06,631 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:06,631 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:06,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-11-23 11:54:06,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 440 transitions. [2018-11-23 11:54:06,637 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 440 transitions. Word has length 169 [2018-11-23 11:54:06,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:06,637 INFO L480 AbstractCegarLoop]: Abstraction has 333 states and 440 transitions. [2018-11-23 11:54:06,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-11-23 11:54:06,637 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 440 transitions. [2018-11-23 11:54:06,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-23 11:54:06,638 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:06,638 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:06,638 INFO L423 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:06,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:06,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1246635759, now seen corresponding path program 52 times [2018-11-23 11:54:06,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:06,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:06,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:06,639 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:06,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:06,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:07,889 INFO L256 TraceCheckUtils]: 0: Hoare triple {72681#true} call ULTIMATE.init(); {72681#true} is VALID [2018-11-23 11:54:07,890 INFO L273 TraceCheckUtils]: 1: Hoare triple {72681#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {72681#true} is VALID [2018-11-23 11:54:07,890 INFO L273 TraceCheckUtils]: 2: Hoare triple {72681#true} assume true; {72681#true} is VALID [2018-11-23 11:54:07,890 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {72681#true} {72681#true} #79#return; {72681#true} is VALID [2018-11-23 11:54:07,890 INFO L256 TraceCheckUtils]: 4: Hoare triple {72681#true} call #t~ret8 := main(); {72681#true} is VALID [2018-11-23 11:54:07,890 INFO L273 TraceCheckUtils]: 5: Hoare triple {72681#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {72681#true} is VALID [2018-11-23 11:54:07,891 INFO L273 TraceCheckUtils]: 6: Hoare triple {72681#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {72683#(= main_~i~0 1)} is VALID [2018-11-23 11:54:07,891 INFO L273 TraceCheckUtils]: 7: Hoare triple {72683#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72683#(= main_~i~0 1)} is VALID [2018-11-23 11:54:07,892 INFO L273 TraceCheckUtils]: 8: Hoare triple {72683#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72683#(= main_~i~0 1)} is VALID [2018-11-23 11:54:07,893 INFO L273 TraceCheckUtils]: 9: Hoare triple {72683#(= main_~i~0 1)} ~i~0 := 1 + ~i~0; {72684#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:07,893 INFO L273 TraceCheckUtils]: 10: Hoare triple {72684#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72684#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:07,893 INFO L273 TraceCheckUtils]: 11: Hoare triple {72684#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72684#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:07,894 INFO L273 TraceCheckUtils]: 12: Hoare triple {72684#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {72685#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:07,894 INFO L273 TraceCheckUtils]: 13: Hoare triple {72685#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72685#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:07,894 INFO L273 TraceCheckUtils]: 14: Hoare triple {72685#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72685#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:07,895 INFO L273 TraceCheckUtils]: 15: Hoare triple {72685#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {72686#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:07,895 INFO L273 TraceCheckUtils]: 16: Hoare triple {72686#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72686#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:07,896 INFO L273 TraceCheckUtils]: 17: Hoare triple {72686#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72686#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:07,896 INFO L273 TraceCheckUtils]: 18: Hoare triple {72686#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {72687#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:07,897 INFO L273 TraceCheckUtils]: 19: Hoare triple {72687#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72687#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:07,897 INFO L273 TraceCheckUtils]: 20: Hoare triple {72687#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72687#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:07,898 INFO L273 TraceCheckUtils]: 21: Hoare triple {72687#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {72688#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:07,898 INFO L273 TraceCheckUtils]: 22: Hoare triple {72688#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72688#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:07,899 INFO L273 TraceCheckUtils]: 23: Hoare triple {72688#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72688#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:07,899 INFO L273 TraceCheckUtils]: 24: Hoare triple {72688#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {72689#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:07,900 INFO L273 TraceCheckUtils]: 25: Hoare triple {72689#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72689#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:07,900 INFO L273 TraceCheckUtils]: 26: Hoare triple {72689#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72689#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:07,901 INFO L273 TraceCheckUtils]: 27: Hoare triple {72689#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {72690#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:07,902 INFO L273 TraceCheckUtils]: 28: Hoare triple {72690#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72690#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:07,902 INFO L273 TraceCheckUtils]: 29: Hoare triple {72690#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72690#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:07,903 INFO L273 TraceCheckUtils]: 30: Hoare triple {72690#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {72691#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:07,903 INFO L273 TraceCheckUtils]: 31: Hoare triple {72691#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72691#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:07,904 INFO L273 TraceCheckUtils]: 32: Hoare triple {72691#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72691#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:07,904 INFO L273 TraceCheckUtils]: 33: Hoare triple {72691#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {72692#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:07,905 INFO L273 TraceCheckUtils]: 34: Hoare triple {72692#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72692#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:07,905 INFO L273 TraceCheckUtils]: 35: Hoare triple {72692#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72692#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:07,906 INFO L273 TraceCheckUtils]: 36: Hoare triple {72692#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {72693#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:07,906 INFO L273 TraceCheckUtils]: 37: Hoare triple {72693#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72693#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:07,907 INFO L273 TraceCheckUtils]: 38: Hoare triple {72693#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72693#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:07,908 INFO L273 TraceCheckUtils]: 39: Hoare triple {72693#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {72694#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:07,908 INFO L273 TraceCheckUtils]: 40: Hoare triple {72694#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72694#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:07,908 INFO L273 TraceCheckUtils]: 41: Hoare triple {72694#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72694#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:07,909 INFO L273 TraceCheckUtils]: 42: Hoare triple {72694#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {72695#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:07,910 INFO L273 TraceCheckUtils]: 43: Hoare triple {72695#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72695#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:07,910 INFO L273 TraceCheckUtils]: 44: Hoare triple {72695#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72695#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:07,911 INFO L273 TraceCheckUtils]: 45: Hoare triple {72695#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {72696#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:07,911 INFO L273 TraceCheckUtils]: 46: Hoare triple {72696#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72696#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:07,912 INFO L273 TraceCheckUtils]: 47: Hoare triple {72696#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72696#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:07,912 INFO L273 TraceCheckUtils]: 48: Hoare triple {72696#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {72697#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:07,913 INFO L273 TraceCheckUtils]: 49: Hoare triple {72697#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72697#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:07,913 INFO L273 TraceCheckUtils]: 50: Hoare triple {72697#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72697#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:07,914 INFO L273 TraceCheckUtils]: 51: Hoare triple {72697#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {72698#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:07,914 INFO L273 TraceCheckUtils]: 52: Hoare triple {72698#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72698#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:07,915 INFO L273 TraceCheckUtils]: 53: Hoare triple {72698#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72698#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:07,916 INFO L273 TraceCheckUtils]: 54: Hoare triple {72698#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {72699#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:07,916 INFO L273 TraceCheckUtils]: 55: Hoare triple {72699#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72699#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:07,917 INFO L273 TraceCheckUtils]: 56: Hoare triple {72699#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72699#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:07,917 INFO L273 TraceCheckUtils]: 57: Hoare triple {72699#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {72700#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:07,918 INFO L273 TraceCheckUtils]: 58: Hoare triple {72700#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72700#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:07,918 INFO L273 TraceCheckUtils]: 59: Hoare triple {72700#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72700#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:07,919 INFO L273 TraceCheckUtils]: 60: Hoare triple {72700#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {72701#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:07,919 INFO L273 TraceCheckUtils]: 61: Hoare triple {72701#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72701#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:07,920 INFO L273 TraceCheckUtils]: 62: Hoare triple {72701#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72701#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:07,920 INFO L273 TraceCheckUtils]: 63: Hoare triple {72701#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {72702#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:07,921 INFO L273 TraceCheckUtils]: 64: Hoare triple {72702#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72702#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:07,921 INFO L273 TraceCheckUtils]: 65: Hoare triple {72702#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72702#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:07,922 INFO L273 TraceCheckUtils]: 66: Hoare triple {72702#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {72703#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:07,922 INFO L273 TraceCheckUtils]: 67: Hoare triple {72703#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72703#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:07,923 INFO L273 TraceCheckUtils]: 68: Hoare triple {72703#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72703#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:07,924 INFO L273 TraceCheckUtils]: 69: Hoare triple {72703#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {72704#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:07,924 INFO L273 TraceCheckUtils]: 70: Hoare triple {72704#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72704#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:07,925 INFO L273 TraceCheckUtils]: 71: Hoare triple {72704#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72704#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:07,925 INFO L273 TraceCheckUtils]: 72: Hoare triple {72704#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {72705#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:07,926 INFO L273 TraceCheckUtils]: 73: Hoare triple {72705#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72705#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:07,926 INFO L273 TraceCheckUtils]: 74: Hoare triple {72705#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72705#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:07,927 INFO L273 TraceCheckUtils]: 75: Hoare triple {72705#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {72706#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:07,927 INFO L273 TraceCheckUtils]: 76: Hoare triple {72706#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72706#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:07,928 INFO L273 TraceCheckUtils]: 77: Hoare triple {72706#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72706#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:07,928 INFO L273 TraceCheckUtils]: 78: Hoare triple {72706#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {72707#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:07,929 INFO L273 TraceCheckUtils]: 79: Hoare triple {72707#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72707#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:07,929 INFO L273 TraceCheckUtils]: 80: Hoare triple {72707#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72707#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:07,930 INFO L273 TraceCheckUtils]: 81: Hoare triple {72707#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {72708#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:07,931 INFO L273 TraceCheckUtils]: 82: Hoare triple {72708#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72708#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:07,931 INFO L273 TraceCheckUtils]: 83: Hoare triple {72708#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72708#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:07,932 INFO L273 TraceCheckUtils]: 84: Hoare triple {72708#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {72709#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:07,932 INFO L273 TraceCheckUtils]: 85: Hoare triple {72709#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72709#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:07,933 INFO L273 TraceCheckUtils]: 86: Hoare triple {72709#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72709#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:07,933 INFO L273 TraceCheckUtils]: 87: Hoare triple {72709#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {72710#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:07,934 INFO L273 TraceCheckUtils]: 88: Hoare triple {72710#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72710#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:07,934 INFO L273 TraceCheckUtils]: 89: Hoare triple {72710#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72710#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:07,935 INFO L273 TraceCheckUtils]: 90: Hoare triple {72710#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {72711#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:07,935 INFO L273 TraceCheckUtils]: 91: Hoare triple {72711#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72711#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:07,936 INFO L273 TraceCheckUtils]: 92: Hoare triple {72711#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72711#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:07,937 INFO L273 TraceCheckUtils]: 93: Hoare triple {72711#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {72712#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:07,937 INFO L273 TraceCheckUtils]: 94: Hoare triple {72712#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72712#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:07,937 INFO L273 TraceCheckUtils]: 95: Hoare triple {72712#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72712#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:07,938 INFO L273 TraceCheckUtils]: 96: Hoare triple {72712#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {72713#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:07,939 INFO L273 TraceCheckUtils]: 97: Hoare triple {72713#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72713#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:07,939 INFO L273 TraceCheckUtils]: 98: Hoare triple {72713#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72713#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:07,940 INFO L273 TraceCheckUtils]: 99: Hoare triple {72713#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {72714#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:07,940 INFO L273 TraceCheckUtils]: 100: Hoare triple {72714#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72714#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:07,941 INFO L273 TraceCheckUtils]: 101: Hoare triple {72714#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72714#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:07,941 INFO L273 TraceCheckUtils]: 102: Hoare triple {72714#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {72715#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:07,942 INFO L273 TraceCheckUtils]: 103: Hoare triple {72715#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72715#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:07,942 INFO L273 TraceCheckUtils]: 104: Hoare triple {72715#(<= main_~i~0 33)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72715#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:07,943 INFO L273 TraceCheckUtils]: 105: Hoare triple {72715#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {72716#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:07,943 INFO L273 TraceCheckUtils]: 106: Hoare triple {72716#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72716#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:07,944 INFO L273 TraceCheckUtils]: 107: Hoare triple {72716#(<= main_~i~0 34)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72716#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:07,945 INFO L273 TraceCheckUtils]: 108: Hoare triple {72716#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {72717#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:07,945 INFO L273 TraceCheckUtils]: 109: Hoare triple {72717#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72717#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:07,946 INFO L273 TraceCheckUtils]: 110: Hoare triple {72717#(<= main_~i~0 35)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72717#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:07,946 INFO L273 TraceCheckUtils]: 111: Hoare triple {72717#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {72718#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:07,947 INFO L273 TraceCheckUtils]: 112: Hoare triple {72718#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72718#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:07,947 INFO L273 TraceCheckUtils]: 113: Hoare triple {72718#(<= main_~i~0 36)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72718#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:07,948 INFO L273 TraceCheckUtils]: 114: Hoare triple {72718#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {72719#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:07,948 INFO L273 TraceCheckUtils]: 115: Hoare triple {72719#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72719#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:07,949 INFO L273 TraceCheckUtils]: 116: Hoare triple {72719#(<= main_~i~0 37)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72719#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:07,949 INFO L273 TraceCheckUtils]: 117: Hoare triple {72719#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {72720#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:07,950 INFO L273 TraceCheckUtils]: 118: Hoare triple {72720#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72720#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:07,950 INFO L273 TraceCheckUtils]: 119: Hoare triple {72720#(<= main_~i~0 38)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72720#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:07,951 INFO L273 TraceCheckUtils]: 120: Hoare triple {72720#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {72721#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:07,952 INFO L273 TraceCheckUtils]: 121: Hoare triple {72721#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72721#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:07,952 INFO L273 TraceCheckUtils]: 122: Hoare triple {72721#(<= main_~i~0 39)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72721#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:07,953 INFO L273 TraceCheckUtils]: 123: Hoare triple {72721#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {72722#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:07,953 INFO L273 TraceCheckUtils]: 124: Hoare triple {72722#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72722#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:07,954 INFO L273 TraceCheckUtils]: 125: Hoare triple {72722#(<= main_~i~0 40)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72722#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:07,954 INFO L273 TraceCheckUtils]: 126: Hoare triple {72722#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {72723#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:07,955 INFO L273 TraceCheckUtils]: 127: Hoare triple {72723#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72723#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:07,955 INFO L273 TraceCheckUtils]: 128: Hoare triple {72723#(<= main_~i~0 41)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72723#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:07,956 INFO L273 TraceCheckUtils]: 129: Hoare triple {72723#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {72724#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:07,956 INFO L273 TraceCheckUtils]: 130: Hoare triple {72724#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72724#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:07,957 INFO L273 TraceCheckUtils]: 131: Hoare triple {72724#(<= main_~i~0 42)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72724#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:07,957 INFO L273 TraceCheckUtils]: 132: Hoare triple {72724#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {72725#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:07,958 INFO L273 TraceCheckUtils]: 133: Hoare triple {72725#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72725#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:07,958 INFO L273 TraceCheckUtils]: 134: Hoare triple {72725#(<= main_~i~0 43)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72725#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:07,959 INFO L273 TraceCheckUtils]: 135: Hoare triple {72725#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {72726#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:07,960 INFO L273 TraceCheckUtils]: 136: Hoare triple {72726#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72726#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:07,960 INFO L273 TraceCheckUtils]: 137: Hoare triple {72726#(<= main_~i~0 44)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72726#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:07,961 INFO L273 TraceCheckUtils]: 138: Hoare triple {72726#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {72727#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:07,961 INFO L273 TraceCheckUtils]: 139: Hoare triple {72727#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72727#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:07,962 INFO L273 TraceCheckUtils]: 140: Hoare triple {72727#(<= main_~i~0 45)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72727#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:07,962 INFO L273 TraceCheckUtils]: 141: Hoare triple {72727#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {72728#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:07,963 INFO L273 TraceCheckUtils]: 142: Hoare triple {72728#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72728#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:07,963 INFO L273 TraceCheckUtils]: 143: Hoare triple {72728#(<= main_~i~0 46)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72728#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:07,964 INFO L273 TraceCheckUtils]: 144: Hoare triple {72728#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {72729#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:07,964 INFO L273 TraceCheckUtils]: 145: Hoare triple {72729#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72729#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:07,965 INFO L273 TraceCheckUtils]: 146: Hoare triple {72729#(<= main_~i~0 47)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72729#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:07,966 INFO L273 TraceCheckUtils]: 147: Hoare triple {72729#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {72730#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:07,966 INFO L273 TraceCheckUtils]: 148: Hoare triple {72730#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72730#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:07,967 INFO L273 TraceCheckUtils]: 149: Hoare triple {72730#(<= main_~i~0 48)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72730#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:07,967 INFO L273 TraceCheckUtils]: 150: Hoare triple {72730#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {72731#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:07,968 INFO L273 TraceCheckUtils]: 151: Hoare triple {72731#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72731#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:07,968 INFO L273 TraceCheckUtils]: 152: Hoare triple {72731#(<= main_~i~0 49)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72731#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:07,969 INFO L273 TraceCheckUtils]: 153: Hoare triple {72731#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {72732#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:07,969 INFO L273 TraceCheckUtils]: 154: Hoare triple {72732#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72732#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:07,970 INFO L273 TraceCheckUtils]: 155: Hoare triple {72732#(<= main_~i~0 50)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72732#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:07,970 INFO L273 TraceCheckUtils]: 156: Hoare triple {72732#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {72733#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:07,971 INFO L273 TraceCheckUtils]: 157: Hoare triple {72733#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72733#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:07,971 INFO L273 TraceCheckUtils]: 158: Hoare triple {72733#(<= main_~i~0 51)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72733#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:07,972 INFO L273 TraceCheckUtils]: 159: Hoare triple {72733#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {72734#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:07,973 INFO L273 TraceCheckUtils]: 160: Hoare triple {72734#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72734#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:07,973 INFO L273 TraceCheckUtils]: 161: Hoare triple {72734#(<= main_~i~0 52)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72734#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:07,974 INFO L273 TraceCheckUtils]: 162: Hoare triple {72734#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {72735#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:07,974 INFO L273 TraceCheckUtils]: 163: Hoare triple {72735#(<= main_~i~0 53)} assume !(~i~0 < 100000); {72682#false} is VALID [2018-11-23 11:54:07,974 INFO L273 TraceCheckUtils]: 164: Hoare triple {72682#false} assume !(0 != ~swapped~0); {72682#false} is VALID [2018-11-23 11:54:07,975 INFO L273 TraceCheckUtils]: 165: Hoare triple {72682#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {72682#false} is VALID [2018-11-23 11:54:07,975 INFO L273 TraceCheckUtils]: 166: Hoare triple {72682#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {72682#false} is VALID [2018-11-23 11:54:07,975 INFO L273 TraceCheckUtils]: 167: Hoare triple {72682#false} assume !!(~y~0 < 100000);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); {72682#false} is VALID [2018-11-23 11:54:07,975 INFO L256 TraceCheckUtils]: 168: Hoare triple {72682#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {72682#false} is VALID [2018-11-23 11:54:07,975 INFO L273 TraceCheckUtils]: 169: Hoare triple {72682#false} ~cond := #in~cond; {72682#false} is VALID [2018-11-23 11:54:07,975 INFO L273 TraceCheckUtils]: 170: Hoare triple {72682#false} assume 0 == ~cond; {72682#false} is VALID [2018-11-23 11:54:07,976 INFO L273 TraceCheckUtils]: 171: Hoare triple {72682#false} assume !false; {72682#false} is VALID [2018-11-23 11:54:07,993 INFO L134 CoverageAnalysis]: Checked inductivity of 4031 backedges. 1 proven. 4030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:07,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:07,994 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:54:08,002 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:54:08,079 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:54:08,079 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:08,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:08,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:08,596 INFO L256 TraceCheckUtils]: 0: Hoare triple {72681#true} call ULTIMATE.init(); {72681#true} is VALID [2018-11-23 11:54:08,596 INFO L273 TraceCheckUtils]: 1: Hoare triple {72681#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {72681#true} is VALID [2018-11-23 11:54:08,597 INFO L273 TraceCheckUtils]: 2: Hoare triple {72681#true} assume true; {72681#true} is VALID [2018-11-23 11:54:08,597 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {72681#true} {72681#true} #79#return; {72681#true} is VALID [2018-11-23 11:54:08,597 INFO L256 TraceCheckUtils]: 4: Hoare triple {72681#true} call #t~ret8 := main(); {72681#true} is VALID [2018-11-23 11:54:08,597 INFO L273 TraceCheckUtils]: 5: Hoare triple {72681#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {72681#true} is VALID [2018-11-23 11:54:08,598 INFO L273 TraceCheckUtils]: 6: Hoare triple {72681#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {72757#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:08,598 INFO L273 TraceCheckUtils]: 7: Hoare triple {72757#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72757#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:08,599 INFO L273 TraceCheckUtils]: 8: Hoare triple {72757#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72757#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:08,599 INFO L273 TraceCheckUtils]: 9: Hoare triple {72757#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {72684#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:08,599 INFO L273 TraceCheckUtils]: 10: Hoare triple {72684#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72684#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:08,600 INFO L273 TraceCheckUtils]: 11: Hoare triple {72684#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72684#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:08,600 INFO L273 TraceCheckUtils]: 12: Hoare triple {72684#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {72685#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:08,600 INFO L273 TraceCheckUtils]: 13: Hoare triple {72685#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72685#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:08,601 INFO L273 TraceCheckUtils]: 14: Hoare triple {72685#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72685#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:08,601 INFO L273 TraceCheckUtils]: 15: Hoare triple {72685#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {72686#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:08,602 INFO L273 TraceCheckUtils]: 16: Hoare triple {72686#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72686#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:08,602 INFO L273 TraceCheckUtils]: 17: Hoare triple {72686#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72686#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:08,603 INFO L273 TraceCheckUtils]: 18: Hoare triple {72686#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {72687#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:08,603 INFO L273 TraceCheckUtils]: 19: Hoare triple {72687#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72687#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:08,604 INFO L273 TraceCheckUtils]: 20: Hoare triple {72687#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72687#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:08,605 INFO L273 TraceCheckUtils]: 21: Hoare triple {72687#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {72688#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:08,605 INFO L273 TraceCheckUtils]: 22: Hoare triple {72688#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72688#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:08,605 INFO L273 TraceCheckUtils]: 23: Hoare triple {72688#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72688#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:08,606 INFO L273 TraceCheckUtils]: 24: Hoare triple {72688#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {72689#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:08,607 INFO L273 TraceCheckUtils]: 25: Hoare triple {72689#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72689#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:08,607 INFO L273 TraceCheckUtils]: 26: Hoare triple {72689#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72689#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:08,608 INFO L273 TraceCheckUtils]: 27: Hoare triple {72689#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {72690#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:08,608 INFO L273 TraceCheckUtils]: 28: Hoare triple {72690#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72690#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:08,609 INFO L273 TraceCheckUtils]: 29: Hoare triple {72690#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72690#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:08,609 INFO L273 TraceCheckUtils]: 30: Hoare triple {72690#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {72691#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:08,610 INFO L273 TraceCheckUtils]: 31: Hoare triple {72691#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72691#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:08,610 INFO L273 TraceCheckUtils]: 32: Hoare triple {72691#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72691#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:08,611 INFO L273 TraceCheckUtils]: 33: Hoare triple {72691#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {72692#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:08,611 INFO L273 TraceCheckUtils]: 34: Hoare triple {72692#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72692#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:08,612 INFO L273 TraceCheckUtils]: 35: Hoare triple {72692#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72692#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:08,613 INFO L273 TraceCheckUtils]: 36: Hoare triple {72692#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {72693#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:08,613 INFO L273 TraceCheckUtils]: 37: Hoare triple {72693#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72693#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:08,613 INFO L273 TraceCheckUtils]: 38: Hoare triple {72693#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72693#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:08,614 INFO L273 TraceCheckUtils]: 39: Hoare triple {72693#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {72694#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:08,615 INFO L273 TraceCheckUtils]: 40: Hoare triple {72694#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72694#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:08,615 INFO L273 TraceCheckUtils]: 41: Hoare triple {72694#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72694#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:08,616 INFO L273 TraceCheckUtils]: 42: Hoare triple {72694#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {72695#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:08,616 INFO L273 TraceCheckUtils]: 43: Hoare triple {72695#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72695#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:08,617 INFO L273 TraceCheckUtils]: 44: Hoare triple {72695#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72695#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:08,617 INFO L273 TraceCheckUtils]: 45: Hoare triple {72695#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {72696#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:08,618 INFO L273 TraceCheckUtils]: 46: Hoare triple {72696#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72696#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:08,618 INFO L273 TraceCheckUtils]: 47: Hoare triple {72696#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72696#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:08,619 INFO L273 TraceCheckUtils]: 48: Hoare triple {72696#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {72697#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:08,619 INFO L273 TraceCheckUtils]: 49: Hoare triple {72697#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72697#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:08,620 INFO L273 TraceCheckUtils]: 50: Hoare triple {72697#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72697#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:08,621 INFO L273 TraceCheckUtils]: 51: Hoare triple {72697#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {72698#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:08,621 INFO L273 TraceCheckUtils]: 52: Hoare triple {72698#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72698#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:08,622 INFO L273 TraceCheckUtils]: 53: Hoare triple {72698#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72698#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:08,622 INFO L273 TraceCheckUtils]: 54: Hoare triple {72698#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {72699#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:08,623 INFO L273 TraceCheckUtils]: 55: Hoare triple {72699#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72699#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:08,623 INFO L273 TraceCheckUtils]: 56: Hoare triple {72699#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72699#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:08,624 INFO L273 TraceCheckUtils]: 57: Hoare triple {72699#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {72700#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:08,624 INFO L273 TraceCheckUtils]: 58: Hoare triple {72700#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72700#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:08,625 INFO L273 TraceCheckUtils]: 59: Hoare triple {72700#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72700#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:08,625 INFO L273 TraceCheckUtils]: 60: Hoare triple {72700#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {72701#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:08,626 INFO L273 TraceCheckUtils]: 61: Hoare triple {72701#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72701#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:08,626 INFO L273 TraceCheckUtils]: 62: Hoare triple {72701#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72701#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:08,627 INFO L273 TraceCheckUtils]: 63: Hoare triple {72701#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {72702#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:08,627 INFO L273 TraceCheckUtils]: 64: Hoare triple {72702#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72702#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:08,628 INFO L273 TraceCheckUtils]: 65: Hoare triple {72702#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72702#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:08,629 INFO L273 TraceCheckUtils]: 66: Hoare triple {72702#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {72703#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:08,629 INFO L273 TraceCheckUtils]: 67: Hoare triple {72703#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72703#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:08,630 INFO L273 TraceCheckUtils]: 68: Hoare triple {72703#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72703#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:08,630 INFO L273 TraceCheckUtils]: 69: Hoare triple {72703#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {72704#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:08,631 INFO L273 TraceCheckUtils]: 70: Hoare triple {72704#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72704#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:08,631 INFO L273 TraceCheckUtils]: 71: Hoare triple {72704#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72704#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:08,632 INFO L273 TraceCheckUtils]: 72: Hoare triple {72704#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {72705#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:08,632 INFO L273 TraceCheckUtils]: 73: Hoare triple {72705#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72705#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:08,633 INFO L273 TraceCheckUtils]: 74: Hoare triple {72705#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72705#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:08,633 INFO L273 TraceCheckUtils]: 75: Hoare triple {72705#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {72706#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:08,634 INFO L273 TraceCheckUtils]: 76: Hoare triple {72706#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72706#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:08,634 INFO L273 TraceCheckUtils]: 77: Hoare triple {72706#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72706#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:08,635 INFO L273 TraceCheckUtils]: 78: Hoare triple {72706#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {72707#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:08,636 INFO L273 TraceCheckUtils]: 79: Hoare triple {72707#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72707#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:08,636 INFO L273 TraceCheckUtils]: 80: Hoare triple {72707#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72707#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:08,637 INFO L273 TraceCheckUtils]: 81: Hoare triple {72707#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {72708#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:08,637 INFO L273 TraceCheckUtils]: 82: Hoare triple {72708#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72708#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:08,638 INFO L273 TraceCheckUtils]: 83: Hoare triple {72708#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72708#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:08,638 INFO L273 TraceCheckUtils]: 84: Hoare triple {72708#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {72709#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:08,639 INFO L273 TraceCheckUtils]: 85: Hoare triple {72709#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72709#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:08,639 INFO L273 TraceCheckUtils]: 86: Hoare triple {72709#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72709#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:08,640 INFO L273 TraceCheckUtils]: 87: Hoare triple {72709#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {72710#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:08,640 INFO L273 TraceCheckUtils]: 88: Hoare triple {72710#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72710#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:08,641 INFO L273 TraceCheckUtils]: 89: Hoare triple {72710#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72710#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:08,641 INFO L273 TraceCheckUtils]: 90: Hoare triple {72710#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {72711#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:08,642 INFO L273 TraceCheckUtils]: 91: Hoare triple {72711#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72711#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:08,642 INFO L273 TraceCheckUtils]: 92: Hoare triple {72711#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72711#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:08,643 INFO L273 TraceCheckUtils]: 93: Hoare triple {72711#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {72712#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:08,644 INFO L273 TraceCheckUtils]: 94: Hoare triple {72712#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72712#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:08,644 INFO L273 TraceCheckUtils]: 95: Hoare triple {72712#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72712#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:08,645 INFO L273 TraceCheckUtils]: 96: Hoare triple {72712#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {72713#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:08,645 INFO L273 TraceCheckUtils]: 97: Hoare triple {72713#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72713#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:08,646 INFO L273 TraceCheckUtils]: 98: Hoare triple {72713#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72713#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:08,646 INFO L273 TraceCheckUtils]: 99: Hoare triple {72713#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {72714#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:08,647 INFO L273 TraceCheckUtils]: 100: Hoare triple {72714#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72714#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:08,647 INFO L273 TraceCheckUtils]: 101: Hoare triple {72714#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72714#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:08,648 INFO L273 TraceCheckUtils]: 102: Hoare triple {72714#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {72715#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:08,648 INFO L273 TraceCheckUtils]: 103: Hoare triple {72715#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72715#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:08,649 INFO L273 TraceCheckUtils]: 104: Hoare triple {72715#(<= main_~i~0 33)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72715#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:08,649 INFO L273 TraceCheckUtils]: 105: Hoare triple {72715#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {72716#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:08,650 INFO L273 TraceCheckUtils]: 106: Hoare triple {72716#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72716#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:08,650 INFO L273 TraceCheckUtils]: 107: Hoare triple {72716#(<= main_~i~0 34)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72716#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:08,651 INFO L273 TraceCheckUtils]: 108: Hoare triple {72716#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {72717#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:08,652 INFO L273 TraceCheckUtils]: 109: Hoare triple {72717#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72717#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:08,652 INFO L273 TraceCheckUtils]: 110: Hoare triple {72717#(<= main_~i~0 35)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72717#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:08,653 INFO L273 TraceCheckUtils]: 111: Hoare triple {72717#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {72718#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:08,653 INFO L273 TraceCheckUtils]: 112: Hoare triple {72718#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72718#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:08,654 INFO L273 TraceCheckUtils]: 113: Hoare triple {72718#(<= main_~i~0 36)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72718#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:08,654 INFO L273 TraceCheckUtils]: 114: Hoare triple {72718#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {72719#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:08,655 INFO L273 TraceCheckUtils]: 115: Hoare triple {72719#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72719#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:08,655 INFO L273 TraceCheckUtils]: 116: Hoare triple {72719#(<= main_~i~0 37)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72719#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:08,656 INFO L273 TraceCheckUtils]: 117: Hoare triple {72719#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {72720#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:08,656 INFO L273 TraceCheckUtils]: 118: Hoare triple {72720#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72720#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:08,657 INFO L273 TraceCheckUtils]: 119: Hoare triple {72720#(<= main_~i~0 38)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72720#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:08,657 INFO L273 TraceCheckUtils]: 120: Hoare triple {72720#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {72721#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:08,658 INFO L273 TraceCheckUtils]: 121: Hoare triple {72721#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72721#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:08,658 INFO L273 TraceCheckUtils]: 122: Hoare triple {72721#(<= main_~i~0 39)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72721#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:08,659 INFO L273 TraceCheckUtils]: 123: Hoare triple {72721#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {72722#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:08,660 INFO L273 TraceCheckUtils]: 124: Hoare triple {72722#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72722#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:08,660 INFO L273 TraceCheckUtils]: 125: Hoare triple {72722#(<= main_~i~0 40)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72722#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:08,661 INFO L273 TraceCheckUtils]: 126: Hoare triple {72722#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {72723#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:08,661 INFO L273 TraceCheckUtils]: 127: Hoare triple {72723#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72723#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:08,662 INFO L273 TraceCheckUtils]: 128: Hoare triple {72723#(<= main_~i~0 41)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72723#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:08,662 INFO L273 TraceCheckUtils]: 129: Hoare triple {72723#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {72724#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:08,663 INFO L273 TraceCheckUtils]: 130: Hoare triple {72724#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72724#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:08,663 INFO L273 TraceCheckUtils]: 131: Hoare triple {72724#(<= main_~i~0 42)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72724#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:08,664 INFO L273 TraceCheckUtils]: 132: Hoare triple {72724#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {72725#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:08,664 INFO L273 TraceCheckUtils]: 133: Hoare triple {72725#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72725#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:08,665 INFO L273 TraceCheckUtils]: 134: Hoare triple {72725#(<= main_~i~0 43)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72725#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:08,666 INFO L273 TraceCheckUtils]: 135: Hoare triple {72725#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {72726#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:08,666 INFO L273 TraceCheckUtils]: 136: Hoare triple {72726#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72726#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:08,666 INFO L273 TraceCheckUtils]: 137: Hoare triple {72726#(<= main_~i~0 44)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72726#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:08,667 INFO L273 TraceCheckUtils]: 138: Hoare triple {72726#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {72727#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:08,668 INFO L273 TraceCheckUtils]: 139: Hoare triple {72727#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72727#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:08,668 INFO L273 TraceCheckUtils]: 140: Hoare triple {72727#(<= main_~i~0 45)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72727#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:08,669 INFO L273 TraceCheckUtils]: 141: Hoare triple {72727#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {72728#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:08,669 INFO L273 TraceCheckUtils]: 142: Hoare triple {72728#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72728#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:08,670 INFO L273 TraceCheckUtils]: 143: Hoare triple {72728#(<= main_~i~0 46)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72728#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:08,671 INFO L273 TraceCheckUtils]: 144: Hoare triple {72728#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {72729#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:08,671 INFO L273 TraceCheckUtils]: 145: Hoare triple {72729#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72729#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:08,671 INFO L273 TraceCheckUtils]: 146: Hoare triple {72729#(<= main_~i~0 47)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72729#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:08,672 INFO L273 TraceCheckUtils]: 147: Hoare triple {72729#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {72730#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:08,673 INFO L273 TraceCheckUtils]: 148: Hoare triple {72730#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72730#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:08,673 INFO L273 TraceCheckUtils]: 149: Hoare triple {72730#(<= main_~i~0 48)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72730#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:08,674 INFO L273 TraceCheckUtils]: 150: Hoare triple {72730#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {72731#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:08,674 INFO L273 TraceCheckUtils]: 151: Hoare triple {72731#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72731#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:08,675 INFO L273 TraceCheckUtils]: 152: Hoare triple {72731#(<= main_~i~0 49)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72731#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:08,675 INFO L273 TraceCheckUtils]: 153: Hoare triple {72731#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {72732#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:08,676 INFO L273 TraceCheckUtils]: 154: Hoare triple {72732#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72732#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:08,676 INFO L273 TraceCheckUtils]: 155: Hoare triple {72732#(<= main_~i~0 50)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72732#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:08,677 INFO L273 TraceCheckUtils]: 156: Hoare triple {72732#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {72733#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:08,678 INFO L273 TraceCheckUtils]: 157: Hoare triple {72733#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72733#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:08,678 INFO L273 TraceCheckUtils]: 158: Hoare triple {72733#(<= main_~i~0 51)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72733#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:08,679 INFO L273 TraceCheckUtils]: 159: Hoare triple {72733#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {72734#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:08,679 INFO L273 TraceCheckUtils]: 160: Hoare triple {72734#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {72734#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:08,680 INFO L273 TraceCheckUtils]: 161: Hoare triple {72734#(<= main_~i~0 52)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {72734#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:08,680 INFO L273 TraceCheckUtils]: 162: Hoare triple {72734#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {72735#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:08,681 INFO L273 TraceCheckUtils]: 163: Hoare triple {72735#(<= main_~i~0 53)} assume !(~i~0 < 100000); {72682#false} is VALID [2018-11-23 11:54:08,681 INFO L273 TraceCheckUtils]: 164: Hoare triple {72682#false} assume !(0 != ~swapped~0); {72682#false} is VALID [2018-11-23 11:54:08,681 INFO L273 TraceCheckUtils]: 165: Hoare triple {72682#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {72682#false} is VALID [2018-11-23 11:54:08,681 INFO L273 TraceCheckUtils]: 166: Hoare triple {72682#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {72682#false} is VALID [2018-11-23 11:54:08,682 INFO L273 TraceCheckUtils]: 167: Hoare triple {72682#false} assume !!(~y~0 < 100000);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); {72682#false} is VALID [2018-11-23 11:54:08,682 INFO L256 TraceCheckUtils]: 168: Hoare triple {72682#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {72682#false} is VALID [2018-11-23 11:54:08,682 INFO L273 TraceCheckUtils]: 169: Hoare triple {72682#false} ~cond := #in~cond; {72682#false} is VALID [2018-11-23 11:54:08,682 INFO L273 TraceCheckUtils]: 170: Hoare triple {72682#false} assume 0 == ~cond; {72682#false} is VALID [2018-11-23 11:54:08,682 INFO L273 TraceCheckUtils]: 171: Hoare triple {72682#false} assume !false; {72682#false} is VALID [2018-11-23 11:54:08,701 INFO L134 CoverageAnalysis]: Checked inductivity of 4031 backedges. 1 proven. 4030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:08,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:08,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 56 [2018-11-23 11:54:08,721 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 172 [2018-11-23 11:54:08,721 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:08,722 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 56 states. [2018-11-23 11:54:08,883 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:08,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-11-23 11:54:08,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-11-23 11:54:08,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-11-23 11:54:08,884 INFO L87 Difference]: Start difference. First operand 333 states and 440 transitions. Second operand 56 states. [2018-11-23 11:54:09,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:09,876 INFO L93 Difference]: Finished difference Result 670 states and 890 transitions. [2018-11-23 11:54:09,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-23 11:54:09,876 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 172 [2018-11-23 11:54:09,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:09,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 11:54:09,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 261 transitions. [2018-11-23 11:54:09,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 11:54:09,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 261 transitions. [2018-11-23 11:54:09,879 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 55 states and 261 transitions. [2018-11-23 11:54:10,138 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 261 edges. 261 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:10,147 INFO L225 Difference]: With dead ends: 670 [2018-11-23 11:54:10,147 INFO L226 Difference]: Without dead ends: 343 [2018-11-23 11:54:10,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-11-23 11:54:10,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-11-23 11:54:10,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 339. [2018-11-23 11:54:10,332 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:10,332 INFO L82 GeneralOperation]: Start isEquivalent. First operand 343 states. Second operand 339 states. [2018-11-23 11:54:10,332 INFO L74 IsIncluded]: Start isIncluded. First operand 343 states. Second operand 339 states. [2018-11-23 11:54:10,332 INFO L87 Difference]: Start difference. First operand 343 states. Second operand 339 states. [2018-11-23 11:54:10,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:10,340 INFO L93 Difference]: Finished difference Result 343 states and 454 transitions. [2018-11-23 11:54:10,340 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 454 transitions. [2018-11-23 11:54:10,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:10,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:10,340 INFO L74 IsIncluded]: Start isIncluded. First operand 339 states. Second operand 343 states. [2018-11-23 11:54:10,341 INFO L87 Difference]: Start difference. First operand 339 states. Second operand 343 states. [2018-11-23 11:54:10,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:10,347 INFO L93 Difference]: Finished difference Result 343 states and 454 transitions. [2018-11-23 11:54:10,347 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 454 transitions. [2018-11-23 11:54:10,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:10,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:10,347 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:10,347 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:10,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-11-23 11:54:10,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 448 transitions. [2018-11-23 11:54:10,353 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 448 transitions. Word has length 172 [2018-11-23 11:54:10,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:10,353 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 448 transitions. [2018-11-23 11:54:10,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-11-23 11:54:10,353 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 448 transitions. [2018-11-23 11:54:10,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-23 11:54:10,354 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:10,354 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:10,354 INFO L423 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:10,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:10,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1231028024, now seen corresponding path program 53 times [2018-11-23 11:54:10,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:10,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:10,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:10,355 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:10,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:10,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:11,927 INFO L256 TraceCheckUtils]: 0: Hoare triple {75292#true} call ULTIMATE.init(); {75292#true} is VALID [2018-11-23 11:54:11,927 INFO L273 TraceCheckUtils]: 1: Hoare triple {75292#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {75292#true} is VALID [2018-11-23 11:54:11,927 INFO L273 TraceCheckUtils]: 2: Hoare triple {75292#true} assume true; {75292#true} is VALID [2018-11-23 11:54:11,928 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {75292#true} {75292#true} #79#return; {75292#true} is VALID [2018-11-23 11:54:11,928 INFO L256 TraceCheckUtils]: 4: Hoare triple {75292#true} call #t~ret8 := main(); {75292#true} is VALID [2018-11-23 11:54:11,928 INFO L273 TraceCheckUtils]: 5: Hoare triple {75292#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {75292#true} is VALID [2018-11-23 11:54:11,928 INFO L273 TraceCheckUtils]: 6: Hoare triple {75292#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {75294#(= main_~i~0 1)} is VALID [2018-11-23 11:54:11,929 INFO L273 TraceCheckUtils]: 7: Hoare triple {75294#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75294#(= main_~i~0 1)} is VALID [2018-11-23 11:54:11,929 INFO L273 TraceCheckUtils]: 8: Hoare triple {75294#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75294#(= main_~i~0 1)} is VALID [2018-11-23 11:54:11,929 INFO L273 TraceCheckUtils]: 9: Hoare triple {75294#(= main_~i~0 1)} ~i~0 := 1 + ~i~0; {75295#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:11,930 INFO L273 TraceCheckUtils]: 10: Hoare triple {75295#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75295#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:11,930 INFO L273 TraceCheckUtils]: 11: Hoare triple {75295#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75295#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:11,931 INFO L273 TraceCheckUtils]: 12: Hoare triple {75295#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {75296#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:11,931 INFO L273 TraceCheckUtils]: 13: Hoare triple {75296#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75296#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:11,932 INFO L273 TraceCheckUtils]: 14: Hoare triple {75296#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75296#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:11,932 INFO L273 TraceCheckUtils]: 15: Hoare triple {75296#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {75297#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:11,933 INFO L273 TraceCheckUtils]: 16: Hoare triple {75297#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75297#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:11,933 INFO L273 TraceCheckUtils]: 17: Hoare triple {75297#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75297#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:11,934 INFO L273 TraceCheckUtils]: 18: Hoare triple {75297#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {75298#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:11,935 INFO L273 TraceCheckUtils]: 19: Hoare triple {75298#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75298#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:11,935 INFO L273 TraceCheckUtils]: 20: Hoare triple {75298#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75298#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:11,936 INFO L273 TraceCheckUtils]: 21: Hoare triple {75298#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {75299#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:11,936 INFO L273 TraceCheckUtils]: 22: Hoare triple {75299#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75299#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:11,937 INFO L273 TraceCheckUtils]: 23: Hoare triple {75299#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75299#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:11,938 INFO L273 TraceCheckUtils]: 24: Hoare triple {75299#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {75300#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:11,938 INFO L273 TraceCheckUtils]: 25: Hoare triple {75300#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75300#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:11,939 INFO L273 TraceCheckUtils]: 26: Hoare triple {75300#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75300#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:11,939 INFO L273 TraceCheckUtils]: 27: Hoare triple {75300#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {75301#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:11,940 INFO L273 TraceCheckUtils]: 28: Hoare triple {75301#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75301#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:11,940 INFO L273 TraceCheckUtils]: 29: Hoare triple {75301#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75301#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:11,941 INFO L273 TraceCheckUtils]: 30: Hoare triple {75301#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {75302#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:11,941 INFO L273 TraceCheckUtils]: 31: Hoare triple {75302#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75302#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:11,942 INFO L273 TraceCheckUtils]: 32: Hoare triple {75302#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75302#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:11,942 INFO L273 TraceCheckUtils]: 33: Hoare triple {75302#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {75303#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:11,943 INFO L273 TraceCheckUtils]: 34: Hoare triple {75303#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75303#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:11,943 INFO L273 TraceCheckUtils]: 35: Hoare triple {75303#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75303#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:11,944 INFO L273 TraceCheckUtils]: 36: Hoare triple {75303#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {75304#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:11,945 INFO L273 TraceCheckUtils]: 37: Hoare triple {75304#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75304#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:11,945 INFO L273 TraceCheckUtils]: 38: Hoare triple {75304#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75304#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:11,946 INFO L273 TraceCheckUtils]: 39: Hoare triple {75304#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {75305#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:11,946 INFO L273 TraceCheckUtils]: 40: Hoare triple {75305#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75305#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:11,947 INFO L273 TraceCheckUtils]: 41: Hoare triple {75305#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75305#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:11,948 INFO L273 TraceCheckUtils]: 42: Hoare triple {75305#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {75306#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:11,948 INFO L273 TraceCheckUtils]: 43: Hoare triple {75306#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75306#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:11,949 INFO L273 TraceCheckUtils]: 44: Hoare triple {75306#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75306#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:11,949 INFO L273 TraceCheckUtils]: 45: Hoare triple {75306#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {75307#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:11,950 INFO L273 TraceCheckUtils]: 46: Hoare triple {75307#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75307#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:11,950 INFO L273 TraceCheckUtils]: 47: Hoare triple {75307#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75307#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:11,951 INFO L273 TraceCheckUtils]: 48: Hoare triple {75307#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {75308#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:11,952 INFO L273 TraceCheckUtils]: 49: Hoare triple {75308#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75308#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:11,952 INFO L273 TraceCheckUtils]: 50: Hoare triple {75308#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75308#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:11,953 INFO L273 TraceCheckUtils]: 51: Hoare triple {75308#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {75309#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:11,953 INFO L273 TraceCheckUtils]: 52: Hoare triple {75309#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75309#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:11,954 INFO L273 TraceCheckUtils]: 53: Hoare triple {75309#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75309#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:11,954 INFO L273 TraceCheckUtils]: 54: Hoare triple {75309#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {75310#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:11,955 INFO L273 TraceCheckUtils]: 55: Hoare triple {75310#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75310#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:11,955 INFO L273 TraceCheckUtils]: 56: Hoare triple {75310#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75310#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:11,956 INFO L273 TraceCheckUtils]: 57: Hoare triple {75310#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {75311#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:11,957 INFO L273 TraceCheckUtils]: 58: Hoare triple {75311#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75311#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:11,957 INFO L273 TraceCheckUtils]: 59: Hoare triple {75311#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75311#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:11,958 INFO L273 TraceCheckUtils]: 60: Hoare triple {75311#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {75312#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:11,958 INFO L273 TraceCheckUtils]: 61: Hoare triple {75312#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75312#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:11,959 INFO L273 TraceCheckUtils]: 62: Hoare triple {75312#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75312#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:11,960 INFO L273 TraceCheckUtils]: 63: Hoare triple {75312#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {75313#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:11,960 INFO L273 TraceCheckUtils]: 64: Hoare triple {75313#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75313#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:11,961 INFO L273 TraceCheckUtils]: 65: Hoare triple {75313#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75313#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:11,961 INFO L273 TraceCheckUtils]: 66: Hoare triple {75313#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {75314#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:11,962 INFO L273 TraceCheckUtils]: 67: Hoare triple {75314#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75314#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:11,962 INFO L273 TraceCheckUtils]: 68: Hoare triple {75314#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75314#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:11,963 INFO L273 TraceCheckUtils]: 69: Hoare triple {75314#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {75315#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:11,963 INFO L273 TraceCheckUtils]: 70: Hoare triple {75315#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75315#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:11,964 INFO L273 TraceCheckUtils]: 71: Hoare triple {75315#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75315#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:11,965 INFO L273 TraceCheckUtils]: 72: Hoare triple {75315#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {75316#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:11,965 INFO L273 TraceCheckUtils]: 73: Hoare triple {75316#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75316#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:11,966 INFO L273 TraceCheckUtils]: 74: Hoare triple {75316#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75316#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:11,966 INFO L273 TraceCheckUtils]: 75: Hoare triple {75316#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {75317#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:11,967 INFO L273 TraceCheckUtils]: 76: Hoare triple {75317#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75317#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:11,967 INFO L273 TraceCheckUtils]: 77: Hoare triple {75317#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75317#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:11,968 INFO L273 TraceCheckUtils]: 78: Hoare triple {75317#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {75318#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:11,969 INFO L273 TraceCheckUtils]: 79: Hoare triple {75318#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75318#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:11,969 INFO L273 TraceCheckUtils]: 80: Hoare triple {75318#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75318#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:11,970 INFO L273 TraceCheckUtils]: 81: Hoare triple {75318#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {75319#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:11,970 INFO L273 TraceCheckUtils]: 82: Hoare triple {75319#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75319#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:11,971 INFO L273 TraceCheckUtils]: 83: Hoare triple {75319#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75319#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:11,972 INFO L273 TraceCheckUtils]: 84: Hoare triple {75319#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {75320#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:11,972 INFO L273 TraceCheckUtils]: 85: Hoare triple {75320#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75320#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:11,973 INFO L273 TraceCheckUtils]: 86: Hoare triple {75320#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75320#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:11,973 INFO L273 TraceCheckUtils]: 87: Hoare triple {75320#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {75321#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:11,974 INFO L273 TraceCheckUtils]: 88: Hoare triple {75321#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75321#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:11,974 INFO L273 TraceCheckUtils]: 89: Hoare triple {75321#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75321#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:11,975 INFO L273 TraceCheckUtils]: 90: Hoare triple {75321#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {75322#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:11,975 INFO L273 TraceCheckUtils]: 91: Hoare triple {75322#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75322#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:11,976 INFO L273 TraceCheckUtils]: 92: Hoare triple {75322#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75322#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:11,977 INFO L273 TraceCheckUtils]: 93: Hoare triple {75322#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {75323#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:11,977 INFO L273 TraceCheckUtils]: 94: Hoare triple {75323#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75323#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:11,978 INFO L273 TraceCheckUtils]: 95: Hoare triple {75323#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75323#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:11,978 INFO L273 TraceCheckUtils]: 96: Hoare triple {75323#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {75324#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:11,979 INFO L273 TraceCheckUtils]: 97: Hoare triple {75324#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75324#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:11,979 INFO L273 TraceCheckUtils]: 98: Hoare triple {75324#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75324#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:11,980 INFO L273 TraceCheckUtils]: 99: Hoare triple {75324#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {75325#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:11,980 INFO L273 TraceCheckUtils]: 100: Hoare triple {75325#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75325#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:11,981 INFO L273 TraceCheckUtils]: 101: Hoare triple {75325#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75325#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:11,982 INFO L273 TraceCheckUtils]: 102: Hoare triple {75325#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {75326#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:11,982 INFO L273 TraceCheckUtils]: 103: Hoare triple {75326#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75326#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:11,983 INFO L273 TraceCheckUtils]: 104: Hoare triple {75326#(<= main_~i~0 33)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75326#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:11,983 INFO L273 TraceCheckUtils]: 105: Hoare triple {75326#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {75327#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:11,984 INFO L273 TraceCheckUtils]: 106: Hoare triple {75327#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75327#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:11,984 INFO L273 TraceCheckUtils]: 107: Hoare triple {75327#(<= main_~i~0 34)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75327#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:11,985 INFO L273 TraceCheckUtils]: 108: Hoare triple {75327#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {75328#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:11,986 INFO L273 TraceCheckUtils]: 109: Hoare triple {75328#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75328#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:11,986 INFO L273 TraceCheckUtils]: 110: Hoare triple {75328#(<= main_~i~0 35)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75328#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:11,987 INFO L273 TraceCheckUtils]: 111: Hoare triple {75328#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {75329#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:11,987 INFO L273 TraceCheckUtils]: 112: Hoare triple {75329#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75329#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:11,988 INFO L273 TraceCheckUtils]: 113: Hoare triple {75329#(<= main_~i~0 36)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75329#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:11,989 INFO L273 TraceCheckUtils]: 114: Hoare triple {75329#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {75330#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:11,989 INFO L273 TraceCheckUtils]: 115: Hoare triple {75330#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75330#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:11,990 INFO L273 TraceCheckUtils]: 116: Hoare triple {75330#(<= main_~i~0 37)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75330#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:11,990 INFO L273 TraceCheckUtils]: 117: Hoare triple {75330#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {75331#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:11,991 INFO L273 TraceCheckUtils]: 118: Hoare triple {75331#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75331#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:11,991 INFO L273 TraceCheckUtils]: 119: Hoare triple {75331#(<= main_~i~0 38)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75331#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:11,992 INFO L273 TraceCheckUtils]: 120: Hoare triple {75331#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {75332#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:11,992 INFO L273 TraceCheckUtils]: 121: Hoare triple {75332#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75332#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:11,993 INFO L273 TraceCheckUtils]: 122: Hoare triple {75332#(<= main_~i~0 39)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75332#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:11,994 INFO L273 TraceCheckUtils]: 123: Hoare triple {75332#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {75333#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:11,994 INFO L273 TraceCheckUtils]: 124: Hoare triple {75333#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75333#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:11,995 INFO L273 TraceCheckUtils]: 125: Hoare triple {75333#(<= main_~i~0 40)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75333#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:11,995 INFO L273 TraceCheckUtils]: 126: Hoare triple {75333#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {75334#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:11,996 INFO L273 TraceCheckUtils]: 127: Hoare triple {75334#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75334#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:11,996 INFO L273 TraceCheckUtils]: 128: Hoare triple {75334#(<= main_~i~0 41)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75334#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:11,997 INFO L273 TraceCheckUtils]: 129: Hoare triple {75334#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {75335#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:11,998 INFO L273 TraceCheckUtils]: 130: Hoare triple {75335#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75335#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:11,998 INFO L273 TraceCheckUtils]: 131: Hoare triple {75335#(<= main_~i~0 42)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75335#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:11,999 INFO L273 TraceCheckUtils]: 132: Hoare triple {75335#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {75336#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:11,999 INFO L273 TraceCheckUtils]: 133: Hoare triple {75336#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75336#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:12,000 INFO L273 TraceCheckUtils]: 134: Hoare triple {75336#(<= main_~i~0 43)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75336#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:12,000 INFO L273 TraceCheckUtils]: 135: Hoare triple {75336#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {75337#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:12,001 INFO L273 TraceCheckUtils]: 136: Hoare triple {75337#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75337#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:12,001 INFO L273 TraceCheckUtils]: 137: Hoare triple {75337#(<= main_~i~0 44)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75337#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:12,002 INFO L273 TraceCheckUtils]: 138: Hoare triple {75337#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {75338#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:12,003 INFO L273 TraceCheckUtils]: 139: Hoare triple {75338#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75338#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:12,003 INFO L273 TraceCheckUtils]: 140: Hoare triple {75338#(<= main_~i~0 45)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75338#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:12,004 INFO L273 TraceCheckUtils]: 141: Hoare triple {75338#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {75339#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:12,004 INFO L273 TraceCheckUtils]: 142: Hoare triple {75339#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75339#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:12,005 INFO L273 TraceCheckUtils]: 143: Hoare triple {75339#(<= main_~i~0 46)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75339#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:12,006 INFO L273 TraceCheckUtils]: 144: Hoare triple {75339#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {75340#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:12,006 INFO L273 TraceCheckUtils]: 145: Hoare triple {75340#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75340#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:12,007 INFO L273 TraceCheckUtils]: 146: Hoare triple {75340#(<= main_~i~0 47)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75340#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:12,007 INFO L273 TraceCheckUtils]: 147: Hoare triple {75340#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {75341#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:12,008 INFO L273 TraceCheckUtils]: 148: Hoare triple {75341#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75341#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:12,008 INFO L273 TraceCheckUtils]: 149: Hoare triple {75341#(<= main_~i~0 48)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75341#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:12,009 INFO L273 TraceCheckUtils]: 150: Hoare triple {75341#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {75342#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:12,009 INFO L273 TraceCheckUtils]: 151: Hoare triple {75342#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75342#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:12,010 INFO L273 TraceCheckUtils]: 152: Hoare triple {75342#(<= main_~i~0 49)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75342#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:12,011 INFO L273 TraceCheckUtils]: 153: Hoare triple {75342#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {75343#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:12,011 INFO L273 TraceCheckUtils]: 154: Hoare triple {75343#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75343#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:12,012 INFO L273 TraceCheckUtils]: 155: Hoare triple {75343#(<= main_~i~0 50)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75343#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:12,012 INFO L273 TraceCheckUtils]: 156: Hoare triple {75343#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {75344#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:12,013 INFO L273 TraceCheckUtils]: 157: Hoare triple {75344#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75344#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:12,013 INFO L273 TraceCheckUtils]: 158: Hoare triple {75344#(<= main_~i~0 51)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75344#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:12,014 INFO L273 TraceCheckUtils]: 159: Hoare triple {75344#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {75345#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:12,015 INFO L273 TraceCheckUtils]: 160: Hoare triple {75345#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75345#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:12,015 INFO L273 TraceCheckUtils]: 161: Hoare triple {75345#(<= main_~i~0 52)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75345#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:12,016 INFO L273 TraceCheckUtils]: 162: Hoare triple {75345#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {75346#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:12,016 INFO L273 TraceCheckUtils]: 163: Hoare triple {75346#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75346#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:12,017 INFO L273 TraceCheckUtils]: 164: Hoare triple {75346#(<= main_~i~0 53)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75346#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:12,018 INFO L273 TraceCheckUtils]: 165: Hoare triple {75346#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {75347#(<= main_~i~0 54)} is VALID [2018-11-23 11:54:12,018 INFO L273 TraceCheckUtils]: 166: Hoare triple {75347#(<= main_~i~0 54)} assume !(~i~0 < 100000); {75293#false} is VALID [2018-11-23 11:54:12,018 INFO L273 TraceCheckUtils]: 167: Hoare triple {75293#false} assume !(0 != ~swapped~0); {75293#false} is VALID [2018-11-23 11:54:12,019 INFO L273 TraceCheckUtils]: 168: Hoare triple {75293#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {75293#false} is VALID [2018-11-23 11:54:12,019 INFO L273 TraceCheckUtils]: 169: Hoare triple {75293#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {75293#false} is VALID [2018-11-23 11:54:12,019 INFO L273 TraceCheckUtils]: 170: Hoare triple {75293#false} assume !!(~y~0 < 100000);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); {75293#false} is VALID [2018-11-23 11:54:12,019 INFO L256 TraceCheckUtils]: 171: Hoare triple {75293#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {75293#false} is VALID [2018-11-23 11:54:12,019 INFO L273 TraceCheckUtils]: 172: Hoare triple {75293#false} ~cond := #in~cond; {75293#false} is VALID [2018-11-23 11:54:12,019 INFO L273 TraceCheckUtils]: 173: Hoare triple {75293#false} assume 0 == ~cond; {75293#false} is VALID [2018-11-23 11:54:12,020 INFO L273 TraceCheckUtils]: 174: Hoare triple {75293#false} assume !false; {75293#false} is VALID [2018-11-23 11:54:12,039 INFO L134 CoverageAnalysis]: Checked inductivity of 4188 backedges. 1 proven. 4187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:12,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:12,039 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:54:12,049 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:54:12,322 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-11-23 11:54:12,322 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:12,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:12,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:12,743 INFO L256 TraceCheckUtils]: 0: Hoare triple {75292#true} call ULTIMATE.init(); {75292#true} is VALID [2018-11-23 11:54:12,744 INFO L273 TraceCheckUtils]: 1: Hoare triple {75292#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {75292#true} is VALID [2018-11-23 11:54:12,744 INFO L273 TraceCheckUtils]: 2: Hoare triple {75292#true} assume true; {75292#true} is VALID [2018-11-23 11:54:12,744 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {75292#true} {75292#true} #79#return; {75292#true} is VALID [2018-11-23 11:54:12,744 INFO L256 TraceCheckUtils]: 4: Hoare triple {75292#true} call #t~ret8 := main(); {75292#true} is VALID [2018-11-23 11:54:12,744 INFO L273 TraceCheckUtils]: 5: Hoare triple {75292#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {75292#true} is VALID [2018-11-23 11:54:12,745 INFO L273 TraceCheckUtils]: 6: Hoare triple {75292#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {75369#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:12,745 INFO L273 TraceCheckUtils]: 7: Hoare triple {75369#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75369#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:12,746 INFO L273 TraceCheckUtils]: 8: Hoare triple {75369#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75369#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:12,746 INFO L273 TraceCheckUtils]: 9: Hoare triple {75369#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {75295#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:12,747 INFO L273 TraceCheckUtils]: 10: Hoare triple {75295#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75295#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:12,747 INFO L273 TraceCheckUtils]: 11: Hoare triple {75295#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75295#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:12,747 INFO L273 TraceCheckUtils]: 12: Hoare triple {75295#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {75296#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:12,748 INFO L273 TraceCheckUtils]: 13: Hoare triple {75296#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75296#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:12,748 INFO L273 TraceCheckUtils]: 14: Hoare triple {75296#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75296#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:12,748 INFO L273 TraceCheckUtils]: 15: Hoare triple {75296#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {75297#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:12,749 INFO L273 TraceCheckUtils]: 16: Hoare triple {75297#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75297#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:12,749 INFO L273 TraceCheckUtils]: 17: Hoare triple {75297#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75297#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:12,750 INFO L273 TraceCheckUtils]: 18: Hoare triple {75297#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {75298#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:12,750 INFO L273 TraceCheckUtils]: 19: Hoare triple {75298#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75298#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:12,751 INFO L273 TraceCheckUtils]: 20: Hoare triple {75298#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75298#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:12,752 INFO L273 TraceCheckUtils]: 21: Hoare triple {75298#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {75299#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:12,752 INFO L273 TraceCheckUtils]: 22: Hoare triple {75299#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75299#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:12,753 INFO L273 TraceCheckUtils]: 23: Hoare triple {75299#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75299#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:12,753 INFO L273 TraceCheckUtils]: 24: Hoare triple {75299#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {75300#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:12,754 INFO L273 TraceCheckUtils]: 25: Hoare triple {75300#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75300#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:12,754 INFO L273 TraceCheckUtils]: 26: Hoare triple {75300#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75300#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:12,755 INFO L273 TraceCheckUtils]: 27: Hoare triple {75300#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {75301#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:12,755 INFO L273 TraceCheckUtils]: 28: Hoare triple {75301#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75301#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:12,756 INFO L273 TraceCheckUtils]: 29: Hoare triple {75301#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75301#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:12,757 INFO L273 TraceCheckUtils]: 30: Hoare triple {75301#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {75302#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:12,757 INFO L273 TraceCheckUtils]: 31: Hoare triple {75302#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75302#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:12,758 INFO L273 TraceCheckUtils]: 32: Hoare triple {75302#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75302#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:12,758 INFO L273 TraceCheckUtils]: 33: Hoare triple {75302#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {75303#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:12,759 INFO L273 TraceCheckUtils]: 34: Hoare triple {75303#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75303#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:12,759 INFO L273 TraceCheckUtils]: 35: Hoare triple {75303#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75303#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:12,760 INFO L273 TraceCheckUtils]: 36: Hoare triple {75303#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {75304#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:12,761 INFO L273 TraceCheckUtils]: 37: Hoare triple {75304#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75304#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:12,761 INFO L273 TraceCheckUtils]: 38: Hoare triple {75304#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75304#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:12,762 INFO L273 TraceCheckUtils]: 39: Hoare triple {75304#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {75305#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:12,762 INFO L273 TraceCheckUtils]: 40: Hoare triple {75305#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75305#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:12,763 INFO L273 TraceCheckUtils]: 41: Hoare triple {75305#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75305#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:12,764 INFO L273 TraceCheckUtils]: 42: Hoare triple {75305#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {75306#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:12,764 INFO L273 TraceCheckUtils]: 43: Hoare triple {75306#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75306#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:12,765 INFO L273 TraceCheckUtils]: 44: Hoare triple {75306#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75306#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:12,765 INFO L273 TraceCheckUtils]: 45: Hoare triple {75306#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {75307#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:12,766 INFO L273 TraceCheckUtils]: 46: Hoare triple {75307#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75307#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:12,766 INFO L273 TraceCheckUtils]: 47: Hoare triple {75307#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75307#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:12,767 INFO L273 TraceCheckUtils]: 48: Hoare triple {75307#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {75308#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:12,767 INFO L273 TraceCheckUtils]: 49: Hoare triple {75308#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75308#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:12,768 INFO L273 TraceCheckUtils]: 50: Hoare triple {75308#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75308#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:12,769 INFO L273 TraceCheckUtils]: 51: Hoare triple {75308#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {75309#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:12,769 INFO L273 TraceCheckUtils]: 52: Hoare triple {75309#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75309#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:12,770 INFO L273 TraceCheckUtils]: 53: Hoare triple {75309#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75309#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:12,770 INFO L273 TraceCheckUtils]: 54: Hoare triple {75309#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {75310#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:12,771 INFO L273 TraceCheckUtils]: 55: Hoare triple {75310#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75310#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:12,771 INFO L273 TraceCheckUtils]: 56: Hoare triple {75310#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75310#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:12,772 INFO L273 TraceCheckUtils]: 57: Hoare triple {75310#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {75311#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:12,773 INFO L273 TraceCheckUtils]: 58: Hoare triple {75311#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75311#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:12,773 INFO L273 TraceCheckUtils]: 59: Hoare triple {75311#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75311#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:12,774 INFO L273 TraceCheckUtils]: 60: Hoare triple {75311#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {75312#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:12,774 INFO L273 TraceCheckUtils]: 61: Hoare triple {75312#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75312#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:12,775 INFO L273 TraceCheckUtils]: 62: Hoare triple {75312#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75312#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:12,776 INFO L273 TraceCheckUtils]: 63: Hoare triple {75312#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {75313#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:12,776 INFO L273 TraceCheckUtils]: 64: Hoare triple {75313#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75313#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:12,777 INFO L273 TraceCheckUtils]: 65: Hoare triple {75313#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75313#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:12,777 INFO L273 TraceCheckUtils]: 66: Hoare triple {75313#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {75314#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:12,778 INFO L273 TraceCheckUtils]: 67: Hoare triple {75314#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75314#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:12,778 INFO L273 TraceCheckUtils]: 68: Hoare triple {75314#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75314#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:12,779 INFO L273 TraceCheckUtils]: 69: Hoare triple {75314#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {75315#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:12,779 INFO L273 TraceCheckUtils]: 70: Hoare triple {75315#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75315#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:12,780 INFO L273 TraceCheckUtils]: 71: Hoare triple {75315#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75315#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:12,781 INFO L273 TraceCheckUtils]: 72: Hoare triple {75315#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {75316#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:12,781 INFO L273 TraceCheckUtils]: 73: Hoare triple {75316#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75316#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:12,782 INFO L273 TraceCheckUtils]: 74: Hoare triple {75316#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75316#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:12,782 INFO L273 TraceCheckUtils]: 75: Hoare triple {75316#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {75317#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:12,783 INFO L273 TraceCheckUtils]: 76: Hoare triple {75317#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75317#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:12,783 INFO L273 TraceCheckUtils]: 77: Hoare triple {75317#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75317#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:12,784 INFO L273 TraceCheckUtils]: 78: Hoare triple {75317#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {75318#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:12,785 INFO L273 TraceCheckUtils]: 79: Hoare triple {75318#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75318#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:12,785 INFO L273 TraceCheckUtils]: 80: Hoare triple {75318#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75318#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:12,786 INFO L273 TraceCheckUtils]: 81: Hoare triple {75318#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {75319#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:12,786 INFO L273 TraceCheckUtils]: 82: Hoare triple {75319#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75319#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:12,787 INFO L273 TraceCheckUtils]: 83: Hoare triple {75319#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75319#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:12,788 INFO L273 TraceCheckUtils]: 84: Hoare triple {75319#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {75320#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:12,788 INFO L273 TraceCheckUtils]: 85: Hoare triple {75320#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75320#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:12,789 INFO L273 TraceCheckUtils]: 86: Hoare triple {75320#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75320#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:12,789 INFO L273 TraceCheckUtils]: 87: Hoare triple {75320#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {75321#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:12,790 INFO L273 TraceCheckUtils]: 88: Hoare triple {75321#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75321#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:12,790 INFO L273 TraceCheckUtils]: 89: Hoare triple {75321#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75321#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:12,791 INFO L273 TraceCheckUtils]: 90: Hoare triple {75321#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {75322#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:12,791 INFO L273 TraceCheckUtils]: 91: Hoare triple {75322#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75322#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:12,792 INFO L273 TraceCheckUtils]: 92: Hoare triple {75322#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75322#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:12,793 INFO L273 TraceCheckUtils]: 93: Hoare triple {75322#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {75323#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:12,793 INFO L273 TraceCheckUtils]: 94: Hoare triple {75323#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75323#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:12,794 INFO L273 TraceCheckUtils]: 95: Hoare triple {75323#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75323#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:12,794 INFO L273 TraceCheckUtils]: 96: Hoare triple {75323#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {75324#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:12,795 INFO L273 TraceCheckUtils]: 97: Hoare triple {75324#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75324#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:12,795 INFO L273 TraceCheckUtils]: 98: Hoare triple {75324#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75324#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:12,796 INFO L273 TraceCheckUtils]: 99: Hoare triple {75324#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {75325#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:12,797 INFO L273 TraceCheckUtils]: 100: Hoare triple {75325#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75325#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:12,797 INFO L273 TraceCheckUtils]: 101: Hoare triple {75325#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75325#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:12,798 INFO L273 TraceCheckUtils]: 102: Hoare triple {75325#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {75326#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:12,798 INFO L273 TraceCheckUtils]: 103: Hoare triple {75326#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75326#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:12,799 INFO L273 TraceCheckUtils]: 104: Hoare triple {75326#(<= main_~i~0 33)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75326#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:12,799 INFO L273 TraceCheckUtils]: 105: Hoare triple {75326#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {75327#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:12,800 INFO L273 TraceCheckUtils]: 106: Hoare triple {75327#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75327#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:12,800 INFO L273 TraceCheckUtils]: 107: Hoare triple {75327#(<= main_~i~0 34)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75327#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:12,801 INFO L273 TraceCheckUtils]: 108: Hoare triple {75327#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {75328#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:12,802 INFO L273 TraceCheckUtils]: 109: Hoare triple {75328#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75328#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:12,802 INFO L273 TraceCheckUtils]: 110: Hoare triple {75328#(<= main_~i~0 35)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75328#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:12,803 INFO L273 TraceCheckUtils]: 111: Hoare triple {75328#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {75329#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:12,803 INFO L273 TraceCheckUtils]: 112: Hoare triple {75329#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75329#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:12,804 INFO L273 TraceCheckUtils]: 113: Hoare triple {75329#(<= main_~i~0 36)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75329#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:12,805 INFO L273 TraceCheckUtils]: 114: Hoare triple {75329#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {75330#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:12,805 INFO L273 TraceCheckUtils]: 115: Hoare triple {75330#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75330#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:12,806 INFO L273 TraceCheckUtils]: 116: Hoare triple {75330#(<= main_~i~0 37)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75330#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:12,806 INFO L273 TraceCheckUtils]: 117: Hoare triple {75330#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {75331#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:12,807 INFO L273 TraceCheckUtils]: 118: Hoare triple {75331#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75331#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:12,807 INFO L273 TraceCheckUtils]: 119: Hoare triple {75331#(<= main_~i~0 38)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75331#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:12,808 INFO L273 TraceCheckUtils]: 120: Hoare triple {75331#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {75332#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:12,809 INFO L273 TraceCheckUtils]: 121: Hoare triple {75332#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75332#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:12,809 INFO L273 TraceCheckUtils]: 122: Hoare triple {75332#(<= main_~i~0 39)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75332#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:12,810 INFO L273 TraceCheckUtils]: 123: Hoare triple {75332#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {75333#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:12,810 INFO L273 TraceCheckUtils]: 124: Hoare triple {75333#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75333#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:12,811 INFO L273 TraceCheckUtils]: 125: Hoare triple {75333#(<= main_~i~0 40)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75333#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:12,811 INFO L273 TraceCheckUtils]: 126: Hoare triple {75333#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {75334#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:12,812 INFO L273 TraceCheckUtils]: 127: Hoare triple {75334#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75334#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:12,812 INFO L273 TraceCheckUtils]: 128: Hoare triple {75334#(<= main_~i~0 41)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75334#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:12,813 INFO L273 TraceCheckUtils]: 129: Hoare triple {75334#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {75335#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:12,814 INFO L273 TraceCheckUtils]: 130: Hoare triple {75335#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75335#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:12,814 INFO L273 TraceCheckUtils]: 131: Hoare triple {75335#(<= main_~i~0 42)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75335#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:12,815 INFO L273 TraceCheckUtils]: 132: Hoare triple {75335#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {75336#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:12,815 INFO L273 TraceCheckUtils]: 133: Hoare triple {75336#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75336#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:12,816 INFO L273 TraceCheckUtils]: 134: Hoare triple {75336#(<= main_~i~0 43)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75336#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:12,817 INFO L273 TraceCheckUtils]: 135: Hoare triple {75336#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {75337#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:12,817 INFO L273 TraceCheckUtils]: 136: Hoare triple {75337#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75337#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:12,818 INFO L273 TraceCheckUtils]: 137: Hoare triple {75337#(<= main_~i~0 44)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75337#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:12,818 INFO L273 TraceCheckUtils]: 138: Hoare triple {75337#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {75338#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:12,819 INFO L273 TraceCheckUtils]: 139: Hoare triple {75338#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75338#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:12,819 INFO L273 TraceCheckUtils]: 140: Hoare triple {75338#(<= main_~i~0 45)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75338#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:12,820 INFO L273 TraceCheckUtils]: 141: Hoare triple {75338#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {75339#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:12,821 INFO L273 TraceCheckUtils]: 142: Hoare triple {75339#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75339#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:12,821 INFO L273 TraceCheckUtils]: 143: Hoare triple {75339#(<= main_~i~0 46)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75339#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:12,822 INFO L273 TraceCheckUtils]: 144: Hoare triple {75339#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {75340#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:12,822 INFO L273 TraceCheckUtils]: 145: Hoare triple {75340#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75340#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:12,823 INFO L273 TraceCheckUtils]: 146: Hoare triple {75340#(<= main_~i~0 47)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75340#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:12,823 INFO L273 TraceCheckUtils]: 147: Hoare triple {75340#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {75341#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:12,824 INFO L273 TraceCheckUtils]: 148: Hoare triple {75341#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75341#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:12,824 INFO L273 TraceCheckUtils]: 149: Hoare triple {75341#(<= main_~i~0 48)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75341#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:12,825 INFO L273 TraceCheckUtils]: 150: Hoare triple {75341#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {75342#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:12,826 INFO L273 TraceCheckUtils]: 151: Hoare triple {75342#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75342#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:12,826 INFO L273 TraceCheckUtils]: 152: Hoare triple {75342#(<= main_~i~0 49)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75342#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:12,827 INFO L273 TraceCheckUtils]: 153: Hoare triple {75342#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {75343#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:12,827 INFO L273 TraceCheckUtils]: 154: Hoare triple {75343#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75343#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:12,828 INFO L273 TraceCheckUtils]: 155: Hoare triple {75343#(<= main_~i~0 50)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75343#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:12,829 INFO L273 TraceCheckUtils]: 156: Hoare triple {75343#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {75344#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:12,829 INFO L273 TraceCheckUtils]: 157: Hoare triple {75344#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75344#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:12,830 INFO L273 TraceCheckUtils]: 158: Hoare triple {75344#(<= main_~i~0 51)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75344#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:12,830 INFO L273 TraceCheckUtils]: 159: Hoare triple {75344#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {75345#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:12,831 INFO L273 TraceCheckUtils]: 160: Hoare triple {75345#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75345#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:12,831 INFO L273 TraceCheckUtils]: 161: Hoare triple {75345#(<= main_~i~0 52)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75345#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:12,832 INFO L273 TraceCheckUtils]: 162: Hoare triple {75345#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {75346#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:12,833 INFO L273 TraceCheckUtils]: 163: Hoare triple {75346#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {75346#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:12,833 INFO L273 TraceCheckUtils]: 164: Hoare triple {75346#(<= main_~i~0 53)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {75346#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:12,834 INFO L273 TraceCheckUtils]: 165: Hoare triple {75346#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {75347#(<= main_~i~0 54)} is VALID [2018-11-23 11:54:12,834 INFO L273 TraceCheckUtils]: 166: Hoare triple {75347#(<= main_~i~0 54)} assume !(~i~0 < 100000); {75293#false} is VALID [2018-11-23 11:54:12,835 INFO L273 TraceCheckUtils]: 167: Hoare triple {75293#false} assume !(0 != ~swapped~0); {75293#false} is VALID [2018-11-23 11:54:12,835 INFO L273 TraceCheckUtils]: 168: Hoare triple {75293#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {75293#false} is VALID [2018-11-23 11:54:12,835 INFO L273 TraceCheckUtils]: 169: Hoare triple {75293#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {75293#false} is VALID [2018-11-23 11:54:12,835 INFO L273 TraceCheckUtils]: 170: Hoare triple {75293#false} assume !!(~y~0 < 100000);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); {75293#false} is VALID [2018-11-23 11:54:12,835 INFO L256 TraceCheckUtils]: 171: Hoare triple {75293#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {75293#false} is VALID [2018-11-23 11:54:12,836 INFO L273 TraceCheckUtils]: 172: Hoare triple {75293#false} ~cond := #in~cond; {75293#false} is VALID [2018-11-23 11:54:12,836 INFO L273 TraceCheckUtils]: 173: Hoare triple {75293#false} assume 0 == ~cond; {75293#false} is VALID [2018-11-23 11:54:12,836 INFO L273 TraceCheckUtils]: 174: Hoare triple {75293#false} assume !false; {75293#false} is VALID [2018-11-23 11:54:12,855 INFO L134 CoverageAnalysis]: Checked inductivity of 4188 backedges. 1 proven. 4187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:12,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:12,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 57 [2018-11-23 11:54:12,876 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 175 [2018-11-23 11:54:12,877 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:12,877 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 57 states. [2018-11-23 11:54:13,051 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:54:13,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-11-23 11:54:13,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-11-23 11:54:13,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-11-23 11:54:13,052 INFO L87 Difference]: Start difference. First operand 339 states and 448 transitions. Second operand 57 states. [2018-11-23 11:54:14,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:14,232 INFO L93 Difference]: Finished difference Result 682 states and 906 transitions. [2018-11-23 11:54:14,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-11-23 11:54:14,232 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 175 [2018-11-23 11:54:14,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:14,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 11:54:14,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 265 transitions. [2018-11-23 11:54:14,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 11:54:14,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 265 transitions. [2018-11-23 11:54:14,235 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 56 states and 265 transitions. [2018-11-23 11:54:14,502 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 265 edges. 265 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:14,509 INFO L225 Difference]: With dead ends: 682 [2018-11-23 11:54:14,509 INFO L226 Difference]: Without dead ends: 349 [2018-11-23 11:54:14,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-11-23 11:54:14,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-11-23 11:54:14,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 345. [2018-11-23 11:54:14,645 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:14,645 INFO L82 GeneralOperation]: Start isEquivalent. First operand 349 states. Second operand 345 states. [2018-11-23 11:54:14,646 INFO L74 IsIncluded]: Start isIncluded. First operand 349 states. Second operand 345 states. [2018-11-23 11:54:14,646 INFO L87 Difference]: Start difference. First operand 349 states. Second operand 345 states. [2018-11-23 11:54:14,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:14,653 INFO L93 Difference]: Finished difference Result 349 states and 462 transitions. [2018-11-23 11:54:14,653 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 462 transitions. [2018-11-23 11:54:14,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:14,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:14,653 INFO L74 IsIncluded]: Start isIncluded. First operand 345 states. Second operand 349 states. [2018-11-23 11:54:14,654 INFO L87 Difference]: Start difference. First operand 345 states. Second operand 349 states. [2018-11-23 11:54:14,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:14,659 INFO L93 Difference]: Finished difference Result 349 states and 462 transitions. [2018-11-23 11:54:14,659 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 462 transitions. [2018-11-23 11:54:14,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:14,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:14,659 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:14,660 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:14,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-11-23 11:54:14,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 456 transitions. [2018-11-23 11:54:14,668 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 456 transitions. Word has length 175 [2018-11-23 11:54:14,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:14,668 INFO L480 AbstractCegarLoop]: Abstraction has 345 states and 456 transitions. [2018-11-23 11:54:14,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-11-23 11:54:14,668 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 456 transitions. [2018-11-23 11:54:14,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-23 11:54:14,669 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:14,670 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:14,670 INFO L423 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:14,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:14,670 INFO L82 PathProgramCache]: Analyzing trace with hash -117462607, now seen corresponding path program 54 times [2018-11-23 11:54:14,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:14,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:14,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:14,671 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:14,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:14,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:15,979 INFO L256 TraceCheckUtils]: 0: Hoare triple {77949#true} call ULTIMATE.init(); {77949#true} is VALID [2018-11-23 11:54:15,979 INFO L273 TraceCheckUtils]: 1: Hoare triple {77949#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {77949#true} is VALID [2018-11-23 11:54:15,979 INFO L273 TraceCheckUtils]: 2: Hoare triple {77949#true} assume true; {77949#true} is VALID [2018-11-23 11:54:15,979 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {77949#true} {77949#true} #79#return; {77949#true} is VALID [2018-11-23 11:54:15,980 INFO L256 TraceCheckUtils]: 4: Hoare triple {77949#true} call #t~ret8 := main(); {77949#true} is VALID [2018-11-23 11:54:15,980 INFO L273 TraceCheckUtils]: 5: Hoare triple {77949#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {77949#true} is VALID [2018-11-23 11:54:15,980 INFO L273 TraceCheckUtils]: 6: Hoare triple {77949#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {77951#(= main_~i~0 1)} is VALID [2018-11-23 11:54:15,981 INFO L273 TraceCheckUtils]: 7: Hoare triple {77951#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77951#(= main_~i~0 1)} is VALID [2018-11-23 11:54:15,981 INFO L273 TraceCheckUtils]: 8: Hoare triple {77951#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77951#(= main_~i~0 1)} is VALID [2018-11-23 11:54:15,982 INFO L273 TraceCheckUtils]: 9: Hoare triple {77951#(= main_~i~0 1)} ~i~0 := 1 + ~i~0; {77952#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:15,982 INFO L273 TraceCheckUtils]: 10: Hoare triple {77952#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77952#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:15,983 INFO L273 TraceCheckUtils]: 11: Hoare triple {77952#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77952#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:15,984 INFO L273 TraceCheckUtils]: 12: Hoare triple {77952#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {77953#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:15,984 INFO L273 TraceCheckUtils]: 13: Hoare triple {77953#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77953#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:15,985 INFO L273 TraceCheckUtils]: 14: Hoare triple {77953#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77953#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:15,985 INFO L273 TraceCheckUtils]: 15: Hoare triple {77953#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {77954#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:15,986 INFO L273 TraceCheckUtils]: 16: Hoare triple {77954#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77954#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:15,986 INFO L273 TraceCheckUtils]: 17: Hoare triple {77954#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77954#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:15,987 INFO L273 TraceCheckUtils]: 18: Hoare triple {77954#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {77955#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:15,988 INFO L273 TraceCheckUtils]: 19: Hoare triple {77955#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77955#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:15,988 INFO L273 TraceCheckUtils]: 20: Hoare triple {77955#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77955#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:15,989 INFO L273 TraceCheckUtils]: 21: Hoare triple {77955#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {77956#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:15,989 INFO L273 TraceCheckUtils]: 22: Hoare triple {77956#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77956#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:15,990 INFO L273 TraceCheckUtils]: 23: Hoare triple {77956#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77956#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:15,990 INFO L273 TraceCheckUtils]: 24: Hoare triple {77956#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {77957#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:15,991 INFO L273 TraceCheckUtils]: 25: Hoare triple {77957#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77957#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:15,991 INFO L273 TraceCheckUtils]: 26: Hoare triple {77957#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77957#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:15,992 INFO L273 TraceCheckUtils]: 27: Hoare triple {77957#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {77958#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:15,993 INFO L273 TraceCheckUtils]: 28: Hoare triple {77958#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77958#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:15,993 INFO L273 TraceCheckUtils]: 29: Hoare triple {77958#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77958#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:15,994 INFO L273 TraceCheckUtils]: 30: Hoare triple {77958#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {77959#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:15,994 INFO L273 TraceCheckUtils]: 31: Hoare triple {77959#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77959#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:15,995 INFO L273 TraceCheckUtils]: 32: Hoare triple {77959#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77959#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:15,996 INFO L273 TraceCheckUtils]: 33: Hoare triple {77959#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {77960#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:15,996 INFO L273 TraceCheckUtils]: 34: Hoare triple {77960#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77960#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:15,997 INFO L273 TraceCheckUtils]: 35: Hoare triple {77960#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77960#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:15,997 INFO L273 TraceCheckUtils]: 36: Hoare triple {77960#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {77961#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:15,998 INFO L273 TraceCheckUtils]: 37: Hoare triple {77961#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77961#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:15,998 INFO L273 TraceCheckUtils]: 38: Hoare triple {77961#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77961#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:15,999 INFO L273 TraceCheckUtils]: 39: Hoare triple {77961#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {77962#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:15,999 INFO L273 TraceCheckUtils]: 40: Hoare triple {77962#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77962#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:16,000 INFO L273 TraceCheckUtils]: 41: Hoare triple {77962#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77962#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:16,001 INFO L273 TraceCheckUtils]: 42: Hoare triple {77962#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {77963#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:16,001 INFO L273 TraceCheckUtils]: 43: Hoare triple {77963#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77963#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:16,002 INFO L273 TraceCheckUtils]: 44: Hoare triple {77963#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77963#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:16,002 INFO L273 TraceCheckUtils]: 45: Hoare triple {77963#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {77964#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:16,003 INFO L273 TraceCheckUtils]: 46: Hoare triple {77964#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77964#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:16,003 INFO L273 TraceCheckUtils]: 47: Hoare triple {77964#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77964#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:16,004 INFO L273 TraceCheckUtils]: 48: Hoare triple {77964#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {77965#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:16,005 INFO L273 TraceCheckUtils]: 49: Hoare triple {77965#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77965#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:16,005 INFO L273 TraceCheckUtils]: 50: Hoare triple {77965#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77965#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:16,006 INFO L273 TraceCheckUtils]: 51: Hoare triple {77965#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {77966#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:16,006 INFO L273 TraceCheckUtils]: 52: Hoare triple {77966#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77966#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:16,007 INFO L273 TraceCheckUtils]: 53: Hoare triple {77966#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77966#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:16,007 INFO L273 TraceCheckUtils]: 54: Hoare triple {77966#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {77967#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:16,008 INFO L273 TraceCheckUtils]: 55: Hoare triple {77967#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77967#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:16,008 INFO L273 TraceCheckUtils]: 56: Hoare triple {77967#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77967#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:16,009 INFO L273 TraceCheckUtils]: 57: Hoare triple {77967#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {77968#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:16,010 INFO L273 TraceCheckUtils]: 58: Hoare triple {77968#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77968#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:16,010 INFO L273 TraceCheckUtils]: 59: Hoare triple {77968#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77968#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:16,011 INFO L273 TraceCheckUtils]: 60: Hoare triple {77968#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {77969#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:16,011 INFO L273 TraceCheckUtils]: 61: Hoare triple {77969#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77969#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:16,012 INFO L273 TraceCheckUtils]: 62: Hoare triple {77969#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77969#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:16,013 INFO L273 TraceCheckUtils]: 63: Hoare triple {77969#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {77970#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:16,013 INFO L273 TraceCheckUtils]: 64: Hoare triple {77970#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77970#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:16,014 INFO L273 TraceCheckUtils]: 65: Hoare triple {77970#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77970#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:16,014 INFO L273 TraceCheckUtils]: 66: Hoare triple {77970#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {77971#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:16,015 INFO L273 TraceCheckUtils]: 67: Hoare triple {77971#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77971#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:16,015 INFO L273 TraceCheckUtils]: 68: Hoare triple {77971#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77971#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:16,016 INFO L273 TraceCheckUtils]: 69: Hoare triple {77971#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {77972#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:16,016 INFO L273 TraceCheckUtils]: 70: Hoare triple {77972#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77972#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:16,017 INFO L273 TraceCheckUtils]: 71: Hoare triple {77972#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77972#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:16,018 INFO L273 TraceCheckUtils]: 72: Hoare triple {77972#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {77973#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:16,018 INFO L273 TraceCheckUtils]: 73: Hoare triple {77973#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77973#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:16,019 INFO L273 TraceCheckUtils]: 74: Hoare triple {77973#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77973#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:16,019 INFO L273 TraceCheckUtils]: 75: Hoare triple {77973#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {77974#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:16,020 INFO L273 TraceCheckUtils]: 76: Hoare triple {77974#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77974#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:16,020 INFO L273 TraceCheckUtils]: 77: Hoare triple {77974#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77974#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:16,021 INFO L273 TraceCheckUtils]: 78: Hoare triple {77974#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {77975#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:16,022 INFO L273 TraceCheckUtils]: 79: Hoare triple {77975#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77975#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:16,022 INFO L273 TraceCheckUtils]: 80: Hoare triple {77975#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77975#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:16,023 INFO L273 TraceCheckUtils]: 81: Hoare triple {77975#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {77976#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:16,023 INFO L273 TraceCheckUtils]: 82: Hoare triple {77976#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77976#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:16,024 INFO L273 TraceCheckUtils]: 83: Hoare triple {77976#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77976#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:16,024 INFO L273 TraceCheckUtils]: 84: Hoare triple {77976#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {77977#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:16,025 INFO L273 TraceCheckUtils]: 85: Hoare triple {77977#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77977#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:16,025 INFO L273 TraceCheckUtils]: 86: Hoare triple {77977#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77977#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:16,026 INFO L273 TraceCheckUtils]: 87: Hoare triple {77977#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {77978#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:16,027 INFO L273 TraceCheckUtils]: 88: Hoare triple {77978#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77978#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:16,027 INFO L273 TraceCheckUtils]: 89: Hoare triple {77978#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77978#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:16,028 INFO L273 TraceCheckUtils]: 90: Hoare triple {77978#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {77979#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:16,028 INFO L273 TraceCheckUtils]: 91: Hoare triple {77979#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77979#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:16,029 INFO L273 TraceCheckUtils]: 92: Hoare triple {77979#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77979#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:16,030 INFO L273 TraceCheckUtils]: 93: Hoare triple {77979#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {77980#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:16,030 INFO L273 TraceCheckUtils]: 94: Hoare triple {77980#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77980#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:16,031 INFO L273 TraceCheckUtils]: 95: Hoare triple {77980#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77980#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:16,031 INFO L273 TraceCheckUtils]: 96: Hoare triple {77980#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {77981#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:16,032 INFO L273 TraceCheckUtils]: 97: Hoare triple {77981#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77981#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:16,032 INFO L273 TraceCheckUtils]: 98: Hoare triple {77981#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77981#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:16,033 INFO L273 TraceCheckUtils]: 99: Hoare triple {77981#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {77982#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:16,034 INFO L273 TraceCheckUtils]: 100: Hoare triple {77982#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77982#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:16,037 INFO L273 TraceCheckUtils]: 101: Hoare triple {77982#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77982#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:16,040 INFO L273 TraceCheckUtils]: 102: Hoare triple {77982#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {77983#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:16,043 INFO L273 TraceCheckUtils]: 103: Hoare triple {77983#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77983#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:16,044 INFO L273 TraceCheckUtils]: 104: Hoare triple {77983#(<= main_~i~0 33)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77983#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:16,044 INFO L273 TraceCheckUtils]: 105: Hoare triple {77983#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {77984#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:16,044 INFO L273 TraceCheckUtils]: 106: Hoare triple {77984#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77984#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:16,046 INFO L273 TraceCheckUtils]: 107: Hoare triple {77984#(<= main_~i~0 34)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77984#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:16,046 INFO L273 TraceCheckUtils]: 108: Hoare triple {77984#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {77985#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:16,048 INFO L273 TraceCheckUtils]: 109: Hoare triple {77985#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77985#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:16,048 INFO L273 TraceCheckUtils]: 110: Hoare triple {77985#(<= main_~i~0 35)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77985#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:16,049 INFO L273 TraceCheckUtils]: 111: Hoare triple {77985#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {77986#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:16,049 INFO L273 TraceCheckUtils]: 112: Hoare triple {77986#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77986#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:16,051 INFO L273 TraceCheckUtils]: 113: Hoare triple {77986#(<= main_~i~0 36)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77986#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:16,051 INFO L273 TraceCheckUtils]: 114: Hoare triple {77986#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {77987#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:16,053 INFO L273 TraceCheckUtils]: 115: Hoare triple {77987#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77987#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:16,053 INFO L273 TraceCheckUtils]: 116: Hoare triple {77987#(<= main_~i~0 37)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77987#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:16,055 INFO L273 TraceCheckUtils]: 117: Hoare triple {77987#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {77988#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:16,055 INFO L273 TraceCheckUtils]: 118: Hoare triple {77988#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77988#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:16,057 INFO L273 TraceCheckUtils]: 119: Hoare triple {77988#(<= main_~i~0 38)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77988#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:16,057 INFO L273 TraceCheckUtils]: 120: Hoare triple {77988#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {77989#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:16,059 INFO L273 TraceCheckUtils]: 121: Hoare triple {77989#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77989#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:16,059 INFO L273 TraceCheckUtils]: 122: Hoare triple {77989#(<= main_~i~0 39)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77989#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:16,061 INFO L273 TraceCheckUtils]: 123: Hoare triple {77989#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {77990#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:16,061 INFO L273 TraceCheckUtils]: 124: Hoare triple {77990#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77990#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:16,063 INFO L273 TraceCheckUtils]: 125: Hoare triple {77990#(<= main_~i~0 40)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77990#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:16,063 INFO L273 TraceCheckUtils]: 126: Hoare triple {77990#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {77991#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:16,065 INFO L273 TraceCheckUtils]: 127: Hoare triple {77991#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77991#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:16,065 INFO L273 TraceCheckUtils]: 128: Hoare triple {77991#(<= main_~i~0 41)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77991#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:16,067 INFO L273 TraceCheckUtils]: 129: Hoare triple {77991#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {77992#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:16,067 INFO L273 TraceCheckUtils]: 130: Hoare triple {77992#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77992#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:16,069 INFO L273 TraceCheckUtils]: 131: Hoare triple {77992#(<= main_~i~0 42)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77992#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:16,071 INFO L273 TraceCheckUtils]: 132: Hoare triple {77992#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {77993#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:16,071 INFO L273 TraceCheckUtils]: 133: Hoare triple {77993#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77993#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:16,073 INFO L273 TraceCheckUtils]: 134: Hoare triple {77993#(<= main_~i~0 43)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77993#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:16,073 INFO L273 TraceCheckUtils]: 135: Hoare triple {77993#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {77994#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:16,075 INFO L273 TraceCheckUtils]: 136: Hoare triple {77994#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77994#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:16,075 INFO L273 TraceCheckUtils]: 137: Hoare triple {77994#(<= main_~i~0 44)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77994#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:16,078 INFO L273 TraceCheckUtils]: 138: Hoare triple {77994#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {77995#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:16,078 INFO L273 TraceCheckUtils]: 139: Hoare triple {77995#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77995#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:16,081 INFO L273 TraceCheckUtils]: 140: Hoare triple {77995#(<= main_~i~0 45)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77995#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:16,081 INFO L273 TraceCheckUtils]: 141: Hoare triple {77995#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {77996#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:16,083 INFO L273 TraceCheckUtils]: 142: Hoare triple {77996#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77996#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:16,083 INFO L273 TraceCheckUtils]: 143: Hoare triple {77996#(<= main_~i~0 46)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77996#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:16,085 INFO L273 TraceCheckUtils]: 144: Hoare triple {77996#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {77997#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:16,085 INFO L273 TraceCheckUtils]: 145: Hoare triple {77997#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77997#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:16,087 INFO L273 TraceCheckUtils]: 146: Hoare triple {77997#(<= main_~i~0 47)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77997#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:16,087 INFO L273 TraceCheckUtils]: 147: Hoare triple {77997#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {77998#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:16,089 INFO L273 TraceCheckUtils]: 148: Hoare triple {77998#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77998#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:16,089 INFO L273 TraceCheckUtils]: 149: Hoare triple {77998#(<= main_~i~0 48)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77998#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:16,092 INFO L273 TraceCheckUtils]: 150: Hoare triple {77998#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {77999#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:16,092 INFO L273 TraceCheckUtils]: 151: Hoare triple {77999#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77999#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:16,094 INFO L273 TraceCheckUtils]: 152: Hoare triple {77999#(<= main_~i~0 49)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77999#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:16,094 INFO L273 TraceCheckUtils]: 153: Hoare triple {77999#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {78000#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:16,096 INFO L273 TraceCheckUtils]: 154: Hoare triple {78000#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {78000#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:16,096 INFO L273 TraceCheckUtils]: 155: Hoare triple {78000#(<= main_~i~0 50)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {78000#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:16,099 INFO L273 TraceCheckUtils]: 156: Hoare triple {78000#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {78001#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:16,099 INFO L273 TraceCheckUtils]: 157: Hoare triple {78001#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {78001#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:16,101 INFO L273 TraceCheckUtils]: 158: Hoare triple {78001#(<= main_~i~0 51)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {78001#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:16,101 INFO L273 TraceCheckUtils]: 159: Hoare triple {78001#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {78002#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:16,103 INFO L273 TraceCheckUtils]: 160: Hoare triple {78002#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {78002#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:16,103 INFO L273 TraceCheckUtils]: 161: Hoare triple {78002#(<= main_~i~0 52)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {78002#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:16,105 INFO L273 TraceCheckUtils]: 162: Hoare triple {78002#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {78003#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:16,105 INFO L273 TraceCheckUtils]: 163: Hoare triple {78003#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {78003#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:16,107 INFO L273 TraceCheckUtils]: 164: Hoare triple {78003#(<= main_~i~0 53)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {78003#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:16,107 INFO L273 TraceCheckUtils]: 165: Hoare triple {78003#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {78004#(<= main_~i~0 54)} is VALID [2018-11-23 11:54:16,109 INFO L273 TraceCheckUtils]: 166: Hoare triple {78004#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {78004#(<= main_~i~0 54)} is VALID [2018-11-23 11:54:16,109 INFO L273 TraceCheckUtils]: 167: Hoare triple {78004#(<= main_~i~0 54)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {78004#(<= main_~i~0 54)} is VALID [2018-11-23 11:54:16,111 INFO L273 TraceCheckUtils]: 168: Hoare triple {78004#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {78005#(<= main_~i~0 55)} is VALID [2018-11-23 11:54:16,111 INFO L273 TraceCheckUtils]: 169: Hoare triple {78005#(<= main_~i~0 55)} assume !(~i~0 < 100000); {77950#false} is VALID [2018-11-23 11:54:16,111 INFO L273 TraceCheckUtils]: 170: Hoare triple {77950#false} assume !(0 != ~swapped~0); {77950#false} is VALID [2018-11-23 11:54:16,111 INFO L273 TraceCheckUtils]: 171: Hoare triple {77950#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {77950#false} is VALID [2018-11-23 11:54:16,111 INFO L273 TraceCheckUtils]: 172: Hoare triple {77950#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {77950#false} is VALID [2018-11-23 11:54:16,111 INFO L273 TraceCheckUtils]: 173: Hoare triple {77950#false} assume !!(~y~0 < 100000);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); {77950#false} is VALID [2018-11-23 11:54:16,112 INFO L256 TraceCheckUtils]: 174: Hoare triple {77950#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {77950#false} is VALID [2018-11-23 11:54:16,112 INFO L273 TraceCheckUtils]: 175: Hoare triple {77950#false} ~cond := #in~cond; {77950#false} is VALID [2018-11-23 11:54:16,112 INFO L273 TraceCheckUtils]: 176: Hoare triple {77950#false} assume 0 == ~cond; {77950#false} is VALID [2018-11-23 11:54:16,112 INFO L273 TraceCheckUtils]: 177: Hoare triple {77950#false} assume !false; {77950#false} is VALID [2018-11-23 11:54:16,131 INFO L134 CoverageAnalysis]: Checked inductivity of 4348 backedges. 1 proven. 4347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:16,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:16,131 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:54:16,141 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:54:16,388 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 56 check-sat command(s) [2018-11-23 11:54:16,389 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:16,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:16,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:17,841 INFO L256 TraceCheckUtils]: 0: Hoare triple {77949#true} call ULTIMATE.init(); {77949#true} is VALID [2018-11-23 11:54:17,841 INFO L273 TraceCheckUtils]: 1: Hoare triple {77949#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {77949#true} is VALID [2018-11-23 11:54:17,841 INFO L273 TraceCheckUtils]: 2: Hoare triple {77949#true} assume true; {77949#true} is VALID [2018-11-23 11:54:17,841 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {77949#true} {77949#true} #79#return; {77949#true} is VALID [2018-11-23 11:54:17,842 INFO L256 TraceCheckUtils]: 4: Hoare triple {77949#true} call #t~ret8 := main(); {77949#true} is VALID [2018-11-23 11:54:17,842 INFO L273 TraceCheckUtils]: 5: Hoare triple {77949#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {77949#true} is VALID [2018-11-23 11:54:17,842 INFO L273 TraceCheckUtils]: 6: Hoare triple {77949#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {78027#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:17,843 INFO L273 TraceCheckUtils]: 7: Hoare triple {78027#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {78027#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:17,843 INFO L273 TraceCheckUtils]: 8: Hoare triple {78027#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {78027#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:17,844 INFO L273 TraceCheckUtils]: 9: Hoare triple {78027#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {77952#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:17,844 INFO L273 TraceCheckUtils]: 10: Hoare triple {77952#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77952#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:17,844 INFO L273 TraceCheckUtils]: 11: Hoare triple {77952#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77952#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:17,845 INFO L273 TraceCheckUtils]: 12: Hoare triple {77952#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {77953#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:17,845 INFO L273 TraceCheckUtils]: 13: Hoare triple {77953#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77953#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:17,845 INFO L273 TraceCheckUtils]: 14: Hoare triple {77953#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77953#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:17,846 INFO L273 TraceCheckUtils]: 15: Hoare triple {77953#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {77954#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:17,847 INFO L273 TraceCheckUtils]: 16: Hoare triple {77954#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77954#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:17,847 INFO L273 TraceCheckUtils]: 17: Hoare triple {77954#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77954#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:17,848 INFO L273 TraceCheckUtils]: 18: Hoare triple {77954#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {77955#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:17,848 INFO L273 TraceCheckUtils]: 19: Hoare triple {77955#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77955#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:17,849 INFO L273 TraceCheckUtils]: 20: Hoare triple {77955#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77955#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:17,849 INFO L273 TraceCheckUtils]: 21: Hoare triple {77955#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {77956#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:17,850 INFO L273 TraceCheckUtils]: 22: Hoare triple {77956#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77956#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:17,850 INFO L273 TraceCheckUtils]: 23: Hoare triple {77956#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77956#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:17,851 INFO L273 TraceCheckUtils]: 24: Hoare triple {77956#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {77957#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:17,851 INFO L273 TraceCheckUtils]: 25: Hoare triple {77957#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77957#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:17,852 INFO L273 TraceCheckUtils]: 26: Hoare triple {77957#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77957#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:17,853 INFO L273 TraceCheckUtils]: 27: Hoare triple {77957#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {77958#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:17,853 INFO L273 TraceCheckUtils]: 28: Hoare triple {77958#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77958#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:17,853 INFO L273 TraceCheckUtils]: 29: Hoare triple {77958#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77958#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:17,854 INFO L273 TraceCheckUtils]: 30: Hoare triple {77958#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {77959#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:17,855 INFO L273 TraceCheckUtils]: 31: Hoare triple {77959#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77959#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:17,855 INFO L273 TraceCheckUtils]: 32: Hoare triple {77959#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77959#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:17,856 INFO L273 TraceCheckUtils]: 33: Hoare triple {77959#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {77960#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:17,856 INFO L273 TraceCheckUtils]: 34: Hoare triple {77960#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77960#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:17,857 INFO L273 TraceCheckUtils]: 35: Hoare triple {77960#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77960#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:17,857 INFO L273 TraceCheckUtils]: 36: Hoare triple {77960#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {77961#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:17,858 INFO L273 TraceCheckUtils]: 37: Hoare triple {77961#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77961#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:17,858 INFO L273 TraceCheckUtils]: 38: Hoare triple {77961#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77961#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:17,859 INFO L273 TraceCheckUtils]: 39: Hoare triple {77961#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {77962#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:17,860 INFO L273 TraceCheckUtils]: 40: Hoare triple {77962#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77962#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:17,860 INFO L273 TraceCheckUtils]: 41: Hoare triple {77962#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77962#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:17,861 INFO L273 TraceCheckUtils]: 42: Hoare triple {77962#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {77963#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:17,861 INFO L273 TraceCheckUtils]: 43: Hoare triple {77963#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77963#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:17,862 INFO L273 TraceCheckUtils]: 44: Hoare triple {77963#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77963#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:17,862 INFO L273 TraceCheckUtils]: 45: Hoare triple {77963#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {77964#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:17,863 INFO L273 TraceCheckUtils]: 46: Hoare triple {77964#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77964#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:17,863 INFO L273 TraceCheckUtils]: 47: Hoare triple {77964#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77964#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:17,864 INFO L273 TraceCheckUtils]: 48: Hoare triple {77964#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {77965#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:17,864 INFO L273 TraceCheckUtils]: 49: Hoare triple {77965#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77965#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:17,865 INFO L273 TraceCheckUtils]: 50: Hoare triple {77965#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77965#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:17,866 INFO L273 TraceCheckUtils]: 51: Hoare triple {77965#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {77966#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:17,866 INFO L273 TraceCheckUtils]: 52: Hoare triple {77966#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77966#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:17,866 INFO L273 TraceCheckUtils]: 53: Hoare triple {77966#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77966#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:17,867 INFO L273 TraceCheckUtils]: 54: Hoare triple {77966#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {77967#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:17,868 INFO L273 TraceCheckUtils]: 55: Hoare triple {77967#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77967#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:17,868 INFO L273 TraceCheckUtils]: 56: Hoare triple {77967#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77967#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:17,869 INFO L273 TraceCheckUtils]: 57: Hoare triple {77967#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {77968#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:17,869 INFO L273 TraceCheckUtils]: 58: Hoare triple {77968#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77968#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:17,870 INFO L273 TraceCheckUtils]: 59: Hoare triple {77968#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77968#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:17,870 INFO L273 TraceCheckUtils]: 60: Hoare triple {77968#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {77969#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:17,871 INFO L273 TraceCheckUtils]: 61: Hoare triple {77969#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77969#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:17,871 INFO L273 TraceCheckUtils]: 62: Hoare triple {77969#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77969#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:17,872 INFO L273 TraceCheckUtils]: 63: Hoare triple {77969#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {77970#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:17,872 INFO L273 TraceCheckUtils]: 64: Hoare triple {77970#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77970#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:17,873 INFO L273 TraceCheckUtils]: 65: Hoare triple {77970#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77970#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:17,874 INFO L273 TraceCheckUtils]: 66: Hoare triple {77970#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {77971#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:17,874 INFO L273 TraceCheckUtils]: 67: Hoare triple {77971#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77971#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:17,874 INFO L273 TraceCheckUtils]: 68: Hoare triple {77971#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77971#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:17,875 INFO L273 TraceCheckUtils]: 69: Hoare triple {77971#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {77972#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:17,876 INFO L273 TraceCheckUtils]: 70: Hoare triple {77972#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77972#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:17,876 INFO L273 TraceCheckUtils]: 71: Hoare triple {77972#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77972#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:17,877 INFO L273 TraceCheckUtils]: 72: Hoare triple {77972#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {77973#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:17,877 INFO L273 TraceCheckUtils]: 73: Hoare triple {77973#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77973#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:17,878 INFO L273 TraceCheckUtils]: 74: Hoare triple {77973#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77973#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:17,878 INFO L273 TraceCheckUtils]: 75: Hoare triple {77973#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {77974#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:17,879 INFO L273 TraceCheckUtils]: 76: Hoare triple {77974#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77974#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:17,879 INFO L273 TraceCheckUtils]: 77: Hoare triple {77974#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77974#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:17,880 INFO L273 TraceCheckUtils]: 78: Hoare triple {77974#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {77975#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:17,880 INFO L273 TraceCheckUtils]: 79: Hoare triple {77975#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77975#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:17,881 INFO L273 TraceCheckUtils]: 80: Hoare triple {77975#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77975#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:17,882 INFO L273 TraceCheckUtils]: 81: Hoare triple {77975#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {77976#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:17,882 INFO L273 TraceCheckUtils]: 82: Hoare triple {77976#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77976#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:17,883 INFO L273 TraceCheckUtils]: 83: Hoare triple {77976#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77976#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:17,883 INFO L273 TraceCheckUtils]: 84: Hoare triple {77976#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {77977#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:17,884 INFO L273 TraceCheckUtils]: 85: Hoare triple {77977#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77977#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:17,884 INFO L273 TraceCheckUtils]: 86: Hoare triple {77977#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77977#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:17,885 INFO L273 TraceCheckUtils]: 87: Hoare triple {77977#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {77978#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:17,885 INFO L273 TraceCheckUtils]: 88: Hoare triple {77978#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77978#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:17,886 INFO L273 TraceCheckUtils]: 89: Hoare triple {77978#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77978#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:17,886 INFO L273 TraceCheckUtils]: 90: Hoare triple {77978#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {77979#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:17,887 INFO L273 TraceCheckUtils]: 91: Hoare triple {77979#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77979#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:17,887 INFO L273 TraceCheckUtils]: 92: Hoare triple {77979#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77979#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:17,888 INFO L273 TraceCheckUtils]: 93: Hoare triple {77979#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {77980#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:17,888 INFO L273 TraceCheckUtils]: 94: Hoare triple {77980#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77980#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:17,889 INFO L273 TraceCheckUtils]: 95: Hoare triple {77980#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77980#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:17,890 INFO L273 TraceCheckUtils]: 96: Hoare triple {77980#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {77981#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:17,890 INFO L273 TraceCheckUtils]: 97: Hoare triple {77981#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77981#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:17,891 INFO L273 TraceCheckUtils]: 98: Hoare triple {77981#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77981#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:17,891 INFO L273 TraceCheckUtils]: 99: Hoare triple {77981#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {77982#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:17,892 INFO L273 TraceCheckUtils]: 100: Hoare triple {77982#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77982#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:17,892 INFO L273 TraceCheckUtils]: 101: Hoare triple {77982#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77982#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:17,893 INFO L273 TraceCheckUtils]: 102: Hoare triple {77982#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {77983#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:17,893 INFO L273 TraceCheckUtils]: 103: Hoare triple {77983#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77983#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:17,894 INFO L273 TraceCheckUtils]: 104: Hoare triple {77983#(<= main_~i~0 33)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77983#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:17,894 INFO L273 TraceCheckUtils]: 105: Hoare triple {77983#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {77984#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:17,895 INFO L273 TraceCheckUtils]: 106: Hoare triple {77984#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77984#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:17,895 INFO L273 TraceCheckUtils]: 107: Hoare triple {77984#(<= main_~i~0 34)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77984#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:17,896 INFO L273 TraceCheckUtils]: 108: Hoare triple {77984#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {77985#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:17,896 INFO L273 TraceCheckUtils]: 109: Hoare triple {77985#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77985#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:17,897 INFO L273 TraceCheckUtils]: 110: Hoare triple {77985#(<= main_~i~0 35)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77985#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:17,898 INFO L273 TraceCheckUtils]: 111: Hoare triple {77985#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {77986#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:17,898 INFO L273 TraceCheckUtils]: 112: Hoare triple {77986#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77986#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:17,899 INFO L273 TraceCheckUtils]: 113: Hoare triple {77986#(<= main_~i~0 36)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77986#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:17,899 INFO L273 TraceCheckUtils]: 114: Hoare triple {77986#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {77987#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:17,900 INFO L273 TraceCheckUtils]: 115: Hoare triple {77987#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77987#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:17,900 INFO L273 TraceCheckUtils]: 116: Hoare triple {77987#(<= main_~i~0 37)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77987#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:17,901 INFO L273 TraceCheckUtils]: 117: Hoare triple {77987#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {77988#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:17,902 INFO L273 TraceCheckUtils]: 118: Hoare triple {77988#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77988#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:17,902 INFO L273 TraceCheckUtils]: 119: Hoare triple {77988#(<= main_~i~0 38)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77988#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:17,903 INFO L273 TraceCheckUtils]: 120: Hoare triple {77988#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {77989#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:17,903 INFO L273 TraceCheckUtils]: 121: Hoare triple {77989#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77989#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:17,904 INFO L273 TraceCheckUtils]: 122: Hoare triple {77989#(<= main_~i~0 39)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77989#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:17,904 INFO L273 TraceCheckUtils]: 123: Hoare triple {77989#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {77990#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:17,905 INFO L273 TraceCheckUtils]: 124: Hoare triple {77990#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77990#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:17,905 INFO L273 TraceCheckUtils]: 125: Hoare triple {77990#(<= main_~i~0 40)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77990#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:17,906 INFO L273 TraceCheckUtils]: 126: Hoare triple {77990#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {77991#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:17,906 INFO L273 TraceCheckUtils]: 127: Hoare triple {77991#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77991#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:17,907 INFO L273 TraceCheckUtils]: 128: Hoare triple {77991#(<= main_~i~0 41)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77991#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:17,908 INFO L273 TraceCheckUtils]: 129: Hoare triple {77991#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {77992#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:17,908 INFO L273 TraceCheckUtils]: 130: Hoare triple {77992#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77992#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:17,908 INFO L273 TraceCheckUtils]: 131: Hoare triple {77992#(<= main_~i~0 42)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77992#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:17,909 INFO L273 TraceCheckUtils]: 132: Hoare triple {77992#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {77993#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:17,910 INFO L273 TraceCheckUtils]: 133: Hoare triple {77993#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77993#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:17,910 INFO L273 TraceCheckUtils]: 134: Hoare triple {77993#(<= main_~i~0 43)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77993#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:17,911 INFO L273 TraceCheckUtils]: 135: Hoare triple {77993#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {77994#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:17,911 INFO L273 TraceCheckUtils]: 136: Hoare triple {77994#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77994#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:17,912 INFO L273 TraceCheckUtils]: 137: Hoare triple {77994#(<= main_~i~0 44)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77994#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:17,912 INFO L273 TraceCheckUtils]: 138: Hoare triple {77994#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {77995#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:17,913 INFO L273 TraceCheckUtils]: 139: Hoare triple {77995#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77995#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:17,913 INFO L273 TraceCheckUtils]: 140: Hoare triple {77995#(<= main_~i~0 45)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77995#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:17,914 INFO L273 TraceCheckUtils]: 141: Hoare triple {77995#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {77996#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:17,914 INFO L273 TraceCheckUtils]: 142: Hoare triple {77996#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77996#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:17,915 INFO L273 TraceCheckUtils]: 143: Hoare triple {77996#(<= main_~i~0 46)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77996#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:17,916 INFO L273 TraceCheckUtils]: 144: Hoare triple {77996#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {77997#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:17,916 INFO L273 TraceCheckUtils]: 145: Hoare triple {77997#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77997#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:17,916 INFO L273 TraceCheckUtils]: 146: Hoare triple {77997#(<= main_~i~0 47)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77997#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:17,917 INFO L273 TraceCheckUtils]: 147: Hoare triple {77997#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {77998#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:17,918 INFO L273 TraceCheckUtils]: 148: Hoare triple {77998#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77998#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:17,918 INFO L273 TraceCheckUtils]: 149: Hoare triple {77998#(<= main_~i~0 48)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77998#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:17,919 INFO L273 TraceCheckUtils]: 150: Hoare triple {77998#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {77999#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:17,919 INFO L273 TraceCheckUtils]: 151: Hoare triple {77999#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {77999#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:17,920 INFO L273 TraceCheckUtils]: 152: Hoare triple {77999#(<= main_~i~0 49)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {77999#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:17,920 INFO L273 TraceCheckUtils]: 153: Hoare triple {77999#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {78000#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:17,921 INFO L273 TraceCheckUtils]: 154: Hoare triple {78000#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {78000#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:17,921 INFO L273 TraceCheckUtils]: 155: Hoare triple {78000#(<= main_~i~0 50)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {78000#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:17,922 INFO L273 TraceCheckUtils]: 156: Hoare triple {78000#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {78001#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:17,922 INFO L273 TraceCheckUtils]: 157: Hoare triple {78001#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {78001#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:17,923 INFO L273 TraceCheckUtils]: 158: Hoare triple {78001#(<= main_~i~0 51)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {78001#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:17,924 INFO L273 TraceCheckUtils]: 159: Hoare triple {78001#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {78002#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:17,924 INFO L273 TraceCheckUtils]: 160: Hoare triple {78002#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {78002#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:17,925 INFO L273 TraceCheckUtils]: 161: Hoare triple {78002#(<= main_~i~0 52)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {78002#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:17,925 INFO L273 TraceCheckUtils]: 162: Hoare triple {78002#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {78003#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:17,926 INFO L273 TraceCheckUtils]: 163: Hoare triple {78003#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {78003#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:17,926 INFO L273 TraceCheckUtils]: 164: Hoare triple {78003#(<= main_~i~0 53)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {78003#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:17,927 INFO L273 TraceCheckUtils]: 165: Hoare triple {78003#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {78004#(<= main_~i~0 54)} is VALID [2018-11-23 11:54:17,927 INFO L273 TraceCheckUtils]: 166: Hoare triple {78004#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {78004#(<= main_~i~0 54)} is VALID [2018-11-23 11:54:17,928 INFO L273 TraceCheckUtils]: 167: Hoare triple {78004#(<= main_~i~0 54)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {78004#(<= main_~i~0 54)} is VALID [2018-11-23 11:54:17,928 INFO L273 TraceCheckUtils]: 168: Hoare triple {78004#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {78005#(<= main_~i~0 55)} is VALID [2018-11-23 11:54:17,929 INFO L273 TraceCheckUtils]: 169: Hoare triple {78005#(<= main_~i~0 55)} assume !(~i~0 < 100000); {77950#false} is VALID [2018-11-23 11:54:17,929 INFO L273 TraceCheckUtils]: 170: Hoare triple {77950#false} assume !(0 != ~swapped~0); {77950#false} is VALID [2018-11-23 11:54:17,929 INFO L273 TraceCheckUtils]: 171: Hoare triple {77950#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {77950#false} is VALID [2018-11-23 11:54:17,930 INFO L273 TraceCheckUtils]: 172: Hoare triple {77950#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {77950#false} is VALID [2018-11-23 11:54:17,930 INFO L273 TraceCheckUtils]: 173: Hoare triple {77950#false} assume !!(~y~0 < 100000);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); {77950#false} is VALID [2018-11-23 11:54:17,930 INFO L256 TraceCheckUtils]: 174: Hoare triple {77950#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {77950#false} is VALID [2018-11-23 11:54:17,930 INFO L273 TraceCheckUtils]: 175: Hoare triple {77950#false} ~cond := #in~cond; {77950#false} is VALID [2018-11-23 11:54:17,930 INFO L273 TraceCheckUtils]: 176: Hoare triple {77950#false} assume 0 == ~cond; {77950#false} is VALID [2018-11-23 11:54:17,930 INFO L273 TraceCheckUtils]: 177: Hoare triple {77950#false} assume !false; {77950#false} is VALID [2018-11-23 11:54:17,950 INFO L134 CoverageAnalysis]: Checked inductivity of 4348 backedges. 1 proven. 4347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:17,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:17,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 58 [2018-11-23 11:54:17,971 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 178 [2018-11-23 11:54:17,971 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:17,971 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 58 states. [2018-11-23 11:54:18,137 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:18,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-11-23 11:54:18,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-11-23 11:54:18,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-11-23 11:54:18,139 INFO L87 Difference]: Start difference. First operand 345 states and 456 transitions. Second operand 58 states. [2018-11-23 11:54:19,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:19,313 INFO L93 Difference]: Finished difference Result 694 states and 922 transitions. [2018-11-23 11:54:19,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-11-23 11:54:19,313 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 178 [2018-11-23 11:54:19,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:19,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 11:54:19,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 269 transitions. [2018-11-23 11:54:19,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 11:54:19,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 269 transitions. [2018-11-23 11:54:19,317 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 57 states and 269 transitions. [2018-11-23 11:54:19,576 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 269 edges. 269 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:19,584 INFO L225 Difference]: With dead ends: 694 [2018-11-23 11:54:19,584 INFO L226 Difference]: Without dead ends: 355 [2018-11-23 11:54:19,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-11-23 11:54:19,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-11-23 11:54:19,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 351. [2018-11-23 11:54:19,708 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:19,709 INFO L82 GeneralOperation]: Start isEquivalent. First operand 355 states. Second operand 351 states. [2018-11-23 11:54:19,709 INFO L74 IsIncluded]: Start isIncluded. First operand 355 states. Second operand 351 states. [2018-11-23 11:54:19,709 INFO L87 Difference]: Start difference. First operand 355 states. Second operand 351 states. [2018-11-23 11:54:19,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:19,716 INFO L93 Difference]: Finished difference Result 355 states and 470 transitions. [2018-11-23 11:54:19,716 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 470 transitions. [2018-11-23 11:54:19,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:19,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:19,717 INFO L74 IsIncluded]: Start isIncluded. First operand 351 states. Second operand 355 states. [2018-11-23 11:54:19,717 INFO L87 Difference]: Start difference. First operand 351 states. Second operand 355 states. [2018-11-23 11:54:19,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:19,724 INFO L93 Difference]: Finished difference Result 355 states and 470 transitions. [2018-11-23 11:54:19,724 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 470 transitions. [2018-11-23 11:54:19,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:19,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:19,725 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:19,725 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:19,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-11-23 11:54:19,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 464 transitions. [2018-11-23 11:54:19,731 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 464 transitions. Word has length 178 [2018-11-23 11:54:19,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:19,731 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 464 transitions. [2018-11-23 11:54:19,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-11-23 11:54:19,732 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 464 transitions. [2018-11-23 11:54:19,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-23 11:54:19,732 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:19,733 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:19,733 INFO L423 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:19,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:19,733 INFO L82 PathProgramCache]: Analyzing trace with hash -217519064, now seen corresponding path program 55 times [2018-11-23 11:54:19,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:19,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:19,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:19,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:19,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:19,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:21,129 INFO L256 TraceCheckUtils]: 0: Hoare triple {80652#true} call ULTIMATE.init(); {80652#true} is VALID [2018-11-23 11:54:21,129 INFO L273 TraceCheckUtils]: 1: Hoare triple {80652#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {80652#true} is VALID [2018-11-23 11:54:21,129 INFO L273 TraceCheckUtils]: 2: Hoare triple {80652#true} assume true; {80652#true} is VALID [2018-11-23 11:54:21,130 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {80652#true} {80652#true} #79#return; {80652#true} is VALID [2018-11-23 11:54:21,130 INFO L256 TraceCheckUtils]: 4: Hoare triple {80652#true} call #t~ret8 := main(); {80652#true} is VALID [2018-11-23 11:54:21,130 INFO L273 TraceCheckUtils]: 5: Hoare triple {80652#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {80652#true} is VALID [2018-11-23 11:54:21,130 INFO L273 TraceCheckUtils]: 6: Hoare triple {80652#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {80654#(= main_~i~0 1)} is VALID [2018-11-23 11:54:21,130 INFO L273 TraceCheckUtils]: 7: Hoare triple {80654#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80654#(= main_~i~0 1)} is VALID [2018-11-23 11:54:21,131 INFO L273 TraceCheckUtils]: 8: Hoare triple {80654#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80654#(= main_~i~0 1)} is VALID [2018-11-23 11:54:21,131 INFO L273 TraceCheckUtils]: 9: Hoare triple {80654#(= main_~i~0 1)} ~i~0 := 1 + ~i~0; {80655#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:21,131 INFO L273 TraceCheckUtils]: 10: Hoare triple {80655#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80655#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:21,132 INFO L273 TraceCheckUtils]: 11: Hoare triple {80655#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80655#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:21,132 INFO L273 TraceCheckUtils]: 12: Hoare triple {80655#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {80656#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:21,132 INFO L273 TraceCheckUtils]: 13: Hoare triple {80656#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80656#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:21,133 INFO L273 TraceCheckUtils]: 14: Hoare triple {80656#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80656#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:21,133 INFO L273 TraceCheckUtils]: 15: Hoare triple {80656#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {80657#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:21,133 INFO L273 TraceCheckUtils]: 16: Hoare triple {80657#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80657#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:21,134 INFO L273 TraceCheckUtils]: 17: Hoare triple {80657#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80657#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:21,135 INFO L273 TraceCheckUtils]: 18: Hoare triple {80657#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {80658#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:21,135 INFO L273 TraceCheckUtils]: 19: Hoare triple {80658#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80658#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:21,135 INFO L273 TraceCheckUtils]: 20: Hoare triple {80658#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80658#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:21,136 INFO L273 TraceCheckUtils]: 21: Hoare triple {80658#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {80659#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:21,137 INFO L273 TraceCheckUtils]: 22: Hoare triple {80659#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80659#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:21,137 INFO L273 TraceCheckUtils]: 23: Hoare triple {80659#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80659#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:21,138 INFO L273 TraceCheckUtils]: 24: Hoare triple {80659#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {80660#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:21,138 INFO L273 TraceCheckUtils]: 25: Hoare triple {80660#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80660#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:21,139 INFO L273 TraceCheckUtils]: 26: Hoare triple {80660#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80660#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:21,139 INFO L273 TraceCheckUtils]: 27: Hoare triple {80660#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {80661#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:21,140 INFO L273 TraceCheckUtils]: 28: Hoare triple {80661#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80661#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:21,140 INFO L273 TraceCheckUtils]: 29: Hoare triple {80661#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80661#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:21,141 INFO L273 TraceCheckUtils]: 30: Hoare triple {80661#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {80662#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:21,141 INFO L273 TraceCheckUtils]: 31: Hoare triple {80662#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80662#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:21,142 INFO L273 TraceCheckUtils]: 32: Hoare triple {80662#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80662#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:21,143 INFO L273 TraceCheckUtils]: 33: Hoare triple {80662#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {80663#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:21,143 INFO L273 TraceCheckUtils]: 34: Hoare triple {80663#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80663#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:21,143 INFO L273 TraceCheckUtils]: 35: Hoare triple {80663#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80663#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:21,144 INFO L273 TraceCheckUtils]: 36: Hoare triple {80663#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {80664#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:21,145 INFO L273 TraceCheckUtils]: 37: Hoare triple {80664#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80664#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:21,145 INFO L273 TraceCheckUtils]: 38: Hoare triple {80664#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80664#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:21,146 INFO L273 TraceCheckUtils]: 39: Hoare triple {80664#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {80665#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:21,146 INFO L273 TraceCheckUtils]: 40: Hoare triple {80665#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80665#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:21,147 INFO L273 TraceCheckUtils]: 41: Hoare triple {80665#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80665#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:21,147 INFO L273 TraceCheckUtils]: 42: Hoare triple {80665#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {80666#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:21,148 INFO L273 TraceCheckUtils]: 43: Hoare triple {80666#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80666#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:21,148 INFO L273 TraceCheckUtils]: 44: Hoare triple {80666#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80666#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:21,149 INFO L273 TraceCheckUtils]: 45: Hoare triple {80666#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {80667#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:21,149 INFO L273 TraceCheckUtils]: 46: Hoare triple {80667#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80667#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:21,150 INFO L273 TraceCheckUtils]: 47: Hoare triple {80667#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80667#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:21,151 INFO L273 TraceCheckUtils]: 48: Hoare triple {80667#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {80668#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:21,151 INFO L273 TraceCheckUtils]: 49: Hoare triple {80668#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80668#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:21,152 INFO L273 TraceCheckUtils]: 50: Hoare triple {80668#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80668#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:21,152 INFO L273 TraceCheckUtils]: 51: Hoare triple {80668#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {80669#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:21,153 INFO L273 TraceCheckUtils]: 52: Hoare triple {80669#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80669#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:21,153 INFO L273 TraceCheckUtils]: 53: Hoare triple {80669#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80669#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:21,155 INFO L273 TraceCheckUtils]: 54: Hoare triple {80669#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {80670#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:21,157 INFO L273 TraceCheckUtils]: 55: Hoare triple {80670#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80670#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:21,157 INFO L273 TraceCheckUtils]: 56: Hoare triple {80670#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80670#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:21,158 INFO L273 TraceCheckUtils]: 57: Hoare triple {80670#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {80671#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:21,158 INFO L273 TraceCheckUtils]: 58: Hoare triple {80671#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80671#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:21,160 INFO L273 TraceCheckUtils]: 59: Hoare triple {80671#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80671#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:21,160 INFO L273 TraceCheckUtils]: 60: Hoare triple {80671#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {80672#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:21,162 INFO L273 TraceCheckUtils]: 61: Hoare triple {80672#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80672#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:21,162 INFO L273 TraceCheckUtils]: 62: Hoare triple {80672#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80672#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:21,164 INFO L273 TraceCheckUtils]: 63: Hoare triple {80672#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {80673#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:21,164 INFO L273 TraceCheckUtils]: 64: Hoare triple {80673#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80673#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:21,167 INFO L273 TraceCheckUtils]: 65: Hoare triple {80673#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80673#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:21,167 INFO L273 TraceCheckUtils]: 66: Hoare triple {80673#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {80674#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:21,169 INFO L273 TraceCheckUtils]: 67: Hoare triple {80674#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80674#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:21,169 INFO L273 TraceCheckUtils]: 68: Hoare triple {80674#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80674#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:21,171 INFO L273 TraceCheckUtils]: 69: Hoare triple {80674#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {80675#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:21,171 INFO L273 TraceCheckUtils]: 70: Hoare triple {80675#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80675#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:21,173 INFO L273 TraceCheckUtils]: 71: Hoare triple {80675#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80675#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:21,173 INFO L273 TraceCheckUtils]: 72: Hoare triple {80675#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {80676#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:21,176 INFO L273 TraceCheckUtils]: 73: Hoare triple {80676#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80676#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:21,176 INFO L273 TraceCheckUtils]: 74: Hoare triple {80676#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80676#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:21,178 INFO L273 TraceCheckUtils]: 75: Hoare triple {80676#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {80677#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:21,178 INFO L273 TraceCheckUtils]: 76: Hoare triple {80677#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80677#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:21,181 INFO L273 TraceCheckUtils]: 77: Hoare triple {80677#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80677#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:21,181 INFO L273 TraceCheckUtils]: 78: Hoare triple {80677#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {80678#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:21,185 INFO L273 TraceCheckUtils]: 79: Hoare triple {80678#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80678#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:21,185 INFO L273 TraceCheckUtils]: 80: Hoare triple {80678#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80678#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:21,185 INFO L273 TraceCheckUtils]: 81: Hoare triple {80678#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {80679#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:21,191 INFO L273 TraceCheckUtils]: 82: Hoare triple {80679#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80679#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:21,191 INFO L273 TraceCheckUtils]: 83: Hoare triple {80679#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80679#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:21,194 INFO L273 TraceCheckUtils]: 84: Hoare triple {80679#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {80680#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:21,194 INFO L273 TraceCheckUtils]: 85: Hoare triple {80680#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80680#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:21,197 INFO L273 TraceCheckUtils]: 86: Hoare triple {80680#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80680#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:21,198 INFO L273 TraceCheckUtils]: 87: Hoare triple {80680#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {80681#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:21,198 INFO L273 TraceCheckUtils]: 88: Hoare triple {80681#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80681#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:21,201 INFO L273 TraceCheckUtils]: 89: Hoare triple {80681#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80681#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:21,201 INFO L273 TraceCheckUtils]: 90: Hoare triple {80681#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {80682#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:21,204 INFO L273 TraceCheckUtils]: 91: Hoare triple {80682#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80682#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:21,204 INFO L273 TraceCheckUtils]: 92: Hoare triple {80682#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80682#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:21,206 INFO L273 TraceCheckUtils]: 93: Hoare triple {80682#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {80683#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:21,208 INFO L273 TraceCheckUtils]: 94: Hoare triple {80683#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80683#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:21,208 INFO L273 TraceCheckUtils]: 95: Hoare triple {80683#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80683#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:21,210 INFO L273 TraceCheckUtils]: 96: Hoare triple {80683#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {80684#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:21,210 INFO L273 TraceCheckUtils]: 97: Hoare triple {80684#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80684#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:21,213 INFO L273 TraceCheckUtils]: 98: Hoare triple {80684#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80684#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:21,213 INFO L273 TraceCheckUtils]: 99: Hoare triple {80684#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {80685#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:21,216 INFO L273 TraceCheckUtils]: 100: Hoare triple {80685#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80685#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:21,216 INFO L273 TraceCheckUtils]: 101: Hoare triple {80685#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80685#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:21,219 INFO L273 TraceCheckUtils]: 102: Hoare triple {80685#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {80686#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:21,219 INFO L273 TraceCheckUtils]: 103: Hoare triple {80686#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80686#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:21,222 INFO L273 TraceCheckUtils]: 104: Hoare triple {80686#(<= main_~i~0 33)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80686#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:21,222 INFO L273 TraceCheckUtils]: 105: Hoare triple {80686#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {80687#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:21,225 INFO L273 TraceCheckUtils]: 106: Hoare triple {80687#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80687#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:21,225 INFO L273 TraceCheckUtils]: 107: Hoare triple {80687#(<= main_~i~0 34)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80687#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:21,227 INFO L273 TraceCheckUtils]: 108: Hoare triple {80687#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {80688#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:21,227 INFO L273 TraceCheckUtils]: 109: Hoare triple {80688#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80688#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:21,229 INFO L273 TraceCheckUtils]: 110: Hoare triple {80688#(<= main_~i~0 35)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80688#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:21,229 INFO L273 TraceCheckUtils]: 111: Hoare triple {80688#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {80689#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:21,232 INFO L273 TraceCheckUtils]: 112: Hoare triple {80689#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80689#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:21,232 INFO L273 TraceCheckUtils]: 113: Hoare triple {80689#(<= main_~i~0 36)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80689#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:21,234 INFO L273 TraceCheckUtils]: 114: Hoare triple {80689#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {80690#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:21,234 INFO L273 TraceCheckUtils]: 115: Hoare triple {80690#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80690#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:21,237 INFO L273 TraceCheckUtils]: 116: Hoare triple {80690#(<= main_~i~0 37)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80690#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:21,237 INFO L273 TraceCheckUtils]: 117: Hoare triple {80690#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {80691#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:21,239 INFO L273 TraceCheckUtils]: 118: Hoare triple {80691#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80691#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:21,239 INFO L273 TraceCheckUtils]: 119: Hoare triple {80691#(<= main_~i~0 38)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80691#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:21,242 INFO L273 TraceCheckUtils]: 120: Hoare triple {80691#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {80692#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:21,242 INFO L273 TraceCheckUtils]: 121: Hoare triple {80692#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80692#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:21,245 INFO L273 TraceCheckUtils]: 122: Hoare triple {80692#(<= main_~i~0 39)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80692#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:21,245 INFO L273 TraceCheckUtils]: 123: Hoare triple {80692#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {80693#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:21,248 INFO L273 TraceCheckUtils]: 124: Hoare triple {80693#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80693#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:21,248 INFO L273 TraceCheckUtils]: 125: Hoare triple {80693#(<= main_~i~0 40)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80693#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:21,250 INFO L273 TraceCheckUtils]: 126: Hoare triple {80693#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {80694#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:21,250 INFO L273 TraceCheckUtils]: 127: Hoare triple {80694#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80694#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:21,252 INFO L273 TraceCheckUtils]: 128: Hoare triple {80694#(<= main_~i~0 41)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80694#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:21,252 INFO L273 TraceCheckUtils]: 129: Hoare triple {80694#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {80695#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:21,254 INFO L273 TraceCheckUtils]: 130: Hoare triple {80695#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80695#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:21,254 INFO L273 TraceCheckUtils]: 131: Hoare triple {80695#(<= main_~i~0 42)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80695#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:21,257 INFO L273 TraceCheckUtils]: 132: Hoare triple {80695#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {80696#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:21,257 INFO L273 TraceCheckUtils]: 133: Hoare triple {80696#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80696#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:21,259 INFO L273 TraceCheckUtils]: 134: Hoare triple {80696#(<= main_~i~0 43)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80696#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:21,259 INFO L273 TraceCheckUtils]: 135: Hoare triple {80696#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {80697#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:21,261 INFO L273 TraceCheckUtils]: 136: Hoare triple {80697#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80697#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:21,261 INFO L273 TraceCheckUtils]: 137: Hoare triple {80697#(<= main_~i~0 44)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80697#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:21,264 INFO L273 TraceCheckUtils]: 138: Hoare triple {80697#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {80698#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:21,264 INFO L273 TraceCheckUtils]: 139: Hoare triple {80698#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80698#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:21,267 INFO L273 TraceCheckUtils]: 140: Hoare triple {80698#(<= main_~i~0 45)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80698#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:21,267 INFO L273 TraceCheckUtils]: 141: Hoare triple {80698#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {80699#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:21,270 INFO L273 TraceCheckUtils]: 142: Hoare triple {80699#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80699#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:21,270 INFO L273 TraceCheckUtils]: 143: Hoare triple {80699#(<= main_~i~0 46)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80699#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:21,272 INFO L273 TraceCheckUtils]: 144: Hoare triple {80699#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {80700#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:21,272 INFO L273 TraceCheckUtils]: 145: Hoare triple {80700#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80700#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:21,274 INFO L273 TraceCheckUtils]: 146: Hoare triple {80700#(<= main_~i~0 47)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80700#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:21,274 INFO L273 TraceCheckUtils]: 147: Hoare triple {80700#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {80701#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:21,277 INFO L273 TraceCheckUtils]: 148: Hoare triple {80701#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80701#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:21,277 INFO L273 TraceCheckUtils]: 149: Hoare triple {80701#(<= main_~i~0 48)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80701#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:21,280 INFO L273 TraceCheckUtils]: 150: Hoare triple {80701#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {80702#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:21,280 INFO L273 TraceCheckUtils]: 151: Hoare triple {80702#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80702#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:21,283 INFO L273 TraceCheckUtils]: 152: Hoare triple {80702#(<= main_~i~0 49)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80702#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:21,283 INFO L273 TraceCheckUtils]: 153: Hoare triple {80702#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {80703#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:21,285 INFO L273 TraceCheckUtils]: 154: Hoare triple {80703#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80703#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:21,285 INFO L273 TraceCheckUtils]: 155: Hoare triple {80703#(<= main_~i~0 50)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80703#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:21,287 INFO L273 TraceCheckUtils]: 156: Hoare triple {80703#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {80704#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:21,287 INFO L273 TraceCheckUtils]: 157: Hoare triple {80704#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80704#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:21,290 INFO L273 TraceCheckUtils]: 158: Hoare triple {80704#(<= main_~i~0 51)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80704#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:21,290 INFO L273 TraceCheckUtils]: 159: Hoare triple {80704#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {80705#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:21,293 INFO L273 TraceCheckUtils]: 160: Hoare triple {80705#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80705#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:21,293 INFO L273 TraceCheckUtils]: 161: Hoare triple {80705#(<= main_~i~0 52)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80705#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:21,296 INFO L273 TraceCheckUtils]: 162: Hoare triple {80705#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {80706#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:21,296 INFO L273 TraceCheckUtils]: 163: Hoare triple {80706#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80706#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:21,299 INFO L273 TraceCheckUtils]: 164: Hoare triple {80706#(<= main_~i~0 53)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80706#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:21,299 INFO L273 TraceCheckUtils]: 165: Hoare triple {80706#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {80707#(<= main_~i~0 54)} is VALID [2018-11-23 11:54:21,301 INFO L273 TraceCheckUtils]: 166: Hoare triple {80707#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80707#(<= main_~i~0 54)} is VALID [2018-11-23 11:54:21,301 INFO L273 TraceCheckUtils]: 167: Hoare triple {80707#(<= main_~i~0 54)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80707#(<= main_~i~0 54)} is VALID [2018-11-23 11:54:21,304 INFO L273 TraceCheckUtils]: 168: Hoare triple {80707#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {80708#(<= main_~i~0 55)} is VALID [2018-11-23 11:54:21,304 INFO L273 TraceCheckUtils]: 169: Hoare triple {80708#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80708#(<= main_~i~0 55)} is VALID [2018-11-23 11:54:21,306 INFO L273 TraceCheckUtils]: 170: Hoare triple {80708#(<= main_~i~0 55)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80708#(<= main_~i~0 55)} is VALID [2018-11-23 11:54:21,306 INFO L273 TraceCheckUtils]: 171: Hoare triple {80708#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {80709#(<= main_~i~0 56)} is VALID [2018-11-23 11:54:21,308 INFO L273 TraceCheckUtils]: 172: Hoare triple {80709#(<= main_~i~0 56)} assume !(~i~0 < 100000); {80653#false} is VALID [2018-11-23 11:54:21,308 INFO L273 TraceCheckUtils]: 173: Hoare triple {80653#false} assume !(0 != ~swapped~0); {80653#false} is VALID [2018-11-23 11:54:21,308 INFO L273 TraceCheckUtils]: 174: Hoare triple {80653#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {80653#false} is VALID [2018-11-23 11:54:21,308 INFO L273 TraceCheckUtils]: 175: Hoare triple {80653#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {80653#false} is VALID [2018-11-23 11:54:21,308 INFO L273 TraceCheckUtils]: 176: Hoare triple {80653#false} assume !!(~y~0 < 100000);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); {80653#false} is VALID [2018-11-23 11:54:21,308 INFO L256 TraceCheckUtils]: 177: Hoare triple {80653#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {80653#false} is VALID [2018-11-23 11:54:21,308 INFO L273 TraceCheckUtils]: 178: Hoare triple {80653#false} ~cond := #in~cond; {80653#false} is VALID [2018-11-23 11:54:21,308 INFO L273 TraceCheckUtils]: 179: Hoare triple {80653#false} assume 0 == ~cond; {80653#false} is VALID [2018-11-23 11:54:21,309 INFO L273 TraceCheckUtils]: 180: Hoare triple {80653#false} assume !false; {80653#false} is VALID [2018-11-23 11:54:21,328 INFO L134 CoverageAnalysis]: Checked inductivity of 4511 backedges. 1 proven. 4510 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:21,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:21,328 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:54:21,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:54:21,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:21,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:21,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:21,944 INFO L256 TraceCheckUtils]: 0: Hoare triple {80652#true} call ULTIMATE.init(); {80652#true} is VALID [2018-11-23 11:54:21,945 INFO L273 TraceCheckUtils]: 1: Hoare triple {80652#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {80652#true} is VALID [2018-11-23 11:54:21,945 INFO L273 TraceCheckUtils]: 2: Hoare triple {80652#true} assume true; {80652#true} is VALID [2018-11-23 11:54:21,945 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {80652#true} {80652#true} #79#return; {80652#true} is VALID [2018-11-23 11:54:21,945 INFO L256 TraceCheckUtils]: 4: Hoare triple {80652#true} call #t~ret8 := main(); {80652#true} is VALID [2018-11-23 11:54:21,945 INFO L273 TraceCheckUtils]: 5: Hoare triple {80652#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {80652#true} is VALID [2018-11-23 11:54:21,946 INFO L273 TraceCheckUtils]: 6: Hoare triple {80652#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {80731#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:21,947 INFO L273 TraceCheckUtils]: 7: Hoare triple {80731#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80731#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:21,947 INFO L273 TraceCheckUtils]: 8: Hoare triple {80731#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80731#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:21,947 INFO L273 TraceCheckUtils]: 9: Hoare triple {80731#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {80655#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:21,948 INFO L273 TraceCheckUtils]: 10: Hoare triple {80655#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80655#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:21,948 INFO L273 TraceCheckUtils]: 11: Hoare triple {80655#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80655#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:21,948 INFO L273 TraceCheckUtils]: 12: Hoare triple {80655#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {80656#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:21,949 INFO L273 TraceCheckUtils]: 13: Hoare triple {80656#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80656#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:21,949 INFO L273 TraceCheckUtils]: 14: Hoare triple {80656#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80656#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:21,950 INFO L273 TraceCheckUtils]: 15: Hoare triple {80656#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {80657#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:21,950 INFO L273 TraceCheckUtils]: 16: Hoare triple {80657#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80657#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:21,951 INFO L273 TraceCheckUtils]: 17: Hoare triple {80657#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80657#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:21,951 INFO L273 TraceCheckUtils]: 18: Hoare triple {80657#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {80658#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:21,952 INFO L273 TraceCheckUtils]: 19: Hoare triple {80658#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80658#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:21,952 INFO L273 TraceCheckUtils]: 20: Hoare triple {80658#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80658#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:21,953 INFO L273 TraceCheckUtils]: 21: Hoare triple {80658#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {80659#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:21,953 INFO L273 TraceCheckUtils]: 22: Hoare triple {80659#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80659#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:21,954 INFO L273 TraceCheckUtils]: 23: Hoare triple {80659#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80659#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:21,955 INFO L273 TraceCheckUtils]: 24: Hoare triple {80659#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {80660#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:21,955 INFO L273 TraceCheckUtils]: 25: Hoare triple {80660#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80660#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:21,956 INFO L273 TraceCheckUtils]: 26: Hoare triple {80660#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80660#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:21,956 INFO L273 TraceCheckUtils]: 27: Hoare triple {80660#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {80661#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:21,957 INFO L273 TraceCheckUtils]: 28: Hoare triple {80661#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80661#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:21,957 INFO L273 TraceCheckUtils]: 29: Hoare triple {80661#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80661#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:21,958 INFO L273 TraceCheckUtils]: 30: Hoare triple {80661#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {80662#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:21,958 INFO L273 TraceCheckUtils]: 31: Hoare triple {80662#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80662#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:21,959 INFO L273 TraceCheckUtils]: 32: Hoare triple {80662#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80662#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:21,959 INFO L273 TraceCheckUtils]: 33: Hoare triple {80662#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {80663#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:21,960 INFO L273 TraceCheckUtils]: 34: Hoare triple {80663#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80663#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:21,960 INFO L273 TraceCheckUtils]: 35: Hoare triple {80663#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80663#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:21,961 INFO L273 TraceCheckUtils]: 36: Hoare triple {80663#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {80664#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:21,962 INFO L273 TraceCheckUtils]: 37: Hoare triple {80664#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80664#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:21,962 INFO L273 TraceCheckUtils]: 38: Hoare triple {80664#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80664#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:21,963 INFO L273 TraceCheckUtils]: 39: Hoare triple {80664#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {80665#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:21,963 INFO L273 TraceCheckUtils]: 40: Hoare triple {80665#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80665#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:21,964 INFO L273 TraceCheckUtils]: 41: Hoare triple {80665#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80665#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:21,964 INFO L273 TraceCheckUtils]: 42: Hoare triple {80665#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {80666#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:21,965 INFO L273 TraceCheckUtils]: 43: Hoare triple {80666#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80666#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:21,965 INFO L273 TraceCheckUtils]: 44: Hoare triple {80666#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80666#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:21,966 INFO L273 TraceCheckUtils]: 45: Hoare triple {80666#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {80667#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:21,966 INFO L273 TraceCheckUtils]: 46: Hoare triple {80667#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80667#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:21,967 INFO L273 TraceCheckUtils]: 47: Hoare triple {80667#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80667#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:21,967 INFO L273 TraceCheckUtils]: 48: Hoare triple {80667#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {80668#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:21,968 INFO L273 TraceCheckUtils]: 49: Hoare triple {80668#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80668#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:21,968 INFO L273 TraceCheckUtils]: 50: Hoare triple {80668#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80668#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:21,969 INFO L273 TraceCheckUtils]: 51: Hoare triple {80668#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {80669#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:21,970 INFO L273 TraceCheckUtils]: 52: Hoare triple {80669#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80669#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:21,970 INFO L273 TraceCheckUtils]: 53: Hoare triple {80669#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80669#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:21,971 INFO L273 TraceCheckUtils]: 54: Hoare triple {80669#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {80670#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:21,971 INFO L273 TraceCheckUtils]: 55: Hoare triple {80670#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80670#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:21,972 INFO L273 TraceCheckUtils]: 56: Hoare triple {80670#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80670#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:21,972 INFO L273 TraceCheckUtils]: 57: Hoare triple {80670#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {80671#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:21,973 INFO L273 TraceCheckUtils]: 58: Hoare triple {80671#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80671#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:21,973 INFO L273 TraceCheckUtils]: 59: Hoare triple {80671#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80671#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:21,974 INFO L273 TraceCheckUtils]: 60: Hoare triple {80671#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {80672#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:21,974 INFO L273 TraceCheckUtils]: 61: Hoare triple {80672#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80672#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:21,975 INFO L273 TraceCheckUtils]: 62: Hoare triple {80672#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80672#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:21,975 INFO L273 TraceCheckUtils]: 63: Hoare triple {80672#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {80673#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:21,976 INFO L273 TraceCheckUtils]: 64: Hoare triple {80673#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80673#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:21,976 INFO L273 TraceCheckUtils]: 65: Hoare triple {80673#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80673#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:21,977 INFO L273 TraceCheckUtils]: 66: Hoare triple {80673#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {80674#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:21,978 INFO L273 TraceCheckUtils]: 67: Hoare triple {80674#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80674#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:21,978 INFO L273 TraceCheckUtils]: 68: Hoare triple {80674#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80674#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:21,979 INFO L273 TraceCheckUtils]: 69: Hoare triple {80674#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {80675#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:21,979 INFO L273 TraceCheckUtils]: 70: Hoare triple {80675#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80675#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:21,980 INFO L273 TraceCheckUtils]: 71: Hoare triple {80675#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80675#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:21,980 INFO L273 TraceCheckUtils]: 72: Hoare triple {80675#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {80676#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:21,981 INFO L273 TraceCheckUtils]: 73: Hoare triple {80676#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80676#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:21,981 INFO L273 TraceCheckUtils]: 74: Hoare triple {80676#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80676#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:21,982 INFO L273 TraceCheckUtils]: 75: Hoare triple {80676#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {80677#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:21,982 INFO L273 TraceCheckUtils]: 76: Hoare triple {80677#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80677#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:21,983 INFO L273 TraceCheckUtils]: 77: Hoare triple {80677#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80677#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:21,984 INFO L273 TraceCheckUtils]: 78: Hoare triple {80677#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {80678#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:21,984 INFO L273 TraceCheckUtils]: 79: Hoare triple {80678#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80678#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:21,984 INFO L273 TraceCheckUtils]: 80: Hoare triple {80678#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80678#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:21,985 INFO L273 TraceCheckUtils]: 81: Hoare triple {80678#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {80679#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:21,986 INFO L273 TraceCheckUtils]: 82: Hoare triple {80679#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80679#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:21,986 INFO L273 TraceCheckUtils]: 83: Hoare triple {80679#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80679#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:21,987 INFO L273 TraceCheckUtils]: 84: Hoare triple {80679#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {80680#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:21,987 INFO L273 TraceCheckUtils]: 85: Hoare triple {80680#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80680#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:21,988 INFO L273 TraceCheckUtils]: 86: Hoare triple {80680#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80680#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:21,988 INFO L273 TraceCheckUtils]: 87: Hoare triple {80680#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {80681#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:21,989 INFO L273 TraceCheckUtils]: 88: Hoare triple {80681#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80681#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:21,989 INFO L273 TraceCheckUtils]: 89: Hoare triple {80681#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80681#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:21,990 INFO L273 TraceCheckUtils]: 90: Hoare triple {80681#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {80682#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:21,990 INFO L273 TraceCheckUtils]: 91: Hoare triple {80682#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80682#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:21,991 INFO L273 TraceCheckUtils]: 92: Hoare triple {80682#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80682#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:21,992 INFO L273 TraceCheckUtils]: 93: Hoare triple {80682#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {80683#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:21,992 INFO L273 TraceCheckUtils]: 94: Hoare triple {80683#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80683#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:21,992 INFO L273 TraceCheckUtils]: 95: Hoare triple {80683#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80683#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:21,993 INFO L273 TraceCheckUtils]: 96: Hoare triple {80683#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {80684#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:21,994 INFO L273 TraceCheckUtils]: 97: Hoare triple {80684#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80684#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:21,994 INFO L273 TraceCheckUtils]: 98: Hoare triple {80684#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80684#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:21,995 INFO L273 TraceCheckUtils]: 99: Hoare triple {80684#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {80685#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:21,995 INFO L273 TraceCheckUtils]: 100: Hoare triple {80685#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80685#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:21,996 INFO L273 TraceCheckUtils]: 101: Hoare triple {80685#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80685#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:21,996 INFO L273 TraceCheckUtils]: 102: Hoare triple {80685#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {80686#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:21,997 INFO L273 TraceCheckUtils]: 103: Hoare triple {80686#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80686#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:21,997 INFO L273 TraceCheckUtils]: 104: Hoare triple {80686#(<= main_~i~0 33)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80686#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:21,998 INFO L273 TraceCheckUtils]: 105: Hoare triple {80686#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {80687#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:21,998 INFO L273 TraceCheckUtils]: 106: Hoare triple {80687#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80687#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:21,999 INFO L273 TraceCheckUtils]: 107: Hoare triple {80687#(<= main_~i~0 34)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80687#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:22,000 INFO L273 TraceCheckUtils]: 108: Hoare triple {80687#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {80688#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:22,000 INFO L273 TraceCheckUtils]: 109: Hoare triple {80688#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80688#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:22,000 INFO L273 TraceCheckUtils]: 110: Hoare triple {80688#(<= main_~i~0 35)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80688#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:22,001 INFO L273 TraceCheckUtils]: 111: Hoare triple {80688#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {80689#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:22,002 INFO L273 TraceCheckUtils]: 112: Hoare triple {80689#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80689#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:22,002 INFO L273 TraceCheckUtils]: 113: Hoare triple {80689#(<= main_~i~0 36)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80689#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:22,003 INFO L273 TraceCheckUtils]: 114: Hoare triple {80689#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {80690#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:22,003 INFO L273 TraceCheckUtils]: 115: Hoare triple {80690#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80690#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:22,004 INFO L273 TraceCheckUtils]: 116: Hoare triple {80690#(<= main_~i~0 37)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80690#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:22,004 INFO L273 TraceCheckUtils]: 117: Hoare triple {80690#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {80691#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:22,005 INFO L273 TraceCheckUtils]: 118: Hoare triple {80691#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80691#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:22,005 INFO L273 TraceCheckUtils]: 119: Hoare triple {80691#(<= main_~i~0 38)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80691#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:22,006 INFO L273 TraceCheckUtils]: 120: Hoare triple {80691#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {80692#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:22,006 INFO L273 TraceCheckUtils]: 121: Hoare triple {80692#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80692#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:22,007 INFO L273 TraceCheckUtils]: 122: Hoare triple {80692#(<= main_~i~0 39)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80692#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:22,008 INFO L273 TraceCheckUtils]: 123: Hoare triple {80692#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {80693#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:22,008 INFO L273 TraceCheckUtils]: 124: Hoare triple {80693#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80693#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:22,008 INFO L273 TraceCheckUtils]: 125: Hoare triple {80693#(<= main_~i~0 40)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80693#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:22,009 INFO L273 TraceCheckUtils]: 126: Hoare triple {80693#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {80694#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:22,010 INFO L273 TraceCheckUtils]: 127: Hoare triple {80694#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80694#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:22,010 INFO L273 TraceCheckUtils]: 128: Hoare triple {80694#(<= main_~i~0 41)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80694#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:22,011 INFO L273 TraceCheckUtils]: 129: Hoare triple {80694#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {80695#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:22,011 INFO L273 TraceCheckUtils]: 130: Hoare triple {80695#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80695#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:22,012 INFO L273 TraceCheckUtils]: 131: Hoare triple {80695#(<= main_~i~0 42)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80695#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:22,012 INFO L273 TraceCheckUtils]: 132: Hoare triple {80695#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {80696#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:22,013 INFO L273 TraceCheckUtils]: 133: Hoare triple {80696#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80696#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:22,013 INFO L273 TraceCheckUtils]: 134: Hoare triple {80696#(<= main_~i~0 43)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80696#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:22,014 INFO L273 TraceCheckUtils]: 135: Hoare triple {80696#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {80697#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:22,014 INFO L273 TraceCheckUtils]: 136: Hoare triple {80697#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80697#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:22,015 INFO L273 TraceCheckUtils]: 137: Hoare triple {80697#(<= main_~i~0 44)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80697#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:22,016 INFO L273 TraceCheckUtils]: 138: Hoare triple {80697#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {80698#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:22,016 INFO L273 TraceCheckUtils]: 139: Hoare triple {80698#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80698#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:22,017 INFO L273 TraceCheckUtils]: 140: Hoare triple {80698#(<= main_~i~0 45)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80698#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:22,017 INFO L273 TraceCheckUtils]: 141: Hoare triple {80698#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {80699#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:22,018 INFO L273 TraceCheckUtils]: 142: Hoare triple {80699#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80699#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:22,018 INFO L273 TraceCheckUtils]: 143: Hoare triple {80699#(<= main_~i~0 46)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80699#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:22,019 INFO L273 TraceCheckUtils]: 144: Hoare triple {80699#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {80700#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:22,019 INFO L273 TraceCheckUtils]: 145: Hoare triple {80700#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80700#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:22,020 INFO L273 TraceCheckUtils]: 146: Hoare triple {80700#(<= main_~i~0 47)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80700#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:22,020 INFO L273 TraceCheckUtils]: 147: Hoare triple {80700#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {80701#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:22,021 INFO L273 TraceCheckUtils]: 148: Hoare triple {80701#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80701#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:22,021 INFO L273 TraceCheckUtils]: 149: Hoare triple {80701#(<= main_~i~0 48)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80701#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:22,022 INFO L273 TraceCheckUtils]: 150: Hoare triple {80701#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {80702#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:22,022 INFO L273 TraceCheckUtils]: 151: Hoare triple {80702#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80702#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:22,023 INFO L273 TraceCheckUtils]: 152: Hoare triple {80702#(<= main_~i~0 49)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80702#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:22,024 INFO L273 TraceCheckUtils]: 153: Hoare triple {80702#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {80703#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:22,024 INFO L273 TraceCheckUtils]: 154: Hoare triple {80703#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80703#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:22,025 INFO L273 TraceCheckUtils]: 155: Hoare triple {80703#(<= main_~i~0 50)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80703#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:22,025 INFO L273 TraceCheckUtils]: 156: Hoare triple {80703#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {80704#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:22,026 INFO L273 TraceCheckUtils]: 157: Hoare triple {80704#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80704#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:22,026 INFO L273 TraceCheckUtils]: 158: Hoare triple {80704#(<= main_~i~0 51)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80704#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:22,027 INFO L273 TraceCheckUtils]: 159: Hoare triple {80704#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {80705#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:22,027 INFO L273 TraceCheckUtils]: 160: Hoare triple {80705#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80705#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:22,028 INFO L273 TraceCheckUtils]: 161: Hoare triple {80705#(<= main_~i~0 52)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80705#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:22,028 INFO L273 TraceCheckUtils]: 162: Hoare triple {80705#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {80706#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:22,029 INFO L273 TraceCheckUtils]: 163: Hoare triple {80706#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80706#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:22,029 INFO L273 TraceCheckUtils]: 164: Hoare triple {80706#(<= main_~i~0 53)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80706#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:22,030 INFO L273 TraceCheckUtils]: 165: Hoare triple {80706#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {80707#(<= main_~i~0 54)} is VALID [2018-11-23 11:54:22,031 INFO L273 TraceCheckUtils]: 166: Hoare triple {80707#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80707#(<= main_~i~0 54)} is VALID [2018-11-23 11:54:22,031 INFO L273 TraceCheckUtils]: 167: Hoare triple {80707#(<= main_~i~0 54)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80707#(<= main_~i~0 54)} is VALID [2018-11-23 11:54:22,032 INFO L273 TraceCheckUtils]: 168: Hoare triple {80707#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {80708#(<= main_~i~0 55)} is VALID [2018-11-23 11:54:22,032 INFO L273 TraceCheckUtils]: 169: Hoare triple {80708#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {80708#(<= main_~i~0 55)} is VALID [2018-11-23 11:54:22,033 INFO L273 TraceCheckUtils]: 170: Hoare triple {80708#(<= main_~i~0 55)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {80708#(<= main_~i~0 55)} is VALID [2018-11-23 11:54:22,033 INFO L273 TraceCheckUtils]: 171: Hoare triple {80708#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {80709#(<= main_~i~0 56)} is VALID [2018-11-23 11:54:22,034 INFO L273 TraceCheckUtils]: 172: Hoare triple {80709#(<= main_~i~0 56)} assume !(~i~0 < 100000); {80653#false} is VALID [2018-11-23 11:54:22,034 INFO L273 TraceCheckUtils]: 173: Hoare triple {80653#false} assume !(0 != ~swapped~0); {80653#false} is VALID [2018-11-23 11:54:22,034 INFO L273 TraceCheckUtils]: 174: Hoare triple {80653#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {80653#false} is VALID [2018-11-23 11:54:22,034 INFO L273 TraceCheckUtils]: 175: Hoare triple {80653#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {80653#false} is VALID [2018-11-23 11:54:22,035 INFO L273 TraceCheckUtils]: 176: Hoare triple {80653#false} assume !!(~y~0 < 100000);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); {80653#false} is VALID [2018-11-23 11:54:22,035 INFO L256 TraceCheckUtils]: 177: Hoare triple {80653#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {80653#false} is VALID [2018-11-23 11:54:22,035 INFO L273 TraceCheckUtils]: 178: Hoare triple {80653#false} ~cond := #in~cond; {80653#false} is VALID [2018-11-23 11:54:22,035 INFO L273 TraceCheckUtils]: 179: Hoare triple {80653#false} assume 0 == ~cond; {80653#false} is VALID [2018-11-23 11:54:22,035 INFO L273 TraceCheckUtils]: 180: Hoare triple {80653#false} assume !false; {80653#false} is VALID [2018-11-23 11:54:22,056 INFO L134 CoverageAnalysis]: Checked inductivity of 4511 backedges. 1 proven. 4510 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:22,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:22,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 59 [2018-11-23 11:54:22,075 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 181 [2018-11-23 11:54:22,075 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:22,075 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 59 states. [2018-11-23 11:54:22,244 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 185 edges. 185 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:22,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-11-23 11:54:22,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-11-23 11:54:22,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-11-23 11:54:22,245 INFO L87 Difference]: Start difference. First operand 351 states and 464 transitions. Second operand 59 states. [2018-11-23 11:54:23,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:23,470 INFO L93 Difference]: Finished difference Result 706 states and 938 transitions. [2018-11-23 11:54:23,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-11-23 11:54:23,470 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 181 [2018-11-23 11:54:23,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:23,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 11:54:23,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 273 transitions. [2018-11-23 11:54:23,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 11:54:23,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 273 transitions. [2018-11-23 11:54:23,473 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 58 states and 273 transitions. [2018-11-23 11:54:23,749 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 273 edges. 273 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:23,757 INFO L225 Difference]: With dead ends: 706 [2018-11-23 11:54:23,757 INFO L226 Difference]: Without dead ends: 361 [2018-11-23 11:54:23,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-11-23 11:54:23,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-11-23 11:54:23,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 357. [2018-11-23 11:54:23,892 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:23,892 INFO L82 GeneralOperation]: Start isEquivalent. First operand 361 states. Second operand 357 states. [2018-11-23 11:54:23,892 INFO L74 IsIncluded]: Start isIncluded. First operand 361 states. Second operand 357 states. [2018-11-23 11:54:23,892 INFO L87 Difference]: Start difference. First operand 361 states. Second operand 357 states. [2018-11-23 11:54:23,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:23,901 INFO L93 Difference]: Finished difference Result 361 states and 478 transitions. [2018-11-23 11:54:23,901 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 478 transitions. [2018-11-23 11:54:23,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:23,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:23,901 INFO L74 IsIncluded]: Start isIncluded. First operand 357 states. Second operand 361 states. [2018-11-23 11:54:23,901 INFO L87 Difference]: Start difference. First operand 357 states. Second operand 361 states. [2018-11-23 11:54:23,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:23,908 INFO L93 Difference]: Finished difference Result 361 states and 478 transitions. [2018-11-23 11:54:23,908 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 478 transitions. [2018-11-23 11:54:23,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:23,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:23,908 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:23,908 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:23,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2018-11-23 11:54:23,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 472 transitions. [2018-11-23 11:54:23,915 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 472 transitions. Word has length 181 [2018-11-23 11:54:23,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:23,915 INFO L480 AbstractCegarLoop]: Abstraction has 357 states and 472 transitions. [2018-11-23 11:54:23,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-11-23 11:54:23,915 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 472 transitions. [2018-11-23 11:54:23,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-23 11:54:23,916 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:23,916 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:23,916 INFO L423 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:23,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:23,916 INFO L82 PathProgramCache]: Analyzing trace with hash -292126127, now seen corresponding path program 56 times [2018-11-23 11:54:23,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:23,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:23,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:23,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:54:23,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:23,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:25,331 INFO L256 TraceCheckUtils]: 0: Hoare triple {83401#true} call ULTIMATE.init(); {83401#true} is VALID [2018-11-23 11:54:25,331 INFO L273 TraceCheckUtils]: 1: Hoare triple {83401#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {83401#true} is VALID [2018-11-23 11:54:25,332 INFO L273 TraceCheckUtils]: 2: Hoare triple {83401#true} assume true; {83401#true} is VALID [2018-11-23 11:54:25,332 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {83401#true} {83401#true} #79#return; {83401#true} is VALID [2018-11-23 11:54:25,332 INFO L256 TraceCheckUtils]: 4: Hoare triple {83401#true} call #t~ret8 := main(); {83401#true} is VALID [2018-11-23 11:54:25,332 INFO L273 TraceCheckUtils]: 5: Hoare triple {83401#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {83401#true} is VALID [2018-11-23 11:54:25,333 INFO L273 TraceCheckUtils]: 6: Hoare triple {83401#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {83403#(= main_~i~0 1)} is VALID [2018-11-23 11:54:25,333 INFO L273 TraceCheckUtils]: 7: Hoare triple {83403#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83403#(= main_~i~0 1)} is VALID [2018-11-23 11:54:25,334 INFO L273 TraceCheckUtils]: 8: Hoare triple {83403#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83403#(= main_~i~0 1)} is VALID [2018-11-23 11:54:25,334 INFO L273 TraceCheckUtils]: 9: Hoare triple {83403#(= main_~i~0 1)} ~i~0 := 1 + ~i~0; {83404#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:25,335 INFO L273 TraceCheckUtils]: 10: Hoare triple {83404#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83404#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:25,335 INFO L273 TraceCheckUtils]: 11: Hoare triple {83404#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83404#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:25,336 INFO L273 TraceCheckUtils]: 12: Hoare triple {83404#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {83405#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:25,336 INFO L273 TraceCheckUtils]: 13: Hoare triple {83405#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83405#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:25,337 INFO L273 TraceCheckUtils]: 14: Hoare triple {83405#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83405#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:25,338 INFO L273 TraceCheckUtils]: 15: Hoare triple {83405#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {83406#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:25,338 INFO L273 TraceCheckUtils]: 16: Hoare triple {83406#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83406#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:25,339 INFO L273 TraceCheckUtils]: 17: Hoare triple {83406#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83406#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:25,339 INFO L273 TraceCheckUtils]: 18: Hoare triple {83406#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {83407#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:25,340 INFO L273 TraceCheckUtils]: 19: Hoare triple {83407#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83407#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:25,340 INFO L273 TraceCheckUtils]: 20: Hoare triple {83407#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83407#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:25,341 INFO L273 TraceCheckUtils]: 21: Hoare triple {83407#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {83408#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:25,341 INFO L273 TraceCheckUtils]: 22: Hoare triple {83408#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83408#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:25,342 INFO L273 TraceCheckUtils]: 23: Hoare triple {83408#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83408#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:25,342 INFO L273 TraceCheckUtils]: 24: Hoare triple {83408#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {83409#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:25,343 INFO L273 TraceCheckUtils]: 25: Hoare triple {83409#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83409#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:25,343 INFO L273 TraceCheckUtils]: 26: Hoare triple {83409#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83409#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:25,344 INFO L273 TraceCheckUtils]: 27: Hoare triple {83409#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {83410#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:25,345 INFO L273 TraceCheckUtils]: 28: Hoare triple {83410#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83410#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:25,345 INFO L273 TraceCheckUtils]: 29: Hoare triple {83410#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83410#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:25,346 INFO L273 TraceCheckUtils]: 30: Hoare triple {83410#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {83411#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:25,346 INFO L273 TraceCheckUtils]: 31: Hoare triple {83411#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83411#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:25,347 INFO L273 TraceCheckUtils]: 32: Hoare triple {83411#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83411#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:25,347 INFO L273 TraceCheckUtils]: 33: Hoare triple {83411#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {83412#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:25,348 INFO L273 TraceCheckUtils]: 34: Hoare triple {83412#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83412#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:25,348 INFO L273 TraceCheckUtils]: 35: Hoare triple {83412#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83412#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:25,349 INFO L273 TraceCheckUtils]: 36: Hoare triple {83412#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {83413#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:25,349 INFO L273 TraceCheckUtils]: 37: Hoare triple {83413#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83413#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:25,350 INFO L273 TraceCheckUtils]: 38: Hoare triple {83413#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83413#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:25,351 INFO L273 TraceCheckUtils]: 39: Hoare triple {83413#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {83414#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:25,351 INFO L273 TraceCheckUtils]: 40: Hoare triple {83414#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83414#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:25,352 INFO L273 TraceCheckUtils]: 41: Hoare triple {83414#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83414#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:25,352 INFO L273 TraceCheckUtils]: 42: Hoare triple {83414#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {83415#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:25,353 INFO L273 TraceCheckUtils]: 43: Hoare triple {83415#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83415#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:25,353 INFO L273 TraceCheckUtils]: 44: Hoare triple {83415#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83415#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:25,354 INFO L273 TraceCheckUtils]: 45: Hoare triple {83415#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {83416#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:25,354 INFO L273 TraceCheckUtils]: 46: Hoare triple {83416#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83416#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:25,355 INFO L273 TraceCheckUtils]: 47: Hoare triple {83416#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83416#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:25,355 INFO L273 TraceCheckUtils]: 48: Hoare triple {83416#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {83417#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:25,356 INFO L273 TraceCheckUtils]: 49: Hoare triple {83417#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83417#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:25,356 INFO L273 TraceCheckUtils]: 50: Hoare triple {83417#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83417#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:25,357 INFO L273 TraceCheckUtils]: 51: Hoare triple {83417#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {83418#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:25,358 INFO L273 TraceCheckUtils]: 52: Hoare triple {83418#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83418#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:25,358 INFO L273 TraceCheckUtils]: 53: Hoare triple {83418#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83418#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:25,359 INFO L273 TraceCheckUtils]: 54: Hoare triple {83418#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {83419#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:25,359 INFO L273 TraceCheckUtils]: 55: Hoare triple {83419#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83419#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:25,360 INFO L273 TraceCheckUtils]: 56: Hoare triple {83419#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83419#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:25,360 INFO L273 TraceCheckUtils]: 57: Hoare triple {83419#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {83420#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:25,361 INFO L273 TraceCheckUtils]: 58: Hoare triple {83420#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83420#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:25,361 INFO L273 TraceCheckUtils]: 59: Hoare triple {83420#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83420#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:25,362 INFO L273 TraceCheckUtils]: 60: Hoare triple {83420#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {83421#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:25,362 INFO L273 TraceCheckUtils]: 61: Hoare triple {83421#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83421#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:25,363 INFO L273 TraceCheckUtils]: 62: Hoare triple {83421#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83421#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:25,363 INFO L273 TraceCheckUtils]: 63: Hoare triple {83421#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {83422#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:25,364 INFO L273 TraceCheckUtils]: 64: Hoare triple {83422#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83422#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:25,364 INFO L273 TraceCheckUtils]: 65: Hoare triple {83422#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83422#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:25,365 INFO L273 TraceCheckUtils]: 66: Hoare triple {83422#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {83423#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:25,366 INFO L273 TraceCheckUtils]: 67: Hoare triple {83423#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83423#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:25,366 INFO L273 TraceCheckUtils]: 68: Hoare triple {83423#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83423#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:25,367 INFO L273 TraceCheckUtils]: 69: Hoare triple {83423#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {83424#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:25,367 INFO L273 TraceCheckUtils]: 70: Hoare triple {83424#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83424#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:25,368 INFO L273 TraceCheckUtils]: 71: Hoare triple {83424#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83424#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:25,368 INFO L273 TraceCheckUtils]: 72: Hoare triple {83424#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {83425#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:25,369 INFO L273 TraceCheckUtils]: 73: Hoare triple {83425#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83425#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:25,369 INFO L273 TraceCheckUtils]: 74: Hoare triple {83425#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83425#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:25,370 INFO L273 TraceCheckUtils]: 75: Hoare triple {83425#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {83426#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:25,370 INFO L273 TraceCheckUtils]: 76: Hoare triple {83426#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83426#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:25,371 INFO L273 TraceCheckUtils]: 77: Hoare triple {83426#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83426#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:25,372 INFO L273 TraceCheckUtils]: 78: Hoare triple {83426#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {83427#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:25,372 INFO L273 TraceCheckUtils]: 79: Hoare triple {83427#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83427#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:25,372 INFO L273 TraceCheckUtils]: 80: Hoare triple {83427#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83427#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:25,373 INFO L273 TraceCheckUtils]: 81: Hoare triple {83427#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {83428#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:25,374 INFO L273 TraceCheckUtils]: 82: Hoare triple {83428#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83428#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:25,374 INFO L273 TraceCheckUtils]: 83: Hoare triple {83428#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83428#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:25,375 INFO L273 TraceCheckUtils]: 84: Hoare triple {83428#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {83429#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:25,375 INFO L273 TraceCheckUtils]: 85: Hoare triple {83429#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83429#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:25,376 INFO L273 TraceCheckUtils]: 86: Hoare triple {83429#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83429#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:25,377 INFO L273 TraceCheckUtils]: 87: Hoare triple {83429#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {83430#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:25,377 INFO L273 TraceCheckUtils]: 88: Hoare triple {83430#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83430#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:25,378 INFO L273 TraceCheckUtils]: 89: Hoare triple {83430#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83430#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:25,378 INFO L273 TraceCheckUtils]: 90: Hoare triple {83430#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {83431#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:25,379 INFO L273 TraceCheckUtils]: 91: Hoare triple {83431#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83431#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:25,379 INFO L273 TraceCheckUtils]: 92: Hoare triple {83431#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83431#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:25,380 INFO L273 TraceCheckUtils]: 93: Hoare triple {83431#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {83432#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:25,380 INFO L273 TraceCheckUtils]: 94: Hoare triple {83432#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83432#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:25,381 INFO L273 TraceCheckUtils]: 95: Hoare triple {83432#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83432#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:25,381 INFO L273 TraceCheckUtils]: 96: Hoare triple {83432#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {83433#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:25,382 INFO L273 TraceCheckUtils]: 97: Hoare triple {83433#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83433#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:25,382 INFO L273 TraceCheckUtils]: 98: Hoare triple {83433#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83433#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:25,383 INFO L273 TraceCheckUtils]: 99: Hoare triple {83433#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {83434#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:25,384 INFO L273 TraceCheckUtils]: 100: Hoare triple {83434#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83434#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:25,384 INFO L273 TraceCheckUtils]: 101: Hoare triple {83434#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83434#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:25,385 INFO L273 TraceCheckUtils]: 102: Hoare triple {83434#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {83435#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:25,385 INFO L273 TraceCheckUtils]: 103: Hoare triple {83435#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83435#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:25,386 INFO L273 TraceCheckUtils]: 104: Hoare triple {83435#(<= main_~i~0 33)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83435#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:25,386 INFO L273 TraceCheckUtils]: 105: Hoare triple {83435#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {83436#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:25,387 INFO L273 TraceCheckUtils]: 106: Hoare triple {83436#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83436#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:25,387 INFO L273 TraceCheckUtils]: 107: Hoare triple {83436#(<= main_~i~0 34)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83436#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:25,388 INFO L273 TraceCheckUtils]: 108: Hoare triple {83436#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {83437#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:25,388 INFO L273 TraceCheckUtils]: 109: Hoare triple {83437#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83437#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:25,389 INFO L273 TraceCheckUtils]: 110: Hoare triple {83437#(<= main_~i~0 35)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83437#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:25,390 INFO L273 TraceCheckUtils]: 111: Hoare triple {83437#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {83438#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:25,390 INFO L273 TraceCheckUtils]: 112: Hoare triple {83438#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83438#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:25,390 INFO L273 TraceCheckUtils]: 113: Hoare triple {83438#(<= main_~i~0 36)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83438#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:25,391 INFO L273 TraceCheckUtils]: 114: Hoare triple {83438#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {83439#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:25,392 INFO L273 TraceCheckUtils]: 115: Hoare triple {83439#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83439#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:25,392 INFO L273 TraceCheckUtils]: 116: Hoare triple {83439#(<= main_~i~0 37)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83439#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:25,393 INFO L273 TraceCheckUtils]: 117: Hoare triple {83439#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {83440#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:25,393 INFO L273 TraceCheckUtils]: 118: Hoare triple {83440#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83440#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:25,394 INFO L273 TraceCheckUtils]: 119: Hoare triple {83440#(<= main_~i~0 38)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83440#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:25,394 INFO L273 TraceCheckUtils]: 120: Hoare triple {83440#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {83441#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:25,395 INFO L273 TraceCheckUtils]: 121: Hoare triple {83441#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83441#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:25,395 INFO L273 TraceCheckUtils]: 122: Hoare triple {83441#(<= main_~i~0 39)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83441#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:25,396 INFO L273 TraceCheckUtils]: 123: Hoare triple {83441#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {83442#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:25,396 INFO L273 TraceCheckUtils]: 124: Hoare triple {83442#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83442#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:25,397 INFO L273 TraceCheckUtils]: 125: Hoare triple {83442#(<= main_~i~0 40)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83442#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:25,398 INFO L273 TraceCheckUtils]: 126: Hoare triple {83442#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {83443#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:25,398 INFO L273 TraceCheckUtils]: 127: Hoare triple {83443#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83443#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:25,399 INFO L273 TraceCheckUtils]: 128: Hoare triple {83443#(<= main_~i~0 41)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83443#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:25,399 INFO L273 TraceCheckUtils]: 129: Hoare triple {83443#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {83444#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:25,400 INFO L273 TraceCheckUtils]: 130: Hoare triple {83444#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83444#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:25,400 INFO L273 TraceCheckUtils]: 131: Hoare triple {83444#(<= main_~i~0 42)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83444#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:25,401 INFO L273 TraceCheckUtils]: 132: Hoare triple {83444#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {83445#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:25,401 INFO L273 TraceCheckUtils]: 133: Hoare triple {83445#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83445#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:25,402 INFO L273 TraceCheckUtils]: 134: Hoare triple {83445#(<= main_~i~0 43)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83445#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:25,403 INFO L273 TraceCheckUtils]: 135: Hoare triple {83445#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {83446#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:25,403 INFO L273 TraceCheckUtils]: 136: Hoare triple {83446#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83446#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:25,404 INFO L273 TraceCheckUtils]: 137: Hoare triple {83446#(<= main_~i~0 44)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83446#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:25,404 INFO L273 TraceCheckUtils]: 138: Hoare triple {83446#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {83447#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:25,405 INFO L273 TraceCheckUtils]: 139: Hoare triple {83447#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83447#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:25,405 INFO L273 TraceCheckUtils]: 140: Hoare triple {83447#(<= main_~i~0 45)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83447#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:25,406 INFO L273 TraceCheckUtils]: 141: Hoare triple {83447#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {83448#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:25,406 INFO L273 TraceCheckUtils]: 142: Hoare triple {83448#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83448#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:25,407 INFO L273 TraceCheckUtils]: 143: Hoare triple {83448#(<= main_~i~0 46)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83448#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:25,407 INFO L273 TraceCheckUtils]: 144: Hoare triple {83448#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {83449#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:25,408 INFO L273 TraceCheckUtils]: 145: Hoare triple {83449#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83449#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:25,408 INFO L273 TraceCheckUtils]: 146: Hoare triple {83449#(<= main_~i~0 47)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83449#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:25,409 INFO L273 TraceCheckUtils]: 147: Hoare triple {83449#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {83450#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:25,410 INFO L273 TraceCheckUtils]: 148: Hoare triple {83450#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83450#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:25,410 INFO L273 TraceCheckUtils]: 149: Hoare triple {83450#(<= main_~i~0 48)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83450#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:25,411 INFO L273 TraceCheckUtils]: 150: Hoare triple {83450#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {83451#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:25,411 INFO L273 TraceCheckUtils]: 151: Hoare triple {83451#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83451#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:25,412 INFO L273 TraceCheckUtils]: 152: Hoare triple {83451#(<= main_~i~0 49)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83451#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:25,412 INFO L273 TraceCheckUtils]: 153: Hoare triple {83451#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {83452#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:25,413 INFO L273 TraceCheckUtils]: 154: Hoare triple {83452#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83452#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:25,413 INFO L273 TraceCheckUtils]: 155: Hoare triple {83452#(<= main_~i~0 50)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83452#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:25,414 INFO L273 TraceCheckUtils]: 156: Hoare triple {83452#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {83453#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:25,415 INFO L273 TraceCheckUtils]: 157: Hoare triple {83453#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83453#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:25,415 INFO L273 TraceCheckUtils]: 158: Hoare triple {83453#(<= main_~i~0 51)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83453#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:25,416 INFO L273 TraceCheckUtils]: 159: Hoare triple {83453#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {83454#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:25,416 INFO L273 TraceCheckUtils]: 160: Hoare triple {83454#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83454#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:25,417 INFO L273 TraceCheckUtils]: 161: Hoare triple {83454#(<= main_~i~0 52)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83454#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:25,417 INFO L273 TraceCheckUtils]: 162: Hoare triple {83454#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {83455#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:25,418 INFO L273 TraceCheckUtils]: 163: Hoare triple {83455#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83455#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:25,418 INFO L273 TraceCheckUtils]: 164: Hoare triple {83455#(<= main_~i~0 53)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83455#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:25,419 INFO L273 TraceCheckUtils]: 165: Hoare triple {83455#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {83456#(<= main_~i~0 54)} is VALID [2018-11-23 11:54:25,419 INFO L273 TraceCheckUtils]: 166: Hoare triple {83456#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83456#(<= main_~i~0 54)} is VALID [2018-11-23 11:54:25,420 INFO L273 TraceCheckUtils]: 167: Hoare triple {83456#(<= main_~i~0 54)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83456#(<= main_~i~0 54)} is VALID [2018-11-23 11:54:25,421 INFO L273 TraceCheckUtils]: 168: Hoare triple {83456#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {83457#(<= main_~i~0 55)} is VALID [2018-11-23 11:54:25,421 INFO L273 TraceCheckUtils]: 169: Hoare triple {83457#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83457#(<= main_~i~0 55)} is VALID [2018-11-23 11:54:25,422 INFO L273 TraceCheckUtils]: 170: Hoare triple {83457#(<= main_~i~0 55)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83457#(<= main_~i~0 55)} is VALID [2018-11-23 11:54:25,422 INFO L273 TraceCheckUtils]: 171: Hoare triple {83457#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {83458#(<= main_~i~0 56)} is VALID [2018-11-23 11:54:25,423 INFO L273 TraceCheckUtils]: 172: Hoare triple {83458#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83458#(<= main_~i~0 56)} is VALID [2018-11-23 11:54:25,423 INFO L273 TraceCheckUtils]: 173: Hoare triple {83458#(<= main_~i~0 56)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83458#(<= main_~i~0 56)} is VALID [2018-11-23 11:54:25,424 INFO L273 TraceCheckUtils]: 174: Hoare triple {83458#(<= main_~i~0 56)} ~i~0 := 1 + ~i~0; {83459#(<= main_~i~0 57)} is VALID [2018-11-23 11:54:25,424 INFO L273 TraceCheckUtils]: 175: Hoare triple {83459#(<= main_~i~0 57)} assume !(~i~0 < 100000); {83402#false} is VALID [2018-11-23 11:54:25,425 INFO L273 TraceCheckUtils]: 176: Hoare triple {83402#false} assume !(0 != ~swapped~0); {83402#false} is VALID [2018-11-23 11:54:25,425 INFO L273 TraceCheckUtils]: 177: Hoare triple {83402#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {83402#false} is VALID [2018-11-23 11:54:25,425 INFO L273 TraceCheckUtils]: 178: Hoare triple {83402#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {83402#false} is VALID [2018-11-23 11:54:25,425 INFO L273 TraceCheckUtils]: 179: Hoare triple {83402#false} assume !!(~y~0 < 100000);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); {83402#false} is VALID [2018-11-23 11:54:25,425 INFO L256 TraceCheckUtils]: 180: Hoare triple {83402#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {83402#false} is VALID [2018-11-23 11:54:25,425 INFO L273 TraceCheckUtils]: 181: Hoare triple {83402#false} ~cond := #in~cond; {83402#false} is VALID [2018-11-23 11:54:25,426 INFO L273 TraceCheckUtils]: 182: Hoare triple {83402#false} assume 0 == ~cond; {83402#false} is VALID [2018-11-23 11:54:25,426 INFO L273 TraceCheckUtils]: 183: Hoare triple {83402#false} assume !false; {83402#false} is VALID [2018-11-23 11:54:25,447 INFO L134 CoverageAnalysis]: Checked inductivity of 4677 backedges. 1 proven. 4676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:25,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:25,447 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:54:25,456 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:54:25,539 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:54:25,539 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:25,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:25,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:26,027 INFO L256 TraceCheckUtils]: 0: Hoare triple {83401#true} call ULTIMATE.init(); {83401#true} is VALID [2018-11-23 11:54:26,027 INFO L273 TraceCheckUtils]: 1: Hoare triple {83401#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {83401#true} is VALID [2018-11-23 11:54:26,028 INFO L273 TraceCheckUtils]: 2: Hoare triple {83401#true} assume true; {83401#true} is VALID [2018-11-23 11:54:26,028 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {83401#true} {83401#true} #79#return; {83401#true} is VALID [2018-11-23 11:54:26,028 INFO L256 TraceCheckUtils]: 4: Hoare triple {83401#true} call #t~ret8 := main(); {83401#true} is VALID [2018-11-23 11:54:26,028 INFO L273 TraceCheckUtils]: 5: Hoare triple {83401#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {83401#true} is VALID [2018-11-23 11:54:26,029 INFO L273 TraceCheckUtils]: 6: Hoare triple {83401#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {83481#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:26,029 INFO L273 TraceCheckUtils]: 7: Hoare triple {83481#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83481#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:26,030 INFO L273 TraceCheckUtils]: 8: Hoare triple {83481#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83481#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:26,030 INFO L273 TraceCheckUtils]: 9: Hoare triple {83481#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {83404#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:26,031 INFO L273 TraceCheckUtils]: 10: Hoare triple {83404#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83404#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:26,031 INFO L273 TraceCheckUtils]: 11: Hoare triple {83404#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83404#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:26,032 INFO L273 TraceCheckUtils]: 12: Hoare triple {83404#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {83405#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:26,033 INFO L273 TraceCheckUtils]: 13: Hoare triple {83405#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83405#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:26,033 INFO L273 TraceCheckUtils]: 14: Hoare triple {83405#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83405#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:26,034 INFO L273 TraceCheckUtils]: 15: Hoare triple {83405#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {83406#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:26,034 INFO L273 TraceCheckUtils]: 16: Hoare triple {83406#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83406#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:26,035 INFO L273 TraceCheckUtils]: 17: Hoare triple {83406#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83406#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:26,035 INFO L273 TraceCheckUtils]: 18: Hoare triple {83406#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {83407#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:26,036 INFO L273 TraceCheckUtils]: 19: Hoare triple {83407#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83407#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:26,036 INFO L273 TraceCheckUtils]: 20: Hoare triple {83407#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83407#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:26,037 INFO L273 TraceCheckUtils]: 21: Hoare triple {83407#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {83408#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:26,037 INFO L273 TraceCheckUtils]: 22: Hoare triple {83408#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83408#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:26,038 INFO L273 TraceCheckUtils]: 23: Hoare triple {83408#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83408#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:26,038 INFO L273 TraceCheckUtils]: 24: Hoare triple {83408#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {83409#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:26,039 INFO L273 TraceCheckUtils]: 25: Hoare triple {83409#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83409#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:26,039 INFO L273 TraceCheckUtils]: 26: Hoare triple {83409#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83409#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:26,040 INFO L273 TraceCheckUtils]: 27: Hoare triple {83409#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {83410#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:26,041 INFO L273 TraceCheckUtils]: 28: Hoare triple {83410#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83410#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:26,041 INFO L273 TraceCheckUtils]: 29: Hoare triple {83410#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83410#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:26,042 INFO L273 TraceCheckUtils]: 30: Hoare triple {83410#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {83411#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:26,042 INFO L273 TraceCheckUtils]: 31: Hoare triple {83411#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83411#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:26,043 INFO L273 TraceCheckUtils]: 32: Hoare triple {83411#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83411#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:26,043 INFO L273 TraceCheckUtils]: 33: Hoare triple {83411#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {83412#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:26,044 INFO L273 TraceCheckUtils]: 34: Hoare triple {83412#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83412#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:26,044 INFO L273 TraceCheckUtils]: 35: Hoare triple {83412#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83412#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:26,045 INFO L273 TraceCheckUtils]: 36: Hoare triple {83412#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {83413#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:26,045 INFO L273 TraceCheckUtils]: 37: Hoare triple {83413#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83413#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:26,046 INFO L273 TraceCheckUtils]: 38: Hoare triple {83413#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83413#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:26,047 INFO L273 TraceCheckUtils]: 39: Hoare triple {83413#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {83414#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:26,047 INFO L273 TraceCheckUtils]: 40: Hoare triple {83414#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83414#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:26,047 INFO L273 TraceCheckUtils]: 41: Hoare triple {83414#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83414#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:26,048 INFO L273 TraceCheckUtils]: 42: Hoare triple {83414#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {83415#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:26,049 INFO L273 TraceCheckUtils]: 43: Hoare triple {83415#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83415#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:26,049 INFO L273 TraceCheckUtils]: 44: Hoare triple {83415#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83415#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:26,050 INFO L273 TraceCheckUtils]: 45: Hoare triple {83415#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {83416#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:26,050 INFO L273 TraceCheckUtils]: 46: Hoare triple {83416#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83416#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:26,051 INFO L273 TraceCheckUtils]: 47: Hoare triple {83416#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83416#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:26,051 INFO L273 TraceCheckUtils]: 48: Hoare triple {83416#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {83417#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:26,052 INFO L273 TraceCheckUtils]: 49: Hoare triple {83417#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83417#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:26,052 INFO L273 TraceCheckUtils]: 50: Hoare triple {83417#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83417#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:26,053 INFO L273 TraceCheckUtils]: 51: Hoare triple {83417#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {83418#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:26,053 INFO L273 TraceCheckUtils]: 52: Hoare triple {83418#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83418#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:26,054 INFO L273 TraceCheckUtils]: 53: Hoare triple {83418#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83418#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:26,055 INFO L273 TraceCheckUtils]: 54: Hoare triple {83418#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {83419#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:26,055 INFO L273 TraceCheckUtils]: 55: Hoare triple {83419#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83419#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:26,055 INFO L273 TraceCheckUtils]: 56: Hoare triple {83419#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83419#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:26,056 INFO L273 TraceCheckUtils]: 57: Hoare triple {83419#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {83420#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:26,057 INFO L273 TraceCheckUtils]: 58: Hoare triple {83420#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83420#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:26,057 INFO L273 TraceCheckUtils]: 59: Hoare triple {83420#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83420#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:26,058 INFO L273 TraceCheckUtils]: 60: Hoare triple {83420#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {83421#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:26,058 INFO L273 TraceCheckUtils]: 61: Hoare triple {83421#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83421#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:26,059 INFO L273 TraceCheckUtils]: 62: Hoare triple {83421#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83421#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:26,059 INFO L273 TraceCheckUtils]: 63: Hoare triple {83421#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {83422#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:26,060 INFO L273 TraceCheckUtils]: 64: Hoare triple {83422#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83422#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:26,060 INFO L273 TraceCheckUtils]: 65: Hoare triple {83422#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83422#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:26,061 INFO L273 TraceCheckUtils]: 66: Hoare triple {83422#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {83423#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:26,061 INFO L273 TraceCheckUtils]: 67: Hoare triple {83423#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83423#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:26,062 INFO L273 TraceCheckUtils]: 68: Hoare triple {83423#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83423#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:26,063 INFO L273 TraceCheckUtils]: 69: Hoare triple {83423#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {83424#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:26,063 INFO L273 TraceCheckUtils]: 70: Hoare triple {83424#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83424#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:26,063 INFO L273 TraceCheckUtils]: 71: Hoare triple {83424#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83424#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:26,064 INFO L273 TraceCheckUtils]: 72: Hoare triple {83424#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {83425#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:26,065 INFO L273 TraceCheckUtils]: 73: Hoare triple {83425#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83425#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:26,065 INFO L273 TraceCheckUtils]: 74: Hoare triple {83425#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83425#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:26,066 INFO L273 TraceCheckUtils]: 75: Hoare triple {83425#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {83426#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:26,066 INFO L273 TraceCheckUtils]: 76: Hoare triple {83426#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83426#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:26,067 INFO L273 TraceCheckUtils]: 77: Hoare triple {83426#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83426#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:26,067 INFO L273 TraceCheckUtils]: 78: Hoare triple {83426#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {83427#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:26,068 INFO L273 TraceCheckUtils]: 79: Hoare triple {83427#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83427#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:26,068 INFO L273 TraceCheckUtils]: 80: Hoare triple {83427#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83427#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:26,069 INFO L273 TraceCheckUtils]: 81: Hoare triple {83427#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {83428#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:26,070 INFO L273 TraceCheckUtils]: 82: Hoare triple {83428#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83428#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:26,070 INFO L273 TraceCheckUtils]: 83: Hoare triple {83428#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83428#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:26,071 INFO L273 TraceCheckUtils]: 84: Hoare triple {83428#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {83429#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:26,071 INFO L273 TraceCheckUtils]: 85: Hoare triple {83429#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83429#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:26,072 INFO L273 TraceCheckUtils]: 86: Hoare triple {83429#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83429#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:26,073 INFO L273 TraceCheckUtils]: 87: Hoare triple {83429#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {83430#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:26,073 INFO L273 TraceCheckUtils]: 88: Hoare triple {83430#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83430#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:26,074 INFO L273 TraceCheckUtils]: 89: Hoare triple {83430#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83430#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:26,074 INFO L273 TraceCheckUtils]: 90: Hoare triple {83430#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {83431#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:26,075 INFO L273 TraceCheckUtils]: 91: Hoare triple {83431#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83431#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:26,075 INFO L273 TraceCheckUtils]: 92: Hoare triple {83431#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83431#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:26,076 INFO L273 TraceCheckUtils]: 93: Hoare triple {83431#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {83432#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:26,076 INFO L273 TraceCheckUtils]: 94: Hoare triple {83432#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83432#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:26,077 INFO L273 TraceCheckUtils]: 95: Hoare triple {83432#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83432#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:26,078 INFO L273 TraceCheckUtils]: 96: Hoare triple {83432#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {83433#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:26,078 INFO L273 TraceCheckUtils]: 97: Hoare triple {83433#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83433#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:26,079 INFO L273 TraceCheckUtils]: 98: Hoare triple {83433#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83433#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:26,079 INFO L273 TraceCheckUtils]: 99: Hoare triple {83433#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {83434#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:26,080 INFO L273 TraceCheckUtils]: 100: Hoare triple {83434#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83434#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:26,080 INFO L273 TraceCheckUtils]: 101: Hoare triple {83434#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83434#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:26,081 INFO L273 TraceCheckUtils]: 102: Hoare triple {83434#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {83435#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:26,081 INFO L273 TraceCheckUtils]: 103: Hoare triple {83435#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83435#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:26,082 INFO L273 TraceCheckUtils]: 104: Hoare triple {83435#(<= main_~i~0 33)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83435#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:26,082 INFO L273 TraceCheckUtils]: 105: Hoare triple {83435#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {83436#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:26,083 INFO L273 TraceCheckUtils]: 106: Hoare triple {83436#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83436#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:26,083 INFO L273 TraceCheckUtils]: 107: Hoare triple {83436#(<= main_~i~0 34)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83436#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:26,084 INFO L273 TraceCheckUtils]: 108: Hoare triple {83436#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {83437#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:26,085 INFO L273 TraceCheckUtils]: 109: Hoare triple {83437#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83437#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:26,085 INFO L273 TraceCheckUtils]: 110: Hoare triple {83437#(<= main_~i~0 35)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83437#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:26,086 INFO L273 TraceCheckUtils]: 111: Hoare triple {83437#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {83438#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:26,086 INFO L273 TraceCheckUtils]: 112: Hoare triple {83438#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83438#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:26,087 INFO L273 TraceCheckUtils]: 113: Hoare triple {83438#(<= main_~i~0 36)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83438#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:26,087 INFO L273 TraceCheckUtils]: 114: Hoare triple {83438#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {83439#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:26,088 INFO L273 TraceCheckUtils]: 115: Hoare triple {83439#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83439#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:26,088 INFO L273 TraceCheckUtils]: 116: Hoare triple {83439#(<= main_~i~0 37)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83439#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:26,089 INFO L273 TraceCheckUtils]: 117: Hoare triple {83439#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {83440#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:26,089 INFO L273 TraceCheckUtils]: 118: Hoare triple {83440#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83440#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:26,090 INFO L273 TraceCheckUtils]: 119: Hoare triple {83440#(<= main_~i~0 38)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83440#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:26,091 INFO L273 TraceCheckUtils]: 120: Hoare triple {83440#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {83441#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:26,091 INFO L273 TraceCheckUtils]: 121: Hoare triple {83441#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83441#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:26,092 INFO L273 TraceCheckUtils]: 122: Hoare triple {83441#(<= main_~i~0 39)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83441#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:26,092 INFO L273 TraceCheckUtils]: 123: Hoare triple {83441#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {83442#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:26,093 INFO L273 TraceCheckUtils]: 124: Hoare triple {83442#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83442#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:26,093 INFO L273 TraceCheckUtils]: 125: Hoare triple {83442#(<= main_~i~0 40)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83442#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:26,094 INFO L273 TraceCheckUtils]: 126: Hoare triple {83442#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {83443#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:26,094 INFO L273 TraceCheckUtils]: 127: Hoare triple {83443#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83443#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:26,095 INFO L273 TraceCheckUtils]: 128: Hoare triple {83443#(<= main_~i~0 41)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83443#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:26,095 INFO L273 TraceCheckUtils]: 129: Hoare triple {83443#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {83444#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:26,096 INFO L273 TraceCheckUtils]: 130: Hoare triple {83444#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83444#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:26,096 INFO L273 TraceCheckUtils]: 131: Hoare triple {83444#(<= main_~i~0 42)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83444#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:26,097 INFO L273 TraceCheckUtils]: 132: Hoare triple {83444#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {83445#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:26,098 INFO L273 TraceCheckUtils]: 133: Hoare triple {83445#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83445#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:26,098 INFO L273 TraceCheckUtils]: 134: Hoare triple {83445#(<= main_~i~0 43)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83445#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:26,099 INFO L273 TraceCheckUtils]: 135: Hoare triple {83445#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {83446#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:26,099 INFO L273 TraceCheckUtils]: 136: Hoare triple {83446#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83446#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:26,100 INFO L273 TraceCheckUtils]: 137: Hoare triple {83446#(<= main_~i~0 44)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83446#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:26,100 INFO L273 TraceCheckUtils]: 138: Hoare triple {83446#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {83447#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:26,101 INFO L273 TraceCheckUtils]: 139: Hoare triple {83447#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83447#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:26,101 INFO L273 TraceCheckUtils]: 140: Hoare triple {83447#(<= main_~i~0 45)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83447#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:26,102 INFO L273 TraceCheckUtils]: 141: Hoare triple {83447#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {83448#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:26,102 INFO L273 TraceCheckUtils]: 142: Hoare triple {83448#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83448#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:26,103 INFO L273 TraceCheckUtils]: 143: Hoare triple {83448#(<= main_~i~0 46)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83448#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:26,104 INFO L273 TraceCheckUtils]: 144: Hoare triple {83448#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {83449#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:26,104 INFO L273 TraceCheckUtils]: 145: Hoare triple {83449#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83449#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:26,104 INFO L273 TraceCheckUtils]: 146: Hoare triple {83449#(<= main_~i~0 47)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83449#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:26,105 INFO L273 TraceCheckUtils]: 147: Hoare triple {83449#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {83450#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:26,106 INFO L273 TraceCheckUtils]: 148: Hoare triple {83450#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83450#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:26,106 INFO L273 TraceCheckUtils]: 149: Hoare triple {83450#(<= main_~i~0 48)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83450#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:26,107 INFO L273 TraceCheckUtils]: 150: Hoare triple {83450#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {83451#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:26,107 INFO L273 TraceCheckUtils]: 151: Hoare triple {83451#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83451#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:26,108 INFO L273 TraceCheckUtils]: 152: Hoare triple {83451#(<= main_~i~0 49)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83451#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:26,108 INFO L273 TraceCheckUtils]: 153: Hoare triple {83451#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {83452#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:26,109 INFO L273 TraceCheckUtils]: 154: Hoare triple {83452#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83452#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:26,109 INFO L273 TraceCheckUtils]: 155: Hoare triple {83452#(<= main_~i~0 50)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83452#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:26,110 INFO L273 TraceCheckUtils]: 156: Hoare triple {83452#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {83453#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:26,111 INFO L273 TraceCheckUtils]: 157: Hoare triple {83453#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83453#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:26,111 INFO L273 TraceCheckUtils]: 158: Hoare triple {83453#(<= main_~i~0 51)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83453#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:26,112 INFO L273 TraceCheckUtils]: 159: Hoare triple {83453#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {83454#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:26,112 INFO L273 TraceCheckUtils]: 160: Hoare triple {83454#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83454#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:26,113 INFO L273 TraceCheckUtils]: 161: Hoare triple {83454#(<= main_~i~0 52)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83454#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:26,113 INFO L273 TraceCheckUtils]: 162: Hoare triple {83454#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {83455#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:26,114 INFO L273 TraceCheckUtils]: 163: Hoare triple {83455#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83455#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:26,114 INFO L273 TraceCheckUtils]: 164: Hoare triple {83455#(<= main_~i~0 53)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83455#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:26,115 INFO L273 TraceCheckUtils]: 165: Hoare triple {83455#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {83456#(<= main_~i~0 54)} is VALID [2018-11-23 11:54:26,115 INFO L273 TraceCheckUtils]: 166: Hoare triple {83456#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83456#(<= main_~i~0 54)} is VALID [2018-11-23 11:54:26,116 INFO L273 TraceCheckUtils]: 167: Hoare triple {83456#(<= main_~i~0 54)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83456#(<= main_~i~0 54)} is VALID [2018-11-23 11:54:26,117 INFO L273 TraceCheckUtils]: 168: Hoare triple {83456#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {83457#(<= main_~i~0 55)} is VALID [2018-11-23 11:54:26,117 INFO L273 TraceCheckUtils]: 169: Hoare triple {83457#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83457#(<= main_~i~0 55)} is VALID [2018-11-23 11:54:26,118 INFO L273 TraceCheckUtils]: 170: Hoare triple {83457#(<= main_~i~0 55)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83457#(<= main_~i~0 55)} is VALID [2018-11-23 11:54:26,118 INFO L273 TraceCheckUtils]: 171: Hoare triple {83457#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {83458#(<= main_~i~0 56)} is VALID [2018-11-23 11:54:26,119 INFO L273 TraceCheckUtils]: 172: Hoare triple {83458#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {83458#(<= main_~i~0 56)} is VALID [2018-11-23 11:54:26,119 INFO L273 TraceCheckUtils]: 173: Hoare triple {83458#(<= main_~i~0 56)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {83458#(<= main_~i~0 56)} is VALID [2018-11-23 11:54:26,120 INFO L273 TraceCheckUtils]: 174: Hoare triple {83458#(<= main_~i~0 56)} ~i~0 := 1 + ~i~0; {83459#(<= main_~i~0 57)} is VALID [2018-11-23 11:54:26,120 INFO L273 TraceCheckUtils]: 175: Hoare triple {83459#(<= main_~i~0 57)} assume !(~i~0 < 100000); {83402#false} is VALID [2018-11-23 11:54:26,121 INFO L273 TraceCheckUtils]: 176: Hoare triple {83402#false} assume !(0 != ~swapped~0); {83402#false} is VALID [2018-11-23 11:54:26,121 INFO L273 TraceCheckUtils]: 177: Hoare triple {83402#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {83402#false} is VALID [2018-11-23 11:54:26,121 INFO L273 TraceCheckUtils]: 178: Hoare triple {83402#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {83402#false} is VALID [2018-11-23 11:54:26,121 INFO L273 TraceCheckUtils]: 179: Hoare triple {83402#false} assume !!(~y~0 < 100000);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); {83402#false} is VALID [2018-11-23 11:54:26,121 INFO L256 TraceCheckUtils]: 180: Hoare triple {83402#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {83402#false} is VALID [2018-11-23 11:54:26,122 INFO L273 TraceCheckUtils]: 181: Hoare triple {83402#false} ~cond := #in~cond; {83402#false} is VALID [2018-11-23 11:54:26,122 INFO L273 TraceCheckUtils]: 182: Hoare triple {83402#false} assume 0 == ~cond; {83402#false} is VALID [2018-11-23 11:54:26,122 INFO L273 TraceCheckUtils]: 183: Hoare triple {83402#false} assume !false; {83402#false} is VALID [2018-11-23 11:54:26,143 INFO L134 CoverageAnalysis]: Checked inductivity of 4677 backedges. 1 proven. 4676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:26,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:26,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 60 [2018-11-23 11:54:26,162 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 184 [2018-11-23 11:54:26,162 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:26,162 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 60 states. [2018-11-23 11:54:26,360 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:26,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-11-23 11:54:26,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-11-23 11:54:26,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-11-23 11:54:26,361 INFO L87 Difference]: Start difference. First operand 357 states and 472 transitions. Second operand 60 states. [2018-11-23 11:54:27,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:27,431 INFO L93 Difference]: Finished difference Result 718 states and 954 transitions. [2018-11-23 11:54:27,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-11-23 11:54:27,431 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 184 [2018-11-23 11:54:27,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:27,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 11:54:27,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 277 transitions. [2018-11-23 11:54:27,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 11:54:27,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 277 transitions. [2018-11-23 11:54:27,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 59 states and 277 transitions. [2018-11-23 11:54:27,708 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 277 edges. 277 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:27,716 INFO L225 Difference]: With dead ends: 718 [2018-11-23 11:54:27,717 INFO L226 Difference]: Without dead ends: 367 [2018-11-23 11:54:27,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-11-23 11:54:27,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-11-23 11:54:27,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 363. [2018-11-23 11:54:27,847 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:27,847 INFO L82 GeneralOperation]: Start isEquivalent. First operand 367 states. Second operand 363 states. [2018-11-23 11:54:27,847 INFO L74 IsIncluded]: Start isIncluded. First operand 367 states. Second operand 363 states. [2018-11-23 11:54:27,847 INFO L87 Difference]: Start difference. First operand 367 states. Second operand 363 states. [2018-11-23 11:54:27,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:27,855 INFO L93 Difference]: Finished difference Result 367 states and 486 transitions. [2018-11-23 11:54:27,855 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 486 transitions. [2018-11-23 11:54:27,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:27,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:27,855 INFO L74 IsIncluded]: Start isIncluded. First operand 363 states. Second operand 367 states. [2018-11-23 11:54:27,856 INFO L87 Difference]: Start difference. First operand 363 states. Second operand 367 states. [2018-11-23 11:54:27,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:27,862 INFO L93 Difference]: Finished difference Result 367 states and 486 transitions. [2018-11-23 11:54:27,863 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 486 transitions. [2018-11-23 11:54:27,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:27,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:27,863 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:27,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:27,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-11-23 11:54:27,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 480 transitions. [2018-11-23 11:54:27,870 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 480 transitions. Word has length 184 [2018-11-23 11:54:27,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:27,870 INFO L480 AbstractCegarLoop]: Abstraction has 363 states and 480 transitions. [2018-11-23 11:54:27,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-11-23 11:54:27,870 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 480 transitions. [2018-11-23 11:54:27,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-11-23 11:54:27,871 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:27,871 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:27,871 INFO L423 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:27,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:27,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1881919368, now seen corresponding path program 57 times [2018-11-23 11:54:27,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:27,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:27,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:27,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:27,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:27,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:29,368 INFO L256 TraceCheckUtils]: 0: Hoare triple {86196#true} call ULTIMATE.init(); {86196#true} is VALID [2018-11-23 11:54:29,368 INFO L273 TraceCheckUtils]: 1: Hoare triple {86196#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {86196#true} is VALID [2018-11-23 11:54:29,368 INFO L273 TraceCheckUtils]: 2: Hoare triple {86196#true} assume true; {86196#true} is VALID [2018-11-23 11:54:29,368 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {86196#true} {86196#true} #79#return; {86196#true} is VALID [2018-11-23 11:54:29,369 INFO L256 TraceCheckUtils]: 4: Hoare triple {86196#true} call #t~ret8 := main(); {86196#true} is VALID [2018-11-23 11:54:29,369 INFO L273 TraceCheckUtils]: 5: Hoare triple {86196#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {86196#true} is VALID [2018-11-23 11:54:29,369 INFO L273 TraceCheckUtils]: 6: Hoare triple {86196#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {86198#(= main_~i~0 1)} is VALID [2018-11-23 11:54:29,369 INFO L273 TraceCheckUtils]: 7: Hoare triple {86198#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86198#(= main_~i~0 1)} is VALID [2018-11-23 11:54:29,370 INFO L273 TraceCheckUtils]: 8: Hoare triple {86198#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86198#(= main_~i~0 1)} is VALID [2018-11-23 11:54:29,370 INFO L273 TraceCheckUtils]: 9: Hoare triple {86198#(= main_~i~0 1)} ~i~0 := 1 + ~i~0; {86199#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:29,371 INFO L273 TraceCheckUtils]: 10: Hoare triple {86199#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86199#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:29,371 INFO L273 TraceCheckUtils]: 11: Hoare triple {86199#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86199#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:29,371 INFO L273 TraceCheckUtils]: 12: Hoare triple {86199#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {86200#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:29,372 INFO L273 TraceCheckUtils]: 13: Hoare triple {86200#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86200#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:29,372 INFO L273 TraceCheckUtils]: 14: Hoare triple {86200#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86200#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:29,373 INFO L273 TraceCheckUtils]: 15: Hoare triple {86200#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {86201#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:29,374 INFO L273 TraceCheckUtils]: 16: Hoare triple {86201#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86201#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:29,374 INFO L273 TraceCheckUtils]: 17: Hoare triple {86201#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86201#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:29,375 INFO L273 TraceCheckUtils]: 18: Hoare triple {86201#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {86202#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:29,375 INFO L273 TraceCheckUtils]: 19: Hoare triple {86202#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86202#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:29,376 INFO L273 TraceCheckUtils]: 20: Hoare triple {86202#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86202#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:29,377 INFO L273 TraceCheckUtils]: 21: Hoare triple {86202#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {86203#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:29,377 INFO L273 TraceCheckUtils]: 22: Hoare triple {86203#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86203#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:29,378 INFO L273 TraceCheckUtils]: 23: Hoare triple {86203#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86203#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:29,378 INFO L273 TraceCheckUtils]: 24: Hoare triple {86203#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {86204#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:29,379 INFO L273 TraceCheckUtils]: 25: Hoare triple {86204#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86204#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:29,379 INFO L273 TraceCheckUtils]: 26: Hoare triple {86204#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86204#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:29,380 INFO L273 TraceCheckUtils]: 27: Hoare triple {86204#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {86205#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:29,380 INFO L273 TraceCheckUtils]: 28: Hoare triple {86205#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86205#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:29,381 INFO L273 TraceCheckUtils]: 29: Hoare triple {86205#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86205#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:29,381 INFO L273 TraceCheckUtils]: 30: Hoare triple {86205#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {86206#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:29,382 INFO L273 TraceCheckUtils]: 31: Hoare triple {86206#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86206#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:29,382 INFO L273 TraceCheckUtils]: 32: Hoare triple {86206#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86206#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:29,383 INFO L273 TraceCheckUtils]: 33: Hoare triple {86206#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {86207#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:29,384 INFO L273 TraceCheckUtils]: 34: Hoare triple {86207#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86207#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:29,384 INFO L273 TraceCheckUtils]: 35: Hoare triple {86207#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86207#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:29,385 INFO L273 TraceCheckUtils]: 36: Hoare triple {86207#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {86208#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:29,385 INFO L273 TraceCheckUtils]: 37: Hoare triple {86208#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86208#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:29,386 INFO L273 TraceCheckUtils]: 38: Hoare triple {86208#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86208#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:29,386 INFO L273 TraceCheckUtils]: 39: Hoare triple {86208#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {86209#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:29,387 INFO L273 TraceCheckUtils]: 40: Hoare triple {86209#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86209#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:29,387 INFO L273 TraceCheckUtils]: 41: Hoare triple {86209#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86209#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:29,388 INFO L273 TraceCheckUtils]: 42: Hoare triple {86209#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {86210#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:29,388 INFO L273 TraceCheckUtils]: 43: Hoare triple {86210#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86210#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:29,389 INFO L273 TraceCheckUtils]: 44: Hoare triple {86210#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86210#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:29,390 INFO L273 TraceCheckUtils]: 45: Hoare triple {86210#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {86211#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:29,390 INFO L273 TraceCheckUtils]: 46: Hoare triple {86211#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86211#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:29,390 INFO L273 TraceCheckUtils]: 47: Hoare triple {86211#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86211#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:29,391 INFO L273 TraceCheckUtils]: 48: Hoare triple {86211#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {86212#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:29,392 INFO L273 TraceCheckUtils]: 49: Hoare triple {86212#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86212#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:29,392 INFO L273 TraceCheckUtils]: 50: Hoare triple {86212#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86212#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:29,393 INFO L273 TraceCheckUtils]: 51: Hoare triple {86212#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {86213#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:29,393 INFO L273 TraceCheckUtils]: 52: Hoare triple {86213#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86213#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:29,394 INFO L273 TraceCheckUtils]: 53: Hoare triple {86213#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86213#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:29,394 INFO L273 TraceCheckUtils]: 54: Hoare triple {86213#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {86214#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:29,395 INFO L273 TraceCheckUtils]: 55: Hoare triple {86214#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86214#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:29,395 INFO L273 TraceCheckUtils]: 56: Hoare triple {86214#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86214#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:29,396 INFO L273 TraceCheckUtils]: 57: Hoare triple {86214#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {86215#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:29,396 INFO L273 TraceCheckUtils]: 58: Hoare triple {86215#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86215#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:29,397 INFO L273 TraceCheckUtils]: 59: Hoare triple {86215#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86215#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:29,398 INFO L273 TraceCheckUtils]: 60: Hoare triple {86215#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {86216#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:29,398 INFO L273 TraceCheckUtils]: 61: Hoare triple {86216#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86216#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:29,399 INFO L273 TraceCheckUtils]: 62: Hoare triple {86216#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86216#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:29,399 INFO L273 TraceCheckUtils]: 63: Hoare triple {86216#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {86217#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:29,400 INFO L273 TraceCheckUtils]: 64: Hoare triple {86217#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86217#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:29,400 INFO L273 TraceCheckUtils]: 65: Hoare triple {86217#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86217#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:29,401 INFO L273 TraceCheckUtils]: 66: Hoare triple {86217#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {86218#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:29,401 INFO L273 TraceCheckUtils]: 67: Hoare triple {86218#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86218#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:29,402 INFO L273 TraceCheckUtils]: 68: Hoare triple {86218#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86218#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:29,402 INFO L273 TraceCheckUtils]: 69: Hoare triple {86218#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {86219#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:29,403 INFO L273 TraceCheckUtils]: 70: Hoare triple {86219#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86219#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:29,403 INFO L273 TraceCheckUtils]: 71: Hoare triple {86219#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86219#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:29,404 INFO L273 TraceCheckUtils]: 72: Hoare triple {86219#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {86220#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:29,405 INFO L273 TraceCheckUtils]: 73: Hoare triple {86220#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86220#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:29,405 INFO L273 TraceCheckUtils]: 74: Hoare triple {86220#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86220#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:29,406 INFO L273 TraceCheckUtils]: 75: Hoare triple {86220#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {86221#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:29,406 INFO L273 TraceCheckUtils]: 76: Hoare triple {86221#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86221#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:29,407 INFO L273 TraceCheckUtils]: 77: Hoare triple {86221#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86221#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:29,407 INFO L273 TraceCheckUtils]: 78: Hoare triple {86221#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {86222#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:29,408 INFO L273 TraceCheckUtils]: 79: Hoare triple {86222#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86222#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:29,408 INFO L273 TraceCheckUtils]: 80: Hoare triple {86222#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86222#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:29,409 INFO L273 TraceCheckUtils]: 81: Hoare triple {86222#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {86223#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:29,409 INFO L273 TraceCheckUtils]: 82: Hoare triple {86223#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86223#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:29,410 INFO L273 TraceCheckUtils]: 83: Hoare triple {86223#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86223#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:29,411 INFO L273 TraceCheckUtils]: 84: Hoare triple {86223#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {86224#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:29,411 INFO L273 TraceCheckUtils]: 85: Hoare triple {86224#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86224#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:29,411 INFO L273 TraceCheckUtils]: 86: Hoare triple {86224#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86224#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:29,412 INFO L273 TraceCheckUtils]: 87: Hoare triple {86224#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {86225#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:29,413 INFO L273 TraceCheckUtils]: 88: Hoare triple {86225#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86225#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:29,413 INFO L273 TraceCheckUtils]: 89: Hoare triple {86225#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86225#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:29,414 INFO L273 TraceCheckUtils]: 90: Hoare triple {86225#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {86226#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:29,414 INFO L273 TraceCheckUtils]: 91: Hoare triple {86226#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86226#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:29,415 INFO L273 TraceCheckUtils]: 92: Hoare triple {86226#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86226#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:29,415 INFO L273 TraceCheckUtils]: 93: Hoare triple {86226#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {86227#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:29,416 INFO L273 TraceCheckUtils]: 94: Hoare triple {86227#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86227#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:29,416 INFO L273 TraceCheckUtils]: 95: Hoare triple {86227#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86227#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:29,417 INFO L273 TraceCheckUtils]: 96: Hoare triple {86227#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {86228#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:29,417 INFO L273 TraceCheckUtils]: 97: Hoare triple {86228#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86228#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:29,418 INFO L273 TraceCheckUtils]: 98: Hoare triple {86228#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86228#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:29,419 INFO L273 TraceCheckUtils]: 99: Hoare triple {86228#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {86229#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:29,419 INFO L273 TraceCheckUtils]: 100: Hoare triple {86229#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86229#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:29,419 INFO L273 TraceCheckUtils]: 101: Hoare triple {86229#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86229#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:29,420 INFO L273 TraceCheckUtils]: 102: Hoare triple {86229#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {86230#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:29,421 INFO L273 TraceCheckUtils]: 103: Hoare triple {86230#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86230#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:29,421 INFO L273 TraceCheckUtils]: 104: Hoare triple {86230#(<= main_~i~0 33)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86230#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:29,422 INFO L273 TraceCheckUtils]: 105: Hoare triple {86230#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {86231#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:29,422 INFO L273 TraceCheckUtils]: 106: Hoare triple {86231#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86231#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:29,423 INFO L273 TraceCheckUtils]: 107: Hoare triple {86231#(<= main_~i~0 34)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86231#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:29,423 INFO L273 TraceCheckUtils]: 108: Hoare triple {86231#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {86232#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:29,424 INFO L273 TraceCheckUtils]: 109: Hoare triple {86232#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86232#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:29,424 INFO L273 TraceCheckUtils]: 110: Hoare triple {86232#(<= main_~i~0 35)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86232#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:29,425 INFO L273 TraceCheckUtils]: 111: Hoare triple {86232#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {86233#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:29,425 INFO L273 TraceCheckUtils]: 112: Hoare triple {86233#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86233#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:29,426 INFO L273 TraceCheckUtils]: 113: Hoare triple {86233#(<= main_~i~0 36)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86233#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:29,427 INFO L273 TraceCheckUtils]: 114: Hoare triple {86233#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {86234#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:29,427 INFO L273 TraceCheckUtils]: 115: Hoare triple {86234#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86234#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:29,428 INFO L273 TraceCheckUtils]: 116: Hoare triple {86234#(<= main_~i~0 37)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86234#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:29,428 INFO L273 TraceCheckUtils]: 117: Hoare triple {86234#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {86235#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:29,429 INFO L273 TraceCheckUtils]: 118: Hoare triple {86235#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86235#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:29,429 INFO L273 TraceCheckUtils]: 119: Hoare triple {86235#(<= main_~i~0 38)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86235#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:29,430 INFO L273 TraceCheckUtils]: 120: Hoare triple {86235#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {86236#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:29,430 INFO L273 TraceCheckUtils]: 121: Hoare triple {86236#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86236#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:29,431 INFO L273 TraceCheckUtils]: 122: Hoare triple {86236#(<= main_~i~0 39)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86236#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:29,431 INFO L273 TraceCheckUtils]: 123: Hoare triple {86236#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {86237#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:29,432 INFO L273 TraceCheckUtils]: 124: Hoare triple {86237#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86237#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:29,432 INFO L273 TraceCheckUtils]: 125: Hoare triple {86237#(<= main_~i~0 40)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86237#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:29,433 INFO L273 TraceCheckUtils]: 126: Hoare triple {86237#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {86238#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:29,434 INFO L273 TraceCheckUtils]: 127: Hoare triple {86238#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86238#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:29,434 INFO L273 TraceCheckUtils]: 128: Hoare triple {86238#(<= main_~i~0 41)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86238#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:29,435 INFO L273 TraceCheckUtils]: 129: Hoare triple {86238#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {86239#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:29,435 INFO L273 TraceCheckUtils]: 130: Hoare triple {86239#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86239#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:29,436 INFO L273 TraceCheckUtils]: 131: Hoare triple {86239#(<= main_~i~0 42)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86239#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:29,436 INFO L273 TraceCheckUtils]: 132: Hoare triple {86239#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {86240#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:29,437 INFO L273 TraceCheckUtils]: 133: Hoare triple {86240#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86240#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:29,437 INFO L273 TraceCheckUtils]: 134: Hoare triple {86240#(<= main_~i~0 43)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86240#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:29,438 INFO L273 TraceCheckUtils]: 135: Hoare triple {86240#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {86241#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:29,438 INFO L273 TraceCheckUtils]: 136: Hoare triple {86241#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86241#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:29,439 INFO L273 TraceCheckUtils]: 137: Hoare triple {86241#(<= main_~i~0 44)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86241#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:29,439 INFO L273 TraceCheckUtils]: 138: Hoare triple {86241#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {86242#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:29,440 INFO L273 TraceCheckUtils]: 139: Hoare triple {86242#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86242#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:29,440 INFO L273 TraceCheckUtils]: 140: Hoare triple {86242#(<= main_~i~0 45)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86242#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:29,441 INFO L273 TraceCheckUtils]: 141: Hoare triple {86242#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {86243#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:29,442 INFO L273 TraceCheckUtils]: 142: Hoare triple {86243#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86243#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:29,442 INFO L273 TraceCheckUtils]: 143: Hoare triple {86243#(<= main_~i~0 46)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86243#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:29,443 INFO L273 TraceCheckUtils]: 144: Hoare triple {86243#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {86244#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:29,443 INFO L273 TraceCheckUtils]: 145: Hoare triple {86244#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86244#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:29,444 INFO L273 TraceCheckUtils]: 146: Hoare triple {86244#(<= main_~i~0 47)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86244#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:29,444 INFO L273 TraceCheckUtils]: 147: Hoare triple {86244#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {86245#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:29,445 INFO L273 TraceCheckUtils]: 148: Hoare triple {86245#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86245#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:29,445 INFO L273 TraceCheckUtils]: 149: Hoare triple {86245#(<= main_~i~0 48)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86245#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:29,446 INFO L273 TraceCheckUtils]: 150: Hoare triple {86245#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {86246#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:29,446 INFO L273 TraceCheckUtils]: 151: Hoare triple {86246#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86246#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:29,447 INFO L273 TraceCheckUtils]: 152: Hoare triple {86246#(<= main_~i~0 49)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86246#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:29,447 INFO L273 TraceCheckUtils]: 153: Hoare triple {86246#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {86247#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:29,448 INFO L273 TraceCheckUtils]: 154: Hoare triple {86247#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86247#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:29,448 INFO L273 TraceCheckUtils]: 155: Hoare triple {86247#(<= main_~i~0 50)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86247#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:29,449 INFO L273 TraceCheckUtils]: 156: Hoare triple {86247#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {86248#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:29,450 INFO L273 TraceCheckUtils]: 157: Hoare triple {86248#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86248#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:29,450 INFO L273 TraceCheckUtils]: 158: Hoare triple {86248#(<= main_~i~0 51)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86248#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:29,451 INFO L273 TraceCheckUtils]: 159: Hoare triple {86248#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {86249#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:29,451 INFO L273 TraceCheckUtils]: 160: Hoare triple {86249#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86249#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:29,452 INFO L273 TraceCheckUtils]: 161: Hoare triple {86249#(<= main_~i~0 52)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86249#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:29,452 INFO L273 TraceCheckUtils]: 162: Hoare triple {86249#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {86250#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:29,453 INFO L273 TraceCheckUtils]: 163: Hoare triple {86250#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86250#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:29,453 INFO L273 TraceCheckUtils]: 164: Hoare triple {86250#(<= main_~i~0 53)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86250#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:29,454 INFO L273 TraceCheckUtils]: 165: Hoare triple {86250#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {86251#(<= main_~i~0 54)} is VALID [2018-11-23 11:54:29,454 INFO L273 TraceCheckUtils]: 166: Hoare triple {86251#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86251#(<= main_~i~0 54)} is VALID [2018-11-23 11:54:29,455 INFO L273 TraceCheckUtils]: 167: Hoare triple {86251#(<= main_~i~0 54)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86251#(<= main_~i~0 54)} is VALID [2018-11-23 11:54:29,456 INFO L273 TraceCheckUtils]: 168: Hoare triple {86251#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {86252#(<= main_~i~0 55)} is VALID [2018-11-23 11:54:29,456 INFO L273 TraceCheckUtils]: 169: Hoare triple {86252#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86252#(<= main_~i~0 55)} is VALID [2018-11-23 11:54:29,457 INFO L273 TraceCheckUtils]: 170: Hoare triple {86252#(<= main_~i~0 55)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86252#(<= main_~i~0 55)} is VALID [2018-11-23 11:54:29,457 INFO L273 TraceCheckUtils]: 171: Hoare triple {86252#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {86253#(<= main_~i~0 56)} is VALID [2018-11-23 11:54:29,458 INFO L273 TraceCheckUtils]: 172: Hoare triple {86253#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86253#(<= main_~i~0 56)} is VALID [2018-11-23 11:54:29,458 INFO L273 TraceCheckUtils]: 173: Hoare triple {86253#(<= main_~i~0 56)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86253#(<= main_~i~0 56)} is VALID [2018-11-23 11:54:29,459 INFO L273 TraceCheckUtils]: 174: Hoare triple {86253#(<= main_~i~0 56)} ~i~0 := 1 + ~i~0; {86254#(<= main_~i~0 57)} is VALID [2018-11-23 11:54:29,459 INFO L273 TraceCheckUtils]: 175: Hoare triple {86254#(<= main_~i~0 57)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86254#(<= main_~i~0 57)} is VALID [2018-11-23 11:54:29,460 INFO L273 TraceCheckUtils]: 176: Hoare triple {86254#(<= main_~i~0 57)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86254#(<= main_~i~0 57)} is VALID [2018-11-23 11:54:29,460 INFO L273 TraceCheckUtils]: 177: Hoare triple {86254#(<= main_~i~0 57)} ~i~0 := 1 + ~i~0; {86255#(<= main_~i~0 58)} is VALID [2018-11-23 11:54:29,461 INFO L273 TraceCheckUtils]: 178: Hoare triple {86255#(<= main_~i~0 58)} assume !(~i~0 < 100000); {86197#false} is VALID [2018-11-23 11:54:29,461 INFO L273 TraceCheckUtils]: 179: Hoare triple {86197#false} assume !(0 != ~swapped~0); {86197#false} is VALID [2018-11-23 11:54:29,461 INFO L273 TraceCheckUtils]: 180: Hoare triple {86197#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {86197#false} is VALID [2018-11-23 11:54:29,462 INFO L273 TraceCheckUtils]: 181: Hoare triple {86197#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {86197#false} is VALID [2018-11-23 11:54:29,462 INFO L273 TraceCheckUtils]: 182: Hoare triple {86197#false} assume !!(~y~0 < 100000);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); {86197#false} is VALID [2018-11-23 11:54:29,462 INFO L256 TraceCheckUtils]: 183: Hoare triple {86197#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {86197#false} is VALID [2018-11-23 11:54:29,462 INFO L273 TraceCheckUtils]: 184: Hoare triple {86197#false} ~cond := #in~cond; {86197#false} is VALID [2018-11-23 11:54:29,462 INFO L273 TraceCheckUtils]: 185: Hoare triple {86197#false} assume 0 == ~cond; {86197#false} is VALID [2018-11-23 11:54:29,462 INFO L273 TraceCheckUtils]: 186: Hoare triple {86197#false} assume !false; {86197#false} is VALID [2018-11-23 11:54:29,484 INFO L134 CoverageAnalysis]: Checked inductivity of 4846 backedges. 1 proven. 4845 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:29,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:29,484 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:54:29,508 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:54:29,779 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 59 check-sat command(s) [2018-11-23 11:54:29,780 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:29,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:29,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:30,173 INFO L256 TraceCheckUtils]: 0: Hoare triple {86196#true} call ULTIMATE.init(); {86196#true} is VALID [2018-11-23 11:54:30,173 INFO L273 TraceCheckUtils]: 1: Hoare triple {86196#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {86196#true} is VALID [2018-11-23 11:54:30,173 INFO L273 TraceCheckUtils]: 2: Hoare triple {86196#true} assume true; {86196#true} is VALID [2018-11-23 11:54:30,173 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {86196#true} {86196#true} #79#return; {86196#true} is VALID [2018-11-23 11:54:30,174 INFO L256 TraceCheckUtils]: 4: Hoare triple {86196#true} call #t~ret8 := main(); {86196#true} is VALID [2018-11-23 11:54:30,174 INFO L273 TraceCheckUtils]: 5: Hoare triple {86196#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {86196#true} is VALID [2018-11-23 11:54:30,174 INFO L273 TraceCheckUtils]: 6: Hoare triple {86196#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {86277#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:30,175 INFO L273 TraceCheckUtils]: 7: Hoare triple {86277#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86277#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:30,175 INFO L273 TraceCheckUtils]: 8: Hoare triple {86277#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86277#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:30,176 INFO L273 TraceCheckUtils]: 9: Hoare triple {86277#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {86199#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:30,176 INFO L273 TraceCheckUtils]: 10: Hoare triple {86199#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86199#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:30,176 INFO L273 TraceCheckUtils]: 11: Hoare triple {86199#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86199#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:30,177 INFO L273 TraceCheckUtils]: 12: Hoare triple {86199#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {86200#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:30,177 INFO L273 TraceCheckUtils]: 13: Hoare triple {86200#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86200#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:30,177 INFO L273 TraceCheckUtils]: 14: Hoare triple {86200#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86200#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:30,178 INFO L273 TraceCheckUtils]: 15: Hoare triple {86200#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {86201#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:30,179 INFO L273 TraceCheckUtils]: 16: Hoare triple {86201#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86201#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:30,179 INFO L273 TraceCheckUtils]: 17: Hoare triple {86201#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86201#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:30,180 INFO L273 TraceCheckUtils]: 18: Hoare triple {86201#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {86202#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:30,180 INFO L273 TraceCheckUtils]: 19: Hoare triple {86202#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86202#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:30,181 INFO L273 TraceCheckUtils]: 20: Hoare triple {86202#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86202#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:30,181 INFO L273 TraceCheckUtils]: 21: Hoare triple {86202#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {86203#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:30,182 INFO L273 TraceCheckUtils]: 22: Hoare triple {86203#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86203#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:30,182 INFO L273 TraceCheckUtils]: 23: Hoare triple {86203#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86203#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:30,183 INFO L273 TraceCheckUtils]: 24: Hoare triple {86203#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {86204#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:30,183 INFO L273 TraceCheckUtils]: 25: Hoare triple {86204#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86204#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:30,184 INFO L273 TraceCheckUtils]: 26: Hoare triple {86204#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86204#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:30,185 INFO L273 TraceCheckUtils]: 27: Hoare triple {86204#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {86205#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:30,185 INFO L273 TraceCheckUtils]: 28: Hoare triple {86205#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86205#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:30,186 INFO L273 TraceCheckUtils]: 29: Hoare triple {86205#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86205#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:30,186 INFO L273 TraceCheckUtils]: 30: Hoare triple {86205#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {86206#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:30,187 INFO L273 TraceCheckUtils]: 31: Hoare triple {86206#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86206#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:30,187 INFO L273 TraceCheckUtils]: 32: Hoare triple {86206#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86206#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:30,188 INFO L273 TraceCheckUtils]: 33: Hoare triple {86206#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {86207#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:30,188 INFO L273 TraceCheckUtils]: 34: Hoare triple {86207#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86207#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:30,189 INFO L273 TraceCheckUtils]: 35: Hoare triple {86207#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86207#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:30,189 INFO L273 TraceCheckUtils]: 36: Hoare triple {86207#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {86208#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:30,190 INFO L273 TraceCheckUtils]: 37: Hoare triple {86208#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86208#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:30,190 INFO L273 TraceCheckUtils]: 38: Hoare triple {86208#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86208#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:30,191 INFO L273 TraceCheckUtils]: 39: Hoare triple {86208#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {86209#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:30,192 INFO L273 TraceCheckUtils]: 40: Hoare triple {86209#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86209#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:30,192 INFO L273 TraceCheckUtils]: 41: Hoare triple {86209#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86209#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:30,193 INFO L273 TraceCheckUtils]: 42: Hoare triple {86209#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {86210#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:30,193 INFO L273 TraceCheckUtils]: 43: Hoare triple {86210#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86210#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:30,194 INFO L273 TraceCheckUtils]: 44: Hoare triple {86210#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86210#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:30,195 INFO L273 TraceCheckUtils]: 45: Hoare triple {86210#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {86211#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:30,195 INFO L273 TraceCheckUtils]: 46: Hoare triple {86211#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86211#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:30,195 INFO L273 TraceCheckUtils]: 47: Hoare triple {86211#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86211#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:30,196 INFO L273 TraceCheckUtils]: 48: Hoare triple {86211#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {86212#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:30,197 INFO L273 TraceCheckUtils]: 49: Hoare triple {86212#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86212#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:30,197 INFO L273 TraceCheckUtils]: 50: Hoare triple {86212#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86212#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:30,198 INFO L273 TraceCheckUtils]: 51: Hoare triple {86212#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {86213#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:30,198 INFO L273 TraceCheckUtils]: 52: Hoare triple {86213#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86213#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:30,199 INFO L273 TraceCheckUtils]: 53: Hoare triple {86213#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86213#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:30,200 INFO L273 TraceCheckUtils]: 54: Hoare triple {86213#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {86214#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:30,200 INFO L273 TraceCheckUtils]: 55: Hoare triple {86214#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86214#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:30,201 INFO L273 TraceCheckUtils]: 56: Hoare triple {86214#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86214#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:30,201 INFO L273 TraceCheckUtils]: 57: Hoare triple {86214#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {86215#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:30,202 INFO L273 TraceCheckUtils]: 58: Hoare triple {86215#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86215#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:30,202 INFO L273 TraceCheckUtils]: 59: Hoare triple {86215#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86215#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:30,203 INFO L273 TraceCheckUtils]: 60: Hoare triple {86215#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {86216#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:30,203 INFO L273 TraceCheckUtils]: 61: Hoare triple {86216#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86216#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:30,204 INFO L273 TraceCheckUtils]: 62: Hoare triple {86216#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86216#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:30,205 INFO L273 TraceCheckUtils]: 63: Hoare triple {86216#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {86217#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:30,205 INFO L273 TraceCheckUtils]: 64: Hoare triple {86217#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86217#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:30,206 INFO L273 TraceCheckUtils]: 65: Hoare triple {86217#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86217#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:30,206 INFO L273 TraceCheckUtils]: 66: Hoare triple {86217#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {86218#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:30,207 INFO L273 TraceCheckUtils]: 67: Hoare triple {86218#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86218#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:30,207 INFO L273 TraceCheckUtils]: 68: Hoare triple {86218#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86218#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:30,208 INFO L273 TraceCheckUtils]: 69: Hoare triple {86218#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {86219#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:30,208 INFO L273 TraceCheckUtils]: 70: Hoare triple {86219#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86219#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:30,209 INFO L273 TraceCheckUtils]: 71: Hoare triple {86219#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86219#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:30,209 INFO L273 TraceCheckUtils]: 72: Hoare triple {86219#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {86220#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:30,210 INFO L273 TraceCheckUtils]: 73: Hoare triple {86220#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86220#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:30,210 INFO L273 TraceCheckUtils]: 74: Hoare triple {86220#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86220#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:30,211 INFO L273 TraceCheckUtils]: 75: Hoare triple {86220#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {86221#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:30,212 INFO L273 TraceCheckUtils]: 76: Hoare triple {86221#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86221#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:30,212 INFO L273 TraceCheckUtils]: 77: Hoare triple {86221#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86221#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:30,213 INFO L273 TraceCheckUtils]: 78: Hoare triple {86221#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {86222#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:30,213 INFO L273 TraceCheckUtils]: 79: Hoare triple {86222#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86222#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:30,214 INFO L273 TraceCheckUtils]: 80: Hoare triple {86222#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86222#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:30,214 INFO L273 TraceCheckUtils]: 81: Hoare triple {86222#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {86223#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:30,215 INFO L273 TraceCheckUtils]: 82: Hoare triple {86223#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86223#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:30,215 INFO L273 TraceCheckUtils]: 83: Hoare triple {86223#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86223#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:30,216 INFO L273 TraceCheckUtils]: 84: Hoare triple {86223#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {86224#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:30,216 INFO L273 TraceCheckUtils]: 85: Hoare triple {86224#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86224#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:30,217 INFO L273 TraceCheckUtils]: 86: Hoare triple {86224#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86224#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:30,218 INFO L273 TraceCheckUtils]: 87: Hoare triple {86224#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {86225#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:30,218 INFO L273 TraceCheckUtils]: 88: Hoare triple {86225#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86225#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:30,218 INFO L273 TraceCheckUtils]: 89: Hoare triple {86225#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86225#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:30,219 INFO L273 TraceCheckUtils]: 90: Hoare triple {86225#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {86226#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:30,220 INFO L273 TraceCheckUtils]: 91: Hoare triple {86226#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86226#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:30,220 INFO L273 TraceCheckUtils]: 92: Hoare triple {86226#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86226#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:30,221 INFO L273 TraceCheckUtils]: 93: Hoare triple {86226#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {86227#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:30,221 INFO L273 TraceCheckUtils]: 94: Hoare triple {86227#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86227#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:30,222 INFO L273 TraceCheckUtils]: 95: Hoare triple {86227#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86227#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:30,222 INFO L273 TraceCheckUtils]: 96: Hoare triple {86227#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {86228#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:30,223 INFO L273 TraceCheckUtils]: 97: Hoare triple {86228#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86228#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:30,223 INFO L273 TraceCheckUtils]: 98: Hoare triple {86228#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86228#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:30,224 INFO L273 TraceCheckUtils]: 99: Hoare triple {86228#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {86229#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:30,224 INFO L273 TraceCheckUtils]: 100: Hoare triple {86229#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86229#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:30,225 INFO L273 TraceCheckUtils]: 101: Hoare triple {86229#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86229#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:30,226 INFO L273 TraceCheckUtils]: 102: Hoare triple {86229#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {86230#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:30,226 INFO L273 TraceCheckUtils]: 103: Hoare triple {86230#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86230#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:30,227 INFO L273 TraceCheckUtils]: 104: Hoare triple {86230#(<= main_~i~0 33)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86230#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:30,227 INFO L273 TraceCheckUtils]: 105: Hoare triple {86230#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {86231#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:30,228 INFO L273 TraceCheckUtils]: 106: Hoare triple {86231#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86231#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:30,228 INFO L273 TraceCheckUtils]: 107: Hoare triple {86231#(<= main_~i~0 34)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86231#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:30,229 INFO L273 TraceCheckUtils]: 108: Hoare triple {86231#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {86232#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:30,229 INFO L273 TraceCheckUtils]: 109: Hoare triple {86232#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86232#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:30,230 INFO L273 TraceCheckUtils]: 110: Hoare triple {86232#(<= main_~i~0 35)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86232#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:30,230 INFO L273 TraceCheckUtils]: 111: Hoare triple {86232#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {86233#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:30,231 INFO L273 TraceCheckUtils]: 112: Hoare triple {86233#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86233#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:30,231 INFO L273 TraceCheckUtils]: 113: Hoare triple {86233#(<= main_~i~0 36)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86233#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:30,232 INFO L273 TraceCheckUtils]: 114: Hoare triple {86233#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {86234#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:30,233 INFO L273 TraceCheckUtils]: 115: Hoare triple {86234#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86234#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:30,233 INFO L273 TraceCheckUtils]: 116: Hoare triple {86234#(<= main_~i~0 37)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86234#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:30,234 INFO L273 TraceCheckUtils]: 117: Hoare triple {86234#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {86235#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:30,234 INFO L273 TraceCheckUtils]: 118: Hoare triple {86235#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86235#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:30,235 INFO L273 TraceCheckUtils]: 119: Hoare triple {86235#(<= main_~i~0 38)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86235#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:30,235 INFO L273 TraceCheckUtils]: 120: Hoare triple {86235#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {86236#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:30,236 INFO L273 TraceCheckUtils]: 121: Hoare triple {86236#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86236#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:30,236 INFO L273 TraceCheckUtils]: 122: Hoare triple {86236#(<= main_~i~0 39)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86236#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:30,237 INFO L273 TraceCheckUtils]: 123: Hoare triple {86236#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {86237#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:30,237 INFO L273 TraceCheckUtils]: 124: Hoare triple {86237#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86237#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:30,238 INFO L273 TraceCheckUtils]: 125: Hoare triple {86237#(<= main_~i~0 40)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86237#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:30,239 INFO L273 TraceCheckUtils]: 126: Hoare triple {86237#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {86238#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:30,239 INFO L273 TraceCheckUtils]: 127: Hoare triple {86238#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86238#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:30,240 INFO L273 TraceCheckUtils]: 128: Hoare triple {86238#(<= main_~i~0 41)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86238#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:30,240 INFO L273 TraceCheckUtils]: 129: Hoare triple {86238#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {86239#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:30,241 INFO L273 TraceCheckUtils]: 130: Hoare triple {86239#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86239#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:30,241 INFO L273 TraceCheckUtils]: 131: Hoare triple {86239#(<= main_~i~0 42)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86239#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:30,242 INFO L273 TraceCheckUtils]: 132: Hoare triple {86239#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {86240#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:30,242 INFO L273 TraceCheckUtils]: 133: Hoare triple {86240#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86240#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:30,243 INFO L273 TraceCheckUtils]: 134: Hoare triple {86240#(<= main_~i~0 43)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86240#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:30,244 INFO L273 TraceCheckUtils]: 135: Hoare triple {86240#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {86241#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:30,244 INFO L273 TraceCheckUtils]: 136: Hoare triple {86241#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86241#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:30,245 INFO L273 TraceCheckUtils]: 137: Hoare triple {86241#(<= main_~i~0 44)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86241#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:30,245 INFO L273 TraceCheckUtils]: 138: Hoare triple {86241#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {86242#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:30,246 INFO L273 TraceCheckUtils]: 139: Hoare triple {86242#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86242#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:30,246 INFO L273 TraceCheckUtils]: 140: Hoare triple {86242#(<= main_~i~0 45)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86242#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:30,247 INFO L273 TraceCheckUtils]: 141: Hoare triple {86242#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {86243#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:30,247 INFO L273 TraceCheckUtils]: 142: Hoare triple {86243#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86243#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:30,248 INFO L273 TraceCheckUtils]: 143: Hoare triple {86243#(<= main_~i~0 46)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86243#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:30,248 INFO L273 TraceCheckUtils]: 144: Hoare triple {86243#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {86244#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:30,249 INFO L273 TraceCheckUtils]: 145: Hoare triple {86244#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86244#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:30,249 INFO L273 TraceCheckUtils]: 146: Hoare triple {86244#(<= main_~i~0 47)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86244#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:30,250 INFO L273 TraceCheckUtils]: 147: Hoare triple {86244#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {86245#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:30,250 INFO L273 TraceCheckUtils]: 148: Hoare triple {86245#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86245#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:30,251 INFO L273 TraceCheckUtils]: 149: Hoare triple {86245#(<= main_~i~0 48)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86245#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:30,252 INFO L273 TraceCheckUtils]: 150: Hoare triple {86245#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {86246#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:30,252 INFO L273 TraceCheckUtils]: 151: Hoare triple {86246#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86246#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:30,253 INFO L273 TraceCheckUtils]: 152: Hoare triple {86246#(<= main_~i~0 49)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86246#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:30,253 INFO L273 TraceCheckUtils]: 153: Hoare triple {86246#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {86247#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:30,254 INFO L273 TraceCheckUtils]: 154: Hoare triple {86247#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86247#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:30,254 INFO L273 TraceCheckUtils]: 155: Hoare triple {86247#(<= main_~i~0 50)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86247#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:30,255 INFO L273 TraceCheckUtils]: 156: Hoare triple {86247#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {86248#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:30,255 INFO L273 TraceCheckUtils]: 157: Hoare triple {86248#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86248#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:30,256 INFO L273 TraceCheckUtils]: 158: Hoare triple {86248#(<= main_~i~0 51)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86248#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:30,256 INFO L273 TraceCheckUtils]: 159: Hoare triple {86248#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {86249#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:30,257 INFO L273 TraceCheckUtils]: 160: Hoare triple {86249#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86249#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:30,257 INFO L273 TraceCheckUtils]: 161: Hoare triple {86249#(<= main_~i~0 52)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86249#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:30,258 INFO L273 TraceCheckUtils]: 162: Hoare triple {86249#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {86250#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:30,259 INFO L273 TraceCheckUtils]: 163: Hoare triple {86250#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86250#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:30,259 INFO L273 TraceCheckUtils]: 164: Hoare triple {86250#(<= main_~i~0 53)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86250#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:30,260 INFO L273 TraceCheckUtils]: 165: Hoare triple {86250#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {86251#(<= main_~i~0 54)} is VALID [2018-11-23 11:54:30,260 INFO L273 TraceCheckUtils]: 166: Hoare triple {86251#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86251#(<= main_~i~0 54)} is VALID [2018-11-23 11:54:30,261 INFO L273 TraceCheckUtils]: 167: Hoare triple {86251#(<= main_~i~0 54)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86251#(<= main_~i~0 54)} is VALID [2018-11-23 11:54:30,261 INFO L273 TraceCheckUtils]: 168: Hoare triple {86251#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {86252#(<= main_~i~0 55)} is VALID [2018-11-23 11:54:30,262 INFO L273 TraceCheckUtils]: 169: Hoare triple {86252#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86252#(<= main_~i~0 55)} is VALID [2018-11-23 11:54:30,262 INFO L273 TraceCheckUtils]: 170: Hoare triple {86252#(<= main_~i~0 55)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86252#(<= main_~i~0 55)} is VALID [2018-11-23 11:54:30,263 INFO L273 TraceCheckUtils]: 171: Hoare triple {86252#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {86253#(<= main_~i~0 56)} is VALID [2018-11-23 11:54:30,263 INFO L273 TraceCheckUtils]: 172: Hoare triple {86253#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86253#(<= main_~i~0 56)} is VALID [2018-11-23 11:54:30,264 INFO L273 TraceCheckUtils]: 173: Hoare triple {86253#(<= main_~i~0 56)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86253#(<= main_~i~0 56)} is VALID [2018-11-23 11:54:30,265 INFO L273 TraceCheckUtils]: 174: Hoare triple {86253#(<= main_~i~0 56)} ~i~0 := 1 + ~i~0; {86254#(<= main_~i~0 57)} is VALID [2018-11-23 11:54:30,265 INFO L273 TraceCheckUtils]: 175: Hoare triple {86254#(<= main_~i~0 57)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {86254#(<= main_~i~0 57)} is VALID [2018-11-23 11:54:30,266 INFO L273 TraceCheckUtils]: 176: Hoare triple {86254#(<= main_~i~0 57)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {86254#(<= main_~i~0 57)} is VALID [2018-11-23 11:54:30,266 INFO L273 TraceCheckUtils]: 177: Hoare triple {86254#(<= main_~i~0 57)} ~i~0 := 1 + ~i~0; {86255#(<= main_~i~0 58)} is VALID [2018-11-23 11:54:30,267 INFO L273 TraceCheckUtils]: 178: Hoare triple {86255#(<= main_~i~0 58)} assume !(~i~0 < 100000); {86197#false} is VALID [2018-11-23 11:54:30,267 INFO L273 TraceCheckUtils]: 179: Hoare triple {86197#false} assume !(0 != ~swapped~0); {86197#false} is VALID [2018-11-23 11:54:30,267 INFO L273 TraceCheckUtils]: 180: Hoare triple {86197#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {86197#false} is VALID [2018-11-23 11:54:30,267 INFO L273 TraceCheckUtils]: 181: Hoare triple {86197#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {86197#false} is VALID [2018-11-23 11:54:30,268 INFO L273 TraceCheckUtils]: 182: Hoare triple {86197#false} assume !!(~y~0 < 100000);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); {86197#false} is VALID [2018-11-23 11:54:30,268 INFO L256 TraceCheckUtils]: 183: Hoare triple {86197#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {86197#false} is VALID [2018-11-23 11:54:30,268 INFO L273 TraceCheckUtils]: 184: Hoare triple {86197#false} ~cond := #in~cond; {86197#false} is VALID [2018-11-23 11:54:30,268 INFO L273 TraceCheckUtils]: 185: Hoare triple {86197#false} assume 0 == ~cond; {86197#false} is VALID [2018-11-23 11:54:30,268 INFO L273 TraceCheckUtils]: 186: Hoare triple {86197#false} assume !false; {86197#false} is VALID [2018-11-23 11:54:30,290 INFO L134 CoverageAnalysis]: Checked inductivity of 4846 backedges. 1 proven. 4845 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:30,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:30,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 61 [2018-11-23 11:54:30,311 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 187 [2018-11-23 11:54:30,311 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:30,311 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 61 states. [2018-11-23 11:54:30,493 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:54:30,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-11-23 11:54:30,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-11-23 11:54:30,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-11-23 11:54:30,495 INFO L87 Difference]: Start difference. First operand 363 states and 480 transitions. Second operand 61 states. [2018-11-23 11:54:32,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:32,024 INFO L93 Difference]: Finished difference Result 730 states and 970 transitions. [2018-11-23 11:54:32,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-11-23 11:54:32,024 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 187 [2018-11-23 11:54:32,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:32,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 11:54:32,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 281 transitions. [2018-11-23 11:54:32,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 11:54:32,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 281 transitions. [2018-11-23 11:54:32,029 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 60 states and 281 transitions. [2018-11-23 11:54:32,336 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 281 edges. 281 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:32,344 INFO L225 Difference]: With dead ends: 730 [2018-11-23 11:54:32,345 INFO L226 Difference]: Without dead ends: 373 [2018-11-23 11:54:32,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-11-23 11:54:32,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-11-23 11:54:32,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 369. [2018-11-23 11:54:32,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:32,474 INFO L82 GeneralOperation]: Start isEquivalent. First operand 373 states. Second operand 369 states. [2018-11-23 11:54:32,474 INFO L74 IsIncluded]: Start isIncluded. First operand 373 states. Second operand 369 states. [2018-11-23 11:54:32,474 INFO L87 Difference]: Start difference. First operand 373 states. Second operand 369 states. [2018-11-23 11:54:32,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:32,481 INFO L93 Difference]: Finished difference Result 373 states and 494 transitions. [2018-11-23 11:54:32,481 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 494 transitions. [2018-11-23 11:54:32,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:32,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:32,482 INFO L74 IsIncluded]: Start isIncluded. First operand 369 states. Second operand 373 states. [2018-11-23 11:54:32,482 INFO L87 Difference]: Start difference. First operand 369 states. Second operand 373 states. [2018-11-23 11:54:32,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:32,489 INFO L93 Difference]: Finished difference Result 373 states and 494 transitions. [2018-11-23 11:54:32,489 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 494 transitions. [2018-11-23 11:54:32,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:32,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:32,489 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:32,489 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:32,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-11-23 11:54:32,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 488 transitions. [2018-11-23 11:54:32,496 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 488 transitions. Word has length 187 [2018-11-23 11:54:32,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:32,496 INFO L480 AbstractCegarLoop]: Abstraction has 369 states and 488 transitions. [2018-11-23 11:54:32,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-11-23 11:54:32,497 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 488 transitions. [2018-11-23 11:54:32,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-23 11:54:32,497 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:32,497 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:32,498 INFO L423 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:32,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:32,498 INFO L82 PathProgramCache]: Analyzing trace with hash 764437233, now seen corresponding path program 58 times [2018-11-23 11:54:32,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:32,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:32,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:32,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:32,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:32,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:34,050 INFO L256 TraceCheckUtils]: 0: Hoare triple {89037#true} call ULTIMATE.init(); {89037#true} is VALID [2018-11-23 11:54:34,050 INFO L273 TraceCheckUtils]: 1: Hoare triple {89037#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {89037#true} is VALID [2018-11-23 11:54:34,051 INFO L273 TraceCheckUtils]: 2: Hoare triple {89037#true} assume true; {89037#true} is VALID [2018-11-23 11:54:34,051 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {89037#true} {89037#true} #79#return; {89037#true} is VALID [2018-11-23 11:54:34,051 INFO L256 TraceCheckUtils]: 4: Hoare triple {89037#true} call #t~ret8 := main(); {89037#true} is VALID [2018-11-23 11:54:34,051 INFO L273 TraceCheckUtils]: 5: Hoare triple {89037#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {89037#true} is VALID [2018-11-23 11:54:34,052 INFO L273 TraceCheckUtils]: 6: Hoare triple {89037#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {89039#(= main_~i~0 1)} is VALID [2018-11-23 11:54:34,052 INFO L273 TraceCheckUtils]: 7: Hoare triple {89039#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89039#(= main_~i~0 1)} is VALID [2018-11-23 11:54:34,053 INFO L273 TraceCheckUtils]: 8: Hoare triple {89039#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89039#(= main_~i~0 1)} is VALID [2018-11-23 11:54:34,053 INFO L273 TraceCheckUtils]: 9: Hoare triple {89039#(= main_~i~0 1)} ~i~0 := 1 + ~i~0; {89040#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:34,053 INFO L273 TraceCheckUtils]: 10: Hoare triple {89040#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89040#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:34,054 INFO L273 TraceCheckUtils]: 11: Hoare triple {89040#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89040#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:34,054 INFO L273 TraceCheckUtils]: 12: Hoare triple {89040#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {89041#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:34,054 INFO L273 TraceCheckUtils]: 13: Hoare triple {89041#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89041#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:34,055 INFO L273 TraceCheckUtils]: 14: Hoare triple {89041#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89041#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:34,055 INFO L273 TraceCheckUtils]: 15: Hoare triple {89041#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {89042#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:34,056 INFO L273 TraceCheckUtils]: 16: Hoare triple {89042#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89042#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:34,056 INFO L273 TraceCheckUtils]: 17: Hoare triple {89042#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89042#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:34,057 INFO L273 TraceCheckUtils]: 18: Hoare triple {89042#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {89043#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:34,058 INFO L273 TraceCheckUtils]: 19: Hoare triple {89043#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89043#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:34,058 INFO L273 TraceCheckUtils]: 20: Hoare triple {89043#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89043#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:34,059 INFO L273 TraceCheckUtils]: 21: Hoare triple {89043#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {89044#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:34,059 INFO L273 TraceCheckUtils]: 22: Hoare triple {89044#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89044#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:34,060 INFO L273 TraceCheckUtils]: 23: Hoare triple {89044#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89044#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:34,061 INFO L273 TraceCheckUtils]: 24: Hoare triple {89044#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {89045#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:34,061 INFO L273 TraceCheckUtils]: 25: Hoare triple {89045#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89045#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:34,061 INFO L273 TraceCheckUtils]: 26: Hoare triple {89045#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89045#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:34,062 INFO L273 TraceCheckUtils]: 27: Hoare triple {89045#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {89046#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:34,063 INFO L273 TraceCheckUtils]: 28: Hoare triple {89046#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89046#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:34,063 INFO L273 TraceCheckUtils]: 29: Hoare triple {89046#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89046#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:34,064 INFO L273 TraceCheckUtils]: 30: Hoare triple {89046#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {89047#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:34,064 INFO L273 TraceCheckUtils]: 31: Hoare triple {89047#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89047#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:34,065 INFO L273 TraceCheckUtils]: 32: Hoare triple {89047#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89047#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:34,066 INFO L273 TraceCheckUtils]: 33: Hoare triple {89047#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {89048#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:34,066 INFO L273 TraceCheckUtils]: 34: Hoare triple {89048#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89048#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:34,066 INFO L273 TraceCheckUtils]: 35: Hoare triple {89048#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89048#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:34,067 INFO L273 TraceCheckUtils]: 36: Hoare triple {89048#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {89049#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:34,068 INFO L273 TraceCheckUtils]: 37: Hoare triple {89049#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89049#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:34,068 INFO L273 TraceCheckUtils]: 38: Hoare triple {89049#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89049#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:34,069 INFO L273 TraceCheckUtils]: 39: Hoare triple {89049#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {89050#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:34,069 INFO L273 TraceCheckUtils]: 40: Hoare triple {89050#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89050#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:34,070 INFO L273 TraceCheckUtils]: 41: Hoare triple {89050#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89050#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:34,070 INFO L273 TraceCheckUtils]: 42: Hoare triple {89050#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {89051#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:34,071 INFO L273 TraceCheckUtils]: 43: Hoare triple {89051#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89051#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:34,071 INFO L273 TraceCheckUtils]: 44: Hoare triple {89051#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89051#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:34,072 INFO L273 TraceCheckUtils]: 45: Hoare triple {89051#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {89052#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:34,073 INFO L273 TraceCheckUtils]: 46: Hoare triple {89052#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89052#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:34,073 INFO L273 TraceCheckUtils]: 47: Hoare triple {89052#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89052#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:34,074 INFO L273 TraceCheckUtils]: 48: Hoare triple {89052#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {89053#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:34,074 INFO L273 TraceCheckUtils]: 49: Hoare triple {89053#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89053#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:34,075 INFO L273 TraceCheckUtils]: 50: Hoare triple {89053#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89053#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:34,075 INFO L273 TraceCheckUtils]: 51: Hoare triple {89053#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {89054#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:34,076 INFO L273 TraceCheckUtils]: 52: Hoare triple {89054#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89054#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:34,076 INFO L273 TraceCheckUtils]: 53: Hoare triple {89054#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89054#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:34,077 INFO L273 TraceCheckUtils]: 54: Hoare triple {89054#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {89055#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:34,078 INFO L273 TraceCheckUtils]: 55: Hoare triple {89055#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89055#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:34,078 INFO L273 TraceCheckUtils]: 56: Hoare triple {89055#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89055#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:34,079 INFO L273 TraceCheckUtils]: 57: Hoare triple {89055#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {89056#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:34,079 INFO L273 TraceCheckUtils]: 58: Hoare triple {89056#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89056#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:34,080 INFO L273 TraceCheckUtils]: 59: Hoare triple {89056#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89056#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:34,080 INFO L273 TraceCheckUtils]: 60: Hoare triple {89056#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {89057#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:34,081 INFO L273 TraceCheckUtils]: 61: Hoare triple {89057#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89057#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:34,081 INFO L273 TraceCheckUtils]: 62: Hoare triple {89057#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89057#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:34,082 INFO L273 TraceCheckUtils]: 63: Hoare triple {89057#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {89058#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:34,083 INFO L273 TraceCheckUtils]: 64: Hoare triple {89058#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89058#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:34,083 INFO L273 TraceCheckUtils]: 65: Hoare triple {89058#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89058#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:34,084 INFO L273 TraceCheckUtils]: 66: Hoare triple {89058#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {89059#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:34,084 INFO L273 TraceCheckUtils]: 67: Hoare triple {89059#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89059#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:34,085 INFO L273 TraceCheckUtils]: 68: Hoare triple {89059#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89059#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:34,085 INFO L273 TraceCheckUtils]: 69: Hoare triple {89059#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {89060#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:34,086 INFO L273 TraceCheckUtils]: 70: Hoare triple {89060#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89060#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:34,086 INFO L273 TraceCheckUtils]: 71: Hoare triple {89060#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89060#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:34,087 INFO L273 TraceCheckUtils]: 72: Hoare triple {89060#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {89061#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:34,088 INFO L273 TraceCheckUtils]: 73: Hoare triple {89061#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89061#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:34,088 INFO L273 TraceCheckUtils]: 74: Hoare triple {89061#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89061#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:34,089 INFO L273 TraceCheckUtils]: 75: Hoare triple {89061#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {89062#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:34,089 INFO L273 TraceCheckUtils]: 76: Hoare triple {89062#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89062#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:34,090 INFO L273 TraceCheckUtils]: 77: Hoare triple {89062#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89062#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:34,090 INFO L273 TraceCheckUtils]: 78: Hoare triple {89062#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {89063#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:34,091 INFO L273 TraceCheckUtils]: 79: Hoare triple {89063#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89063#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:34,091 INFO L273 TraceCheckUtils]: 80: Hoare triple {89063#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89063#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:34,092 INFO L273 TraceCheckUtils]: 81: Hoare triple {89063#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {89064#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:34,093 INFO L273 TraceCheckUtils]: 82: Hoare triple {89064#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89064#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:34,093 INFO L273 TraceCheckUtils]: 83: Hoare triple {89064#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89064#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:34,094 INFO L273 TraceCheckUtils]: 84: Hoare triple {89064#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {89065#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:34,094 INFO L273 TraceCheckUtils]: 85: Hoare triple {89065#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89065#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:34,095 INFO L273 TraceCheckUtils]: 86: Hoare triple {89065#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89065#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:34,095 INFO L273 TraceCheckUtils]: 87: Hoare triple {89065#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {89066#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:34,096 INFO L273 TraceCheckUtils]: 88: Hoare triple {89066#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89066#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:34,096 INFO L273 TraceCheckUtils]: 89: Hoare triple {89066#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89066#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:34,097 INFO L273 TraceCheckUtils]: 90: Hoare triple {89066#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {89067#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:34,098 INFO L273 TraceCheckUtils]: 91: Hoare triple {89067#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89067#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:34,098 INFO L273 TraceCheckUtils]: 92: Hoare triple {89067#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89067#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:34,099 INFO L273 TraceCheckUtils]: 93: Hoare triple {89067#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {89068#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:34,099 INFO L273 TraceCheckUtils]: 94: Hoare triple {89068#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89068#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:34,100 INFO L273 TraceCheckUtils]: 95: Hoare triple {89068#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89068#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:34,100 INFO L273 TraceCheckUtils]: 96: Hoare triple {89068#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {89069#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:34,101 INFO L273 TraceCheckUtils]: 97: Hoare triple {89069#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89069#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:34,101 INFO L273 TraceCheckUtils]: 98: Hoare triple {89069#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89069#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:34,102 INFO L273 TraceCheckUtils]: 99: Hoare triple {89069#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {89070#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:34,103 INFO L273 TraceCheckUtils]: 100: Hoare triple {89070#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89070#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:34,103 INFO L273 TraceCheckUtils]: 101: Hoare triple {89070#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89070#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:34,104 INFO L273 TraceCheckUtils]: 102: Hoare triple {89070#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {89071#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:34,104 INFO L273 TraceCheckUtils]: 103: Hoare triple {89071#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89071#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:34,105 INFO L273 TraceCheckUtils]: 104: Hoare triple {89071#(<= main_~i~0 33)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89071#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:34,106 INFO L273 TraceCheckUtils]: 105: Hoare triple {89071#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {89072#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:34,106 INFO L273 TraceCheckUtils]: 106: Hoare triple {89072#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89072#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:34,107 INFO L273 TraceCheckUtils]: 107: Hoare triple {89072#(<= main_~i~0 34)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89072#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:34,107 INFO L273 TraceCheckUtils]: 108: Hoare triple {89072#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {89073#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:34,108 INFO L273 TraceCheckUtils]: 109: Hoare triple {89073#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89073#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:34,108 INFO L273 TraceCheckUtils]: 110: Hoare triple {89073#(<= main_~i~0 35)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89073#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:34,109 INFO L273 TraceCheckUtils]: 111: Hoare triple {89073#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {89074#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:34,109 INFO L273 TraceCheckUtils]: 112: Hoare triple {89074#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89074#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:34,110 INFO L273 TraceCheckUtils]: 113: Hoare triple {89074#(<= main_~i~0 36)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89074#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:34,111 INFO L273 TraceCheckUtils]: 114: Hoare triple {89074#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {89075#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:34,111 INFO L273 TraceCheckUtils]: 115: Hoare triple {89075#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89075#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:34,112 INFO L273 TraceCheckUtils]: 116: Hoare triple {89075#(<= main_~i~0 37)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89075#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:34,112 INFO L273 TraceCheckUtils]: 117: Hoare triple {89075#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {89076#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:34,113 INFO L273 TraceCheckUtils]: 118: Hoare triple {89076#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89076#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:34,113 INFO L273 TraceCheckUtils]: 119: Hoare triple {89076#(<= main_~i~0 38)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89076#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:34,114 INFO L273 TraceCheckUtils]: 120: Hoare triple {89076#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {89077#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:34,115 INFO L273 TraceCheckUtils]: 121: Hoare triple {89077#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89077#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:34,115 INFO L273 TraceCheckUtils]: 122: Hoare triple {89077#(<= main_~i~0 39)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89077#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:34,116 INFO L273 TraceCheckUtils]: 123: Hoare triple {89077#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {89078#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:34,116 INFO L273 TraceCheckUtils]: 124: Hoare triple {89078#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89078#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:34,117 INFO L273 TraceCheckUtils]: 125: Hoare triple {89078#(<= main_~i~0 40)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89078#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:34,117 INFO L273 TraceCheckUtils]: 126: Hoare triple {89078#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {89079#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:34,118 INFO L273 TraceCheckUtils]: 127: Hoare triple {89079#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89079#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:34,118 INFO L273 TraceCheckUtils]: 128: Hoare triple {89079#(<= main_~i~0 41)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89079#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:34,119 INFO L273 TraceCheckUtils]: 129: Hoare triple {89079#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {89080#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:34,120 INFO L273 TraceCheckUtils]: 130: Hoare triple {89080#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89080#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:34,120 INFO L273 TraceCheckUtils]: 131: Hoare triple {89080#(<= main_~i~0 42)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89080#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:34,121 INFO L273 TraceCheckUtils]: 132: Hoare triple {89080#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {89081#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:34,121 INFO L273 TraceCheckUtils]: 133: Hoare triple {89081#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89081#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:34,122 INFO L273 TraceCheckUtils]: 134: Hoare triple {89081#(<= main_~i~0 43)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89081#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:34,123 INFO L273 TraceCheckUtils]: 135: Hoare triple {89081#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {89082#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:34,123 INFO L273 TraceCheckUtils]: 136: Hoare triple {89082#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89082#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:34,124 INFO L273 TraceCheckUtils]: 137: Hoare triple {89082#(<= main_~i~0 44)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89082#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:34,124 INFO L273 TraceCheckUtils]: 138: Hoare triple {89082#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {89083#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:34,125 INFO L273 TraceCheckUtils]: 139: Hoare triple {89083#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89083#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:34,125 INFO L273 TraceCheckUtils]: 140: Hoare triple {89083#(<= main_~i~0 45)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89083#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:34,126 INFO L273 TraceCheckUtils]: 141: Hoare triple {89083#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {89084#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:34,126 INFO L273 TraceCheckUtils]: 142: Hoare triple {89084#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89084#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:34,127 INFO L273 TraceCheckUtils]: 143: Hoare triple {89084#(<= main_~i~0 46)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89084#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:34,128 INFO L273 TraceCheckUtils]: 144: Hoare triple {89084#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {89085#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:34,128 INFO L273 TraceCheckUtils]: 145: Hoare triple {89085#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89085#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:34,129 INFO L273 TraceCheckUtils]: 146: Hoare triple {89085#(<= main_~i~0 47)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89085#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:34,129 INFO L273 TraceCheckUtils]: 147: Hoare triple {89085#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {89086#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:34,130 INFO L273 TraceCheckUtils]: 148: Hoare triple {89086#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89086#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:34,130 INFO L273 TraceCheckUtils]: 149: Hoare triple {89086#(<= main_~i~0 48)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89086#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:34,131 INFO L273 TraceCheckUtils]: 150: Hoare triple {89086#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {89087#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:34,132 INFO L273 TraceCheckUtils]: 151: Hoare triple {89087#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89087#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:34,132 INFO L273 TraceCheckUtils]: 152: Hoare triple {89087#(<= main_~i~0 49)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89087#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:34,133 INFO L273 TraceCheckUtils]: 153: Hoare triple {89087#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {89088#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:34,133 INFO L273 TraceCheckUtils]: 154: Hoare triple {89088#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89088#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:34,134 INFO L273 TraceCheckUtils]: 155: Hoare triple {89088#(<= main_~i~0 50)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89088#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:34,134 INFO L273 TraceCheckUtils]: 156: Hoare triple {89088#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {89089#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:34,135 INFO L273 TraceCheckUtils]: 157: Hoare triple {89089#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89089#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:34,135 INFO L273 TraceCheckUtils]: 158: Hoare triple {89089#(<= main_~i~0 51)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89089#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:34,136 INFO L273 TraceCheckUtils]: 159: Hoare triple {89089#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {89090#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:34,136 INFO L273 TraceCheckUtils]: 160: Hoare triple {89090#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89090#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:34,137 INFO L273 TraceCheckUtils]: 161: Hoare triple {89090#(<= main_~i~0 52)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89090#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:34,138 INFO L273 TraceCheckUtils]: 162: Hoare triple {89090#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {89091#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:34,138 INFO L273 TraceCheckUtils]: 163: Hoare triple {89091#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89091#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:34,139 INFO L273 TraceCheckUtils]: 164: Hoare triple {89091#(<= main_~i~0 53)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89091#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:34,139 INFO L273 TraceCheckUtils]: 165: Hoare triple {89091#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {89092#(<= main_~i~0 54)} is VALID [2018-11-23 11:54:34,140 INFO L273 TraceCheckUtils]: 166: Hoare triple {89092#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89092#(<= main_~i~0 54)} is VALID [2018-11-23 11:54:34,140 INFO L273 TraceCheckUtils]: 167: Hoare triple {89092#(<= main_~i~0 54)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89092#(<= main_~i~0 54)} is VALID [2018-11-23 11:54:34,141 INFO L273 TraceCheckUtils]: 168: Hoare triple {89092#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {89093#(<= main_~i~0 55)} is VALID [2018-11-23 11:54:34,141 INFO L273 TraceCheckUtils]: 169: Hoare triple {89093#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89093#(<= main_~i~0 55)} is VALID [2018-11-23 11:54:34,142 INFO L273 TraceCheckUtils]: 170: Hoare triple {89093#(<= main_~i~0 55)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89093#(<= main_~i~0 55)} is VALID [2018-11-23 11:54:34,143 INFO L273 TraceCheckUtils]: 171: Hoare triple {89093#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {89094#(<= main_~i~0 56)} is VALID [2018-11-23 11:54:34,143 INFO L273 TraceCheckUtils]: 172: Hoare triple {89094#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89094#(<= main_~i~0 56)} is VALID [2018-11-23 11:54:34,144 INFO L273 TraceCheckUtils]: 173: Hoare triple {89094#(<= main_~i~0 56)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89094#(<= main_~i~0 56)} is VALID [2018-11-23 11:54:34,144 INFO L273 TraceCheckUtils]: 174: Hoare triple {89094#(<= main_~i~0 56)} ~i~0 := 1 + ~i~0; {89095#(<= main_~i~0 57)} is VALID [2018-11-23 11:54:34,145 INFO L273 TraceCheckUtils]: 175: Hoare triple {89095#(<= main_~i~0 57)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89095#(<= main_~i~0 57)} is VALID [2018-11-23 11:54:34,145 INFO L273 TraceCheckUtils]: 176: Hoare triple {89095#(<= main_~i~0 57)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89095#(<= main_~i~0 57)} is VALID [2018-11-23 11:54:34,146 INFO L273 TraceCheckUtils]: 177: Hoare triple {89095#(<= main_~i~0 57)} ~i~0 := 1 + ~i~0; {89096#(<= main_~i~0 58)} is VALID [2018-11-23 11:54:34,147 INFO L273 TraceCheckUtils]: 178: Hoare triple {89096#(<= main_~i~0 58)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89096#(<= main_~i~0 58)} is VALID [2018-11-23 11:54:34,147 INFO L273 TraceCheckUtils]: 179: Hoare triple {89096#(<= main_~i~0 58)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89096#(<= main_~i~0 58)} is VALID [2018-11-23 11:54:34,148 INFO L273 TraceCheckUtils]: 180: Hoare triple {89096#(<= main_~i~0 58)} ~i~0 := 1 + ~i~0; {89097#(<= main_~i~0 59)} is VALID [2018-11-23 11:54:34,148 INFO L273 TraceCheckUtils]: 181: Hoare triple {89097#(<= main_~i~0 59)} assume !(~i~0 < 100000); {89038#false} is VALID [2018-11-23 11:54:34,149 INFO L273 TraceCheckUtils]: 182: Hoare triple {89038#false} assume !(0 != ~swapped~0); {89038#false} is VALID [2018-11-23 11:54:34,149 INFO L273 TraceCheckUtils]: 183: Hoare triple {89038#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {89038#false} is VALID [2018-11-23 11:54:34,149 INFO L273 TraceCheckUtils]: 184: Hoare triple {89038#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {89038#false} is VALID [2018-11-23 11:54:34,149 INFO L273 TraceCheckUtils]: 185: Hoare triple {89038#false} assume !!(~y~0 < 100000);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); {89038#false} is VALID [2018-11-23 11:54:34,149 INFO L256 TraceCheckUtils]: 186: Hoare triple {89038#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {89038#false} is VALID [2018-11-23 11:54:34,149 INFO L273 TraceCheckUtils]: 187: Hoare triple {89038#false} ~cond := #in~cond; {89038#false} is VALID [2018-11-23 11:54:34,150 INFO L273 TraceCheckUtils]: 188: Hoare triple {89038#false} assume 0 == ~cond; {89038#false} is VALID [2018-11-23 11:54:34,150 INFO L273 TraceCheckUtils]: 189: Hoare triple {89038#false} assume !false; {89038#false} is VALID [2018-11-23 11:54:34,172 INFO L134 CoverageAnalysis]: Checked inductivity of 5018 backedges. 1 proven. 5017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:34,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:34,173 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:54:34,183 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:54:34,267 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:54:34,267 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:34,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:34,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:34,675 INFO L256 TraceCheckUtils]: 0: Hoare triple {89037#true} call ULTIMATE.init(); {89037#true} is VALID [2018-11-23 11:54:34,676 INFO L273 TraceCheckUtils]: 1: Hoare triple {89037#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {89037#true} is VALID [2018-11-23 11:54:34,676 INFO L273 TraceCheckUtils]: 2: Hoare triple {89037#true} assume true; {89037#true} is VALID [2018-11-23 11:54:34,676 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {89037#true} {89037#true} #79#return; {89037#true} is VALID [2018-11-23 11:54:34,676 INFO L256 TraceCheckUtils]: 4: Hoare triple {89037#true} call #t~ret8 := main(); {89037#true} is VALID [2018-11-23 11:54:34,676 INFO L273 TraceCheckUtils]: 5: Hoare triple {89037#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {89037#true} is VALID [2018-11-23 11:54:34,677 INFO L273 TraceCheckUtils]: 6: Hoare triple {89037#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {89119#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:34,677 INFO L273 TraceCheckUtils]: 7: Hoare triple {89119#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89119#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:34,678 INFO L273 TraceCheckUtils]: 8: Hoare triple {89119#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89119#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:34,678 INFO L273 TraceCheckUtils]: 9: Hoare triple {89119#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {89040#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:34,679 INFO L273 TraceCheckUtils]: 10: Hoare triple {89040#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89040#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:34,679 INFO L273 TraceCheckUtils]: 11: Hoare triple {89040#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89040#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:34,680 INFO L273 TraceCheckUtils]: 12: Hoare triple {89040#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {89041#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:34,680 INFO L273 TraceCheckUtils]: 13: Hoare triple {89041#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89041#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:34,680 INFO L273 TraceCheckUtils]: 14: Hoare triple {89041#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89041#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:34,681 INFO L273 TraceCheckUtils]: 15: Hoare triple {89041#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {89042#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:34,681 INFO L273 TraceCheckUtils]: 16: Hoare triple {89042#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89042#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:34,682 INFO L273 TraceCheckUtils]: 17: Hoare triple {89042#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89042#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:34,682 INFO L273 TraceCheckUtils]: 18: Hoare triple {89042#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {89043#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:34,683 INFO L273 TraceCheckUtils]: 19: Hoare triple {89043#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89043#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:34,683 INFO L273 TraceCheckUtils]: 20: Hoare triple {89043#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89043#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:34,684 INFO L273 TraceCheckUtils]: 21: Hoare triple {89043#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {89044#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:34,684 INFO L273 TraceCheckUtils]: 22: Hoare triple {89044#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89044#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:34,685 INFO L273 TraceCheckUtils]: 23: Hoare triple {89044#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89044#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:34,686 INFO L273 TraceCheckUtils]: 24: Hoare triple {89044#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {89045#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:34,686 INFO L273 TraceCheckUtils]: 25: Hoare triple {89045#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89045#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:34,686 INFO L273 TraceCheckUtils]: 26: Hoare triple {89045#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89045#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:34,687 INFO L273 TraceCheckUtils]: 27: Hoare triple {89045#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {89046#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:34,688 INFO L273 TraceCheckUtils]: 28: Hoare triple {89046#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89046#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:34,688 INFO L273 TraceCheckUtils]: 29: Hoare triple {89046#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89046#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:34,689 INFO L273 TraceCheckUtils]: 30: Hoare triple {89046#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {89047#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:34,689 INFO L273 TraceCheckUtils]: 31: Hoare triple {89047#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89047#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:34,690 INFO L273 TraceCheckUtils]: 32: Hoare triple {89047#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89047#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:34,691 INFO L273 TraceCheckUtils]: 33: Hoare triple {89047#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {89048#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:34,691 INFO L273 TraceCheckUtils]: 34: Hoare triple {89048#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89048#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:34,692 INFO L273 TraceCheckUtils]: 35: Hoare triple {89048#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89048#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:34,692 INFO L273 TraceCheckUtils]: 36: Hoare triple {89048#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {89049#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:34,693 INFO L273 TraceCheckUtils]: 37: Hoare triple {89049#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89049#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:34,693 INFO L273 TraceCheckUtils]: 38: Hoare triple {89049#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89049#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:34,694 INFO L273 TraceCheckUtils]: 39: Hoare triple {89049#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {89050#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:34,695 INFO L273 TraceCheckUtils]: 40: Hoare triple {89050#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89050#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:34,695 INFO L273 TraceCheckUtils]: 41: Hoare triple {89050#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89050#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:34,696 INFO L273 TraceCheckUtils]: 42: Hoare triple {89050#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {89051#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:34,696 INFO L273 TraceCheckUtils]: 43: Hoare triple {89051#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89051#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:34,697 INFO L273 TraceCheckUtils]: 44: Hoare triple {89051#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89051#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:34,697 INFO L273 TraceCheckUtils]: 45: Hoare triple {89051#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {89052#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:34,698 INFO L273 TraceCheckUtils]: 46: Hoare triple {89052#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89052#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:34,698 INFO L273 TraceCheckUtils]: 47: Hoare triple {89052#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89052#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:34,699 INFO L273 TraceCheckUtils]: 48: Hoare triple {89052#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {89053#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:34,700 INFO L273 TraceCheckUtils]: 49: Hoare triple {89053#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89053#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:34,700 INFO L273 TraceCheckUtils]: 50: Hoare triple {89053#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89053#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:34,701 INFO L273 TraceCheckUtils]: 51: Hoare triple {89053#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {89054#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:34,701 INFO L273 TraceCheckUtils]: 52: Hoare triple {89054#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89054#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:34,702 INFO L273 TraceCheckUtils]: 53: Hoare triple {89054#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89054#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:34,703 INFO L273 TraceCheckUtils]: 54: Hoare triple {89054#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {89055#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:34,703 INFO L273 TraceCheckUtils]: 55: Hoare triple {89055#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89055#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:34,704 INFO L273 TraceCheckUtils]: 56: Hoare triple {89055#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89055#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:34,704 INFO L273 TraceCheckUtils]: 57: Hoare triple {89055#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {89056#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:34,705 INFO L273 TraceCheckUtils]: 58: Hoare triple {89056#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89056#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:34,705 INFO L273 TraceCheckUtils]: 59: Hoare triple {89056#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89056#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:34,706 INFO L273 TraceCheckUtils]: 60: Hoare triple {89056#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {89057#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:34,707 INFO L273 TraceCheckUtils]: 61: Hoare triple {89057#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89057#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:34,707 INFO L273 TraceCheckUtils]: 62: Hoare triple {89057#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89057#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:34,708 INFO L273 TraceCheckUtils]: 63: Hoare triple {89057#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {89058#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:34,708 INFO L273 TraceCheckUtils]: 64: Hoare triple {89058#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89058#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:34,709 INFO L273 TraceCheckUtils]: 65: Hoare triple {89058#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89058#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:34,709 INFO L273 TraceCheckUtils]: 66: Hoare triple {89058#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {89059#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:34,710 INFO L273 TraceCheckUtils]: 67: Hoare triple {89059#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89059#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:34,710 INFO L273 TraceCheckUtils]: 68: Hoare triple {89059#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89059#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:34,711 INFO L273 TraceCheckUtils]: 69: Hoare triple {89059#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {89060#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:34,712 INFO L273 TraceCheckUtils]: 70: Hoare triple {89060#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89060#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:34,712 INFO L273 TraceCheckUtils]: 71: Hoare triple {89060#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89060#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:34,713 INFO L273 TraceCheckUtils]: 72: Hoare triple {89060#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {89061#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:34,713 INFO L273 TraceCheckUtils]: 73: Hoare triple {89061#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89061#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:34,714 INFO L273 TraceCheckUtils]: 74: Hoare triple {89061#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89061#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:34,715 INFO L273 TraceCheckUtils]: 75: Hoare triple {89061#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {89062#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:34,715 INFO L273 TraceCheckUtils]: 76: Hoare triple {89062#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89062#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:34,716 INFO L273 TraceCheckUtils]: 77: Hoare triple {89062#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89062#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:34,716 INFO L273 TraceCheckUtils]: 78: Hoare triple {89062#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {89063#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:34,717 INFO L273 TraceCheckUtils]: 79: Hoare triple {89063#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89063#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:34,717 INFO L273 TraceCheckUtils]: 80: Hoare triple {89063#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89063#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:34,718 INFO L273 TraceCheckUtils]: 81: Hoare triple {89063#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {89064#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:34,719 INFO L273 TraceCheckUtils]: 82: Hoare triple {89064#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89064#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:34,719 INFO L273 TraceCheckUtils]: 83: Hoare triple {89064#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89064#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:34,720 INFO L273 TraceCheckUtils]: 84: Hoare triple {89064#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {89065#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:34,720 INFO L273 TraceCheckUtils]: 85: Hoare triple {89065#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89065#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:34,721 INFO L273 TraceCheckUtils]: 86: Hoare triple {89065#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89065#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:34,721 INFO L273 TraceCheckUtils]: 87: Hoare triple {89065#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {89066#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:34,722 INFO L273 TraceCheckUtils]: 88: Hoare triple {89066#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89066#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:34,722 INFO L273 TraceCheckUtils]: 89: Hoare triple {89066#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89066#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:34,723 INFO L273 TraceCheckUtils]: 90: Hoare triple {89066#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {89067#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:34,724 INFO L273 TraceCheckUtils]: 91: Hoare triple {89067#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89067#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:34,724 INFO L273 TraceCheckUtils]: 92: Hoare triple {89067#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89067#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:34,725 INFO L273 TraceCheckUtils]: 93: Hoare triple {89067#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {89068#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:34,725 INFO L273 TraceCheckUtils]: 94: Hoare triple {89068#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89068#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:34,726 INFO L273 TraceCheckUtils]: 95: Hoare triple {89068#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89068#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:34,727 INFO L273 TraceCheckUtils]: 96: Hoare triple {89068#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {89069#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:34,727 INFO L273 TraceCheckUtils]: 97: Hoare triple {89069#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89069#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:34,728 INFO L273 TraceCheckUtils]: 98: Hoare triple {89069#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89069#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:34,728 INFO L273 TraceCheckUtils]: 99: Hoare triple {89069#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {89070#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:34,729 INFO L273 TraceCheckUtils]: 100: Hoare triple {89070#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89070#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:34,729 INFO L273 TraceCheckUtils]: 101: Hoare triple {89070#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89070#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:34,730 INFO L273 TraceCheckUtils]: 102: Hoare triple {89070#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {89071#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:34,731 INFO L273 TraceCheckUtils]: 103: Hoare triple {89071#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89071#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:34,731 INFO L273 TraceCheckUtils]: 104: Hoare triple {89071#(<= main_~i~0 33)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89071#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:34,732 INFO L273 TraceCheckUtils]: 105: Hoare triple {89071#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {89072#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:34,732 INFO L273 TraceCheckUtils]: 106: Hoare triple {89072#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89072#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:34,733 INFO L273 TraceCheckUtils]: 107: Hoare triple {89072#(<= main_~i~0 34)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89072#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:34,733 INFO L273 TraceCheckUtils]: 108: Hoare triple {89072#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {89073#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:34,734 INFO L273 TraceCheckUtils]: 109: Hoare triple {89073#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89073#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:34,734 INFO L273 TraceCheckUtils]: 110: Hoare triple {89073#(<= main_~i~0 35)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89073#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:34,735 INFO L273 TraceCheckUtils]: 111: Hoare triple {89073#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {89074#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:34,736 INFO L273 TraceCheckUtils]: 112: Hoare triple {89074#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89074#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:34,736 INFO L273 TraceCheckUtils]: 113: Hoare triple {89074#(<= main_~i~0 36)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89074#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:34,737 INFO L273 TraceCheckUtils]: 114: Hoare triple {89074#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {89075#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:34,737 INFO L273 TraceCheckUtils]: 115: Hoare triple {89075#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89075#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:34,738 INFO L273 TraceCheckUtils]: 116: Hoare triple {89075#(<= main_~i~0 37)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89075#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:34,739 INFO L273 TraceCheckUtils]: 117: Hoare triple {89075#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {89076#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:34,739 INFO L273 TraceCheckUtils]: 118: Hoare triple {89076#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89076#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:34,740 INFO L273 TraceCheckUtils]: 119: Hoare triple {89076#(<= main_~i~0 38)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89076#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:34,740 INFO L273 TraceCheckUtils]: 120: Hoare triple {89076#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {89077#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:34,741 INFO L273 TraceCheckUtils]: 121: Hoare triple {89077#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89077#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:34,741 INFO L273 TraceCheckUtils]: 122: Hoare triple {89077#(<= main_~i~0 39)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89077#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:34,742 INFO L273 TraceCheckUtils]: 123: Hoare triple {89077#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {89078#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:34,742 INFO L273 TraceCheckUtils]: 124: Hoare triple {89078#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89078#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:34,743 INFO L273 TraceCheckUtils]: 125: Hoare triple {89078#(<= main_~i~0 40)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89078#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:34,744 INFO L273 TraceCheckUtils]: 126: Hoare triple {89078#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {89079#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:34,744 INFO L273 TraceCheckUtils]: 127: Hoare triple {89079#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89079#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:34,745 INFO L273 TraceCheckUtils]: 128: Hoare triple {89079#(<= main_~i~0 41)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89079#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:34,745 INFO L273 TraceCheckUtils]: 129: Hoare triple {89079#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {89080#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:34,746 INFO L273 TraceCheckUtils]: 130: Hoare triple {89080#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89080#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:34,746 INFO L273 TraceCheckUtils]: 131: Hoare triple {89080#(<= main_~i~0 42)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89080#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:34,747 INFO L273 TraceCheckUtils]: 132: Hoare triple {89080#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {89081#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:34,748 INFO L273 TraceCheckUtils]: 133: Hoare triple {89081#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89081#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:34,748 INFO L273 TraceCheckUtils]: 134: Hoare triple {89081#(<= main_~i~0 43)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89081#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:34,749 INFO L273 TraceCheckUtils]: 135: Hoare triple {89081#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {89082#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:34,749 INFO L273 TraceCheckUtils]: 136: Hoare triple {89082#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89082#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:34,750 INFO L273 TraceCheckUtils]: 137: Hoare triple {89082#(<= main_~i~0 44)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89082#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:34,751 INFO L273 TraceCheckUtils]: 138: Hoare triple {89082#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {89083#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:34,751 INFO L273 TraceCheckUtils]: 139: Hoare triple {89083#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89083#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:34,752 INFO L273 TraceCheckUtils]: 140: Hoare triple {89083#(<= main_~i~0 45)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89083#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:34,752 INFO L273 TraceCheckUtils]: 141: Hoare triple {89083#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {89084#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:34,753 INFO L273 TraceCheckUtils]: 142: Hoare triple {89084#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89084#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:34,753 INFO L273 TraceCheckUtils]: 143: Hoare triple {89084#(<= main_~i~0 46)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89084#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:34,754 INFO L273 TraceCheckUtils]: 144: Hoare triple {89084#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {89085#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:34,755 INFO L273 TraceCheckUtils]: 145: Hoare triple {89085#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89085#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:34,755 INFO L273 TraceCheckUtils]: 146: Hoare triple {89085#(<= main_~i~0 47)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89085#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:34,756 INFO L273 TraceCheckUtils]: 147: Hoare triple {89085#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {89086#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:34,756 INFO L273 TraceCheckUtils]: 148: Hoare triple {89086#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89086#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:34,757 INFO L273 TraceCheckUtils]: 149: Hoare triple {89086#(<= main_~i~0 48)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89086#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:34,757 INFO L273 TraceCheckUtils]: 150: Hoare triple {89086#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {89087#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:34,758 INFO L273 TraceCheckUtils]: 151: Hoare triple {89087#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89087#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:34,758 INFO L273 TraceCheckUtils]: 152: Hoare triple {89087#(<= main_~i~0 49)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89087#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:34,759 INFO L273 TraceCheckUtils]: 153: Hoare triple {89087#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {89088#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:34,760 INFO L273 TraceCheckUtils]: 154: Hoare triple {89088#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89088#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:34,760 INFO L273 TraceCheckUtils]: 155: Hoare triple {89088#(<= main_~i~0 50)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89088#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:34,761 INFO L273 TraceCheckUtils]: 156: Hoare triple {89088#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {89089#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:34,761 INFO L273 TraceCheckUtils]: 157: Hoare triple {89089#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89089#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:34,762 INFO L273 TraceCheckUtils]: 158: Hoare triple {89089#(<= main_~i~0 51)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89089#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:34,763 INFO L273 TraceCheckUtils]: 159: Hoare triple {89089#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {89090#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:34,763 INFO L273 TraceCheckUtils]: 160: Hoare triple {89090#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89090#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:34,764 INFO L273 TraceCheckUtils]: 161: Hoare triple {89090#(<= main_~i~0 52)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89090#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:34,764 INFO L273 TraceCheckUtils]: 162: Hoare triple {89090#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {89091#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:34,765 INFO L273 TraceCheckUtils]: 163: Hoare triple {89091#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89091#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:34,765 INFO L273 TraceCheckUtils]: 164: Hoare triple {89091#(<= main_~i~0 53)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89091#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:34,766 INFO L273 TraceCheckUtils]: 165: Hoare triple {89091#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {89092#(<= main_~i~0 54)} is VALID [2018-11-23 11:54:34,767 INFO L273 TraceCheckUtils]: 166: Hoare triple {89092#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89092#(<= main_~i~0 54)} is VALID [2018-11-23 11:54:34,767 INFO L273 TraceCheckUtils]: 167: Hoare triple {89092#(<= main_~i~0 54)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89092#(<= main_~i~0 54)} is VALID [2018-11-23 11:54:34,768 INFO L273 TraceCheckUtils]: 168: Hoare triple {89092#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {89093#(<= main_~i~0 55)} is VALID [2018-11-23 11:54:34,768 INFO L273 TraceCheckUtils]: 169: Hoare triple {89093#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89093#(<= main_~i~0 55)} is VALID [2018-11-23 11:54:34,769 INFO L273 TraceCheckUtils]: 170: Hoare triple {89093#(<= main_~i~0 55)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89093#(<= main_~i~0 55)} is VALID [2018-11-23 11:54:34,769 INFO L273 TraceCheckUtils]: 171: Hoare triple {89093#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {89094#(<= main_~i~0 56)} is VALID [2018-11-23 11:54:34,770 INFO L273 TraceCheckUtils]: 172: Hoare triple {89094#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89094#(<= main_~i~0 56)} is VALID [2018-11-23 11:54:34,770 INFO L273 TraceCheckUtils]: 173: Hoare triple {89094#(<= main_~i~0 56)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89094#(<= main_~i~0 56)} is VALID [2018-11-23 11:54:34,771 INFO L273 TraceCheckUtils]: 174: Hoare triple {89094#(<= main_~i~0 56)} ~i~0 := 1 + ~i~0; {89095#(<= main_~i~0 57)} is VALID [2018-11-23 11:54:34,772 INFO L273 TraceCheckUtils]: 175: Hoare triple {89095#(<= main_~i~0 57)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89095#(<= main_~i~0 57)} is VALID [2018-11-23 11:54:34,772 INFO L273 TraceCheckUtils]: 176: Hoare triple {89095#(<= main_~i~0 57)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89095#(<= main_~i~0 57)} is VALID [2018-11-23 11:54:34,773 INFO L273 TraceCheckUtils]: 177: Hoare triple {89095#(<= main_~i~0 57)} ~i~0 := 1 + ~i~0; {89096#(<= main_~i~0 58)} is VALID [2018-11-23 11:54:34,773 INFO L273 TraceCheckUtils]: 178: Hoare triple {89096#(<= main_~i~0 58)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {89096#(<= main_~i~0 58)} is VALID [2018-11-23 11:54:34,774 INFO L273 TraceCheckUtils]: 179: Hoare triple {89096#(<= main_~i~0 58)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {89096#(<= main_~i~0 58)} is VALID [2018-11-23 11:54:34,775 INFO L273 TraceCheckUtils]: 180: Hoare triple {89096#(<= main_~i~0 58)} ~i~0 := 1 + ~i~0; {89097#(<= main_~i~0 59)} is VALID [2018-11-23 11:54:34,775 INFO L273 TraceCheckUtils]: 181: Hoare triple {89097#(<= main_~i~0 59)} assume !(~i~0 < 100000); {89038#false} is VALID [2018-11-23 11:54:34,775 INFO L273 TraceCheckUtils]: 182: Hoare triple {89038#false} assume !(0 != ~swapped~0); {89038#false} is VALID [2018-11-23 11:54:34,776 INFO L273 TraceCheckUtils]: 183: Hoare triple {89038#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {89038#false} is VALID [2018-11-23 11:54:34,776 INFO L273 TraceCheckUtils]: 184: Hoare triple {89038#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {89038#false} is VALID [2018-11-23 11:54:34,776 INFO L273 TraceCheckUtils]: 185: Hoare triple {89038#false} assume !!(~y~0 < 100000);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); {89038#false} is VALID [2018-11-23 11:54:34,776 INFO L256 TraceCheckUtils]: 186: Hoare triple {89038#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {89038#false} is VALID [2018-11-23 11:54:34,776 INFO L273 TraceCheckUtils]: 187: Hoare triple {89038#false} ~cond := #in~cond; {89038#false} is VALID [2018-11-23 11:54:34,777 INFO L273 TraceCheckUtils]: 188: Hoare triple {89038#false} assume 0 == ~cond; {89038#false} is VALID [2018-11-23 11:54:34,777 INFO L273 TraceCheckUtils]: 189: Hoare triple {89038#false} assume !false; {89038#false} is VALID [2018-11-23 11:54:34,800 INFO L134 CoverageAnalysis]: Checked inductivity of 5018 backedges. 1 proven. 5017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:34,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:34,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 62 [2018-11-23 11:54:34,819 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 190 [2018-11-23 11:54:34,819 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:34,819 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 62 states. [2018-11-23 11:54:35,005 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:35,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-11-23 11:54:35,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-11-23 11:54:35,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-11-23 11:54:35,006 INFO L87 Difference]: Start difference. First operand 369 states and 488 transitions. Second operand 62 states. [2018-11-23 11:54:36,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:36,020 INFO L93 Difference]: Finished difference Result 742 states and 986 transitions. [2018-11-23 11:54:36,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-11-23 11:54:36,020 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 190 [2018-11-23 11:54:36,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:36,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-23 11:54:36,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 285 transitions. [2018-11-23 11:54:36,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-23 11:54:36,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 285 transitions. [2018-11-23 11:54:36,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 61 states and 285 transitions. [2018-11-23 11:54:36,299 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 285 edges. 285 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:36,309 INFO L225 Difference]: With dead ends: 742 [2018-11-23 11:54:36,309 INFO L226 Difference]: Without dead ends: 379 [2018-11-23 11:54:36,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-11-23 11:54:36,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-11-23 11:54:36,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 375. [2018-11-23 11:54:36,441 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:36,441 INFO L82 GeneralOperation]: Start isEquivalent. First operand 379 states. Second operand 375 states. [2018-11-23 11:54:36,442 INFO L74 IsIncluded]: Start isIncluded. First operand 379 states. Second operand 375 states. [2018-11-23 11:54:36,442 INFO L87 Difference]: Start difference. First operand 379 states. Second operand 375 states. [2018-11-23 11:54:36,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:36,450 INFO L93 Difference]: Finished difference Result 379 states and 502 transitions. [2018-11-23 11:54:36,450 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 502 transitions. [2018-11-23 11:54:36,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:36,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:36,451 INFO L74 IsIncluded]: Start isIncluded. First operand 375 states. Second operand 379 states. [2018-11-23 11:54:36,451 INFO L87 Difference]: Start difference. First operand 375 states. Second operand 379 states. [2018-11-23 11:54:36,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:36,458 INFO L93 Difference]: Finished difference Result 379 states and 502 transitions. [2018-11-23 11:54:36,458 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 502 transitions. [2018-11-23 11:54:36,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:36,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:36,458 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:36,458 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:36,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-11-23 11:54:36,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 496 transitions. [2018-11-23 11:54:36,465 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 496 transitions. Word has length 190 [2018-11-23 11:54:36,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:36,466 INFO L480 AbstractCegarLoop]: Abstraction has 375 states and 496 transitions. [2018-11-23 11:54:36,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-11-23 11:54:36,466 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 496 transitions. [2018-11-23 11:54:36,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-11-23 11:54:36,466 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:36,467 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:36,467 INFO L423 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:36,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:36,467 INFO L82 PathProgramCache]: Analyzing trace with hash 145664744, now seen corresponding path program 59 times [2018-11-23 11:54:36,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:36,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:36,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:36,468 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:36,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:36,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:38,272 INFO L256 TraceCheckUtils]: 0: Hoare triple {91924#true} call ULTIMATE.init(); {91924#true} is VALID [2018-11-23 11:54:38,272 INFO L273 TraceCheckUtils]: 1: Hoare triple {91924#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {91924#true} is VALID [2018-11-23 11:54:38,272 INFO L273 TraceCheckUtils]: 2: Hoare triple {91924#true} assume true; {91924#true} is VALID [2018-11-23 11:54:38,272 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {91924#true} {91924#true} #79#return; {91924#true} is VALID [2018-11-23 11:54:38,272 INFO L256 TraceCheckUtils]: 4: Hoare triple {91924#true} call #t~ret8 := main(); {91924#true} is VALID [2018-11-23 11:54:38,272 INFO L273 TraceCheckUtils]: 5: Hoare triple {91924#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {91924#true} is VALID [2018-11-23 11:54:38,273 INFO L273 TraceCheckUtils]: 6: Hoare triple {91924#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {91926#(= main_~i~0 1)} is VALID [2018-11-23 11:54:38,273 INFO L273 TraceCheckUtils]: 7: Hoare triple {91926#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91926#(= main_~i~0 1)} is VALID [2018-11-23 11:54:38,273 INFO L273 TraceCheckUtils]: 8: Hoare triple {91926#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91926#(= main_~i~0 1)} is VALID [2018-11-23 11:54:38,274 INFO L273 TraceCheckUtils]: 9: Hoare triple {91926#(= main_~i~0 1)} ~i~0 := 1 + ~i~0; {91927#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:38,274 INFO L273 TraceCheckUtils]: 10: Hoare triple {91927#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91927#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:38,274 INFO L273 TraceCheckUtils]: 11: Hoare triple {91927#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91927#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:38,275 INFO L273 TraceCheckUtils]: 12: Hoare triple {91927#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {91928#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:38,275 INFO L273 TraceCheckUtils]: 13: Hoare triple {91928#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91928#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:38,275 INFO L273 TraceCheckUtils]: 14: Hoare triple {91928#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91928#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:38,276 INFO L273 TraceCheckUtils]: 15: Hoare triple {91928#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {91929#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:38,276 INFO L273 TraceCheckUtils]: 16: Hoare triple {91929#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91929#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:38,277 INFO L273 TraceCheckUtils]: 17: Hoare triple {91929#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91929#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:38,278 INFO L273 TraceCheckUtils]: 18: Hoare triple {91929#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {91930#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:38,278 INFO L273 TraceCheckUtils]: 19: Hoare triple {91930#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91930#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:38,278 INFO L273 TraceCheckUtils]: 20: Hoare triple {91930#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91930#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:38,279 INFO L273 TraceCheckUtils]: 21: Hoare triple {91930#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {91931#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:38,280 INFO L273 TraceCheckUtils]: 22: Hoare triple {91931#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91931#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:38,280 INFO L273 TraceCheckUtils]: 23: Hoare triple {91931#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91931#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:38,281 INFO L273 TraceCheckUtils]: 24: Hoare triple {91931#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {91932#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:38,281 INFO L273 TraceCheckUtils]: 25: Hoare triple {91932#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91932#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:38,282 INFO L273 TraceCheckUtils]: 26: Hoare triple {91932#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91932#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:38,282 INFO L273 TraceCheckUtils]: 27: Hoare triple {91932#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {91933#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:38,283 INFO L273 TraceCheckUtils]: 28: Hoare triple {91933#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91933#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:38,283 INFO L273 TraceCheckUtils]: 29: Hoare triple {91933#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91933#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:38,284 INFO L273 TraceCheckUtils]: 30: Hoare triple {91933#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {91934#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:38,284 INFO L273 TraceCheckUtils]: 31: Hoare triple {91934#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91934#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:38,285 INFO L273 TraceCheckUtils]: 32: Hoare triple {91934#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91934#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:38,286 INFO L273 TraceCheckUtils]: 33: Hoare triple {91934#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {91935#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:38,286 INFO L273 TraceCheckUtils]: 34: Hoare triple {91935#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91935#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:38,287 INFO L273 TraceCheckUtils]: 35: Hoare triple {91935#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91935#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:38,287 INFO L273 TraceCheckUtils]: 36: Hoare triple {91935#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {91936#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:38,288 INFO L273 TraceCheckUtils]: 37: Hoare triple {91936#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91936#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:38,288 INFO L273 TraceCheckUtils]: 38: Hoare triple {91936#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91936#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:38,289 INFO L273 TraceCheckUtils]: 39: Hoare triple {91936#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {91937#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:38,289 INFO L273 TraceCheckUtils]: 40: Hoare triple {91937#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91937#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:38,290 INFO L273 TraceCheckUtils]: 41: Hoare triple {91937#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91937#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:38,291 INFO L273 TraceCheckUtils]: 42: Hoare triple {91937#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {91938#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:38,291 INFO L273 TraceCheckUtils]: 43: Hoare triple {91938#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91938#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:38,292 INFO L273 TraceCheckUtils]: 44: Hoare triple {91938#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91938#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:38,292 INFO L273 TraceCheckUtils]: 45: Hoare triple {91938#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {91939#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:38,293 INFO L273 TraceCheckUtils]: 46: Hoare triple {91939#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91939#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:38,293 INFO L273 TraceCheckUtils]: 47: Hoare triple {91939#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91939#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:38,294 INFO L273 TraceCheckUtils]: 48: Hoare triple {91939#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {91940#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:38,294 INFO L273 TraceCheckUtils]: 49: Hoare triple {91940#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91940#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:38,295 INFO L273 TraceCheckUtils]: 50: Hoare triple {91940#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91940#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:38,295 INFO L273 TraceCheckUtils]: 51: Hoare triple {91940#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {91941#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:38,296 INFO L273 TraceCheckUtils]: 52: Hoare triple {91941#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91941#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:38,296 INFO L273 TraceCheckUtils]: 53: Hoare triple {91941#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91941#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:38,297 INFO L273 TraceCheckUtils]: 54: Hoare triple {91941#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {91942#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:38,298 INFO L273 TraceCheckUtils]: 55: Hoare triple {91942#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91942#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:38,298 INFO L273 TraceCheckUtils]: 56: Hoare triple {91942#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91942#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:38,299 INFO L273 TraceCheckUtils]: 57: Hoare triple {91942#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {91943#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:38,299 INFO L273 TraceCheckUtils]: 58: Hoare triple {91943#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91943#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:38,300 INFO L273 TraceCheckUtils]: 59: Hoare triple {91943#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91943#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:38,300 INFO L273 TraceCheckUtils]: 60: Hoare triple {91943#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {91944#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:38,301 INFO L273 TraceCheckUtils]: 61: Hoare triple {91944#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91944#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:38,301 INFO L273 TraceCheckUtils]: 62: Hoare triple {91944#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91944#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:38,302 INFO L273 TraceCheckUtils]: 63: Hoare triple {91944#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {91945#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:38,302 INFO L273 TraceCheckUtils]: 64: Hoare triple {91945#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91945#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:38,303 INFO L273 TraceCheckUtils]: 65: Hoare triple {91945#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91945#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:38,304 INFO L273 TraceCheckUtils]: 66: Hoare triple {91945#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {91946#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:38,304 INFO L273 TraceCheckUtils]: 67: Hoare triple {91946#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91946#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:38,305 INFO L273 TraceCheckUtils]: 68: Hoare triple {91946#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91946#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:38,305 INFO L273 TraceCheckUtils]: 69: Hoare triple {91946#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {91947#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:38,306 INFO L273 TraceCheckUtils]: 70: Hoare triple {91947#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91947#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:38,306 INFO L273 TraceCheckUtils]: 71: Hoare triple {91947#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91947#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:38,307 INFO L273 TraceCheckUtils]: 72: Hoare triple {91947#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {91948#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:38,307 INFO L273 TraceCheckUtils]: 73: Hoare triple {91948#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91948#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:38,308 INFO L273 TraceCheckUtils]: 74: Hoare triple {91948#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91948#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:38,308 INFO L273 TraceCheckUtils]: 75: Hoare triple {91948#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {91949#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:38,309 INFO L273 TraceCheckUtils]: 76: Hoare triple {91949#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91949#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:38,309 INFO L273 TraceCheckUtils]: 77: Hoare triple {91949#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91949#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:38,310 INFO L273 TraceCheckUtils]: 78: Hoare triple {91949#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {91950#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:38,311 INFO L273 TraceCheckUtils]: 79: Hoare triple {91950#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91950#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:38,311 INFO L273 TraceCheckUtils]: 80: Hoare triple {91950#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91950#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:38,312 INFO L273 TraceCheckUtils]: 81: Hoare triple {91950#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {91951#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:38,312 INFO L273 TraceCheckUtils]: 82: Hoare triple {91951#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91951#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:38,313 INFO L273 TraceCheckUtils]: 83: Hoare triple {91951#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91951#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:38,313 INFO L273 TraceCheckUtils]: 84: Hoare triple {91951#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {91952#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:38,314 INFO L273 TraceCheckUtils]: 85: Hoare triple {91952#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91952#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:38,314 INFO L273 TraceCheckUtils]: 86: Hoare triple {91952#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91952#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:38,315 INFO L273 TraceCheckUtils]: 87: Hoare triple {91952#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {91953#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:38,315 INFO L273 TraceCheckUtils]: 88: Hoare triple {91953#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91953#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:38,316 INFO L273 TraceCheckUtils]: 89: Hoare triple {91953#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91953#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:38,317 INFO L273 TraceCheckUtils]: 90: Hoare triple {91953#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {91954#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:38,317 INFO L273 TraceCheckUtils]: 91: Hoare triple {91954#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91954#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:38,317 INFO L273 TraceCheckUtils]: 92: Hoare triple {91954#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91954#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:38,318 INFO L273 TraceCheckUtils]: 93: Hoare triple {91954#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {91955#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:38,319 INFO L273 TraceCheckUtils]: 94: Hoare triple {91955#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91955#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:38,319 INFO L273 TraceCheckUtils]: 95: Hoare triple {91955#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91955#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:38,320 INFO L273 TraceCheckUtils]: 96: Hoare triple {91955#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {91956#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:38,320 INFO L273 TraceCheckUtils]: 97: Hoare triple {91956#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91956#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:38,321 INFO L273 TraceCheckUtils]: 98: Hoare triple {91956#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91956#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:38,321 INFO L273 TraceCheckUtils]: 99: Hoare triple {91956#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {91957#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:38,322 INFO L273 TraceCheckUtils]: 100: Hoare triple {91957#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91957#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:38,322 INFO L273 TraceCheckUtils]: 101: Hoare triple {91957#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91957#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:38,323 INFO L273 TraceCheckUtils]: 102: Hoare triple {91957#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {91958#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:38,324 INFO L273 TraceCheckUtils]: 103: Hoare triple {91958#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91958#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:38,324 INFO L273 TraceCheckUtils]: 104: Hoare triple {91958#(<= main_~i~0 33)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91958#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:38,325 INFO L273 TraceCheckUtils]: 105: Hoare triple {91958#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {91959#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:38,325 INFO L273 TraceCheckUtils]: 106: Hoare triple {91959#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91959#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:38,326 INFO L273 TraceCheckUtils]: 107: Hoare triple {91959#(<= main_~i~0 34)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91959#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:38,326 INFO L273 TraceCheckUtils]: 108: Hoare triple {91959#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {91960#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:38,327 INFO L273 TraceCheckUtils]: 109: Hoare triple {91960#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91960#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:38,327 INFO L273 TraceCheckUtils]: 110: Hoare triple {91960#(<= main_~i~0 35)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91960#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:38,328 INFO L273 TraceCheckUtils]: 111: Hoare triple {91960#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {91961#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:38,328 INFO L273 TraceCheckUtils]: 112: Hoare triple {91961#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91961#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:38,329 INFO L273 TraceCheckUtils]: 113: Hoare triple {91961#(<= main_~i~0 36)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91961#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:38,330 INFO L273 TraceCheckUtils]: 114: Hoare triple {91961#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {91962#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:38,330 INFO L273 TraceCheckUtils]: 115: Hoare triple {91962#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91962#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:38,330 INFO L273 TraceCheckUtils]: 116: Hoare triple {91962#(<= main_~i~0 37)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91962#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:38,331 INFO L273 TraceCheckUtils]: 117: Hoare triple {91962#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {91963#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:38,332 INFO L273 TraceCheckUtils]: 118: Hoare triple {91963#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91963#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:38,332 INFO L273 TraceCheckUtils]: 119: Hoare triple {91963#(<= main_~i~0 38)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91963#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:38,333 INFO L273 TraceCheckUtils]: 120: Hoare triple {91963#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {91964#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:38,333 INFO L273 TraceCheckUtils]: 121: Hoare triple {91964#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91964#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:38,334 INFO L273 TraceCheckUtils]: 122: Hoare triple {91964#(<= main_~i~0 39)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91964#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:38,334 INFO L273 TraceCheckUtils]: 123: Hoare triple {91964#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {91965#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:38,335 INFO L273 TraceCheckUtils]: 124: Hoare triple {91965#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91965#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:38,335 INFO L273 TraceCheckUtils]: 125: Hoare triple {91965#(<= main_~i~0 40)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91965#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:38,336 INFO L273 TraceCheckUtils]: 126: Hoare triple {91965#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {91966#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:38,336 INFO L273 TraceCheckUtils]: 127: Hoare triple {91966#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91966#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:38,337 INFO L273 TraceCheckUtils]: 128: Hoare triple {91966#(<= main_~i~0 41)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91966#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:38,338 INFO L273 TraceCheckUtils]: 129: Hoare triple {91966#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {91967#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:38,338 INFO L273 TraceCheckUtils]: 130: Hoare triple {91967#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91967#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:38,339 INFO L273 TraceCheckUtils]: 131: Hoare triple {91967#(<= main_~i~0 42)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91967#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:38,339 INFO L273 TraceCheckUtils]: 132: Hoare triple {91967#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {91968#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:38,340 INFO L273 TraceCheckUtils]: 133: Hoare triple {91968#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91968#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:38,340 INFO L273 TraceCheckUtils]: 134: Hoare triple {91968#(<= main_~i~0 43)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91968#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:38,341 INFO L273 TraceCheckUtils]: 135: Hoare triple {91968#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {91969#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:38,341 INFO L273 TraceCheckUtils]: 136: Hoare triple {91969#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91969#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:38,342 INFO L273 TraceCheckUtils]: 137: Hoare triple {91969#(<= main_~i~0 44)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91969#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:38,342 INFO L273 TraceCheckUtils]: 138: Hoare triple {91969#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {91970#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:38,343 INFO L273 TraceCheckUtils]: 139: Hoare triple {91970#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91970#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:38,343 INFO L273 TraceCheckUtils]: 140: Hoare triple {91970#(<= main_~i~0 45)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91970#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:38,344 INFO L273 TraceCheckUtils]: 141: Hoare triple {91970#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {91971#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:38,345 INFO L273 TraceCheckUtils]: 142: Hoare triple {91971#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91971#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:38,345 INFO L273 TraceCheckUtils]: 143: Hoare triple {91971#(<= main_~i~0 46)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91971#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:38,346 INFO L273 TraceCheckUtils]: 144: Hoare triple {91971#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {91972#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:38,346 INFO L273 TraceCheckUtils]: 145: Hoare triple {91972#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91972#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:38,347 INFO L273 TraceCheckUtils]: 146: Hoare triple {91972#(<= main_~i~0 47)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91972#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:38,347 INFO L273 TraceCheckUtils]: 147: Hoare triple {91972#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {91973#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:38,348 INFO L273 TraceCheckUtils]: 148: Hoare triple {91973#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91973#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:38,348 INFO L273 TraceCheckUtils]: 149: Hoare triple {91973#(<= main_~i~0 48)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91973#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:38,349 INFO L273 TraceCheckUtils]: 150: Hoare triple {91973#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {91974#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:38,349 INFO L273 TraceCheckUtils]: 151: Hoare triple {91974#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91974#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:38,350 INFO L273 TraceCheckUtils]: 152: Hoare triple {91974#(<= main_~i~0 49)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91974#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:38,351 INFO L273 TraceCheckUtils]: 153: Hoare triple {91974#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {91975#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:38,351 INFO L273 TraceCheckUtils]: 154: Hoare triple {91975#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91975#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:38,352 INFO L273 TraceCheckUtils]: 155: Hoare triple {91975#(<= main_~i~0 50)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91975#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:38,352 INFO L273 TraceCheckUtils]: 156: Hoare triple {91975#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {91976#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:38,353 INFO L273 TraceCheckUtils]: 157: Hoare triple {91976#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91976#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:38,353 INFO L273 TraceCheckUtils]: 158: Hoare triple {91976#(<= main_~i~0 51)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91976#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:38,354 INFO L273 TraceCheckUtils]: 159: Hoare triple {91976#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {91977#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:38,354 INFO L273 TraceCheckUtils]: 160: Hoare triple {91977#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91977#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:38,355 INFO L273 TraceCheckUtils]: 161: Hoare triple {91977#(<= main_~i~0 52)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91977#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:38,355 INFO L273 TraceCheckUtils]: 162: Hoare triple {91977#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {91978#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:38,356 INFO L273 TraceCheckUtils]: 163: Hoare triple {91978#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91978#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:38,356 INFO L273 TraceCheckUtils]: 164: Hoare triple {91978#(<= main_~i~0 53)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91978#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:38,357 INFO L273 TraceCheckUtils]: 165: Hoare triple {91978#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {91979#(<= main_~i~0 54)} is VALID [2018-11-23 11:54:38,358 INFO L273 TraceCheckUtils]: 166: Hoare triple {91979#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91979#(<= main_~i~0 54)} is VALID [2018-11-23 11:54:38,358 INFO L273 TraceCheckUtils]: 167: Hoare triple {91979#(<= main_~i~0 54)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91979#(<= main_~i~0 54)} is VALID [2018-11-23 11:54:38,359 INFO L273 TraceCheckUtils]: 168: Hoare triple {91979#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {91980#(<= main_~i~0 55)} is VALID [2018-11-23 11:54:38,359 INFO L273 TraceCheckUtils]: 169: Hoare triple {91980#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91980#(<= main_~i~0 55)} is VALID [2018-11-23 11:54:38,360 INFO L273 TraceCheckUtils]: 170: Hoare triple {91980#(<= main_~i~0 55)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91980#(<= main_~i~0 55)} is VALID [2018-11-23 11:54:38,360 INFO L273 TraceCheckUtils]: 171: Hoare triple {91980#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {91981#(<= main_~i~0 56)} is VALID [2018-11-23 11:54:38,361 INFO L273 TraceCheckUtils]: 172: Hoare triple {91981#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91981#(<= main_~i~0 56)} is VALID [2018-11-23 11:54:38,361 INFO L273 TraceCheckUtils]: 173: Hoare triple {91981#(<= main_~i~0 56)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91981#(<= main_~i~0 56)} is VALID [2018-11-23 11:54:38,362 INFO L273 TraceCheckUtils]: 174: Hoare triple {91981#(<= main_~i~0 56)} ~i~0 := 1 + ~i~0; {91982#(<= main_~i~0 57)} is VALID [2018-11-23 11:54:38,362 INFO L273 TraceCheckUtils]: 175: Hoare triple {91982#(<= main_~i~0 57)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91982#(<= main_~i~0 57)} is VALID [2018-11-23 11:54:38,363 INFO L273 TraceCheckUtils]: 176: Hoare triple {91982#(<= main_~i~0 57)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91982#(<= main_~i~0 57)} is VALID [2018-11-23 11:54:38,364 INFO L273 TraceCheckUtils]: 177: Hoare triple {91982#(<= main_~i~0 57)} ~i~0 := 1 + ~i~0; {91983#(<= main_~i~0 58)} is VALID [2018-11-23 11:54:38,364 INFO L273 TraceCheckUtils]: 178: Hoare triple {91983#(<= main_~i~0 58)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91983#(<= main_~i~0 58)} is VALID [2018-11-23 11:54:38,365 INFO L273 TraceCheckUtils]: 179: Hoare triple {91983#(<= main_~i~0 58)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91983#(<= main_~i~0 58)} is VALID [2018-11-23 11:54:38,365 INFO L273 TraceCheckUtils]: 180: Hoare triple {91983#(<= main_~i~0 58)} ~i~0 := 1 + ~i~0; {91984#(<= main_~i~0 59)} is VALID [2018-11-23 11:54:38,366 INFO L273 TraceCheckUtils]: 181: Hoare triple {91984#(<= main_~i~0 59)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91984#(<= main_~i~0 59)} is VALID [2018-11-23 11:54:38,366 INFO L273 TraceCheckUtils]: 182: Hoare triple {91984#(<= main_~i~0 59)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91984#(<= main_~i~0 59)} is VALID [2018-11-23 11:54:38,367 INFO L273 TraceCheckUtils]: 183: Hoare triple {91984#(<= main_~i~0 59)} ~i~0 := 1 + ~i~0; {91985#(<= main_~i~0 60)} is VALID [2018-11-23 11:54:38,367 INFO L273 TraceCheckUtils]: 184: Hoare triple {91985#(<= main_~i~0 60)} assume !(~i~0 < 100000); {91925#false} is VALID [2018-11-23 11:54:38,368 INFO L273 TraceCheckUtils]: 185: Hoare triple {91925#false} assume !(0 != ~swapped~0); {91925#false} is VALID [2018-11-23 11:54:38,368 INFO L273 TraceCheckUtils]: 186: Hoare triple {91925#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {91925#false} is VALID [2018-11-23 11:54:38,368 INFO L273 TraceCheckUtils]: 187: Hoare triple {91925#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {91925#false} is VALID [2018-11-23 11:54:38,368 INFO L273 TraceCheckUtils]: 188: Hoare triple {91925#false} assume !!(~y~0 < 100000);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); {91925#false} is VALID [2018-11-23 11:54:38,368 INFO L256 TraceCheckUtils]: 189: Hoare triple {91925#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {91925#false} is VALID [2018-11-23 11:54:38,368 INFO L273 TraceCheckUtils]: 190: Hoare triple {91925#false} ~cond := #in~cond; {91925#false} is VALID [2018-11-23 11:54:38,369 INFO L273 TraceCheckUtils]: 191: Hoare triple {91925#false} assume 0 == ~cond; {91925#false} is VALID [2018-11-23 11:54:38,369 INFO L273 TraceCheckUtils]: 192: Hoare triple {91925#false} assume !false; {91925#false} is VALID [2018-11-23 11:54:38,392 INFO L134 CoverageAnalysis]: Checked inductivity of 5193 backedges. 1 proven. 5192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:38,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:38,392 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:54:38,402 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:54:38,793 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2018-11-23 11:54:38,794 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:38,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:38,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:39,258 INFO L256 TraceCheckUtils]: 0: Hoare triple {91924#true} call ULTIMATE.init(); {91924#true} is VALID [2018-11-23 11:54:39,258 INFO L273 TraceCheckUtils]: 1: Hoare triple {91924#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {91924#true} is VALID [2018-11-23 11:54:39,259 INFO L273 TraceCheckUtils]: 2: Hoare triple {91924#true} assume true; {91924#true} is VALID [2018-11-23 11:54:39,259 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {91924#true} {91924#true} #79#return; {91924#true} is VALID [2018-11-23 11:54:39,259 INFO L256 TraceCheckUtils]: 4: Hoare triple {91924#true} call #t~ret8 := main(); {91924#true} is VALID [2018-11-23 11:54:39,259 INFO L273 TraceCheckUtils]: 5: Hoare triple {91924#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {91924#true} is VALID [2018-11-23 11:54:39,260 INFO L273 TraceCheckUtils]: 6: Hoare triple {91924#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {92007#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:39,260 INFO L273 TraceCheckUtils]: 7: Hoare triple {92007#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {92007#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:39,260 INFO L273 TraceCheckUtils]: 8: Hoare triple {92007#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {92007#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:39,261 INFO L273 TraceCheckUtils]: 9: Hoare triple {92007#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {91927#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:39,261 INFO L273 TraceCheckUtils]: 10: Hoare triple {91927#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91927#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:39,261 INFO L273 TraceCheckUtils]: 11: Hoare triple {91927#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91927#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:39,262 INFO L273 TraceCheckUtils]: 12: Hoare triple {91927#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {91928#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:39,262 INFO L273 TraceCheckUtils]: 13: Hoare triple {91928#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91928#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:39,262 INFO L273 TraceCheckUtils]: 14: Hoare triple {91928#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91928#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:39,263 INFO L273 TraceCheckUtils]: 15: Hoare triple {91928#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {91929#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:39,263 INFO L273 TraceCheckUtils]: 16: Hoare triple {91929#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91929#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:39,264 INFO L273 TraceCheckUtils]: 17: Hoare triple {91929#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91929#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:39,265 INFO L273 TraceCheckUtils]: 18: Hoare triple {91929#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {91930#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:39,265 INFO L273 TraceCheckUtils]: 19: Hoare triple {91930#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91930#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:39,266 INFO L273 TraceCheckUtils]: 20: Hoare triple {91930#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91930#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:39,266 INFO L273 TraceCheckUtils]: 21: Hoare triple {91930#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {91931#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:39,267 INFO L273 TraceCheckUtils]: 22: Hoare triple {91931#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91931#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:39,267 INFO L273 TraceCheckUtils]: 23: Hoare triple {91931#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91931#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:39,268 INFO L273 TraceCheckUtils]: 24: Hoare triple {91931#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {91932#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:39,268 INFO L273 TraceCheckUtils]: 25: Hoare triple {91932#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91932#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:39,269 INFO L273 TraceCheckUtils]: 26: Hoare triple {91932#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91932#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:39,270 INFO L273 TraceCheckUtils]: 27: Hoare triple {91932#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {91933#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:39,270 INFO L273 TraceCheckUtils]: 28: Hoare triple {91933#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91933#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:39,271 INFO L273 TraceCheckUtils]: 29: Hoare triple {91933#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91933#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:39,271 INFO L273 TraceCheckUtils]: 30: Hoare triple {91933#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {91934#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:39,272 INFO L273 TraceCheckUtils]: 31: Hoare triple {91934#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91934#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:39,272 INFO L273 TraceCheckUtils]: 32: Hoare triple {91934#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91934#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:39,273 INFO L273 TraceCheckUtils]: 33: Hoare triple {91934#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {91935#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:39,273 INFO L273 TraceCheckUtils]: 34: Hoare triple {91935#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91935#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:39,274 INFO L273 TraceCheckUtils]: 35: Hoare triple {91935#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91935#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:39,275 INFO L273 TraceCheckUtils]: 36: Hoare triple {91935#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {91936#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:39,275 INFO L273 TraceCheckUtils]: 37: Hoare triple {91936#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91936#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:39,275 INFO L273 TraceCheckUtils]: 38: Hoare triple {91936#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91936#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:39,276 INFO L273 TraceCheckUtils]: 39: Hoare triple {91936#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {91937#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:39,277 INFO L273 TraceCheckUtils]: 40: Hoare triple {91937#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91937#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:39,277 INFO L273 TraceCheckUtils]: 41: Hoare triple {91937#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91937#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:39,278 INFO L273 TraceCheckUtils]: 42: Hoare triple {91937#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {91938#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:39,278 INFO L273 TraceCheckUtils]: 43: Hoare triple {91938#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91938#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:39,279 INFO L273 TraceCheckUtils]: 44: Hoare triple {91938#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91938#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:39,279 INFO L273 TraceCheckUtils]: 45: Hoare triple {91938#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {91939#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:39,280 INFO L273 TraceCheckUtils]: 46: Hoare triple {91939#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91939#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:39,280 INFO L273 TraceCheckUtils]: 47: Hoare triple {91939#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91939#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:39,281 INFO L273 TraceCheckUtils]: 48: Hoare triple {91939#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {91940#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:39,281 INFO L273 TraceCheckUtils]: 49: Hoare triple {91940#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91940#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:39,282 INFO L273 TraceCheckUtils]: 50: Hoare triple {91940#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91940#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:39,283 INFO L273 TraceCheckUtils]: 51: Hoare triple {91940#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {91941#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:39,283 INFO L273 TraceCheckUtils]: 52: Hoare triple {91941#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91941#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:39,284 INFO L273 TraceCheckUtils]: 53: Hoare triple {91941#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91941#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:39,284 INFO L273 TraceCheckUtils]: 54: Hoare triple {91941#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {91942#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:39,285 INFO L273 TraceCheckUtils]: 55: Hoare triple {91942#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91942#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:39,285 INFO L273 TraceCheckUtils]: 56: Hoare triple {91942#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91942#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:39,286 INFO L273 TraceCheckUtils]: 57: Hoare triple {91942#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {91943#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:39,286 INFO L273 TraceCheckUtils]: 58: Hoare triple {91943#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91943#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:39,287 INFO L273 TraceCheckUtils]: 59: Hoare triple {91943#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91943#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:39,287 INFO L273 TraceCheckUtils]: 60: Hoare triple {91943#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {91944#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:39,288 INFO L273 TraceCheckUtils]: 61: Hoare triple {91944#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91944#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:39,288 INFO L273 TraceCheckUtils]: 62: Hoare triple {91944#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91944#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:39,289 INFO L273 TraceCheckUtils]: 63: Hoare triple {91944#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {91945#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:39,290 INFO L273 TraceCheckUtils]: 64: Hoare triple {91945#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91945#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:39,290 INFO L273 TraceCheckUtils]: 65: Hoare triple {91945#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91945#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:39,291 INFO L273 TraceCheckUtils]: 66: Hoare triple {91945#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {91946#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:39,291 INFO L273 TraceCheckUtils]: 67: Hoare triple {91946#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91946#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:39,292 INFO L273 TraceCheckUtils]: 68: Hoare triple {91946#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91946#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:39,292 INFO L273 TraceCheckUtils]: 69: Hoare triple {91946#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {91947#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:39,293 INFO L273 TraceCheckUtils]: 70: Hoare triple {91947#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91947#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:39,293 INFO L273 TraceCheckUtils]: 71: Hoare triple {91947#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91947#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:39,294 INFO L273 TraceCheckUtils]: 72: Hoare triple {91947#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {91948#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:39,294 INFO L273 TraceCheckUtils]: 73: Hoare triple {91948#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91948#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:39,295 INFO L273 TraceCheckUtils]: 74: Hoare triple {91948#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91948#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:39,296 INFO L273 TraceCheckUtils]: 75: Hoare triple {91948#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {91949#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:39,296 INFO L273 TraceCheckUtils]: 76: Hoare triple {91949#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91949#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:39,297 INFO L273 TraceCheckUtils]: 77: Hoare triple {91949#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91949#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:39,297 INFO L273 TraceCheckUtils]: 78: Hoare triple {91949#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {91950#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:39,298 INFO L273 TraceCheckUtils]: 79: Hoare triple {91950#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91950#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:39,298 INFO L273 TraceCheckUtils]: 80: Hoare triple {91950#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91950#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:39,299 INFO L273 TraceCheckUtils]: 81: Hoare triple {91950#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {91951#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:39,299 INFO L273 TraceCheckUtils]: 82: Hoare triple {91951#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91951#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:39,300 INFO L273 TraceCheckUtils]: 83: Hoare triple {91951#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91951#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:39,300 INFO L273 TraceCheckUtils]: 84: Hoare triple {91951#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {91952#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:39,301 INFO L273 TraceCheckUtils]: 85: Hoare triple {91952#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91952#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:39,301 INFO L273 TraceCheckUtils]: 86: Hoare triple {91952#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91952#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:39,302 INFO L273 TraceCheckUtils]: 87: Hoare triple {91952#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {91953#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:39,303 INFO L273 TraceCheckUtils]: 88: Hoare triple {91953#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91953#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:39,303 INFO L273 TraceCheckUtils]: 89: Hoare triple {91953#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91953#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:39,304 INFO L273 TraceCheckUtils]: 90: Hoare triple {91953#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {91954#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:39,304 INFO L273 TraceCheckUtils]: 91: Hoare triple {91954#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91954#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:39,305 INFO L273 TraceCheckUtils]: 92: Hoare triple {91954#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91954#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:39,305 INFO L273 TraceCheckUtils]: 93: Hoare triple {91954#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {91955#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:39,306 INFO L273 TraceCheckUtils]: 94: Hoare triple {91955#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91955#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:39,306 INFO L273 TraceCheckUtils]: 95: Hoare triple {91955#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91955#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:39,307 INFO L273 TraceCheckUtils]: 96: Hoare triple {91955#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {91956#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:39,307 INFO L273 TraceCheckUtils]: 97: Hoare triple {91956#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91956#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:39,308 INFO L273 TraceCheckUtils]: 98: Hoare triple {91956#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91956#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:39,309 INFO L273 TraceCheckUtils]: 99: Hoare triple {91956#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {91957#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:39,309 INFO L273 TraceCheckUtils]: 100: Hoare triple {91957#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91957#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:39,309 INFO L273 TraceCheckUtils]: 101: Hoare triple {91957#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91957#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:39,310 INFO L273 TraceCheckUtils]: 102: Hoare triple {91957#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {91958#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:39,311 INFO L273 TraceCheckUtils]: 103: Hoare triple {91958#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91958#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:39,311 INFO L273 TraceCheckUtils]: 104: Hoare triple {91958#(<= main_~i~0 33)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91958#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:39,312 INFO L273 TraceCheckUtils]: 105: Hoare triple {91958#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {91959#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:39,312 INFO L273 TraceCheckUtils]: 106: Hoare triple {91959#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91959#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:39,313 INFO L273 TraceCheckUtils]: 107: Hoare triple {91959#(<= main_~i~0 34)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91959#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:39,313 INFO L273 TraceCheckUtils]: 108: Hoare triple {91959#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {91960#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:39,314 INFO L273 TraceCheckUtils]: 109: Hoare triple {91960#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91960#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:39,314 INFO L273 TraceCheckUtils]: 110: Hoare triple {91960#(<= main_~i~0 35)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91960#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:39,315 INFO L273 TraceCheckUtils]: 111: Hoare triple {91960#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {91961#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:39,315 INFO L273 TraceCheckUtils]: 112: Hoare triple {91961#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91961#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:39,316 INFO L273 TraceCheckUtils]: 113: Hoare triple {91961#(<= main_~i~0 36)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91961#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:39,317 INFO L273 TraceCheckUtils]: 114: Hoare triple {91961#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {91962#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:39,317 INFO L273 TraceCheckUtils]: 115: Hoare triple {91962#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91962#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:39,318 INFO L273 TraceCheckUtils]: 116: Hoare triple {91962#(<= main_~i~0 37)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91962#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:39,318 INFO L273 TraceCheckUtils]: 117: Hoare triple {91962#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {91963#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:39,319 INFO L273 TraceCheckUtils]: 118: Hoare triple {91963#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91963#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:39,319 INFO L273 TraceCheckUtils]: 119: Hoare triple {91963#(<= main_~i~0 38)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91963#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:39,320 INFO L273 TraceCheckUtils]: 120: Hoare triple {91963#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {91964#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:39,320 INFO L273 TraceCheckUtils]: 121: Hoare triple {91964#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91964#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:39,321 INFO L273 TraceCheckUtils]: 122: Hoare triple {91964#(<= main_~i~0 39)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91964#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:39,321 INFO L273 TraceCheckUtils]: 123: Hoare triple {91964#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {91965#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:39,322 INFO L273 TraceCheckUtils]: 124: Hoare triple {91965#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91965#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:39,322 INFO L273 TraceCheckUtils]: 125: Hoare triple {91965#(<= main_~i~0 40)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91965#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:39,323 INFO L273 TraceCheckUtils]: 126: Hoare triple {91965#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {91966#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:39,323 INFO L273 TraceCheckUtils]: 127: Hoare triple {91966#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91966#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:39,324 INFO L273 TraceCheckUtils]: 128: Hoare triple {91966#(<= main_~i~0 41)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91966#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:39,325 INFO L273 TraceCheckUtils]: 129: Hoare triple {91966#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {91967#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:39,325 INFO L273 TraceCheckUtils]: 130: Hoare triple {91967#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91967#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:39,326 INFO L273 TraceCheckUtils]: 131: Hoare triple {91967#(<= main_~i~0 42)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91967#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:39,326 INFO L273 TraceCheckUtils]: 132: Hoare triple {91967#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {91968#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:39,327 INFO L273 TraceCheckUtils]: 133: Hoare triple {91968#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91968#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:39,327 INFO L273 TraceCheckUtils]: 134: Hoare triple {91968#(<= main_~i~0 43)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91968#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:39,328 INFO L273 TraceCheckUtils]: 135: Hoare triple {91968#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {91969#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:39,328 INFO L273 TraceCheckUtils]: 136: Hoare triple {91969#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91969#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:39,329 INFO L273 TraceCheckUtils]: 137: Hoare triple {91969#(<= main_~i~0 44)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91969#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:39,329 INFO L273 TraceCheckUtils]: 138: Hoare triple {91969#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {91970#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:39,330 INFO L273 TraceCheckUtils]: 139: Hoare triple {91970#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91970#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:39,330 INFO L273 TraceCheckUtils]: 140: Hoare triple {91970#(<= main_~i~0 45)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91970#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:39,331 INFO L273 TraceCheckUtils]: 141: Hoare triple {91970#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {91971#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:39,332 INFO L273 TraceCheckUtils]: 142: Hoare triple {91971#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91971#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:39,332 INFO L273 TraceCheckUtils]: 143: Hoare triple {91971#(<= main_~i~0 46)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91971#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:39,333 INFO L273 TraceCheckUtils]: 144: Hoare triple {91971#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {91972#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:39,333 INFO L273 TraceCheckUtils]: 145: Hoare triple {91972#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91972#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:39,334 INFO L273 TraceCheckUtils]: 146: Hoare triple {91972#(<= main_~i~0 47)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91972#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:39,334 INFO L273 TraceCheckUtils]: 147: Hoare triple {91972#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {91973#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:39,335 INFO L273 TraceCheckUtils]: 148: Hoare triple {91973#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91973#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:39,335 INFO L273 TraceCheckUtils]: 149: Hoare triple {91973#(<= main_~i~0 48)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91973#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:39,336 INFO L273 TraceCheckUtils]: 150: Hoare triple {91973#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {91974#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:39,337 INFO L273 TraceCheckUtils]: 151: Hoare triple {91974#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91974#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:39,337 INFO L273 TraceCheckUtils]: 152: Hoare triple {91974#(<= main_~i~0 49)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91974#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:39,338 INFO L273 TraceCheckUtils]: 153: Hoare triple {91974#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {91975#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:39,338 INFO L273 TraceCheckUtils]: 154: Hoare triple {91975#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91975#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:39,339 INFO L273 TraceCheckUtils]: 155: Hoare triple {91975#(<= main_~i~0 50)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91975#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:39,339 INFO L273 TraceCheckUtils]: 156: Hoare triple {91975#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {91976#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:39,340 INFO L273 TraceCheckUtils]: 157: Hoare triple {91976#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91976#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:39,340 INFO L273 TraceCheckUtils]: 158: Hoare triple {91976#(<= main_~i~0 51)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91976#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:39,341 INFO L273 TraceCheckUtils]: 159: Hoare triple {91976#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {91977#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:39,342 INFO L273 TraceCheckUtils]: 160: Hoare triple {91977#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91977#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:39,342 INFO L273 TraceCheckUtils]: 161: Hoare triple {91977#(<= main_~i~0 52)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91977#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:39,343 INFO L273 TraceCheckUtils]: 162: Hoare triple {91977#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {91978#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:39,343 INFO L273 TraceCheckUtils]: 163: Hoare triple {91978#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91978#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:39,344 INFO L273 TraceCheckUtils]: 164: Hoare triple {91978#(<= main_~i~0 53)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91978#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:39,344 INFO L273 TraceCheckUtils]: 165: Hoare triple {91978#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {91979#(<= main_~i~0 54)} is VALID [2018-11-23 11:54:39,345 INFO L273 TraceCheckUtils]: 166: Hoare triple {91979#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91979#(<= main_~i~0 54)} is VALID [2018-11-23 11:54:39,345 INFO L273 TraceCheckUtils]: 167: Hoare triple {91979#(<= main_~i~0 54)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91979#(<= main_~i~0 54)} is VALID [2018-11-23 11:54:39,346 INFO L273 TraceCheckUtils]: 168: Hoare triple {91979#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {91980#(<= main_~i~0 55)} is VALID [2018-11-23 11:54:39,346 INFO L273 TraceCheckUtils]: 169: Hoare triple {91980#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91980#(<= main_~i~0 55)} is VALID [2018-11-23 11:54:39,347 INFO L273 TraceCheckUtils]: 170: Hoare triple {91980#(<= main_~i~0 55)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91980#(<= main_~i~0 55)} is VALID [2018-11-23 11:54:39,348 INFO L273 TraceCheckUtils]: 171: Hoare triple {91980#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {91981#(<= main_~i~0 56)} is VALID [2018-11-23 11:54:39,348 INFO L273 TraceCheckUtils]: 172: Hoare triple {91981#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91981#(<= main_~i~0 56)} is VALID [2018-11-23 11:54:39,348 INFO L273 TraceCheckUtils]: 173: Hoare triple {91981#(<= main_~i~0 56)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91981#(<= main_~i~0 56)} is VALID [2018-11-23 11:54:39,349 INFO L273 TraceCheckUtils]: 174: Hoare triple {91981#(<= main_~i~0 56)} ~i~0 := 1 + ~i~0; {91982#(<= main_~i~0 57)} is VALID [2018-11-23 11:54:39,350 INFO L273 TraceCheckUtils]: 175: Hoare triple {91982#(<= main_~i~0 57)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91982#(<= main_~i~0 57)} is VALID [2018-11-23 11:54:39,350 INFO L273 TraceCheckUtils]: 176: Hoare triple {91982#(<= main_~i~0 57)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91982#(<= main_~i~0 57)} is VALID [2018-11-23 11:54:39,351 INFO L273 TraceCheckUtils]: 177: Hoare triple {91982#(<= main_~i~0 57)} ~i~0 := 1 + ~i~0; {91983#(<= main_~i~0 58)} is VALID [2018-11-23 11:54:39,351 INFO L273 TraceCheckUtils]: 178: Hoare triple {91983#(<= main_~i~0 58)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91983#(<= main_~i~0 58)} is VALID [2018-11-23 11:54:39,352 INFO L273 TraceCheckUtils]: 179: Hoare triple {91983#(<= main_~i~0 58)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91983#(<= main_~i~0 58)} is VALID [2018-11-23 11:54:39,352 INFO L273 TraceCheckUtils]: 180: Hoare triple {91983#(<= main_~i~0 58)} ~i~0 := 1 + ~i~0; {91984#(<= main_~i~0 59)} is VALID [2018-11-23 11:54:39,353 INFO L273 TraceCheckUtils]: 181: Hoare triple {91984#(<= main_~i~0 59)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {91984#(<= main_~i~0 59)} is VALID [2018-11-23 11:54:39,353 INFO L273 TraceCheckUtils]: 182: Hoare triple {91984#(<= main_~i~0 59)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {91984#(<= main_~i~0 59)} is VALID [2018-11-23 11:54:39,354 INFO L273 TraceCheckUtils]: 183: Hoare triple {91984#(<= main_~i~0 59)} ~i~0 := 1 + ~i~0; {91985#(<= main_~i~0 60)} is VALID [2018-11-23 11:54:39,355 INFO L273 TraceCheckUtils]: 184: Hoare triple {91985#(<= main_~i~0 60)} assume !(~i~0 < 100000); {91925#false} is VALID [2018-11-23 11:54:39,355 INFO L273 TraceCheckUtils]: 185: Hoare triple {91925#false} assume !(0 != ~swapped~0); {91925#false} is VALID [2018-11-23 11:54:39,355 INFO L273 TraceCheckUtils]: 186: Hoare triple {91925#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {91925#false} is VALID [2018-11-23 11:54:39,355 INFO L273 TraceCheckUtils]: 187: Hoare triple {91925#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {91925#false} is VALID [2018-11-23 11:54:39,355 INFO L273 TraceCheckUtils]: 188: Hoare triple {91925#false} assume !!(~y~0 < 100000);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); {91925#false} is VALID [2018-11-23 11:54:39,355 INFO L256 TraceCheckUtils]: 189: Hoare triple {91925#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {91925#false} is VALID [2018-11-23 11:54:39,356 INFO L273 TraceCheckUtils]: 190: Hoare triple {91925#false} ~cond := #in~cond; {91925#false} is VALID [2018-11-23 11:54:39,356 INFO L273 TraceCheckUtils]: 191: Hoare triple {91925#false} assume 0 == ~cond; {91925#false} is VALID [2018-11-23 11:54:39,356 INFO L273 TraceCheckUtils]: 192: Hoare triple {91925#false} assume !false; {91925#false} is VALID [2018-11-23 11:54:39,380 INFO L134 CoverageAnalysis]: Checked inductivity of 5193 backedges. 1 proven. 5192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:39,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:39,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 63 [2018-11-23 11:54:39,400 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 193 [2018-11-23 11:54:39,400 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:39,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 63 states. [2018-11-23 11:54:39,581 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:39,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-11-23 11:54:39,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-11-23 11:54:39,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-11-23 11:54:39,582 INFO L87 Difference]: Start difference. First operand 375 states and 496 transitions. Second operand 63 states. [2018-11-23 11:54:40,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:40,903 INFO L93 Difference]: Finished difference Result 754 states and 1002 transitions. [2018-11-23 11:54:40,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-11-23 11:54:40,903 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 193 [2018-11-23 11:54:40,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:40,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 11:54:40,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 289 transitions. [2018-11-23 11:54:40,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 11:54:40,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 289 transitions. [2018-11-23 11:54:40,906 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 62 states and 289 transitions. [2018-11-23 11:54:41,187 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 289 edges. 289 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:41,196 INFO L225 Difference]: With dead ends: 754 [2018-11-23 11:54:41,197 INFO L226 Difference]: Without dead ends: 385 [2018-11-23 11:54:41,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-11-23 11:54:41,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2018-11-23 11:54:41,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 381. [2018-11-23 11:54:41,333 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:41,333 INFO L82 GeneralOperation]: Start isEquivalent. First operand 385 states. Second operand 381 states. [2018-11-23 11:54:41,333 INFO L74 IsIncluded]: Start isIncluded. First operand 385 states. Second operand 381 states. [2018-11-23 11:54:41,333 INFO L87 Difference]: Start difference. First operand 385 states. Second operand 381 states. [2018-11-23 11:54:41,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:41,342 INFO L93 Difference]: Finished difference Result 385 states and 510 transitions. [2018-11-23 11:54:41,342 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 510 transitions. [2018-11-23 11:54:41,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:41,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:41,342 INFO L74 IsIncluded]: Start isIncluded. First operand 381 states. Second operand 385 states. [2018-11-23 11:54:41,342 INFO L87 Difference]: Start difference. First operand 381 states. Second operand 385 states. [2018-11-23 11:54:41,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:41,349 INFO L93 Difference]: Finished difference Result 385 states and 510 transitions. [2018-11-23 11:54:41,349 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 510 transitions. [2018-11-23 11:54:41,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:41,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:41,350 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:41,350 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:41,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-11-23 11:54:41,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 504 transitions. [2018-11-23 11:54:41,356 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 504 transitions. Word has length 193 [2018-11-23 11:54:41,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:41,357 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 504 transitions. [2018-11-23 11:54:41,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-11-23 11:54:41,357 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 504 transitions. [2018-11-23 11:54:41,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-11-23 11:54:41,358 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:41,358 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:41,358 INFO L423 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:41,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:41,358 INFO L82 PathProgramCache]: Analyzing trace with hash 294079377, now seen corresponding path program 60 times [2018-11-23 11:54:41,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:41,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:41,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:41,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:41,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:41,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:43,224 INFO L256 TraceCheckUtils]: 0: Hoare triple {94857#true} call ULTIMATE.init(); {94857#true} is VALID [2018-11-23 11:54:43,224 INFO L273 TraceCheckUtils]: 1: Hoare triple {94857#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {94857#true} is VALID [2018-11-23 11:54:43,224 INFO L273 TraceCheckUtils]: 2: Hoare triple {94857#true} assume true; {94857#true} is VALID [2018-11-23 11:54:43,225 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {94857#true} {94857#true} #79#return; {94857#true} is VALID [2018-11-23 11:54:43,225 INFO L256 TraceCheckUtils]: 4: Hoare triple {94857#true} call #t~ret8 := main(); {94857#true} is VALID [2018-11-23 11:54:43,225 INFO L273 TraceCheckUtils]: 5: Hoare triple {94857#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {94857#true} is VALID [2018-11-23 11:54:43,225 INFO L273 TraceCheckUtils]: 6: Hoare triple {94857#true} assume !!(0 != ~swapped~0);~swapped~0 := 0;~i~0 := 1; {94859#(= main_~i~0 1)} is VALID [2018-11-23 11:54:43,226 INFO L273 TraceCheckUtils]: 7: Hoare triple {94859#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {94859#(= main_~i~0 1)} is VALID [2018-11-23 11:54:43,226 INFO L273 TraceCheckUtils]: 8: Hoare triple {94859#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {94859#(= main_~i~0 1)} is VALID [2018-11-23 11:54:43,227 INFO L273 TraceCheckUtils]: 9: Hoare triple {94859#(= main_~i~0 1)} ~i~0 := 1 + ~i~0; {94860#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:43,227 INFO L273 TraceCheckUtils]: 10: Hoare triple {94860#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {94860#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:43,228 INFO L273 TraceCheckUtils]: 11: Hoare triple {94860#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {94860#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:43,228 INFO L273 TraceCheckUtils]: 12: Hoare triple {94860#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {94861#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:43,228 INFO L273 TraceCheckUtils]: 13: Hoare triple {94861#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {94861#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:43,229 INFO L273 TraceCheckUtils]: 14: Hoare triple {94861#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {94861#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:43,229 INFO L273 TraceCheckUtils]: 15: Hoare triple {94861#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {94862#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:43,230 INFO L273 TraceCheckUtils]: 16: Hoare triple {94862#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {94862#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:43,230 INFO L273 TraceCheckUtils]: 17: Hoare triple {94862#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {94862#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:43,231 INFO L273 TraceCheckUtils]: 18: Hoare triple {94862#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {94863#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:43,231 INFO L273 TraceCheckUtils]: 19: Hoare triple {94863#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {94863#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:43,232 INFO L273 TraceCheckUtils]: 20: Hoare triple {94863#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {94863#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:43,232 INFO L273 TraceCheckUtils]: 21: Hoare triple {94863#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {94864#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:43,233 INFO L273 TraceCheckUtils]: 22: Hoare triple {94864#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {94864#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:43,233 INFO L273 TraceCheckUtils]: 23: Hoare triple {94864#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {94864#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:43,234 INFO L273 TraceCheckUtils]: 24: Hoare triple {94864#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {94865#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:43,234 INFO L273 TraceCheckUtils]: 25: Hoare triple {94865#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {94865#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:43,235 INFO L273 TraceCheckUtils]: 26: Hoare triple {94865#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {94865#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:43,236 INFO L273 TraceCheckUtils]: 27: Hoare triple {94865#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {94866#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:43,236 INFO L273 TraceCheckUtils]: 28: Hoare triple {94866#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {94866#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:43,237 INFO L273 TraceCheckUtils]: 29: Hoare triple {94866#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {94866#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:43,237 INFO L273 TraceCheckUtils]: 30: Hoare triple {94866#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {94867#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:43,238 INFO L273 TraceCheckUtils]: 31: Hoare triple {94867#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {94867#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:43,238 INFO L273 TraceCheckUtils]: 32: Hoare triple {94867#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {94867#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:43,239 INFO L273 TraceCheckUtils]: 33: Hoare triple {94867#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {94868#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:43,239 INFO L273 TraceCheckUtils]: 34: Hoare triple {94868#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {94868#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:43,240 INFO L273 TraceCheckUtils]: 35: Hoare triple {94868#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {94868#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:43,241 INFO L273 TraceCheckUtils]: 36: Hoare triple {94868#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {94869#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:43,241 INFO L273 TraceCheckUtils]: 37: Hoare triple {94869#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {94869#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:43,242 INFO L273 TraceCheckUtils]: 38: Hoare triple {94869#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {94869#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:43,242 INFO L273 TraceCheckUtils]: 39: Hoare triple {94869#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {94870#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:43,243 INFO L273 TraceCheckUtils]: 40: Hoare triple {94870#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {94870#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:43,243 INFO L273 TraceCheckUtils]: 41: Hoare triple {94870#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {94870#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:43,244 INFO L273 TraceCheckUtils]: 42: Hoare triple {94870#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {94871#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:43,244 INFO L273 TraceCheckUtils]: 43: Hoare triple {94871#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {94871#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:43,245 INFO L273 TraceCheckUtils]: 44: Hoare triple {94871#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {94871#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:43,245 INFO L273 TraceCheckUtils]: 45: Hoare triple {94871#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {94872#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:43,246 INFO L273 TraceCheckUtils]: 46: Hoare triple {94872#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {94872#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:43,246 INFO L273 TraceCheckUtils]: 47: Hoare triple {94872#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {94872#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:43,247 INFO L273 TraceCheckUtils]: 48: Hoare triple {94872#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {94873#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:43,248 INFO L273 TraceCheckUtils]: 49: Hoare triple {94873#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {94873#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:43,248 INFO L273 TraceCheckUtils]: 50: Hoare triple {94873#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {94873#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:43,249 INFO L273 TraceCheckUtils]: 51: Hoare triple {94873#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {94874#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:43,249 INFO L273 TraceCheckUtils]: 52: Hoare triple {94874#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {94874#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:43,250 INFO L273 TraceCheckUtils]: 53: Hoare triple {94874#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {94874#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:43,250 INFO L273 TraceCheckUtils]: 54: Hoare triple {94874#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {94875#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:43,251 INFO L273 TraceCheckUtils]: 55: Hoare triple {94875#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {94875#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:43,251 INFO L273 TraceCheckUtils]: 56: Hoare triple {94875#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {94875#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:43,252 INFO L273 TraceCheckUtils]: 57: Hoare triple {94875#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {94876#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:43,252 INFO L273 TraceCheckUtils]: 58: Hoare triple {94876#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {94876#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:43,253 INFO L273 TraceCheckUtils]: 59: Hoare triple {94876#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {94876#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:43,254 INFO L273 TraceCheckUtils]: 60: Hoare triple {94876#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {94877#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:43,254 INFO L273 TraceCheckUtils]: 61: Hoare triple {94877#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {94877#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:43,255 INFO L273 TraceCheckUtils]: 62: Hoare triple {94877#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {94877#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:43,255 INFO L273 TraceCheckUtils]: 63: Hoare triple {94877#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {94878#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:43,256 INFO L273 TraceCheckUtils]: 64: Hoare triple {94878#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {94878#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:43,256 INFO L273 TraceCheckUtils]: 65: Hoare triple {94878#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {94878#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:43,257 INFO L273 TraceCheckUtils]: 66: Hoare triple {94878#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {94879#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:43,258 INFO L273 TraceCheckUtils]: 67: Hoare triple {94879#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {94879#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:43,258 INFO L273 TraceCheckUtils]: 68: Hoare triple {94879#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {94879#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:43,259 INFO L273 TraceCheckUtils]: 69: Hoare triple {94879#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {94880#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:43,259 INFO L273 TraceCheckUtils]: 70: Hoare triple {94880#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {94880#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:43,260 INFO L273 TraceCheckUtils]: 71: Hoare triple {94880#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {94880#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:43,260 INFO L273 TraceCheckUtils]: 72: Hoare triple {94880#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {94881#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:43,261 INFO L273 TraceCheckUtils]: 73: Hoare triple {94881#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {94881#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:43,261 INFO L273 TraceCheckUtils]: 74: Hoare triple {94881#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {94881#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:43,262 INFO L273 TraceCheckUtils]: 75: Hoare triple {94881#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {94882#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:43,262 INFO L273 TraceCheckUtils]: 76: Hoare triple {94882#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {94882#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:43,263 INFO L273 TraceCheckUtils]: 77: Hoare triple {94882#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {94882#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:43,264 INFO L273 TraceCheckUtils]: 78: Hoare triple {94882#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {94883#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:43,264 INFO L273 TraceCheckUtils]: 79: Hoare triple {94883#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {94883#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:43,264 INFO L273 TraceCheckUtils]: 80: Hoare triple {94883#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {94883#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:43,265 INFO L273 TraceCheckUtils]: 81: Hoare triple {94883#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {94884#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:43,266 INFO L273 TraceCheckUtils]: 82: Hoare triple {94884#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {94884#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:43,266 INFO L273 TraceCheckUtils]: 83: Hoare triple {94884#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {94884#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:43,267 INFO L273 TraceCheckUtils]: 84: Hoare triple {94884#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {94885#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:43,267 INFO L273 TraceCheckUtils]: 85: Hoare triple {94885#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {94885#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:43,268 INFO L273 TraceCheckUtils]: 86: Hoare triple {94885#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {94885#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:43,268 INFO L273 TraceCheckUtils]: 87: Hoare triple {94885#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {94886#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:43,269 INFO L273 TraceCheckUtils]: 88: Hoare triple {94886#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {94886#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:43,269 INFO L273 TraceCheckUtils]: 89: Hoare triple {94886#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {94886#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:43,270 INFO L273 TraceCheckUtils]: 90: Hoare triple {94886#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {94887#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:43,270 INFO L273 TraceCheckUtils]: 91: Hoare triple {94887#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {94887#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:43,271 INFO L273 TraceCheckUtils]: 92: Hoare triple {94887#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {94887#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:43,272 INFO L273 TraceCheckUtils]: 93: Hoare triple {94887#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {94888#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:43,272 INFO L273 TraceCheckUtils]: 94: Hoare triple {94888#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {94888#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:43,273 INFO L273 TraceCheckUtils]: 95: Hoare triple {94888#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {94888#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:43,273 INFO L273 TraceCheckUtils]: 96: Hoare triple {94888#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {94889#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:43,274 INFO L273 TraceCheckUtils]: 97: Hoare triple {94889#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {94889#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:43,274 INFO L273 TraceCheckUtils]: 98: Hoare triple {94889#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {94889#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:43,275 INFO L273 TraceCheckUtils]: 99: Hoare triple {94889#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {94890#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:43,275 INFO L273 TraceCheckUtils]: 100: Hoare triple {94890#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {94890#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:43,276 INFO L273 TraceCheckUtils]: 101: Hoare triple {94890#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {94890#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:43,276 INFO L273 TraceCheckUtils]: 102: Hoare triple {94890#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {94891#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:43,277 INFO L273 TraceCheckUtils]: 103: Hoare triple {94891#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {94891#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:43,277 INFO L273 TraceCheckUtils]: 104: Hoare triple {94891#(<= main_~i~0 33)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {94891#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:43,278 INFO L273 TraceCheckUtils]: 105: Hoare triple {94891#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {94892#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:43,279 INFO L273 TraceCheckUtils]: 106: Hoare triple {94892#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {94892#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:43,279 INFO L273 TraceCheckUtils]: 107: Hoare triple {94892#(<= main_~i~0 34)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {94892#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:43,280 INFO L273 TraceCheckUtils]: 108: Hoare triple {94892#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {94893#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:43,280 INFO L273 TraceCheckUtils]: 109: Hoare triple {94893#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {94893#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:43,281 INFO L273 TraceCheckUtils]: 110: Hoare triple {94893#(<= main_~i~0 35)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {94893#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:43,281 INFO L273 TraceCheckUtils]: 111: Hoare triple {94893#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {94894#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:43,282 INFO L273 TraceCheckUtils]: 112: Hoare triple {94894#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {94894#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:43,282 INFO L273 TraceCheckUtils]: 113: Hoare triple {94894#(<= main_~i~0 36)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {94894#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:43,283 INFO L273 TraceCheckUtils]: 114: Hoare triple {94894#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {94895#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:43,284 INFO L273 TraceCheckUtils]: 115: Hoare triple {94895#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {94895#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:43,284 INFO L273 TraceCheckUtils]: 116: Hoare triple {94895#(<= main_~i~0 37)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {94895#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:43,285 INFO L273 TraceCheckUtils]: 117: Hoare triple {94895#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {94896#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:43,285 INFO L273 TraceCheckUtils]: 118: Hoare triple {94896#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {94896#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:43,286 INFO L273 TraceCheckUtils]: 119: Hoare triple {94896#(<= main_~i~0 38)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {94896#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:43,286 INFO L273 TraceCheckUtils]: 120: Hoare triple {94896#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {94897#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:43,287 INFO L273 TraceCheckUtils]: 121: Hoare triple {94897#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {94897#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:43,287 INFO L273 TraceCheckUtils]: 122: Hoare triple {94897#(<= main_~i~0 39)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {94897#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:43,288 INFO L273 TraceCheckUtils]: 123: Hoare triple {94897#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {94898#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:43,289 INFO L273 TraceCheckUtils]: 124: Hoare triple {94898#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4); {94898#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:43,289 INFO L273 TraceCheckUtils]: 125: Hoare triple {94898#(<= main_~i~0 40)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {94898#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:43,290 INFO L273 TraceCheckUtils]: 126: Hoare triple {94898#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {94899#(<= main_~i~0 41)} is VALID